An approximation algorithm for the wireless gathering problem

Authors:
Vincenzo Bonifaci;Peter Korteweg;Alberto Marchetti-Spaccamela;Leen Stougie
Affiliations:
Department of Electrical and Information Engineering, University of L'Aquila, Italy and Department of Computer and Systems Science, University of Rome "La Sapienza", Italy;Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands;Department of Computer and Systems Science, University of Rome "La Sapienza", Italy;Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands and CWI Amsterdam, The Netherlands
Venue:
Operations Research Letters
Year:
2008

Citing 6
Cited 6

Multiple communication im multihop radio networks

SIAM Journal on Computing
Wireless information networks

Wireless information networks
Computer Networks

Computer Networks
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering algorithms on paths under interference constraints

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Minimum Delay Data Gathering in Radio Networks

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
The distributed wireless gathering problem

Theoretical Computer Science
Minimizing flow time in the wireless gathering problem

ACM Transactions on Algorithms (TALG)
Optimal time data gathering in wireless networks with omni-directional antennas

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Scheduling of vehicles in transportation networks

Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles
Optimal gathering in radio grids with interference

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an approximation ratio better than 4.