A clustering algorithm based on energy variance and coverage density in centralized hierarchical Wireless Sensor Networks

In Wireless Sensor Network (WSN), the clustering algorithm was developed to reduce the total energy consumption which determines the lifetime of the whole network. As a result, a number of recently-designed energy-efficient routing algorithms stated that clustering approach has an important issue for organizing a network into a connected hierarchy and increasing the network lifetime. This paper proposes a new algorithm to improve the performance of Low Energy Adaptive Clustering Centralized (LEACH-C) by improving the criterion for electing a cluster-head and the determination of optimal number of cluster-heads. Firstly, the optimal number of cluster-heads is based on the density of the covering. The sensor nodes are deployed randomly on the plane area of the sensing field covered by the communication range of the node. Secondly, nodes having the highest remaining energy and the lowest energy variance consumption becomes cluster-heads. The variance parameter keeps energy consumption dispersion, if the considered node is elected as cluster-head. This dispersion highly depends on the relative positioning of the node to the base station. This is useful for predicting node status when elected as cluster-head in the current round in order to balance the network energy. The simulation and analytical results of the proposed algorithm outperform the existing protocols in terms of lifetime of the network.

[1]  Tung-Jung Chan,et al.  Optimal cluster number selection in ad-hoc wireless sensor networks , 2008 .

[2]  Dirk Timmermann,et al.  Low energy adaptive clustering hierarchy with deterministic cluster-head selection , 2002, 4th International Workshop on Mobile and Wireless Communications Network.

[3]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[4]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[5]  Xiaohu You,et al.  Enhancing the performance of LEACH protocol in wireless sensor networks , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[6]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[7]  Frederic Alicalapa,et al.  Forwarding and Routing Stateless Multi-Hop Protocol for Wireless Sensor Networks , 2012, ICON 2012.

[8]  Ningbo Wang,et al.  An Energy Efficient Algrithm Based on LEACH Protocol , 2012, 2012 International Conference on Computer Science and Electronics Engineering.

[9]  S. Manesis,et al.  A Survey of Applications of Wireless Sensors and Wireless Sensor Networks , 2005, Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005..

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

[11]  Gábor Fejes Tóth.  Best Partial Covering of a Convex Domain by Congruent Circles of a Given Total Area , 2007, Discret. Comput. Geom..

[12]  Adam Dunkels,et al.  Solar-aware clustering in wireless sensor networks , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[13]  Ameer Ahmed Abbasi,et al.  A survey on clustering algorithms for wireless sensor networks , 2007, Comput. Commun..

[14]  Aimin Wang,et al.  A clustering algorithm based on energy information and cluster heads expectation for wireless sensor networks , 2012, Comput. Electr. Eng..