Elements of information theory
Elements of information theory
Approximating layout problems on random geometric graphs
Journal of Algorithms
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity of wireless erasure networks
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where n nodes are uniformly and independently distributed in the unit area square. The bound holds almost surely and is asymptotically tight. We assume all nodes have fixed transmit power and hence two nodes should be within a specified distance rn of each other to overcome noise. In this context, interference determines outages, so we model each transmitter-receiver pair as an erasure channel with a broadcast constraint, i.e. each node can transmit only one signal across all its outgoing links. A lower bound of Θ(nrn) for the capacity of this class of networks is derived. Finally, the case where the erasure probabilities are themselves random variables, for example due to randomness in geometry or channels, is analyzed. We prove somewhat surprisingly that in this setting, variability in erasure probabilities increases network capacity.