We study the time complexity of single and multi token broadcast in adversarial dynamic radio networks. Initially, k tokens (which are k pieces of information) are distributed among the n nodes of a network and all the tokens need to be disseminated to all the nodes in the network. We first consider the single-token broadcast problem (i.e., the case $k=1$). By presenting upper and lower bounds, we show that the time complexity of single-token broadcast depends on the amount of stability and connectivity of the dynamic network topology and on the adaptiveness of the adversary providing the dynamic topology. Then, we give two generic algorithms which allow to transform generalized forms of single-token broadcast algorithms into multi-token broadcast (k-token broadcast) algorithms. Based on these generic algorithms, we obtain k-token broadcast algorithms for a number of different dynamic network settings. For one of the modeling assumptions, our algorithm is complemented by a lower bound which shows that the upper bound is close to optimal.

我们研究了对抗动态无线电网络中单令牌和多令牌广播的时间复杂性。最初，k个令牌（即k条信息）分布在网络的n个节点之间，并且所有令牌都需要分发到网络中的所有节点。我们首先考虑单令牌广播问题（即$ķ=\mathrm{1个}$）。通过给出上限和下限，我们表明单令牌广播的时间复杂度取决于动态网络拓扑的稳定性和连通性的数量以及提供动态拓扑的对手的适应性。然后，我们给出了两种通用算法，它们可以将单令牌广播算法的广义形式转换为多令牌广播（k令牌广播）算法。基于这些通用算法，我们获得了针对许多不同动态网络设置的k令牌广播算法。对于一种建模假设，我们的算法由一个下限补充，该下限表明上限接近最佳值。