Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Gathering with Minimum Delay in Sensor Networks

Jean-Claude Bermond 1 Luisa Gargano Adele Rescigno 2 
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 : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Jean-Claude Bermond Connect in order to contact the contributor
Submitted on : Monday, February 18, 2008 - 1:52:20 PM
Last modification on : Saturday, June 25, 2022 - 10:58:43 PM
Long-term archiving on: : Thursday, May 20, 2010 - 10:23:27 PM


Files produced by the author(s)


  • HAL Id : inria-00256896, version 1



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



Record views


Files downloads