Multi-Message Broadcast in Dynamic Radio Networks

TL;DR

This paper develops generic algorithms for multi-message broadcast in dynamic radio networks, extending single-message algorithms and providing near-optimal solutions under certain assumptions.

Contribution

It introduces two generic algorithms that transform single-message broadcast algorithms into multi-message ones for various dynamic network models.

Findings

Algorithms achieve near-optimal broadcast times under specific assumptions.

The approach generalizes to multiple dynamic network settings.

A lower bound confirms the near-optimality of the algorithms.

Abstract

We continue the recent line of research studying information dissemination problems in adversarial dynamic radio networks. We give two generic algorithms which allow to transform generalized version of single-message broadcast algorithms into multi-message broadcast algorithms. Based on these generic algorithms, we obtain multi-message broadcast algorithms for dynamic radio networks for a number of different dynamic network settings. For one of the modeling assumptions, our algorithms are complemented by a lower bound which shows that the upper bound is close to optimal.