2016/10/10 by Mohamad Ahmadi, Fabian Kühn, Ahmadi, Mohamad +1
Computer Science · #Cooperative Communication and Network Coding #Distributed #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Opportunistic and Delay-Tolerant Networks #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1610.02931
openalex publication_date 2016/10/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.