Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads

Overheads incurred by routing protocols diminish the capacity available for relaying useful data over a mobile wireless ad hoc network. Discovering and understanding the lower bounds on the amount of protocol overhead incurred for routing data packets is important for development of efficient routing protocols, and for understanding the actual (effective) capacity available for network users. In this paper we use an information-theoretic approach for characterizing the minimum routing overheads of geographic routing in a mobile network. We formulate the minimum overhead problem as a rate-distortion problem. The formulation may be applied to networks with arbitrary traffic arrival and location service schemes. We evaluate lower bounds on the minimum overheads incurred for maintaining the location of destination nodes and consistent neighborhood information in terms of node mobility and packet arrival process. We also characterize the deficit caused by the routing overheads in the overall transport capacity of a mobile network.

[1]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[2]  Alhussein A. Abouzeid,et al.  The impact of traffic patterns on the overhead of reactive routing protocols , 2005, IEEE Journal on Selected Areas in Communications.

[3]  Ivan Stojmenovic,et al.  A scalable quorum based location update scheme for routing in ad hoc wireless networks , 1999 .

[4]  Ram Ramanathan,et al.  On the scalability of ad hoc routing protocols , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Roy D. Yates,et al.  Location uncertainty in mobile networks: a theoretical framework , 1997 .

[6]  Panganamala Ramana Kumar,et al.  The transport capacity of wireless networks over fading channels , 2004, IEEE Transactions on Information Theory.

[7]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[8]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[9]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[10]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[13]  Jan M. Rabaey,et al.  On the performance of geographical routing in the presence of localization errors [ad hoc network applications] , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[14]  Symeon Papavassiliou,et al.  An entropy-based model for supporting and evaluating route stability in mobile ad hoc wireless networks , 2002, IEEE Communications Letters.

[15]  Ram Ramanathan,et al.  Making link-state routing scale for ad hoc networks , 2001, MobiHoc '01.

[16]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

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

[18]  Alhussein A. Abouzeid,et al.  Routing in ad hoc networks: a theoretical framework with practical implications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  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.

[20]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[21]  Klara Nahrstedt,et al.  A scalable location management scheme in mobile ad-hoc networks , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.

[22]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[23]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[24]  Philippe Jacquet,et al.  Analyzing control Traffic Overhead in Mobile Ad-hoc Network Protocols versus Mobility and Data Traffic Activity , 2002 .

[25]  Robert G. Gallager,et al.  Basic limits on protocol information in data communication networks , 1976, IEEE Trans. Inf. Theory.

[26]  Sunghyu Han,et al.  Submitted to Ieee Transactions on Information Theory Upper Bounds for the Length of S-extremal Codes over F 2 , F 4 , and F 2 + Uf 2 , 2007 .

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

[28]  M. S. Corson,et al.  A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[29]  Alhussein A. Abouzeid,et al.  Cluster-based routing overhead in networks with unreliable nodes , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[30]  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.

[31]  Alhussein A. Abouzeid,et al.  Reactive routing overhead in networks with unreliable nodes , 2003, MobiCom '03.

[32]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 1998, SIGCOMM '98.

[33]  Sajal K. Das,et al.  LeZi-update: an information-theoretic approach to track mobile users in PCS networks , 1999, MobiCom.

[34]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.