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

计算机工程 ›› 2012, Vol. 38 ›› Issue (23): 79-83,87. doi: 10.3969/j.issn.1000-3428.2012.23.019

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

机会网络中高效的文件传输机制UH-EC

王银涛,高 媛   

  1. (中北大学电子与计算机科学技术学院,太原 030051)
  • 收稿日期:2012-02-14 出版日期:2012-12-05 发布日期:2012-12-03
  • 作者简介:王银涛(1986-),男,硕士研究生,主研方向:无线传感器网络,机会网络;高 媛,副教授、硕士

Efficient File Transferring Mechanism UH-EC in Opportunistic Networks

WANG Yin-tao, GAO Yuan   

  1. (College of Electronics and Computer Science and Technology, North University of China, Taiyuan 030051, China)
  • Received:2012-02-14 Online:2012-12-05 Published:2012-12-03

摘要: 为高效地在机会网络中进行文件(音、视频)传输,提出一种基于节点性质特征的编码与效用值混合的路由算法UH-EC。将源文件编码成较小数据块,在节点的下一跳转发选取上采取基于节点特征的效用值,不断寻求转发能力强的节点承担转发任务,直到数据转发到目的节点。理论分析与仿真结果证明,与经典的H-EC路由算法相比,该算法能有效降低网络开销、分组端到端时延与黑洞节点对文件传输成功率的影响。

关键词: 机会网络, 文件传输, 效用值, 数据转发, 黑洞节点, 编码算法

Abstract: An efficient routing algorithm based on utility and erasure coding is proposed to solve how to efficiently transfer large files(such as audio, video files) in opportunistic networks. The algorithm encodes the source file by encoding algorithms into small chunks, and on the select of the next hop node, taking forwarding mechanism based on utility value, constantly looking forward a strong node to take the forwarding task until the data is routed to the destination node. Theoretical analysis and simulation results show that UH-EC(utility-encoding hybird scheme) outperforms the classic H-EC routing algorithm, effectively reduces network overhead, group of end-to-end delay, and the effects of black hole nodes for file transferring rate.

Key words: opportunistic networks, file transferring, utility value, data forwarding, black-hole node, encoding algorithm

中图分类号: