作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (05): 76-78. doi: 10.3969/j.issn.1000-3428.2007.05.026

• 网络与通信 • 上一篇    下一篇

ODMRP数据开销的概率算法

年 梅1,2,王 能1   

  1. (1. 华东师范大学计算机科学技术系,上海 200062;2. 新疆师范大学计算机系,乌鲁木齐 830054)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-03-05 发布日期:2007-03-05

Data-overhead Probabilistic Algorithm of on Demand Multicast Routing Protocol

NIAN Mei1,2, WANG Neng1   

  1. (1. Department of Computer Science and Technology, East China Normal University, Shanghai 200062; 2. Department of Computer Science and Technology, Xinjiang Normal University, Urumchi 830054)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-03-05 Published:2007-03-05

摘要: 提出了Ad Hoc网络中基于概率转发的组播协议P_ODMRP。在该协议中,转发节点根据相邻转发节点的密度确定转发概率,并按此概率转发数据报文,从而减少冗余数据报文,降低网络冲突的可能性。仿真结果表明,P_ODMRP协议在保持原ODMRP协议的高数据报文投递率的同时,降低了无效数据的传递开销和数据报文平均端到端传递时延,提高了数据传递的效率。

关键词: Ad Hoc网络, 组播, 适应性概率转发, 数据传递效率

Abstract: A probability-based ODMRP (P_ODMRP) protocol for Ad Hoc networks is proposed in this paper. The forward nodes calculate the relaying probability based on the forwarder density of the local area and retransmit data packets following it. The data packets can be relayed efficiently and the probability of collision is reduced, especially for heavy traffic load. The numerical results by NS-2 show that P_ODMRP maintains the same high data delivery ratio as ODMRP while increases the data delivery efficiency as well as reduction of average data transmission latency by reducing the invalid data overhead.

Key words: Ad Hoc networks, Multicast, Adaptive probabilistic relay, Data transmission efficiency