BK Rai, BK Dey - IEEE Transactions on Information Theory, 2012 - ieeexplore.ieee.org
A directed acyclic network is considered where all the terminals need to recover the sum of the symbols generated at all the sources. We call such a network a sum-network. It is shown …
We show a tight lower bound of Ω (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors …
We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the …
This paper considers the following network computation problem: n nodes are placed on a√ n×√ n grid, each node is connected to every other node within distance r (n) of itself, and it …
F Colace, M De Santo… - 34th Annual Frontiers in …, 2004 - ieeexplore.ieee.org
During last years the interest on distance learning techniques has grown steadily as far as the use of electronic instruments in experimentation is concerned. Due to the higher and …
The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this …
We consider in-network computation of MAX and the approximate histogram in an n-node structure-free random multihop wireless network. The key assumption that we make is that …
S Kamath, D Manjunath - 2008 IEEE International Symposium …, 2008 - ieeexplore.ieee.org
We consider in-network computation of MAX in a structure-free random multihop wireless network. Nodes do not know their relative or absolute locations and use the Aloha MAC …
BK Rai, BK Dey, S Shenvi - 2010 IEEE Information Theory …, 2010 - ieeexplore.ieee.org
We consider directed acyclic networks with multiple sources and multiple terminals where each source generates one iid random process over a finite field and all the terminals want …