Abstract: Aiming at the problem of the contradictions between coding opportunity and the number of forwarding nodes, this paper proposes a forwarding node set selection algorithm of opportunistic routing based on inter-flow network coding called FNSA. The algorithm gets more accurate successful transmission probability of data packets through sending the variable-length probe packets, and determines the optimal number of forwarding nodes through quantitative analyzing the relation among link delivery probability, transmission times and the number of forwarding nodes, and then determines the best forwarding node set. It applies FNSA to coding-aware opportunistic routing mechanism for wireless mesh networks CAOR. Simulation results show that by using fixed-length probe packets(α=0), network throughput performance increases about by 5%, and by using variable-length probe packets(α=0.1), network throughput performance increases about by 9%.

Key words: wireless network, inter-flow network coding, opportunistic routing, variable-length probe packet, successful transmission probability of data packets, node selection

摘要： 针对流间网络编码与机会路由结合时编码机会与转发节点数目之间的矛盾，提出一种基于流间网络编码的机会路由转发节点集选择算法FNSA。采用发送可变长报文探测包的方法获取更加准确的数据包成功发送概率，定量分析链路数据成功传输概率、传输次数和转发节点的个数之间的关系，确立最佳转发节点数目，选取最佳转发节点集。将该算法应用于编码感知机会路由协议CAOR，仿真实验结果表明，采用定长探测包时(α=0)，网络吞吐量性能有约5%的提升；采用可变长报文探测包时(α=0.1)，网络吞吐量性能有约9%的提升。

关键词: 无线网络, 流间网络编码, 机会路由, 可变长探测包, 数据包成功传输概率, 节点选择

CLC Number: 

• TN919.81