Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation

In this paper an information-theoretic formulation is used for characterizing the minimum overhead of maintaining link state information across a mobile ad hoc network. The minimum overhead problem is formulated a rate-distortion problem. Lower bounds are derived for the minimum overhead incurred by maintaining link state information when link state routing protocols are designed with guaranteed delivery ratio for data packets. The deficit caused by the this overhead on the overall transport capacity of a mobile network is characterized. Further a threshold value is derived for the delivery error ratio, and it is shown that no link state routing protocol can achieve a delivery error ratio smaller than this threshold.

[1]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[2]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

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

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

[5]  Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue , 2006, Comput. Networks.

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

[7]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[8]  Nirwan Ansari,et al.  Rate-distortion based link state update , 2006, Comput. Networks.

[9]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

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

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

[12]  Alhussein A. Abouzeid,et al.  Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[13]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[14]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

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

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

[17]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[18]  Thomas M. Cover,et al.  Elements of Information Theory: Cover/Elements of Information Theory, Second Edition , 2005 .

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

[20]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[22]  Fred L. Templin,et al.  Topology Broadcast based on Reverse-Path Forwarding (TBRPF) , 2000 .