Computer Science ›› 2016, Vol. 43 ›› Issue (4): 37-40.doi: 10.11896/j.issn.1002-137X.2016.04.007

Previous Articles     Next Articles

Study on Non Proliferation Stage Transfer Algorithm Based on Opportunistic Network

GUAN Pei-yuan, CHEN Zhi-gang, WU Jia and GUO Lin   

  • Online:2018-12-01 Published:2018-12-01

Abstract: At present, the vast majority of algorithms in opportunistic networks take “packet proliferation” strategy,namely using the packet replication to improve the success rate of data packet transmission in network system. The core idea of the improved algorithms based on Epidemic algorithm or Spray and Wait algorithm is the proliferation.In this paper,the transmission process was divided into a certan period of time,and the stage of non proliferative transfer algorithm NPST(Non Proliferation Stage Transfer Algorithm) was proposed.The core idea of this algorithm is that in the early stage of system operation,system operation runs in accordance with the other classical algorithms,and when the data packets in node cache meet some condition, the system uses non proliferative strategy,and the transmissionof packets between nodes no longer generates new copies,instead,the packets transmit by the way of “exchange”.In the middle and later stages of system operation,the proposed algorithm can effectively reduce the routing overhead of the whole system,and improve the performance of the network.

Key words: Opportunity network,Non proliferation policy,Stage,Routing overhead,Energy consumption

[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!
Full text



No Suggested Reading articles found!