A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Authors:
Wonchang Choi;Miae Woo
Affiliations:
Sejong University, Korea;Sejong University, Korea
Venue:
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Year:
2006

Citing 0
Cited 9

Efficient virtual-backbone routing in mobile ad hoc networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Scenario-Based Diameter-Bounded Algorithm for Cluster Creation and Management in Mobile Ad hoc Networks

DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
SCAM: scenario-based clustering algorithm for mobile ad hoc networks

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A novel stable and low-maintenance clustering scheme

Proceedings of the 2010 ACM Symposium on Applied Computing
A Cluster-Based Approach for Efficient Multi-Source Multicasting in MANETs

Wireless Personal Communications: An International Journal
Smart and balanced clustering for MANETs

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A new weight based self-organizing approach to clustering in mobile ad hoc networks

Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
A Weight Based Clustering Scheme for Mobile Ad hoc Networks

Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Maximising resource utilisation and load balancing in MANET multicasting with ODMRP over cluster-based topologies

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.