Optimal Gathering Protocols on Paths under Interference Constraints

Jean-Claude Bermond 1, * Ricardo Correa 2 Min-Li Yu 3
* Auteur correspondant
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node is able to send messages to other nodes within reception distance, but doing so it might create interference with other communications. Thus, a message can only be properly received if the receiver is reachable from the sender and there is no interference from another message being transmitted simultaneously. The network is modeled as a graph, where the vertices represent the nodes of the network and the edges, the possible communications. The interference constraint is modeled by a fixed integer d?1, which implies that nodes within distance d in the graph from one sender cannot receive messages from another node. In this paper, we suppose that each node has one unit-length message to transmit and, furthermore, we suppose that it takes one unit of time (slot) to transmit a unit-length message and during such a slot we can have only calls which do not interfere (called compatible calls). A set of compatible calls is referred to as a round. We give protocols and lower bounds on the minimum number of rounds for the gathering problem when the network is a path and the destination node is either at one end or at the center of the path. These protocols are shown to be optimal for any d in the first case, and for d=1,2,3,4, in the second case.
Type de document :
Article dans une revue
Discrete Mathematics, Elsevier, 2009, 309 (18), pp.5574-5587
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00429084
Contributeur : Jean-Claude Bermond <>
Soumis le : vendredi 30 octobre 2009 - 17:49:33
Dernière modification le : lundi 4 décembre 2017 - 15:14:09
Document(s) archivé(s) le : jeudi 17 juin 2010 - 18:50:41

Fichier

BCY08.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00429084, version 1

Collections

Citation

Jean-Claude Bermond, Ricardo Correa, Min-Li Yu. Optimal Gathering Protocols on Paths under Interference Constraints. Discrete Mathematics, Elsevier, 2009, 309 (18), pp.5574-5587. 〈inria-00429084〉

Partager

Métriques

Consultations de la notice

326

Téléchargements de fichiers

104