Information Gathering in Ad-Hoc Radio Networks

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).