Computer Science ›› 2019, Vol. 46 ›› Issue (5): 57-61.doi: 10.11896/j.issn.1002-137X.2019.05.008

Previous Articles     Next Articles

Node Encounter Interval Based Buffer Management Strategy in Opportunistic Networks

ZHANG Feng   

  1. (School of Computer & Information Technology,Shanxi University,Taiyuan 030006,China)
  • Received:2018-03-24 Revised:2018-07-22 Published:2019-05-15

Abstract: Opportunistic network which employs store-carry-and-forward pattern doesn’t consider encounter possibility of destination nodes and passing nodes during message transmission,leading to a large deviation for the estimation on message transmission status.This paper proposed an encounter interval based buffer management strategy.It facilitates the characteristic of exponential distribution for the encounter intervals between nodes,and the number of message co-pies is also considered.So the average delivery probability is estimated.All messages stored in the buffer are sorted according to the average delivery probability when the buffer is overflow,and the messages with low delivery probability will be dropped first for buffer management intent.Simulation results show that the proposed strategy achieves better performance compared to existing schemes in respect of the delivery ratio,average latency and overhead ratio.

Key words: Opportunistic networks, Buffer management, Encounter interval, Average delivery probability

CLC Number: 

  • TP393
[1]CAO Y,SUN Z.Routing in delay/disruption tolerant networks:A taxonomy,survey and challenges[J].IEEE Communications Surveys & Tutorials,2013,15(2):654-677.
[2]RA M R,LIU B,LA PORTA T F,et al.Medusa:A programming framework for crowd-sensing applications[C]∥Proceedings of the 10th International Conference on Mobile Systems,Applications,and Services.ACM,2012:337-350.
[3]JAIN S,CHAWLA M.Survey of buffer management policies for delay tolerant networks[J].The Journal of Engineering,2014(3):117-123.
[4]DAVIS J A,FAGG A H,LEVINE B N.Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks[C]∥Proceedings of the 5th International Symposium on Wearable Computers.IEEE,2001:141-148.
[5]LIU Q L,PAN Y J,LI Y,et al.Congestion Control Strategy Based on Copy Rate in DTN[J].Journal of Beijing University of Posts and Telecommunications,2010,33(4):88-92.(in Chinese)刘期烈,潘英俊,李云,等.延迟容忍网络中基于复制率的拥塞控制算法[J].北京邮电大学学报,2010,33(4):88-92.
[6]AN Y,HUANG J W,LUO X,et al.A Node Betweenness Based Congestion Aware Routing Algorithm for DTNs[J].Journal of Chinese Computer Systems,2014,35(9):2062-2067.(in Chinese)安莹,黄家玮,罗熹,等.延迟容忍网络中一种基于节点介数的拥塞感知路由算法[J].小型微型计算机系统,2014,35(9):2062-2067.
[7]LI X L,XUAN M Y.Research on Incentive Strategy of Nodes in Selfish Opportunistic Network[J].Computer Science,2017,44(4):213-217,222.(in Chinese)李向丽,宣茂义.自私性机会网络中的节点激励策略研究[J].计算机科学,2017,44(4):213-217,222.
[8]MA X B,LI A L,ZHANG X J,et al.Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportuni-stic Networks[J].Computer Science,2016,43(S2):296-300.(in Chinese)马学彬,李爱丽,张晓娟,等.稀疏机会网络中基于固定中继节点与消息相关性的缓存管理策略[J].计算机科学,2016,43(S2):296-300.
[9]LU Y,WANG W,CHEN L,et al.Opportunistic forwarding in energy harvesting mobile delay tolerant networks[C]∥IEEE International Conference on Communications (ICC).IEEE,2014:526-531.
[10]ZHANG F,WANG X M,ZHANG L C,et al.A Cellular-lear-ning-automata-based Congestion Control Strategy in Opportuni-stic Networks[J].Journal of Sichuan University (Engineering Science Edition),2016,48(1):158-165.(in Chinese)张峰,王小明,张立臣,等.机会网络中基于元胞学习自动机的拥塞控制策略[J].四川大学学报(工程科学版),2016,48(1):158-165.
[11]KERÄNEN A,OTT J,KÄRKKÄINEN T.The ONE simulator for DTN protocol evaluation[C]∥Proceedings of the 2nd International Conference on Simulation Tools and Techniques(ICST).2009:55.
[1] DENG Xia, CHANG Le, LIANG Jun-bin, JIANG Chan. Survey on Multicast Routing in Mobile Opportunistic Networks [J]. Computer Science, 2018, 45(6): 19-26.
[2] GUO Dong-yue and LIU Lin-feng. Opportunistic Routing Algorithm Based on Regional Friendship [J]. Computer Science, 2017, 44(3): 105-109.
[3] MA Xue-bin, LI Ai-li, ZHANG Xiao-juan, JIA Lei-lei and XIAO Jing. Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportunistic Networks [J]. Computer Science, 2016, 43(Z11): 296-300.
[4] YAN Yu-dao and LIU Lin-feng. Update Strategy of Communities Information Based on Variable Half-lifes in Opportunistic Networks [J]. Computer Science, 2016, 43(2): 124-128.
[5] CAO Xiao-mei and YIN Ying. Identity Authentication Scheme in Opportunistic Network Based on Fuzzy-IBE [J]. Computer Science, 2014, 41(10): 191-195.
[6] . Delivering Social Activity Formation Service over Opportunistic Networks [J]. Computer Science, 2013, 40(2): 35-39.
[7] CAI Qing-song,NIU Jian-wei,LIU Chang. Adaptive Data Dissemination Algorithm for Vehicular Opportunistic Networks [J]. Computer Science, 2011, 38(6): 58-63.
[8] HU Si-quan, WANG Hong-bing ,WANG Jun-feng. Survey on Opportunistic Networks [J]. Computer Science, 2009, 36(10): 32-37.
[9] YANG Qiao-Li ZHU Yi-Jun (Faculty of Science, Jiangsu University, Zhenjiang, Jiangsu 212013). [J]. Computer Science, 2008, 35(1): 60-63.
Full text



[1] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[2] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[3] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .
[4] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105, 130 .
[5] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121, 136 .
[6] QU Zhong and ZHAO Cong-mei. Anti-occlusion Adaptive-scale Object Tracking Algorithm[J]. Computer Science, 2018, 45(4): 296 -300 .
[7] LU Jia-wei, MA Jun, ZHANG Yuan-ming and XIAO Gang. Service Clustering Approach for Global Social Service Network[J]. Computer Science, 2018, 45(3): 204 -212 .
[8] CUI Jian-jing, LONG Jun, MIN Er-xue, YU Yang and YIN Jian-ping. Survey on Application of Homomorphic Encryption in Encrypted Machine Learning[J]. Computer Science, 2018, 45(4): 46 -52 .
[9] YE Zhi-bin,YAN Bo. Survey of Symbolic Execution[J]. Computer Science, 2018, 45(6A): 28 -35 .
[10] LUO Shu-yan, ZHU Yi-an, ZENG Cheng. Performance Evaluation and Optimization of Inter-cores Communication for Heterogeneous
Multi-core Processor Unit
[J]. Computer Science, 2018, 45(6A): 262 -265, 274 .