Toward stable clustering in mobile ad hoc networks

This paper proposes a novel clustering scheme that aims to address the following concerns: effectiveness and low maintenance. By constructing a multi-hop clustering backbone with small number of cluster-heads, we successfully reduce the overhead of inter-cluster maintenance and backbone changes. Next, we utilize the cluster stretching mechanism which decreases the leaving frequency of cluster-members. As the number of leaving events is reduced, the cluster topology is more stable for high-layer applications. Finally, an extensive performance evaluation verifies our results under different system settings.

[1]  P.H.J. Chong,et al.  A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[2]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[4]  Huirong Fu,et al.  A Novel Location-Service Protocol Based on $k$ -Hop Clustering for Mobile Ad Hoc Networks , 2007, IEEE Transactions on Vehicular Technology.

[5]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[6]  Matthias R. Brust,et al.  Dynamic multi-hop clustering for mobile hybrid wireless networks , 2008, ICUIMC '08.

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