检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 123-125.doi: 10.3969/j.issn.1000-3428.2010.06.041

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

MANET中基于动态地址的机会路由算法

王大伟，陈志刚，赵 明，李阳辉   

  1. (中南大学信息科学与工程学院，长沙 410083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Opportunistic Routing Algorithm Based on Dynamic Address in MANET

WANG Da-wei, CHEN Zhi-gang, ZHAO Ming, LI Yang-hui   

  1. (College of Information Science and Engineering, Central South University, Changsha 410083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

PDF

1017

摘要： 机会路由过程中分发矩阵的计算量太大，随着网络规模的增大，分发矩阵的计算严重影响路由性能。针对该问题，提出基于动态地址的机会路由算法。该算法将分发矩阵的计算量从整个网络降低到一跳邻居节点之间，根据反映网络节点相对物理位置的动态地址，简化分发矩阵的计算。在大规模网络中，该路由算法的平均跳数减少了5%~10%，吞吐量提高了7%~26%。

关键词: 移动自组网, 机会路由, 动态地址, 分发矩阵

Abstract: In opportunistic routing, the calculation of distribution matrix is too large, especially as the network size increases, the performance of opportunistic routing is seriously affected. This paper proposes an opportunistic routing algorithm based on the dynamic address for the problem, which makes the calculation of distribution matrix from the entire network down to one-hop neighbor nodes. Experimental results show that according to the dynamic address reflecting the relative physical location of network nodes, the calculation of distribution matrix can be greatly simplified. In the large-scale network, average-hops are decreased by 5%~10% and throughput is increased by 7%~26% by the routing algorithm.

Key words: Mobile Ad Hoc Network(MANET), opportunistic routing, dynamic address, distribution matrix

中图分类号: