Premium
A novel weighted clustering algorithm in mobile ad hoc networks using discrete particle swarm optimization (DPSOWCA)
Author(s) -
Yang Bin,
Xu Jinwu,
Yang Jianhong,
Yang Debin
Publication year - 2010
Publication title -
international journal of network management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.373
H-Index - 28
eISSN - 1099-1190
pISSN - 1055-7148
DOI - 10.1002/nem.730
Subject(s) - computer science , cluster analysis , mobile ad hoc network , particle swarm optimization , stability (learning theory) , algorithm , k medoids , wireless ad hoc network , swarm behaviour , mathematical optimization , cure data clustering algorithm , correlation clustering , artificial intelligence , mathematics , machine learning , computer network , telecommunications , network packet , wireless
Abstract In this paper, a novel weighted clustering algorithm in mobile ad hoc networks using discrete particle swarm optimization (DPSOWCA) is proposed. The proposed algorithm shows how discrete particle swarm optimization can be useful in enhancing the performance of clustering algorithms in mobile ad hoc networks. Consequently, it results in the minimum number of clusters and hence minimum cluster heads. The goals of the algorithm are to minimize the number of cluster heads, to enhance network stability, to maximize network lifetime, and to achieve good end‐to‐end performance. Analysis and simulation of the algorithm have been implemented and the validity of the algorithm has been proved. Results show that the proposed algorithm performs better than the existing weight‐based clustering algorithm and adapts to different kinds of network conditions. Copyright © 2009 John Wiley & Sons, Ltd.