Labeling Schemes for Deterministic Radio Multi-Broadcast
Abstract
We consider the multi-broadcast problem in arbitrary connected radio networks consisting of n nodes. There are k designated source nodes for some fixed k ∈ \1,…,n\, and each source node has a distinct piece of information that it wants to share with all nodes in the network. We set out to determine the shortest possible labels so that multi-broadcast can be solved deterministically in the labeled radio network by some universal deterministic distributed algorithm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.