A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks

This paper presents a Mobility-Resistant, Efficient Clustering Approach (MRECA) for ad hoc and sensor networks. MRECA can provide robustness against moderate node mobility and at the same time render energy-eficiency. The identified clusterheads cover the whole network and each node in the network can determine its cluster and only one cluster. The algorithm terminates in deterministic time without iterations, and each node transmits only one message during the algorithm. We prove analytically the correctness and complexity of the algorithm, and simulation results demonstrate that MRECA is energy-efficient, resilient against node mobility, and robust against synchronization errors

[1]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[2]  Mahesh K. Marina,et al.  Virtual dynamic backbone for mobile ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..

[4]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[5]  Adrian Perrig,et al.  ACE: An Emergent Algorithm for Highly Uniform Cluster Formation , 2004, EWSN.

[6]  Miao Yu,et al.  A Distributed Efficient Clustering Approach for Ad Hoc and Sensor Networks , 2005, MSN.

[7]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[8]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[9]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[10]  Stefano Basagni,et al.  A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[11]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[12]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[13]  Sajal K. Das,et al.  Mobility-adaptive protocols for managing large ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[14]  Vaduvur Bharghavan,et al.  The clade vertebrata: spines and routing in ad hoc networks , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[15]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

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

[17]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[18]  Vaduvur Bharghavan,et al.  Spine routing in ad hoc networks , 1998, Cluster Computing.

[19]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[20]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[21]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).