Geographic Protocol Information and Capacity Deficit in Mobile Wireless Ad Hoc Networks

Overheads incurred by network protocols diminish the capacity available for relaying useful data in a dynamic communications network. Discovering lower bounds on the amount of protocol overhead incurred is important for the development of efficient network protocols and for characterizing the effective capacity available for network users. This paper presents an information-theoretic framework for characterizing the minimum protocol overheads incurred for maintaining location information in a network with mobile nodes. Specifically, the minimum overhead problem is formulated as a rate-distortion problem. The formulation may be applied to networks with arbitrary traffic arrival and location service schemes. Lower bounds are derived for the minimum overheads incurred for maintaining the location of the nodes and consistent neighborhood information in terms of node mobility and packet arrival processes. This leads to a characterization of the deficit caused by the protocol overheads on the overall transport capacity.

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

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

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

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

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

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

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

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

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

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

[11]  Alhussein A. Abouzeid,et al.  Stochastic and information theoretic models for design and performance evaluation of mobile ad hoc and sensor networks , 2007 .

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

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

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

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

[16]  Toby Berger,et al.  Information rates of Wiener processes , 1970, IEEE Trans. Inf. Theory.

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

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

[19]  Paolo Santi.  The critical transmitting range for connectivity in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

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

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

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

[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]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

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

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

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

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

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

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

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

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