Paper Info
Title
A Flexible Weight Based Clustering Algorithm in Mobile Ad hoc Networks
Abstract
Clustering has been proven to be a promising approach for mimicking the operation of the fixed infrastructure and managing the resources in multi-hop networks. In order to achieve good performance, the formation and maintenance procedure of clusters should operate with minimum overhead, allowing mobile nodes to join and leave without perturbing the membership of the cluster and preserving current cluster structure as much as possible. In this paper, we propose a Flexible Weight Based Clustering Algorithm (FWCA) in Mobile Ad hoc Networks. The goals are yielding low number of clusters, maintaining stable clusters, minimizing the number of invocations for the algorithm and maximizing lifetime of mobile nodes in the system. Through simulations we have compared the performance of our algorithm with that of WCA in terms of the number of clusters formed, number of re-affiliations, number of states transitions on each clusterhead and number of clusterheads changes. The results demonstrate the superior performance of the proposed algorithm.
Year
DOI
Venue
2006
10.1109/ICSNC.2006.2
ICSNC
Keywords
Field
DocType
mobile ad,mobile node,current cluster structure,clusterheads change,good performance,stable cluster,low number,flexible weight,proposed algorithm,superior performance,mobile ad hoc network,ad hoc networks,indexing terms,mobile ad hoc networks,network topology,spread spectrum communication,clustering algorithms,resource management,quality management,state transition,technology management
Mobile ad hoc network,Resource management,Cluster (physics),Computer science,Computer network,Network topology,Wireless ad hoc network,Cluster analysis,Technology management,Spread spectrum,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2699-3
6
0.48
References 
Authors
0
5
Name
Order
Citations
PageRank
Zouhair El-Bazzal1203.92
Michel Kadoch233746.84
Basile L. Agba35610.33
Francois Gagnon413133.07
Maria Bennani5162.22