机会网络中基于节点相遇间隔的缓存管理策略

doi:10.11896/j.issn.1002-137X.2019.05.008

摘要/Abstract

摘要： 采用存储-携带-转发方式的机会网络不考虑消息在传递过程中经历节点与目的节点的相遇概率,对消息传播状态的估计结果存在较大误差。文中提出一种基于节点相遇间隔的缓存管理策略,利用节点相遇间隔服从指数分布的特性,结合消息在网络中的副本数量,估计出消息的平均投递概率。在节点缓存溢出时,根据估算的消息投递概率对缓存中的消息进行排序,优先删除投递概率低的消息,达到缓存管理的目的。仿真结果表明,使用该方法对节点缓存进行管理,在提高网络中消息投递成功率的同时,有效降低了消息的平均投递延迟和网络负荷。

关键词: 缓存管理, 机会网络, 节点相遇间隔, 消息平均投递概率

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: Average delivery probability, Buffer management, Encounter interval, Opportunistic networks

中图分类号:

TP393

张峰. 机会网络中基于节点相遇间隔的缓存管理策略[J]. 计算机科学, 2019, 46(5): 57-61. https://doi.org/10.11896/j.issn.1002-137X.2019.05.008

ZHANG Feng. Node Encounter Interval Based Buffer Management Strategy in Opportunistic Networks[J]. Computer Science, 2019, 46(5): 57-61. https://doi.org/10.11896/j.issn.1002-137X.2019.05.008

参考文献

[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.

相关文章 15

[1]	邓霞, 常乐, 梁俊斌, 蒋婵. 移动机会网络组播路由的研究进展 Survey on Multicast Routing in Mobile Opportunistic Networks 计算机科学, 2018, 45(6): 19-26. https://doi.org/10.11896/j.issn.1002-137X.2018.06.003
[2]	朱坤, 刘林峰, 吴家皋. 一种基于节点位置余弦相似度的机会网络转发算法 Opportunistic Network Forwarding Algorithm Based on Node Cosine Similarity 计算机科学, 2018, 45(12): 61-65. https://doi.org/10.11896／j.issn.1002-137X.2018.12.008
[3]	李向丽,宣茂义. 自私性机会网络中的节点激励策略研究 Research on Incentive Strategy of Nodes in Selfish Opportunistic Network 计算机科学, 2017, 44(4): 213-217. https://doi.org/10.11896/j.issn.1002-137X.2017.04.046
[4]	郭东岳,刘林峰. 一种基于区域朋友关系的机会路由算法 Opportunistic Routing Algorithm Based on Regional Friendship 计算机科学, 2017, 44(3): 105-109. https://doi.org/10.11896/j.issn.1002-137X.2017.03.023
[5]	马学彬,李爱丽,张晓娟,贾磊磊,肖静. 稀疏机会网络中基于固定中继节点与消息相关性的缓存管理策略 Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportunistic Networks 计算机科学, 2016, 43(Z11): 296-300. https://doi.org/10.11896/j.issn.1002-137X.2016.11A.069
[6]	姚智海,徐宏喆,李文,吴夏. 基于伸展树的文件数据缓存管理策略研究 Research of Cache Management Strategy Based on Splay Tree 计算机科学, 2016, 43(9): 131-134. https://doi.org/10.11896/j.issn.1002-137X.2016.09.025
[7]	关培源,陈志刚,吴嘉,郭霖. 机会网络中阶段性非增殖型传递算法的研究 Study on Non Proliferation Stage Transfer Algorithm Based on Opportunistic Network 计算机科学, 2016, 43(4): 37-40. https://doi.org/10.11896/j.issn.1002-137X.2016.04.007
[8]	吴嘉,易茜,陈志刚. 基于机会网络的最优化动态合作树选择算法 Algorithm of Selecting Optimal Dynamic Cooperation Tree in Opportunistic Networks 计算机科学, 2014, 41(Z11): 170-173.
[9]	曹晓梅,殷瑛. 基于模糊身份密码学的机会网络身份认证方案 Identity Authentication Scheme in Opportunistic Network Based on Fuzzy-IBE 计算机科学, 2014, 41(10): 191-195. https://doi.org/10.11896/j.issn.1002-137X.2014.10.042
[10]	周军海,林亚平,周四望. 一种低功耗的社区机会网络消息路由算法 Power-efficient Message Routing Algorithm for Community-based Opportunistic Network 计算机科学, 2014, 41(1): 178-182.
[11]	马学彬,张岩纹,欧阳真超,王丽婷. 基于机会网络的消息传输系统 Message Transmission System for Opportunistic Networks 计算机科学, 2013, 40(Z11): 41-45.
[12]	李东生，杨志义，郭斌，贺会磊，於志文. 基于机会网络的社会性活动组织研究 Delivering Social Activity Formation Service over Opportunistic Networks 计算机科学, 2013, 40(2): 35-39.
[13]	孙践知,张迎新,陈丹,韩忠明. 具有自适应能力的Epidemic路由算法 Self-adaptive Epidemic Routing Algorithm 计算机科学, 2012, 39(7): 104-107.
[14]	徐佳,王汝传,徐杰,廖俊. 容迟网络多副本路由技术研究 Research of Multi-copy Routing in Delay Tolerant Networks 计算机科学, 2011, 38(8): 74-79.
[15]	蔡青松，牛建伟，刘畅. 一种基于车载机会网络的自适应数据分发算法 Adaptive Data Dissemination Algorithm for Vehicular Opportunistic Networks 计算机科学, 2011, 38(6): 58-63.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed