Determining the optimal configuration for the zone routing protocol

The zone routing protocol (ZRP) is a hybrid routing protocol that proactively maintains routes within a local region of the network (which we refer to as the routing zone). Knowledge of this routing zone topology is leveraged by the ZRP to improve the efficiency of a reactive route query/reply mechanism. The ZRP can be configured for a particular network through adjustment of a single parameter, the routing zone radius. We address the issue of configuring the ZRP to provide the best performance for a particular network at any time. Previous work has demonstrated that an optimally configured ZRP operates at least as efficiently as traditional reactive flood-search or proactive distance vector/link state routing protocols (and in many cases, much more efficiently). Adaptation of the ZIP to changing network conditions requires both an understanding of how the ZRP reacts to changes in network behavior and a mechanism to allow individual nodes to identify these changes given only limited knowledge of the network behavior. We demonstrate the effects of relative node velocity, node density, network span, and user data activity on the performance of the ZRP. We then introduce two different schemes ("min searching" and "traffic adaptive") that allow individual nodes to identify and appropriately react to changes in network configuration, based only on information derived from the amount of received ZRP traffic. Through test-bed simulation, we demonstrate that these radius estimation techniques can allow the ZRP to operate within 2% of the control traffic resulting from perfect radius estimation.

[1]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

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

[3]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .

[4]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM '89.

[5]  J. J. Garcia-Lunes-Aceves Loop-free routing using diffusing computations , 1993 .

[6]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

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

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

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

[10]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

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

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

[13]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[14]  J. J. Garcia-Luna-Aceves,et al.  A routing protocol for packet radio networks , 1995, MobiCom '95.

[15]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[16]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[17]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

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

[19]  Zygmunt J. Haas,et al.  The performance of a new routing protocol for the reconfigurable wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[20]  L. Kleinrock,et al.  Packet Switching in Radio Channels : Part Il-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution , 2022 .

[21]  J. Sharony A mobile radio network architecture with dynamically changing topology using virtual subnets , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[22]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.