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

doi:10.3969/j.issn.1000-3428.2012.23.019

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

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

王银涛，高媛

(中北大学电子与计算机科学技术学院，太原 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

(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

摘要/Abstract

摘要： 为高效地在机会网络中进行文件(音、视频)传输，提出一种基于节点性质特征的编码与效用值混合的路由算法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

中图分类号:

TP393

王银涛, 高媛. 机会网络中高效的文件传输机制UH-EC[J]. 计算机工程, 2012, 38(23): 79-83,87.

WANG Yin-Chao, GAO Yuan. Efficient File Transferring Mechanism UH-EC in Opportunistic Networks[J]. Computer Engineering, 2012, 38(23): 79-83,87.

参考文献

[1] 熊永平, 孙利民, 牛建伟, 等. 机会网络[J]. 软件学报, 2009, 20(1): 124-137.
[2] Pelusi L, Passarella A, Conti M. Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks[J]. Communications Magazine, 2006, 44(11): 134-141.
[3] Becker V D. Epidemic Routing for Partially Connected Ad Hoc Networks[R]. Durham, USA: Department of Computer Science, Duke University, Technique Report: CS-2000-06, 2000.
[4] Wang Y, Jain S, Martonosi M, et al. Erasure-coding Based Routing for Opportunistic Networks[C]//Proc. of ACM SIGCOMM Workshop on Delay-tolerant Networking. Philadelphia, USA: ACM Press, 2005: 229-236.
[5] Widmer J, Boudec J L. Network Coding for Efficient Communi- cation in Extreme Networks[C]//Proc. of 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking. Philadelphia, USA: ACM Press, 2005: 284-291.
[6] Chen Ling-Jyh, Yu Chen-Hung, Tseng Cheng-Long, et al. A Hybrid Routing Approach for Opportunistic Networks[C]//Proc. of 2006 SIGCOMM Workshop on Challenged Networks. Pisa, Italy: ACM Press, 2006: 213-220.
[7] LeBrun J, Chuah C N, Ghosal D, et al. Knowledge-based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks[C]//Proc. of VTC’05. [S. 1]: Spring, 2005: 2289-2293.
[8] Burgess J, Gallagher B, Jensen D, et al. Maxprop: Routing for Vehicle-based Disruption-tolerant Networking[C]//Proc. of IEEE InfoCom’06. [S. 1.]: IEEE Press, 2006.
[9] Harras K A, Almeroth K C, Belding-Royer E M. Delay Tolerant Mobile Networks: Controlled Flooding in Sparse Mobile Networks[C]//Proc. of IFIP’05. [S. 1.]: IEEE Press, 2005.
[10] Chen Ling-Jyh, Yu Chen-Hung, Tseng Cheng-Long, et al. Effective File Transfer for Opportunistic Networks[C]//Proc. of IEEE Infocom’08. [S. 1.]: IEEE Press, 2008: 761-772.
[11] 周强, 应晶, 吴明晖. 基于特征分类的机会网络多因素预测路由[J]. 浙江大学学报: 工学版, 2010, 44(3): 413-419.

[1]	张英杰,李建波,李英. 基于自私性与中心性的机会网络数据分流算法[J]. 计算机工程, 2019, 45(6): 152-159.
[2]	赵林柳,吕鑫,陶飞飞. 基于Top-k的高效用模式挖掘算法[J]. 计算机工程, 2019, 45(5): 169-174,181.
[3]	杨鹏,汪雄,闫俊杰. 社会特征相似度感知的D2D数据转发算法[J]. 计算机工程, 2018, 44(9): 70-77.
[4]	宋高俊,胡成,周芳. 基于分层PE技术的MPLS-VPN架构优化[J]. 计算机工程, 2017, 43(6): 66-72.
[5]	胡游,李仁发,吴武飞. 车载异构网络网关数据封装方法[J]. 计算机工程, 2017, 43(2): 1-5.
[6]	余翔,刘志红,闫冰冰. 基于社交关系的移动机会网络路由算法[J]. 计算机工程, 2017, 43(12): 98-102.
[7]	常有宝,葛文萍,韩前方. CoMP系统中的天线选择与预编码联合算法[J]. 计算机工程, 2017, 43(11): 45-49.
[8]	周继华,彭湖,吴坚,段荣昌,张瀚文. 一种基于发送队列长度的自适应功率控制机制[J]. 计算机工程, 2016, 42(12): 112-117,123.
[9]	李豪,陈志刚,吴嘉. 基于社区与社会性的机会网络路由算法[J]. 计算机工程, 2015, 41(12): 64-68,74.
[10]	王群,赵广松,许博. 基于攻击特征的DTN 黑洞节点检测机制[J]. 计算机工程, 2014, 40(9): 159-166.
[11]	孙宝印,周强,朱俊杰,倪赛华,陶智,顾济华. 基于改进增益函数的电子耳蜗语音增强[J]. 计算机工程, 2014, 40(8): 237-241.
[12]	卓碧华, 郭振乾, 徐正坤, 张靖宇, 陈良银. 基于低占空比技术的机会网络性能研究[J]. 计算机工程, 2013, 39(3): 123-127.
[13]	龚闻天, 樊镭, 施晓秋. 基于能量最小路径的WSN分簇算法[J]. 计算机工程, 2012, 38(3): 74-76,79.
[14]	吕翊, 樊思龙, 吴大鹏, 孔晓龙. 带有扩散程度估计的机会网络分组调度机制[J]. 计算机工程, 2012, 38(06): 104-106.
[15]	刘期烈, 祝孟伟, 黄巍, 唐丽均, 李云, 潘英俊. 机会网络中无线链路统计特性的研究[J]. 计算机工程, 2011, 37(7): 1-3.

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

Efficient File Transferring Mechanism UH-EC in Opportunistic Networks

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10