Gathering algorithms on paths under interference constraints

Authors:
Jean-Claude Bermond;Ricardo Corrêa;Minli Yu
Affiliations:
joint project CNRS-INRIA-UNSA, MASCOTTE, Sophia-Antipolis, France;Departamento de Computação, Universidade Federal do Ceará, Fortaleza, CE, Brazil;Department of Mathematics and Statistics, University College of the Fraser Valley, Abbotsford, BC, Canada
Venue:
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Year:
2006

Citing 6
Cited 5

Fast broadcasting and gossiping in radio networks

Journal of Algorithms
Gossiping with Bounded Size Messages in ad hoc Radio Networks

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Gossiping with Unit Messages in Known Radio Networks

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Centralized broadcast in multihop radio networks

Journal of Algorithms
Logarithmic inapproximability of the radio broadcast problem

Journal of Algorithms
Hardness and approximation of Gathering in static radio networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops

On the complexity of bandwidth allocation in radio networks

Theoretical Computer Science
Gathering with Minimum Delay in Tree Sensor Networks

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Collision-free path coloring with application to minimum-delay gathering in sensor networks

Discrete Applied Mathematics
An approximation algorithm for the wireless gathering problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 first case, and for 1 ≤ d ≤ 4, in the second case.