By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
T. Ohta ; Fac. of Inf. Sci., Hiroshima City Univ., Japan ; S. Inoue ; Y. Kakuda ; K. Ishida
more authors

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.

Published in:

Distributed Computing Systems Workshops, 2002. Proceedings. 22nd International Conference on

Date of Conference: