Hi-TORA: a hierarchical routing protocol in ad hoc networks

Recently, in wired networks, a hierarchical structure has been introduced to improve management and routing. In ad hoc networks, we introduce a hierarchical structure to achieve the same goal. However it is difficult to introduce the hierarchical structure because all mobile hosts are always moving around the network. So, we proposed the clustering scheme to construct the hierarchical structure. We propose a new hierarchical routing protocol called Hi-TORA based on the clustering scheme. We show the experimental evaluation of Hi-TORA with respect to the number of control packets, accuracy of packet delivery and hop counts in comparison with TORA.

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

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

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

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

[5]  T. Ohta.  Maintenance Algorithm for Hierarchical Structure in Large Ad Hoc Networks , 2002 .

[6]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[7]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

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

[9]  Kenji Ishida,et al.  An adaptive maintenance of hierarchical structure in ad hoc networks and its evaluation , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.