Deterministic Blind Radio Networks
Artur Czumaj, Peter Davies

TL;DR
This paper introduces deterministic algorithms for blind radio networks where nodes only know their own IDs, achieving efficiency comparable to algorithms with full network knowledge, thus challenging previous assumptions about the limitations of such networks.
Contribution
The authors develop the first deterministic algorithms for blind radio networks that match or nearly match the efficiency of algorithms assuming network knowledge.
Findings
Wake-up algorithm with $O(\frac{k\log L \log k }{\log\log k})$ time
Broadcasting algorithm with $O(k\log L \log\log k)$ time
Algorithms applicable to multi-hop networks with significant improvements
Abstract
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 \emph{deterministic} algorithms for \emph{blind} networks (in which nodes know only their own IDs),…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Energy Harvesting in Wireless Networks · Mobile Ad Hoc Networks
