Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Architecture strategies for energy-efficient packet forwarding in wireless sensor networks
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Optimizing Sensor Networks in the Energy-Latency-Density Design Space
IEEE Transactions on Mobile Computing
Dynamic Power Management in Wireless Sensor Networks
IEEE Design & Test
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Localized Sensor Area Coverage with Low Communication Overhead
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy consumption of a single sensor node but also the extension of the entire network lifetime. We propose a simple and adaptive energy-conserving topology management scheme, called SAND (Self-Organizing Active Node Density). SAND is fully decentralized and relies on a distributed probing approach and on the redundancy resolution of sensors for energy optimizations, while preserving the data forwarding and sensing capabilities of the network. We present the SAND's algorithm, its analysis of convergence, and simulation results. Simulation results show that, though slightly increasing path lengths from sensor to sink nodes, the proposed scheme improves significantly the network lifetime for different neighborhood densities degrees, while preserving both sensing and routing fidelity.