loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW'06)
A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Guadeloupe, French Caribbean
February 19-February 25
ISBN: 0-7695-2522-9
Wonchang Choi, Sejong University, Korea
Miae Woo, Sejong University, Korea
Clustering has been proven to support quality of services effectively in a multi-hop network. In order to achieve good performance in a mobile ad hoc network whose topology changes dynamically, any clustering algorithm should operate with minimum clustering maintenance overhead and preserve current cluster structure as much as possible. In this paper, we propose a clustering algorithm, namely a distributed weighted clustering algorithm. The goals of the algorithm are maintaining stable clustering structure, minimizing the overhead for the clustering set up and maintenance, maximizing lifespan of mobile nodes in the system, and achieving good end-to-end performance. DWCA chooses locally optimal clusterheads and incorporates power management at the clusterheads. Results obtained from simulations proved that the proposed algorithm achieves the goals.
Citation:
Wonchang Choi, Miae Woo, "A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks," aict-iciw, pp.73, Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.