An adaptive maintenance of hierarchical structure in ad hoc networks and its evaluation

Hierarchical routing is effective for large ad hoc networks. However, it is difficult to maintain the hierarchical structure for routing due to node movement. This paper proposes an adaptive method for maintaining the hierarchical structure. The features of the proposed method are (1) the roles of nodes for the hierarchical structure are changed depending on the status of nodes in the restricted vicinity, and (2) the cluster size is adjusted so that the number of nodes in each cluster is bounded by two constants. The adaptability of the proposed method has been evaluated by theoretical considerations and simulation experiments. The results show that node roles and clusters efficiently converges to stable states because of the features. The proposed method therefore has high adaptability to node movement.

[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]  T. Ohta Maintenance Algorithm for Hierarchical Structure in Large Ad Hoc Networks , 2002 .

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

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

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

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

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

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