Minimizing flow time in the wireless gathering problem

Authors:
Vincenzo Bonifaci;Peter Korteweg;Alberto Marchetti-Spaccamela;Leen Stougie
Affiliations:
Max Planck Institute for Informatics, Saarbrücken, Germany;TU Eindhoven, the Netherlands;Sapienza University of Rome, Italy;VU University and CWI Amsterdam, the Netherlands
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2011

Citing 22
Cited 2

Unit disk graphs

Discrete Mathematics - Topics on domination
Locality in distributed graph algorithms

SIAM Journal on Computing
Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Multiple communication im multihop radio networks

SIAM Journal on Computing
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Wireless information networks

Wireless information networks
Online computation and competitive analysis

Online computation and competitive analysis
Flow and stretch metrics for scheduling continuous job streams

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
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
Bipartite Domination and Simultaneous Matroid Covers

SIAM Journal on Discrete Mathematics
End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-processor scheduling to minimize flow time with ε resource augmentation

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithmic aspects of capacity in wireless networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating total flow time on parallel machines

Journal of Computer and System Sciences
SRPT optimally utilizes faster machines to minimize flow time

ACM Transactions on Algorithms (TALG)
Algorithmic models for sensor networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Optimally fast data gathering in sensor networks

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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

The distributed wireless gathering problem

Theoretical Computer Science
On complexity of wireless gathering problems on unit-disk graphs

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of efficient data gathering in a wireless network through multihop communication. We focus on two objectives related to flow times, that is, the times spent by data packets in the system: minimization of the maximum flow time and minimization of the average flow time of the packets. For both problems we prove that, unless P=NP, no polynomial-time algorithm can approximate the optimal solution within a factor less than Ω(m1−&epsis;) for any 0m is the number of packets. We then assess the performance of two natural algorithms by proving that their cost remains within the optimal cost of the respective problem if we allow the algorithms to transmit data at a speed 5 times higher than that of the optimal solutions to which we compare them.