Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences

Authors:
Jean-Claude Bermond;Min-Li Yu
Affiliations:
MASCOTTE, joint project CNRS-INRIA-UNSA, Sophia-Antipolis, France F-06902;Department of Mathematics and Statistics, University College of the Fraser Valley, Abbotsford, Canada V2S 4N2
Venue:
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Year:
2008

Citing 12
Cited 1

Fast Gossiping by Short Messages

SIAM Journal on Computing
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
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)

Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
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
An approximation algorithm for the wireless gathering problem

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Gathering algorithms on paths under interference constraints

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Optimally fast data gathering in sensor networks

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Optimal data gathering paths and energy-balance mechanisms in wireless networks

Ad Hoc Networks

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-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible communications. The interference constraint is modeled by a fixed integer dI驴 1, which implies that nodes within distance dIin the graph from one sender cannot receive messages from another node. In this paper, we suppose that it takes one unit of time (slot) to transmit a unit-length message. A step (or round) consists of a set of non interfering (compatible) calls and uses one slot. We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffering possibility, when the network is a tree, the root is the destination and dI= 1. In fact we study the equivalent personalized broadcasting problem instead.