Abstract

In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the underlying digraph. We study the information gathering problem, where each node has a piece of information called a rumor, and the objective is to transmit all rumors to the designated target node. For the model without any collision detection we provide an O˜(n1.5) deterministic protocol, significantly improving the trivial bound of O(n2). We also consider a model with a mild form of collision detection, where a node receives a 1-bit acknowledgment if its transmission was received by at least one out-neighbor. For this model we give an O˜(n) deterministic protocol for information gathering in acyclic graphs.

Highlights

  • We address the problem of information gathering in ad-hoc radio networks

  • In this work we assume that nodes are labelled 0, 1, ..., n − 1, where n is the network size. (All our results remain valid if the labels are selected from the range 0, 1, ..., O(n).) We focus on the ad-hoc model, where the digraph’s topology is uknown when the computation starts, and a protocol needs to complete its task within a desired time bound, no matter what the topology is

  • We provide an O(n)-time algorithm for information dissemination in acyclic radio networks

Read more

Summary

Introduction

The crucial challenge in designing protocols for information gathering is lack of feedback, namely that the nodes in the network do not receive any information about the fate of their transmissions This should be contrasted with the gossiping problem where, due to the assumption of strong connectivity, a node can eventually learn whether its earlier transmissions were successful. Some evidence that feedback might help to speed up information gathering can be found in [4], where the authors developed an O(n)-time protocol for trees if nodes receive (immediate) acknowledgements of successful transmissions, while the best known upper bound for this problem without feedback is O(n log log n). Randomization can help to overcome collisions, and lack of feedback

Preliminaries
Final Comments
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.