Ad hoc网络基于协同的可靠组播丢失恢复算法设计

黄梦洁; 冯钢; 张翼德

doi:10.3724/SP.J.1146.2009.01054

Ad hoc网络基于协同的可靠组播丢失恢复算法设计

doi: 10.3724/SP.J.1146.2009.01054

基金项目:

国家自然科学基金(60772142)，国家973计划项目(2007CB310604)资助课题

计量
- 文章访问数: 3928
- HTML全文浏览量: 114
- PDF下载量: 923
- 被引次数: 0
出版历程
- 收稿日期: 2009-07-29
- 修回日期: 2009-11-24
- 刊出日期: 2010-09-19

CoreRM: Cooperative Loss Recovery for Reliable Multicast in Ad hoc Networks

摘要

摘要: 在Ad hoc网络中保证组播通信的可靠性要面对Ad hoc网络高误码率、带宽受限、节点能量有限和拓扑结构频繁变化等技术挑战。该文将协同的思想引入到组播丢失恢复设计中，设计了新的基于协同的可靠组播丢失恢复算法(CoreRM)。根据各个节点经历的不同丢失情况，通过自适应选择本地恢复、全局恢复或发送端恢复，分布式地处理整个网络的丢失恢复。CoreRM还设计了恢复路径缓存、NAK抑制机制，以及源路由数据包(SPM)发送机制来应对Ad hoc网络中的拓扑变化。性能分析和NS2的仿真实验表明相对于UDP和PGM可靠组播通信，CoreRM算法可以在网络吞吐量和丢失恢复延时方面有显著性能改善。
- Ad hoc网络 /
- 可靠组播 /
- 协同通信 /
- 丢失恢复
Abstract: Reliable multicast in Ad hoc networks is challenging due to high error rate, low bandwidth, limited node power, and highly dynamic topology changes. In this paper, an efficient loss recovery scheme is proposed for reliable multicast (CoreRM). The basic idea is to apply the notion of cooperative communication to support local loss recovery. According different packet loss cases, CoreRM tries to retrieve the lost packet through progressively cooperating with neighboring nodes, upstream nodes or source node. In order to minimize recovery latency and retransmission overhead, CoreRM caches not only data packets but also the path which could be used for future possible packet recovery. In CoreRM, upstream nodes suppress duplicate NAKs to tackle feedback implosion. Both analytical and simulation results reveal that CoreRM significantly improves the multicast performance in terms of throughput and recovery latency compared with UDP and PGM.
- Ad hoc networks /
- Reliable multicast /
- Cooperative communication /
- Loss recovery

HTML全文

参考文献(1)

Gemmell J, Montgomery T, Speakman T, Bhaskar N, and Crowcroft J. The PGM Reliable Multicast Protocol. IEEE Digital Object Identifier 10.1109/MNET.2003.Volume 17, Issue1, Jan-Feb. 2003: 16-22.[2]Gopalsamy T, Singhal M, Panda D, and Sadayappan P. A reliable multicast algorithm for mobile ad hoc networks. 22nd International Conference on Distributed Computing Systems, Vienna, Austria, July 2-5, 2002: 563-570.[3]Ouyang.B and Hong Xiao-yan, and Yi Yun-jung. A comparison of reliable multicast protocols for mobile ad hoc networks. Proceeding IEEE, SoutheastCon, 2005, April 8-10, 2005: 339-344.[4]Chandra R, Ramasubramanian V, and Birman K P. Anonymous gossip: improving multicast reliability in mobile ad-hoc networks. Distributed Computing Systems, Arizona, USA, 2001, April 16-19, 2001: 275-283.[5]Fung Alex and Sasase Iwao. Hybrid local recovery scheme for reliable multicast using group-aided multicast scheme. WCNC2007, Hong Kong China, March 11-15, 2007: 3478-3482.[6]Koutsonikolas D.[J].Hu Y C, and Wang Chih-Chun. Pacifier: high-throughput, reliable multicast withoutcrying babies in wireless mesh networks. IFOCOM 2009. The 28th Conference on Computer Communications. Rio de Janeiro, Brazil. April 19-2.2009,:-Fen Hou, Cai L X, Ho Pin-han, Shen Xuemin, and Zhang Junshan. A cooperative multicast scheduling scheme for multimedia services in IEEE 802.16 networks. Wireless Communications, ISSN: 1536-1284, March 2009: 1508-1519.Alay O, Pan Xin, Erkip E, and Wang Yao. Layered randomized cooperative multicast for lossy data: a superposition approach.. CISS 2009.43rd Annual Conference, Baltimore, MD, March 18-20, 2009: 330-335.[7]Zhu Yufang and Kunz T. MAODV implementation for NS-2.26. systems and computing engineering, Carleton University, Technical Report SCE-04-01, January 2004.[8]Saikia L P and Hemachandran K. Reliable multicast protocol adopting hierarchical tree-based repair mechanism. ICACT 2009.11th International Conference, Gangwon-Do, South Korea, Feb. 15-18, 2009: 1969-1973.[9]Feng Gang, Zhang Jing-yu, and Xie Feng. Efficient buffer management scheme for loss recovery for reliable multicast[C]. Proceedings of IEEE Globecom 2004, Dallas, USA, 2004: 1152-1156.

施引文献

资源附件(0)

访问统计