Clustering algorithms in ad hoc networks
Hirohito Taniguchi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara · Electronics and Communications in Japan (Part II Electronics) · 2004
This study proposes clustering algorithms for ad hoc networks (networks including only mobile terminals). A clustering algorithm is a method of dividing the whole network into clusters so that every cluster includes a cluster head and cluster members, that is, nodes that can directly communicate with the cluster head. Since mobile terminals have relatively low performance in terms of processing power and communications capabilities, the load on mobile terminals should be kept as low as possible. One of the problems in distributed systems is that movement of terminals and changes of topology generate overhead, which must be taken into account. In addition, clustering offers a hierarchical structure, which is advantageous in terms of spatial reuse of wireless channel bandwidth. Information exchange in a network should be minimized by using fewer cluster heads, and by minimizing the modifications of cluster heads. In this study, a new clustering algorithm is proposed, along with a reclustering algorithm to deal with topology changes caused by movement of mobile terminals. Simulations show that the proposed clustering algorithm results in fewer clusters than conventional algorithms, except for dense graphs, and that the proposed reclustering algorithm results in fewer clusters and cluster head modifications. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 88(1): 51–59, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20143