Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Improved bounds for data-gathering time in sensor networks
Computer Communications
Scheduling for information gathering on sensor network
Wireless Networks
Collision-free path coloring with application to minimum-delay 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
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Delay efficient data gathering in sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
An approximation algorithm for the wireless gathering problem
Operations Research Letters
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Optimal gathering in radio grids with interference
Theoretical Computer Science
| Hi-index | 0.00 |
We study algorithmic and complexity issues originating from the problem of data gathering in wireless networks. We give an algorithm to construct minimum makespan transmission schedules for data gathering when the communication graph G is a tree network, the interference range is any integer m ≥ 2, and no buffering is allowed at intermediate nodes. In the interesting case in which all nodes in the network have to deliver an arbitrary non-zero number of packets, we provide a closed formula for the makespan of the optimal gathering schedule. Additionally, we consider the problem of determining the computational complexity of data gathering in general graphs and show that the problem is NP-complete. On the positive side, we design a simple (1 + 2/m) factor approximation algorithm for general networks.