Arranging cluster sizes and transmission ranges for wireless sensor networks
Information Sciences: an International Journal
Data aggregation for evolving wireless sensor networks using W-LEACH
Proceedings of the Second Kuwait Conference on e-Services and e-Systems
Journal of Network and Computer Applications
Hi-index | 0.00 |
Many recent applications deal with continues flows of data (data streams). One important area of applications that is based on data streams is the area of Wireless Sensor Networks (WSNs) applications. Since sensors have limited lifetime, the need for developing algorithms for aggregating sensors' data forms an important concern in the area of WSNs. We present W-LEACH, a data-stream aggregation algorithm for WSNs that extends LEACH algorithm by Heinzelman et al. W-LEACH is able to handle non-uniform networks as well as uniform networks, while not affecting the network lifetime. It, instead, increases the average lifetime for sensors. We simulate our algorithm to evaluate its performance. Results show that W-LEACH increases the network lifetime and the average lifetime for sensors for uniform and non-uniform WSNs.