An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Z-MAC: a hybrid MAC for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Mobile data collection in sensor networks: The TinyLime middleware
Pervasive and Mobile Computing
Meeting lifetime goals with energy levels
Proceedings of the 5th international conference on Embedded networked sensor systems
A node discovery service for partially mobile sensor networks
Proceedings of the 2nd international workshop on Middleware for sensor networks
Solving the Wake-Up Scattering Problem Optimally
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
On meeting lifetime goals and providing constant application quality
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Agent-based decentralised coordination for sensor networks using the max-sum algorithm
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Duty-cycling in wireless sensor networks (WSNs) has both beneficial effects on network lifetime and negative effects on application performance due to the inability of a sensor to perform while it is sleeping. In a typical scenario, the active periods of nodes are randomly initialized, leading to unpredictable and often sub-optimal performance. In this paper, we propose a fully decentralized wake-up scattering algorithm that uniformly spreads wake-up times of nearby sensors. Interestingly, our approach is complementary and dual to existing approaches that aim at synchronizing (instead of scattering) times, and to those that focus on spatial (instead of temporal) coverage. Wake-up scattering is beneficial in several application scenarios, three of which are considered here: responsiveness to one-hop queries from a mobile base station, sensing coverage for event detection, and latency in multi-hop communication. Our evaluation shows that, w.r.t. a random assignment of wake-up times, wake-up scattering brings improvements in all these measures, along with a positive impact on the network lifetime.