Flexible power scheduling for sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
A wireless sensor network For structural monitoring
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Dozer: ultra-low power data gathering in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Network scheduling for data archiving applications in sensor networks
DMSN '06 Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006
Scheduling Transmission of Bulk Data in Sensor Networks Using a Dynamic TDMA Protocol
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
An approximation algorithm for the wireless gathering problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
Many applications in sensor networks demand for energy and time optimal routing of data towards a sink. In this work we present mechanisms to set up energy and time efficient TDMA schedules for a given routing tree under very strict limitations: Nodes have only a constant size memory and must agree on a schedule using only a minimum of communication for set up: Each node is only allowed to send a single message to each of its neighbors. We propose and analyze solutions in two different interference models. We show that, despite these tight restrictions, it is possible to compute energy optimal schedules which are almost time optimal and time optimal schedules which are almost energy optimal in the total interference model and we describe a 4-approximative algorithm in the k -local interference model. We also show how to extend these mechanisms to settings with packet loss, while still guaranteeing bounds on energy consumption.