Abstract—Mobile Ad hoc Networks have special properties and one of the most significant of those properties is nodes mobility which in part plays a considerable role in network’s different parameters. Many efforts were made to make an infrastructure for these networks. In these infrastructures or clusters, a main node called clusterhead has a vital role in keeping the structure, routing and enhancing the efficiency of the network. In this paper, we have presented a new clustering algorithm in Mobile Ad Hoc Network based on nodes weight. For calculating node weight we present four new parameter, relative speed, stability, number of nodes moving towards a node and battery remaining. The goal of this algorithm is to decrease the number of cluster forming, maintain stable clustering structure and maximize lifespan of mobile nodes in the system. In simulation, the proposed algorithm has been compared with WCA, MOBIC and the Lowest_ID algorithm. The results of simulation reveal that the proposed algorithm achieves the goals.
Index Terms—Mobile adhoc network, clustering, stability, clusterhead
M. shayesteh is with Islamic azad university of Banddar-abbas Branch, Iran (e-mail: shayesteh.au@gmail.com)
N. Karimi is with Islamic azad university of Bandar-abbas Branch, Iran (e-mail: nimakarimi@gmail.com)
Cite: Mohammad Shayesteh and Nima Karimi, "An Innovative Clustering Algorithm for MANETs Based on Cluster Stability," International Journal of Modeling and Optimization vol. 2, no. 3, pp. 239-244, 2012.
Copyright © 2008-2024. International Journal of Modeling and Optimization. All rights reserved.
E-mail: ijmo@iacsitp.com