A Clustering Algorithm for Wireless Sensor Networks Basing on Distance and Distribution

Abstract:

Wireless sensor networks (WSNs) detect and monitor the outside physical state by the sensor nodes organizing automatically. Utilizing clustering algorithm to form hierarchical network topology is the common method which implements managing network and aggregating data in WSNs. Different from the previous clustering algorithms, this article proposes a clustering algorithm for WSNs based on distance and distribution to generate clusters considering residual energy of nods in WSNs with inhomogeneous distribution. The simulation result indicates that the algorithm can establish more balanceable clustering structure effectively and enhance the network life cycle obviously.

• Periodical: Key Engineering Materials (Volumes 474-476)
• Pages: 1221-1227
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.474-476.1221
• Online since: April 2011
• Authors: Ying Liao, Wei Xu Hao
• Keywords: Cluster, Connectivity, Density, Inhomogeneous Distribution, Life Cycle, Wireless Sensor Network (WSN)

References

[1] Tilak S, Abu-Ghazaleh NB, Heinzelman W. A taxonomy of wireless micro-sensor network models. Mobile Computing and Communications Review, 1(2): 1~8. (2002).

DOI: 10.1145/565702.565708

[2] Heinzelman, W.R., A.P. Chandrakasan, and H. Balakrishnan, Energy-Efficient Communication Protocol for Wireless Micro Sensor Networks， in IEEE Proceedings of the Hawaii International Conference on System Sciences (HICSS '00). (2000).

DOI: 10.1109/hicss.2000.926982

[3] Younis O, Fahmy S. Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach. In: Proc 13th Joint Conf on IEEE Computer and Communications Societies (INFOCOM). (2004).

DOI: 10.1109/infcom.2004.1354534

[4] Xu F , Heidemann J, Estrin D. Geography-informed energy conservation for ad hoc routing, In Proc 7th Annual Int's Conf on Mobile Computing and Networking (MobiCom). Rome, Italy: 70~84. (2001).

DOI: 10.1145/381677.381685

[5] Chatterjee, M., S.K. Da as, and D. Turgut, WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks, Cluster Computing Journal. vol. 5, No. 2, pp.193-204. (2002).

[6] Basagni, S., Distributed clustering for ad hoc networks, Proceedings of International Symposium on Parallel Architectures, Algorithm ms and Networks (ISPAN). Fremantle, Australia, pp.310-315. (1999).

DOI: 10.1109/ispan.1999.778957

[7] Bettstetter, C. and B. F Friedrich. Time and message complexities of the generalized distributed mobility-adaptive clustering (GD DMAC) algorithm in wireless multihop networks, in n VTC'03: Proceedings IEEE Vehicular Technology Conference. pp.176-180. (2003).

DOI: 10.1109/vetecs.2003.1207525

[8] Fernandess, Y. and D. Malkhi. K-clustering in wireless ad-hoc networks, in 2nd ACM Workshop on Principles of Mobile Computing (POMC'02). Toulouse, France. (2002).

DOI: 10.1145/584490.584497

[9] Lehsaini, M.  Guyennet, H.  Feham. M.  A novel cluster-based self-organization algorithm for wireless sensor networks, in Collaborative Technologies and Systems. CTS 2008International Symposium on: 19-26. (2008).

DOI: 10.1109/cts.2008.4543907

[10] Youssef. Moustafa, Youssef. Adel, Younis. Mohamed, Overlapping Multihop Clustering for Wireless Sensor Networks, EEE Transactions on Parallel and Distributed Systems, v20, n12, pp.1844-1856. (2009).

DOI: 10.1109/tpds.2009.32