A dual-hybrid adaptive routing strategy for wireless ad-hoc networks

Recent debate in the research community has focused around the following question: should the design of routing algorithms for ad-hoc networks be predicated upon the minimization of routing overhead, or the optimization of network paths? The answer to this question depends upon the mobility and traffic characteristics present in the network. It is doubtful that any one approach by itself can be optimal, or even sufficient when there are temporal and spatial changes in the network dynamics. Most proposed solutions have adopted a fixed approach. To address this shortcoming we propose a dynamic cluster based routing strategy that shifts the characteristics of its routing approach according to localized network dynamics. This is achieved by dividing routing into intra-cluster and inter-cluster components utilizing a strategy that is hybrid in terms of both its route acquisition and path computation approaches. By adapting the cluster organization to node mobility the strategy senses the network and balances optimality and overhead. The reason for doing this is to achieve the best possible performance subject to a wide range of operating environments.

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

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

[3]  Taieb Znati,et al.  A path availability model for wireless ad-hoc networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[4]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[5]  I. Chlamtac,et al.  Route selection in mobile multimedia ad hoc networks , 1999, 1999 IEEE International Workshop on Mobile Multimedia Communications (MoMuC'99) (Cat. No.99EX384).

[6]  Jon Postel,et al.  Internet Control Message Protocol , 1981, RFC.

[7]  A. B. McDonald,et al.  Predicting node proximity in ad-hoc networks: a least overhead adaptive model for selecting stable routes , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

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

[9]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[10]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[11]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[12]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

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