A load balance K-hop clustering algorithm for ad hoc networks

Authors:
Yong Li;Ping Wang
Affiliations:
Key Laboratory of Network control & Intelligent Instrument, Ministry of Education, Chongqing University of Posts and Telecommunications, Chongqing, China;Key Laboratory of Network control & Intelligent Instrument, Ministry of Education, Chongqing University of Posts and Telecommunications, Chongqing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 2
Cited 1

Connectivity-Based k-Hop Clustering in Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Dynamic genetic algorithms for the dynamic load balanced clustering problem in mobile ad hoc networks

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposed a load balance k-hop clustering algorithm (LBKC) for ad hoc works. Each node uses criteria to decide whether join the contention of cluster-heads. After k rounds of Floodmax[1], the IDs of cluster members are converged to potential cluster-head nodes of the network. Based on these informations, overloaded cluster-heads balance their loads with selected under-loaded cluster-heads. Simulation experiments indicate that proposed LBKC can decrease the overhead of k-hop clustering significantly, and with lower control overheads than Max-Min k-cluster heuristic.