Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 432952, 11 pages
Research Article

A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links’ Weight to Increase Network Stability

1Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Arak Branch, Arak 38198-38453, Iran
2Department of Computer and Communication Systems Engineering, Faculty of Engineering, UPM, Serdang, Malaysia

Received 19 November 2013; Accepted 3 February 2014; Published 30 April 2014

Academic Editors: J. F. Groote and B. Sun

Copyright © 2014 Abbas Karimi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The stability of clusters is a serious issue in mobile ad hoc networks. Low stability of clusters may lead to rapid failure of clusters, high energy consumption for reclustering, and decrease in the overall network stability in mobile ad hoc network. In order to improve the stability of clusters, weight-based clustering algorithms are utilized. However, these algorithms only use limited features of the nodes. Thus, they decrease the weight accuracy in determining node’s competency and lead to incorrect selection of cluster heads. A new weight-based algorithm presented in this paper not only determines node’s weight using its own features, but also considers the direct effect of feature of adjacent nodes. It determines the weight of virtual links between nodes and the effect of the weights on determining node’s final weight. By using this strategy, the highest weight is assigned to the best choices for being the cluster heads and the accuracy of nodes selection increases. The performance of new algorithm is analyzed by using computer simulation. The results show that produced clusters have longer lifetime and higher stability. Mathematical simulation shows that this algorithm has high availability in case of failure.