DAR: An energy-balanced data-gathering scheme for wireless sensor networks
Computer Communications
Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Routing and Aggregation Strategies for Contour Map Applications in Sensor Networks
WWIC 2009 Proceedings of the 7th International Conference on Wired/Wireless Internet Communications
Securing data aggregation against false data injection in wireless sensor networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Geographic convergecast using mobile sink in wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
Spanning trees rooted at a sink node are often employed for data collection in sensor networks. The nodeýs double task of sensing and forwarding traffic from other nodes results in energy depletion which is dependent on the constructed spanning tree. The approach taken in this paper is to extend the lifetime of a sensor network by judiciously recalculating the data collection tree to adjust it pro-actively before nodes fail due to total energy depletion. The proposed scheme attempts to make energy-critical nodes leaf nodes, or, as a last resort, to balance the traffic load handled by them. Additionally, an exponentially decaying threshold is used for adaptively characterizing nodes as critical. Simulations demonstrate significantly improved network lifetime but also point to the need to carefully set the thresholds for characterizing nodes as critical.