Probabilistic Energy Value for Clustering in Wireless Sensors Networks

HTML  XML Download Download as PDF (Size: 538KB)  PP. 26-32  
DOI: 10.4236/wsn.2013.52004    5,268 Downloads   9,322 Views  Citations

ABSTRACT

Wireless sensors networks consist of a number of sensors nodes connected through a wireless network that collect data to be treated locally or relayed to the sink node using multi-hop wireless transmission. Several solutions were proposed to minimize the amount of information flowing within the network. Clustering algorithms is one solution and mechanism that enables the creation of sensor’s clusters; each sensor is dominated by elected routers. In order to limit energy consumption, the clustering around the sensor is established: sensors linked to the router transmit relayed data thereafter outward. The number of messages sent and the transmission range are thus reduced. This article tackles this issue by unveiling proposed techniques in the same line of researches and proposing a clustering mechanism based on the amount of energy remaining in the sensors. The simulation results show that proposed method can achieve higher network lifetime by comparison to original LEACH.

Share and Cite:

S. Khediri, N. Nasri, A. Wei and A. Kachouri, "Probabilistic Energy Value for Clustering in Wireless Sensors Networks," Wireless Sensor Network, Vol. 5 No. 2, 2013, pp. 26-32. doi: 10.4236/wsn.2013.52004.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.