Information gathering in ad-hoc radio networks

https://doi.org/10.1016/j.ic.2021.104769Get rights and content
Under a Creative Commons license
open access

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.

Keywords

Algorithms
Radio networks
Information dissemination

Cited by (0)

1

M. Chrobak's research supported by NSF grant CCF-1536026.