Time-Efficient Broadcasting in Radio Networks: A Review
Time-Efficient Broadcasting in Radio Networks: A Review
复制标题
无线电网络中的高效广播：回顾
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
D. Peleg
中科院分区：
文献类型：
--
作者：
D. Peleg
广播是一项基本的网络通信任务，其中最初由源节点持有的消息必须传播到网络中的所有其他节点。在广播网络中进行广播的快速算法已在各种不同的模型和不同的要求下进行了研究。引起问题的不同变体的一些主要参数是有关网络拓扑的知识，碰撞检测机制的可用性，唤醒模式，所考虑的拓扑类别以及随机性的使用。本文回顾了有关各种模型和假设下的无线网络广播算法的文献。
Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.