期刊文献+

基于运动相似性的机会网络缓存管理策略 被引量:2

Cache management algorithm based on mobility similarity in opportunistic network
下载PDF
导出
摘要 考虑机会网络节点移动相似性以及节点是否适合传输消息的判断对消息传输效率的影响,提出一种基于运动相似性的缓存管理策略。通过分析网络中消息副本扩散程度和节点的移动特性,估计缓存中消息待传输概率;结合节点运动、消息运动以及节点与消息运动的相似性,计算消息在节点中存储和转发的效用值;根据效用值选择适合节点转发的消息集合,确定在节点缓存溢出时需要丢弃消息的顺序。仿真结果表明,与ENMP、DY、CMA-MS等缓存管理策略相比,该策略具备较高的网络投递率、较低网络开销和传输时延。 Making full use of the similarity of node mobility which is used to judge whether the node is suitable for messages transmission and considering its influences on messages delivery ratio,a cache management strategy using motion similarity was proposed.The probability of message transmission in the cache was estimated by analyzing the diffusion degree of message replicas and the moving characteristics of nodes in the network,and node motion similarity and message motion similarity were combined to estimate utility of message storage and forwarding.The set of messages that was appropriate for node forwarding was selected and the order was determined in which the message needed to be discarded when the node buffer overflowed based on utility value.Simulation results show that the proposed strategy has higher delivery rate,lower cost and transmission delay compared with other cache management strategies.
作者 张力 陈滢生 王言通 ZHANG Li1 , CHEN Ying-sheng1 , WANG Yan- tong2(1. School of Computer Engineering, Chongqing College of Humanities, Science and Technology, Chongqing 401524, China;2. School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, Chin)
出处 《计算机工程与设计》 北大核心 2018年第8期2466-2471,共6页 Computer Engineering and Design
基金 重庆市科委基础与前沿研究计划基金项目(cstc2014jcyjA40039)
关键词 机会网络 运动相似性 消息扩散 传输概率 缓存管理 opportunistic network mobility similarity message diffusion transmission probability cache management
  • 相关文献

参考文献4

二级参考文献35

  • 1龙柯,陆慧梅,殷磊,李凡.容迟网络场景监测自适应路由研究[J].计算机研究与发展,2010,47(S2):189-193. 被引量:1
  • 2Hyytia E, Lassila P, and Virtama J. Spatial node distribution of the random waypoint mobility model with applications [J]. IEEE Transactions on Mobile Computing, 2006, 5(6): 680-694.
  • 3Zhang Z S. Routing in intermittently connected mobile Ad hoc networks and delay tolerant networks Overview and challenges [J]. IEEE Communications Surveys Tutorials, 2006, 8(1): 24-37.
  • 4Krifa A, Barakat C, and Spyropoulos T. Optimal buffer management policies for delay tolerant networks [C]. The 5th Annual IEEE Communications Society Conference on Sensor Mesh and Ad hoc Communications and Networks, San Francisco, CA, 2008: 260-268.
  • 5Spyropoulos T, Psounis K, and Raghavendra C S. Efficient routing in intermittently connected mobile networks: the multiple-copy case [J]. IEEE/ACM Transactions on Networking, 2008, 16(1): 77-81.
  • 6Bettstetter C, Resta G, and Santi P. The node distribution of the random waypoint mobility model for wireless Ad hoc networks[J]. IEEE Transactions on Mobile Computing, 2003, 2(3): 257-269.
  • 7Spyropoulos T, Psounis K, and Raghavendra C S. Performance analysis of mobility assisted routing [C]. The 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Florence, Italy, 2006: 49-60.
  • 8Mahmoud M and Al-Nagar H. On generalized order statistics form linear exponential distribution and its characterization [J]. Statistical Papers, 2009, 50(2): 407-418.
  • 9Keranen A, Ott J, and Karkkainen T. The ONE simulator for DTN protocol evaluation [C] .The 2nd International Conference on Simulation Tools and Techniques, Rome, Italy 2009: 1-10.
  • 10Mundur P, Seligman M, and Lee G. Epidemic routing with immunity in delay tolerant networks [C]. The IEEE Military Communications Conference, San Diego, CA, 2008: 1-7.

共引文献26

同被引文献20

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部