A Lower Bound on the Capacity of Wireless Erasure Networks with Random Node Locations

Free registration required

Executive Summary

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. The authors 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 they 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.

  • Format: PDF
  • Size: 264.47 KB