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

刘靖永; 李乐民; 景小荣

doi:10.3724/SP.J.1146.2009.00920

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

doi: 10.3724/SP.J.1146.2009.00920

刘靖永^{① 李乐民,},
李乐民,
景小荣

基金项目:

国家973计划项目(2007CB307104)和国家863计划项目(2007AA01Z242)资助课题

计量
- 文章访问数: 3097
- HTML全文浏览量: 85
- PDF下载量: 794
- 被引次数: 0
出版历程
- 收稿日期: 2009-06-23
- 修回日期: 2010-01-18
- 刊出日期: 2010-10-19

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

Liu Jing-Yong^{① 李乐民
,},
Li Le-Min,
Jing Xiao-Rong

摘要

摘要: 针对多跳无线网络中广播的转发冗余问题，该文提出了一种无需邻节点信息的空间覆盖广播(Space-Covered Broadcast，SCB)算法。SCB算法通过优化转发节点的空间分布达到利用最少数目的转发节点实现对网络空间的覆盖，从而在保证较高送达率的同时明显降低了广播的转发次数。由于无需邻节点信息和网络拓扑信息，SCB算法降低了带宽和存储计算等开销；并且，转发节点的选择由接收节点通过延时转发机制来完成，因而SCB算法能够自动适应信道状况，避免信道变化造成的传输错误。仿真结果表明：该算法在不同的节点密度和网络负载条件下能够明显提高广播的传输效率。
- 多跳无线网络 /
- 广播算法 /
- 邻节点信息
Abstract: 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.
- Multi-hop wireless networks /
- Broadcasting algorithm /
- Neighbor information

HTML全文

参考文献(1)

[1] Heissenbel M, Braun T, Wlchli M, and Bernoulli T. Optimized stateless broadcasting in wireless multi-hop networks [C]. Proc. IEEE INFOCOM2006, Barcelona, Spanish, April 23-29 2006: 1-12. [2] Khan I A.[J].Javaid A, and Qian H L. Distance-based dynamically adjusted probabilistic forwarding for wireless mobile Ad Hoc networks [C]. IEEE and IFIP WOCN08, Surabaya, Indonesia, May 5-.2008,:- [3] Liarokapis D, Shahrabi A, and Komninos A. DibA: An adaptive broadcasting scheme in mobile Ad hoc networks [C]. Communication Networks and Services Research Conference 2009, Moncton, Canada, May 11-13, 2009: 224-231. [4] Durresi A, Paruchuri V K, Iyengar S S, and Kannan R. Optimized broadcast protocol for sensor networks [J].IEEE Transactions on Computers.2005, 54(8):1013-1024 [5] Liu H, Jia X H, Wan P J, Liu X X, and Yao F. A distributed and efficient flooding scheme using 1-hop information in mobile Ad Hoc networks [J].IEEE Transactions on Parallel and Distributed Systems.2007, 18(5):658-671 [6] Khabbazian M and Bhargava V K. Efficient broadcasting in mobile Ad hoc networks [J].IEEE Transactions on Mobile Computing.2009, 8(2):231-245 [7] al-Humoud S O, Mackenzie L M, and Abdulai J. Neighbourhood-aware counter-based broadcast scheme for wireless Ad hoc networks [C]. IEEE GLOBECOM 2008 Workshops, New Orleans, USA, Nov. 30-Dec. 4 2008: 1-6. [8] Lee Y, Shim Y, Choi Y, and Kwon T. A reliability aware flooding algorithm (RAFA) in wireless multi-hop networks [C]. IEEE Symposium on Computers and Communications 2008, Marrakech, Morocco, July 6-9, 2008: 1070-1075. [9] Stojmenovic I, Seddigh M, and Zunic J. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks [J].IEEE Transactions on Parallel and Distributed Systems.2002, 13(1):14-25 [10] Thai M T, Wang F, Liu D, Zhu S, and Du D Z. Connected dominating sets in wireless networks with different transmission ranges [J].IEEE Transactions on Mobile Computing.2007, 6(7):721-730 [11] Yang H Y, Lin C H, and Tsai M J. Distributed algorithm for efficient construction and maintenance of connected k-hop dominating sets in mobile Ad hoc networks [J].IEEE Transactions on Mobile Computing.2008, 7(4):444-457 [12] Dai F and Wu J. Performance analysis of broadcast protocols in Ad hoc networks based on self-pruning [J].IEEE Transactions on Parallel and Distributed Systems.2004, 15(11):1-14 [13] Kadi N and Al agha K. Optimized MPR-based flooding in wireless ad hoc network using network coding [C]. Wireless Days 2008 1st IFIP, Dubai, UAE, Nov 24-27, 2008: 1-5. [14] Cai Y, Hua K A, and Phillips A. Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless Ad hoc networks [C]. Proc. IPCCC 2005, Phoenix, Arizona, April 7-9, 2005: 347-354. [15] Kershner R. The number of circles covering a set [J].American Journal of Mathematics.1939, 61(1):665-671 [16] Ho C, Obraczka K, Tsudik G, and Viswanath K. Flooding for reliable multicast in multi-hop Ad hoc networks [C]. Proc. DiaLM99, Seattle, USA, 1999: 64-71.

施引文献

资源附件(0)

访问统计