Gathering algorithms on paths under interference constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Gathering algorithms on paths under interference constraints


We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-determined destination node under interference constraints which are modeled by an integer d 1, so that any node within distance d of a sender cannot receive calls from any other sender. A set of calls which do not interfere with each other is referred to as a round. We give algorithms and lower bounds on the minimum number of rounds for this problem, when the network is a path and the destination node is either at one end or at the center of the path. The algorithms are shown to be optimal for any d in the rst case, and for 1 d 4, in the second case.
Fichier principal
Vignette du fichier
BCY06.pdf (160.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00512286 , version 1 (29-08-2010)


  • HAL Id : hal-00512286 , version 1


Jean-Claude Bermond, Ricardo Correa, Min-Li Yu. Gathering algorithms on paths under interference constraints. CTAC06, May 2006, Roma, Italy. pp.115-126. ⟨hal-00512286⟩
170 View
118 Download


Gmail Facebook Twitter LinkedIn More