Premium
A methodology for real‐time self‐organized autonomous clustering in mobile ad hoc networks
Author(s) -
Kakuda Yoshiaki,
Ohta Tomoyuki,
Oda Ryotaro
Publication year - 2012
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1792
Subject(s) - adaptability , cluster analysis , computer science , scalability , mobile ad hoc network , wireless ad hoc network , distributed computing , disjoint sets , geocast , computer network , self organization , network topology , vehicular ad hoc network , artificial intelligence , wireless , mathematics , telecommunications , ecology , combinatorics , database , network packet , biology
SUMMARY In order to realize hierarchical routings that should be executed in large‐scaled mobile ad hoc networks that vary their topologies considerably with time, we have developed autonomous clustering with high scalability and adaptability. In autonomous clustering, an entire network is divided into disjoint subnetworks (called clusters), and they are maintained by periodically sending messages within the clusters. This paper proposes real‐time self‐organizing autonomous clustering, in which interval and power for transmitting such messages are dynamically changed depending on variation of mobility and density of the clusters. Because their mobility and density can be estimated by local information obtained in the clusters, and according to their respective change the clusters are self‐organized in real‐time way, the proposed real‐time self‐organizing autonomous clustering can contribute to enhancement of its scalability and adaptability. Copyright © 2011 John Wiley & Sons, Ltd.