3hBAC (3-hop between adjacent clusterheads): a novel non-overlapping clustering algorithm for mobile ad hoc networks

The clustering protocol of an ad hoc network is always with interest. In this paper, we present a novel non-overlapping clustering algorithm, 3-hop between adjacent clusterheads (3hBAC), which can decrease the number of clusters without loss of connection information. In the cluster maintenance phase, we combine 3hBAC with least cluster change (LCC) algorithm to further decrease the cluster change and to extend average clusterhead time and membership time. The performances of 3hBAC are compared with highest-connectivity clustering (HCC), random competition-based clustering (RCC) in terms of average number of clusters, average clusterhead time and average membership time. 3hBAC outperforms HCC and RCC in both the cluster formation and maintenance phase.

[1]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[2]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[3]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[4]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[5]  Tzu-Jane Tsai,et al.  A access-based clustering protocol for multihop wireless ad hoc networks , 2001, IEEE J. Sel. Areas Commun..

[6]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[7]  Xiaoyan Hong,et al.  An ad hoc network with mobile backbones , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).