Information gathering in ad-hoc radio networks

Chrobak, Marek, Costello, Kevin P and Gasieniec, Leszek ORCID: 0000-0003-1809-9814 (2021) Information gathering in ad-hoc radio networks. INFORMATION AND COMPUTATION, 281. p. 104769.

Access the full-text of this item by clicking on the Open Access link.

Text
1909.03636v1.pdf - Submitted version
Download (658kB) | Preview

Official URL: http://dx.doi.org/10.1016/j.ic.2021.104769

Abstract

In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the graph. 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 a designated target node. We provide an O(n^1.5*polylog(n)) deteministic protocol for information gathering in ad-hoc radio networks, significantly improving the trivial bound of O(n^2).

Item Type:	Article
Uncontrolled Keywords:	Algorithms, Radio networks, Information dissemination
Depositing User:	Symplectic Admin
Date Deposited:	23 Sep 2019 12:18
Last Modified:	19 Jan 2023 00:25
DOI:	10.1016/j.ic.2021.104769
Open Access URL:	https://www.sciencedirect.com/science/article/pii/...
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3055619