Associativity-based adaptive weighted clustering for large-scale mobile ad hoc networks

Authors:
Shafqat Ur Rehman;Wang-Cheol Song;Junghoon Lee;Gyung-Leen Park;Hanan Lutfiyya
Affiliations:
Cheju National University, Jeju Si, Jeju Do, South Korea;Cheju National University, Jeju Si, Jeju Do, South Korea;Cheju National University, Jeju Si, Jeju Do, South Korea;Cheju National University, Jeju Si, Jeju Do, South Korea;University of Western Ontario, Canada
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 8
Cited 0

Multicluster, mobile, multimedia radio network

Wireless Networks
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks

ISADS '03 Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03)
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks

ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Ad Hoc Networking

Ad Hoc Networking
A survey of clustering schemes for mobile ad hoc networks

IEEE Communications Surveys & Tutorials
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and analyze a distributed adaptive clustering algorithm for large-scale ad hoc networks. The algorithm calculates a stability weight for each node based on its power and spatial and temporal stability. The nodes having the highest stability weight get elected as clusterheads. Frequent clusterhead change is minimized by cautious invocation of re-clustering. Frequency of control messages is adapted to the mobility pattern of clustermembers. The algorithm balances load across clusterheads and adapts hop-distance to the network density by keeping the cluster size around an optimum value. It reduces the overall communication complexity by minimizing the control traffic overhead and by eliminating the ripple effect of re-clustering. We analyze effectiveness of the algorithm through simulations.