Gathering with Minimum Delay in Sensor Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2008

Gathering with Minimum Delay in Sensor Networks


Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. The network is a multi-hop wireless network and the time is slotted so that one--hop transmission of one data item consumes one time slot. In this paper we suppose that each sensor is equipped with an half--duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with omnidirectional antennas allowing the transmission over distance R. We model the network with a graph where the vertices represent the nodes and two nodes are connected if they are in the transmission/interference range of each other. Due to interferences a collision happens at a node if two or more of its neighbors try to transmit at the same time. Furthermore we suppose that an intermediate node should forward a message as soon as it receives it. We give an optimal collision free gathering schedule for tree networks.
Fichier principal
Vignette du fichier
sensor-feb08.pdf (214.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00256896 , version 1 (18-02-2008)


  • HAL Id : inria-00256896 , version 1


Jean-Claude Bermond, Luisa Gargano Adele Rescigno. Gathering with Minimum Delay in Sensor Networks. 2008. ⟨inria-00256896⟩
184 View
72 Download


Gmail Facebook X LinkedIn More