Capacity of ad hoc wireless networks with infrastructure support

We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity W bits/s, and infrastructure nodes which in addition are interconnected with each other via high capacity links. Specifically, we consider a network model where ad hoc nodes are randomly spatially distributed and choose to communicate with a random destination. We identify three scaling regimes, depending on the growth of the number of infrastructure nodes, m relative to the number of ad hoc nodes n, and show the asymptotic scaling for the per user throughput as n becomes large. We show that when m /spl lsim/ /spl radic/n/logn the per user throughput is of order W//spl radic/n log n and could be realized by allowing only ad hoc communications, i.e., not deploying the infrastructure nodes at all. Whenever /spl radic/n/log n /spl lsim/ m /spl lsim/ n/log n, the order for the per user throughput is Wm/n and, thus, the total additional bandwidth provided by m infrastructure nodes is effectively shared among ad hoc nodes. Finally, whenever m /spl gsim/ n/log n, the order of the per user throughput is only W/log n, suggesting that further investments in infrastructure nodes will not lead to improvement in throughput. The results are shown through an upper bound which is independent of the routing strategy, and by constructing scenarios showing that the upper bound is asymptotically tight.

[1]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  P. R. Kumar,et al.  Internets in the sky: The capacity of three-dimensional wireless networks , 2001, Commun. Inf. Syst..

[3]  Leandros Tassiulas,et al.  Throughput capacity of random ad hoc networks with infrastructure support , 2003, MobiCom '03.

[4]  David P. Reed,et al.  How wireless networks scale: the illusion of spectrum scarcity , 2002 .

[5]  Robert Morris,et al.  Capacity of Wireless Ad Hoc Networks , 2020, Encyclopedia of Wireless Networks.

[6]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[7]  Andrea J. Goldsmith,et al.  Design challenges for energy-constrained ad hoc wireless networks , 2002, IEEE Wirel. Commun..

[8]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

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

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

[11]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

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

[13]  Timothy J. Shepard,et al.  A channel access scheme for large dense packet radio networks , 1996, SIGCOMM '96.

[14]  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).

[15]  Rick S. Blum,et al.  Delay limited capacity of ad hoc networks: asymptotically optimal transmission and relaying strategy , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

[18]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.