Throughput Capacity of Ad Hoc Networks with Route Discovery

Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[2]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[3]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[5]  Chun-Chuan Yang,et al.  A reachability-guaranteed approach for reducing broadcast storms in mobile ad hoc networks , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[6]  Panganamala Ramana Kumar,et al.  Towards an information theory of large networks: an achievable rate region , 2003, IEEE Trans. Inf. Theory.

[7]  Junmo Yang,et al.  Location aided broadcast in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[8]  Rick S. Blum,et al.  Delay-limited throughput of ad hoc networks , 2004, IEEE Transactions on Communications.

[9]  Ashish Agarwal,et al.  Improved capacity bounds for wireless networks , 2004, Wirel. Commun. Mob. Comput..

[10]  Yu-Chee Tseng,et al.  Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

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

[12]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

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

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

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

[17]  Suhas Diggavi,et al.  Even one-dimensional mobility increases ad hoc wireless capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[18]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

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

[20]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[21]  Fred L. Templin,et al.  Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) , 2004, RFC.

[22]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .