Deterministic Blind Radio Networks

05/13/2018
by   Artur Czumaj, et al.
0

Ad-hoc radio networks and multiple access channels are classical and well-studied models of distributed systems, with a large body of literature on deterministic algorithms for fundamental communications primitives such as broadcasting and wake-up. However, almost all of these algorithms assume knowledge of the number of participating nodes and the range of possible IDs, and often make the further assumption that the latter is linear in the former. These are very strong assumptions for models which were designed to capture networks of weak devices organized in an ad-hoc manner. It was believed that without this knowledge, deterministic algorithms must necessarily be much less efficient. In this paper we address this fundamental question and show that this is not the case. We present deterministic algorithms for blind networks (in which nodes know only their own IDs), which match or nearly match the running times of the fastest algorithms which assume network knowledge (and even surpass the previous fastest algorithms which assume parameter knowledge but not small labels). Specifically, in multiple access channels with k participating nodes and IDs up to L, we give a wake-up algorithm requiring O(k L k / k) time, improving dramatically over the O(L^3 ^3 L) time algorithm of De Marco et al. (2007), and a broadcasting algorithm requiring O(k L k) time, improving over the O(L) time algorithm of Gasieniec et al. (2001) in most circumstances. Furthermore, we show how these same algorithms apply directly to multi-hop radio networks, achieving even larger running time improvements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2018

Randomized Communication Without Network Knowledge

Radio networks are a long-studied model for distributed system of device...
research
12/30/2017

Randomized Communication in Radio Networks

A communication network is called a radio network if its nodes exchange ...
research
08/20/2023

Improved Algorithms for Integer Complexity

The integer complexity f(n) of a positive integer n is defined as the mi...
research
04/17/2021

Labeling Schemes for Deterministic Radio Multi-Broadcast

We consider the multi-broadcast problem in arbitrary connected radio net...
research
10/28/2021

Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths

We revisit the problem of finding optimal strategies for deterministic M...
research
05/16/2021

Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election

We consider the energy complexity of the leader election problem in the ...
research
12/29/2021

Broadcasting on Adversarial Multiple Access Channels

We study broadcasting on multiple-access channels under adversarial pack...

Please sign up or login with your details

Forgot password? Click here to reset