Journal Articles Theoretical Computer Science Year : 2013

Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas

Abstract

A Wireless Network consists of a large number of devices, deployed over a geographical area, and of a base station where data sensed by the devices are collected and accessed by the end users. In this paper 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 under the following hypotheses: the communication graph G is a tree network, the transmissions in the network can interfere with each other up to distance m, where m ≥ 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 NP-complete. On the positive side, we design a simple (1+2/m)-factor approximation algorithm for general networks.
Fichier principal
Vignette du fichier
journal-revised-II-15-1-13.pdf (306.62 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00905187 , version 1 (17-11-2013)

Identifiers

Cite

Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele Rescigno, Ugo Vaccaro. Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas. Theoretical Computer Science, 2013, 509, pp.122-139. ⟨10.1016/j.tcs.2013.03.017⟩. ⟨hal-00905187⟩
406 View
257 Download

Altmetric

Share

More