Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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 \emph{any} integer $m\geq 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 weakly NP-complete. On the positive side, we design a simple $(1+2/m)$ factor approximation algorithm for general networks.
Document type :
Conference papers
Domain :

https://hal.inria.fr/inria-00589687
Contributor : Jean-Claude Bermond <>
Submitted on : Saturday, April 30, 2011 - 1:32:54 PM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Sunday, July 31, 2011 - 2:27:31 AM

File

paper_26finalSIROCCO.pdf
Files produced by the author(s)

Identifiers

• HAL Id : inria-00589687, version 1

Citation

Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele Rescigno, Ugo Vaccaro. Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. SIROCCO2011, Gdansk University of technology, Jun 2011, Gdansk, Poland. pp.306-317. ⟨inria-00589687⟩

Record views