Effect of Information on Routing Performance in Multi-Hop Wireless Networks

A key issue impacting wireless network performance is network information. In wireless networks, a significant amount of bandwidth and power resource is consumed to disseminate and maintain routing information. Previous work has presented different methods to broadcast and store such routing information so as to reduce the overhead. However, the amount of information required for a routing algorithm to be effective is not studied theoretically. In this paper, we consider two kinds of routing information, i.e., location information and link state information, and study the quantitative relationship between the available routing information and network performance. It is assumed that each node in the network can only obtain information of its k-hop neighbors, and for each packet, a distance vector based algorithm is employed to minimize the number of hops for the packet to reach its destination with the limited information. We then present a methodology to derive the analytical result on the quantitative relationship between routing performance and the information available for each node. The analysis in this paper can be a valuable tool on designing routing algorithms in wireless networks.

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

[2]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[3]  J.J. Garcia-Luna-Aceves,et al.  Steady-state response of shortest-path routing algorithms , 1992, Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings].

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

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

[6]  Mario Gerla,et al.  Global state routing: a new routing scheme for ad-hoc wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[7]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[8]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[9]  Imrich Chlamtac,et al.  Mobile ad hoc networking: imperatives and challenges , 2003, Ad Hoc Networks.

[10]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[11]  Alhussein A. Abouzeid,et al.  Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[13]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[14]  Xiaoyan Hong,et al.  A wireless hierarchical routing protocol with group mobility , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

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

[16]  J. J. Garcia-Luna-Aceves,et al.  Source-tree routing in wireless networks , 1999, Proceedings. Seventh International Conference on Network Protocols.

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