An Adaptive Maintenance of Hierarchical Structure in Ad Hoc Networks and Its Evaluation

Authors:
Tomoyuki Ohta;Shinji Inoue;Yoshiaki Kakuda;Kenji Ishida;Kaori Maeda
Affiliations:
-;-;-;-;-
Venue:
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Year:
2002

Citing 0
Cited 4

Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Robust self-stabilizing construction of bounded size weight-based clusters

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.