Space-covered Broadcast Algorithm without Neighbor Information in Multi-hop Wireless Networks
多跳无线网络中无需邻节点信息的空间覆盖广播算法

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.