English

Labeling Schemes for Deterministic Radio Multi-Broadcast

Distributed, Parallel, and Cluster Computing 2021-04-20 v1

Abstract

We consider the multi-broadcast problem in arbitrary connected radio networks consisting of nn nodes. There are kk designated source nodes for some fixed k{1,,n}k \in \{1,\ldots,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.

Keywords

Cite

@article{arxiv.2104.08644,
  title  = {Labeling Schemes for Deterministic Radio Multi-Broadcast},
  author = {Colin Krisko and Avery Miller},
  journal= {arXiv preprint arXiv:2104.08644},
  year   = {2021}
}
R2 v1 2026-06-24T01:16:58.062Z