On the Capacity of Ad Hoc Networks Under Random Packet Losses

We consider the problem of determining asymptotic bounds on the capacity of a random <i>ad</i> <i>hoc</i> network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the signal to interference and noise ratio (SINR) is above a certain threshold, then the transmitted packet is received error-free by the receiver thereby. Using this model, the per node capacity of the network was shown to be Theta(<sub>radic(n</sub> <sub>log</sub> <sub>n)</sub>/<sup>1</sup>). In reality, for any finite link SINR, there is a nonzero probability of erroneous reception of the packet. We show that in a large network, as the packet travels an asymptotically large number of hops from source to destination, the cumulative impact of packet losses over intermediate links results in a per-node throughput of only <i>O</i>(<sub>radic(n)</sub>/<sup>1</sup>) under the previously proposed routing and scheduling strategy. We then propose a new scheduling scheme to counter this effect. The proposed scheme provides tight guarantees on end-to-end packet loss probability, and improves the per-node throughput to Omega(<sub>radic(n)(log</sub> <sub>n)</sub>/<sup>1</sup>2<sub>(alpha-2)</sub>/<sup>alpha+2</sup>) where <i>alpha</i> <i>></i> <i>2</i> is the path loss exponent.

[1]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[2]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

[3]  Catherine Rosenberg,et al.  Throughput-optimal configuration of fixed wireless networks , 2008, TNET.

[4]  Robert Morris,et al.  Capacity of ad hoc networks , 2001 .

[5]  Sanjeev R. Kulkarni,et al.  Upper bounds to transport capacity of wireless networks , 2004, IEEE Transactions on Information Theory.

[6]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[7]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[8]  Vivek P. Mhatre,et al.  The Impact of Link Layer Model on the Capacity of a Random Ad hoc Network , 2006, 2006 IEEE International Symposium on Information Theory.

[9]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[10]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[11]  P. Viswanath,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, Proceedings IEEE International Symposium on Information Theory,.

[12]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[13]  Donald F. Towsley,et al.  On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Aravind V Iyer The Capacity of Ad hoc Networks under a Realistic Link Layer Model , 2006 .

[15]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[18]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[19]  Massimo Franceschetti,et al.  Information theoretic bounds on the throughput scaling of wireless relay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  R. Ellis,et al.  Entropy, large deviations, and statistical mechanics , 1985 .

[21]  Olivier Leveque,et al.  How does the information capacity of ad hoc networks scale , 2006 .