Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Mitigating congestion in wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Scheduling Messages with Deadlines in Multi-Hop Real-Time Sensor Networks
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Improved Lower Bounds for Data-Gathering Time in Sensor Networks
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Time optimal gathering in sensor networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Optimally fast data gathering in sensor networks
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Data aggregation and pipelining scheduling protocols for real-time wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.04 |
Wireless sensor networks represent a new generation of real-time traffic communications and high data rate sensor applications, such as structural health monitoring and control. We study some problems related to data gathering in sensor networks when the sensors collect the sensed data about their environment and this information should be delivered to a collecting central Base Station. We prove that scheduling messages through the network to minimize the maximal delivery time with restrictions on the total idle time allowed is NP-hard. We also refer to a special case of linear network topology for which we present two polynomial time optimization algorithms: One is for minimizing the maximal lateness and maximal delay, while the other is for minimizing the number of tardy messages.