GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS

Jean-Claude Bermond 1 Luisa Gargano 2 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. 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. 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. We model the network with a graph where the vertices represent the nodes and two nodes are connected if they are in the transmission range of each other. We suppose that the interference range is the same as the transmission range; therefore 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 whenever each node has exactly.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00535816
Contributor : Jean-Claude Bermond <>
Submitted on : Saturday, November 13, 2010 - 12:30:16 AM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

Identifiers

Collections

Citation

Jean-Claude Bermond, Luisa Gargano, Adele Rescigno. GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS. Journal of Interconnection Networks, World Scientific Publishing, 2010, 11 (1-2), pp.1-33. ⟨10.1142/S0219265910002714⟩. ⟨hal-00535816⟩

Share

Metrics

Record views

245