Introduction to algorithms
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Hardness and approximation of Gathering in static radio networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Delay efficient data gathering in sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Minimizing Average Flow Time in Sensor Data Gathering
Algorithmic Aspects of Wireless Sensor Networks
Minimum Delay Data Gathering in Radio Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Real-time data gathering in sensor networks
Discrete Applied Mathematics
Time optimal gathering in sensor networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
Optimal gathering in radio grids with interference
Theoretical Computer Science
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Efficient data gathering in sensor network is an important challenge. In this paper we address the problem of gathering sensed data to the sink of a sensor network minimizing the time to complete the process. We present optimal time data gathering algorithms for any type of topology of a sensor network. Our results improve on existing approximation algorithms. We approach the gathering problem by obtaining optimal solutions to the collision-free paths coloring problem.