Constant-Length Labeling Schemes for Deterministic Radio Broadcast
Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc

TL;DR
This paper demonstrates that extremely short, constant-length labels (2-3 bits) are sufficient for deterministic broadcast in radio networks, enabling efficient communication without prior knowledge of network topology or size.
Contribution
The authors introduce a universal labeling scheme with 2-3 bits that guarantees deterministic broadcast in radio networks, regardless of topology or source node.
Findings
2-bit labels enable broadcast without topology knowledge
3-bit labels support broadcast from any source node
A common round can be identified for broadcast completion
Abstract
Broadcast is one of the fundamental network communication primitives. One node of a network, called the , has a message that has to be learned by all other nodes. We consider the feasibility of deterministic broadcast in radio networks. If nodes of the network do not have any labels, deterministic broadcast is impossible even in the four-cycle. On the other hand, if all nodes have distinct labels, then broadcast can be carried out, e.g., in a round-robin fashion, and hence -bit labels are sufficient for this task in -node networks. In fact, -bit labels, where is the maximum degree, are enough to broadcast successfully. Hence, it is natural to ask if very short labels are sufficient for broadcast. Our main result is a positive answer to this question. We show that every radio network can be labeled using 2 bits in such a way that…
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.
