Minimizing Average Flow Time in Sensor Data Gathering

Authors:
Vincenzo Bonifaci;Peter Korteweg;Alberto Marchetti-Spaccamela;Leen Stougie
Affiliations:
Università degli Studi dell'Aquila, Italy and Sapienza Università di Roma, Italy;Eindhoven University of Technology, The Netherlands;Sapienza Università di Roma, Italy;Eindhoven University of Technology, The Netherlands and CWI, Amsterdam, The Netherlands
Venue:
Algorithmic Aspects of Wireless Sensor Networks
Year:
2008

Citing 16
Cited 0

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
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)
Computer-Aided complexity classification of combinational problems

Communications of the ACM
Broadcasting in radio networks

Handbook of wireless networks and mobile computing
SRPT optimally utilizes faster machines to minimize flow time

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Algorithmic models for sensor networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An approximation algorithm for the wireless gathering problem

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building on previous work [Bonifaci et al., Minimizing flow time in the wireless gathering problem , STACS 2008] we study data gathering in a wireless network through multi-hop communication with the objective to minimize the average flow time of a data packet. We show that for any the problem is NP-hard to approximate within a factor better than , where m is the number of data packets. On the other hand, we give an online polynomial time algorithm that we analyze using resource augmentation. We show that the algorithm has average flow time bounded by that of an optimal solution when the clock speed of the algorithm is increased by a factor of five. As a byproduct of the analysis we obtain a 5-approximation algorithm for the problem of minimizing the average completion time of data packets.