计算机科学 ›› 2016, Vol. 43 ›› Issue (4): 37-40.doi: 10.11896/j.issn.1002-137X.2016.04.007
• 2015年全国理论计算机科学学术年会 • 上一篇 下一篇
关培源,陈志刚,吴嘉,郭霖
GUAN Pei-yuan, CHEN Zhi-gang, WU Jia and GUO Lin
摘要: 目前,机会网络算法中,绝大部分都采取“数据包增殖”策略,即通过数据包的复制,来提高数据包在网络系统中的传递成功率。无论是以Epidemic算法还是以Spray and Wait算法为原型的改进型算法,其核心思想都是增殖。因此对传输过程进行了某种时段上的划分,提出了阶段性非增殖型传递算法NPST(Non Proliferation Stage Transfer Algorithm)。该算法的核心思想是:在系统运行的初期,系统按照其他经典算法运行;当节点中缓存的数据包达到某种条件时,系统改用非增殖型策略,节点间数据包的转发不再产生新的副本,而是以“交换”的方式进行;在系统运行的中期及后期,该算法能有效降低系统整体的路由开销及能量消耗,提高网络性能。
[1] Xiong Yong-ping,Sun Li-min,Niu Jian-wei,et al.Opportunistic Networks[J].Journal of Software,2009,0(1):124-137(in Chinese) 熊永平,孙利民,牛建伟,等.机会网络[J].软件学报,2009,20(1):124-137 [2] Zhang Jun-bao,Luo Guang-chun,Li Jiong,et al.Study on routing protocols in delay tolerant networks[J].Application Research of Computers,2012,9(3):808-812(in Chinese) 张俊宝,罗光春,李炯,等.延迟容忍网络路由协议研究[J].计算机应用研究,2012,9(3):808-812 [3] Wu J,Chen Z,Yi X.Optimal Objects of Cooperation Selection for Human Activity in Opportunistic Networks[J].Smartcr,2014,4(2):118-129 [4] Jia W,Chen Z G.Reducing energy consumption priority selection of node transmission routing algorithm in opportunistic network[J].Advances in Information Sciences & Service Sciences,2014,6(1):11 [5] Grossglauser M,Tse D.Mobility increases the capacity of ad-hoc wireless networks[C]∥ Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies.IEEE,2001,3:1360-1369 [6] Sun Jian-zhi,Zhang Ying-xin,Chen Dan,et al.Self-adaptive Epidemic Routing Algorithm[J].Computer Science,2012,9(7):104-107(in Chinese) 孙践知,张迎新,陈丹,等.具有自适应能力的Epidemic路由算法[J].计算机科学,2012,9(7):104-107 [7] Chen Liang-yin,Liu Zhen-lei,Zou Xun,et al.Erasre-Coding Algorithm in Mobile Low-Duty-Cycle Opportunistic Networks Based on Energy-Aware[J].Journal of Software,2013,4(2):230-242(in Chinese) 陈良银,刘振磊,邹循,等.基于能量感知的移动低占空比机会网络纠删编码算法[J].软件学报,2013,4(2):230-242 [8] Datta A,Quarteroni S,Aberer K.Autonomous gossiping:A self-organizing epidemic algorithm for selective information dissemination in wireless mobile ad-hoc networks[M]∥Semantics of a Networked World.Semantics for Grid Databases,Springer Berlin Heidelberg,2004:126-143 [9] Spyropoulos T,Psounis K,Raghavendra C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]∥Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking.ACM,2005:252-259 [10] Wang G,Wang B,Gao Y.Dynamic spray and wait routing algorithm with quality of node in delay tolerant network[C]∥2010 International Conference on Communications and Mobile Computing (CMC).IEEE,2010,3:452-456 [11] Li Ji-bi,Li Bin,Ren Zhi,et al.An Efficient Energy-Saving Routing Algorithm for Opportunistic Networks with Dynamically Adaptive Power Control[J].Journal of Xi’an Jiaotong University,2014,8(12):49-56(in Chinese) 李季碧,李宾,任智,等.自适应动态功率控制的机会网络节能高效路由算法[J].西安交通大学学报,2014,8(12):49-56 [12] Ma Hua-dong,Yuan Pei-yan,Zhao Dong.Research Progress on Routing Problem in Mobile Opportunistic Networks[J].Journal of Software,2015,6(3):600-616(in Chinese) 马华东,袁培燕,赵东.移动机会网络路由问题研究进展[J].软件学报,2015,26(3):600-616 |
No related articles found! |
|