License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1338
URN: urn:nbn:de:0030-drops-13381
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1338/
Go to the corresponding LIPIcs Volume Portal

Bonifaci, Vincenzo ; Korteweg, Peter ; Marchetti-Spaccamela, Alberto ; Stougie, Leen

Minimizing Flow Time in the Wireless Gathering Problem

pdf-format:
22011.BonifaciVincenzo.Paper.1338.pdf (0.2 MB)

Abstract

We address the problem of efficient data gathering in a wireless
network through multi-hop communication. We focus on the objective
of minimizing the maximum flow time of a data packet. We prove
that no polynomial time algorithm for this problem can have
approximation ratio less than $Omega(m^{1/3)$ when $m$ packets
have to be transmitted, unless $P = NP$. We then use resource
augmentation to assess the performance of a FIFO-like strategy. We
prove that this strategy is 5-speed optimal, i.e., its cost remains
within the optimal cost if we allow the algorithm to transmit data
at a speed 5 times higher than that of the optimal solution we
compare to.

BibTeX - Entry

@InProceedings{bonifaci_et_al:LIPIcs:2008:1338,
  author =	{Vincenzo Bonifaci and Peter Korteweg and Alberto Marchetti-Spaccamela and Leen Stougie},
  title =	{{Minimizing Flow Time in the Wireless Gathering Problem}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{109--120},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Susanne Albers and Pascal Weil},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1338},
  URN =		{urn:nbn:de:0030-drops-13381},
  doi =		{10.4230/LIPIcs.STACS.2008.1338},
  annote =	{Keywords: Wireless networks, data gathering, approximation algorithms, distributed algorithms}
}

Keywords: Wireless networks, data gathering, approximation algorithms, distributed algorithms
Collection: 25th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2008
Date of publication: 06.02.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI