多跳无线网络中无需邻节点信息的空间覆盖广播算法  

Space-covered Broadcast Algorithm without Neighbor Information in Multi-hop Wireless Networks

作　　者：刘靖永[1] 李乐民[1] 景小荣[2] 

机构地区：[1]电子科技大学通信与信息工程学院,成都610054 [2]重庆邮电大学信号与信息处理重庆市重点实验室,重庆400065

出　　处：《电子与信息学报》2010年第10期2434-2439,共6页Journal of Electronics & Information Technology

基　　金：国家973计划项目(2007CB307104);国家863计划项目(2007AA01Z242)资助课题

摘　　要：针对多跳无线网络中广播的转发冗余问题,该文提出了一种无需邻节点信息的空间覆盖广播(Space-Covered Broadcast,SCB)算法。SCB算法通过优化转发节点的空间分布达到利用最少数目的转发节点实现对网络空间的覆盖,从而在保证较高送达率的同时明显降低了广播的转发次数。由于无需邻节点信息和网络拓扑信息,SCB算法降低了带宽和存储计算等开销;并且,转发节点的选择由接收节点通过延时转发机制来完成,因而SCB算法能够自动适应信道状况,避免信道变化造成的传输错误。仿真结果表明:该算法在不同的节点密度和网络负载条件下能够明显提高广播的传输效率。This paper presents a broadcast algorithm called Space-Covered Broadcast（SCB） that does not need and neighbor information to address broadcast storm problem in multi-hop wireless networks.The SCB algorithm uses the minimum number of forwarding nodes to cover the network by optimizing the spatial distribution of the forwarding nodes,thereby it reduces retransmissions considerably while providing high deliverability.The SCB algorithm reduces the communication and memory overhead for it does not need any neighbor information or network topology awareness,and the algorithm adapts itself to and gets the best out of existing channel conditions for the forwarding nodes are entirely self-selected at each receiving node using a delayed retransmitting mechanism.Simulation results show that SCB can significantly improve broadcast efficiency for different network density and network load.

关 键 词：多跳无线网络 广播算法 邻节点信息 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]