Labeling Schemes for Deterministic Radio Multi-Broadcast

TL;DR

This paper investigates the minimal label sizes needed for deterministic algorithms to efficiently solve multi-broadcast in arbitrary radio networks with multiple sources, aiming for optimal communication protocols.

Contribution

It introduces methods to determine the shortest labels that enable deterministic multi-broadcast in labeled radio networks, optimizing communication efficiency.

Findings

Shortest label sizes for deterministic multi-broadcast are characterized.

Universal algorithms are designed to operate with minimal labeling.

Results improve understanding of deterministic communication in radio networks.

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 \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.