Minimum delay Data Gathering in Radio Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Minimum delay Data Gathering in Radio Networks


The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbours at most one data item. Each device is equipped with a half duplex interface; so a node cannot both receive and transmit simultaneously. During a step only non interfering transmissions can be done. In other words, the non interfering calls done during a step will form a matching. The aim is to minimize the number of steps needed to send to the base station a set of messages generated by the nodes, this completion time is also denoted makespan of the call scheduling. The best known algorithm for open-grids was a multiplicative 1.5-approximation algorithm [Revah, Segal 07]. In such topologies, we give a very simple +2 approximation algorithm and then a more involved +1 approximation algorithm. Moreover, our algorithms work when no buffering is allowed in intermediary nodes, i.e., when a node receives a message at some step, it must transmit it during the next step.
Fichier principal
Vignette du fichier
1777-BNRR09b-gatheringradioadHocNow.pdf (201.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00505522 , version 1 (03-09-2022)



Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano. Minimum delay Data Gathering in Radio Networks. ADHOC-NOW 2009 - 8th international conference on Ad Hoc Networks and Wireless, Sep 2009, Murcia, Spain. pp.69-82, ⟨10.1007/978-3-642-04383-3_6⟩. ⟨inria-00505522⟩
137 View
4 Download



Gmail Facebook Twitter LinkedIn More