期刊文献+

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

Node Encounter Interval Based Buffer Management Strategy in Opportunistic Networks
下载PDF
导出
摘要 采用存储-携带-转发方式的机会网络不考虑消息在传递过程中经历节点与目的节点的相遇概率,对消息传播状态的估计结果存在较大误差。文中提出一种基于节点相遇间隔的缓存管理策略,利用节点相遇间隔服从指数分布的特性,结合消息在网络中的副本数量,估计出消息的平均投递概率。在节点缓存溢出时,根据估算的消息投递概率对缓存中的消息进行排序,优先删除投递概率低的消息,达到缓存管理的目的。仿真结果表明,使用该方法对节点缓存进行管理,在提高网络中消息投递成功率的同时,有效降低了消息的平均投递延迟和网络负荷。 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.
作者 张峰 ZHANG Feng(School of Computer & Information Technology,Shanxi University,Taiyuan 030006,China)
出处 《计算机科学》 CSCD 北大核心 2019年第5期57-61,共5页 Computer Science
关键词 机会网络 缓存管理 节点相遇间隔 消息平均投递概率 Opportunistic networks Buffer management Encounter interval Average delivery probability
  • 相关文献

参考文献5

二级参考文献30

  • 1姚凌,纪红,乐光新.一种改进的无线TCP拥塞控制算法及其稳态流量模型[J].北京邮电大学学报,2005,28(2):42-45. 被引量:4
  • 2李士宁,方济平,覃征.一种动态门限变速增加的TCP慢启动算法[J].西安电子科技大学学报,2006,33(4):640-645. 被引量:5
  • 3Juang P, Oki H, Martonosi M, et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet [ C ] //ASPLOS'02. San Jose: ACM, 2002 : 96-107.
  • 4Warthman F. Delay tolerant networks (DTNs) : a tutorial [EB/OL]. (2003-05-03) http: ///www. ipnsig.or/reports/DTN_Tutorial11. pdf.
  • 5Burleigh S, Hooke A, Torgerson L, et al. Delay-tolerant networking: an approach to interplanetary Internet [ J ]. Communications Magazine, 2003, 41(6): 128-136.
  • 6Wang Hongpeng, Cui Lin. An enhanced AODV for mobile Ad hoc network[ C ]//2008 International Conference on Machine Learning and Cybernetics. Kunming: [ s. n. ], 2008: 1135-1140.
  • 7James A D, Andrew H F, Brian N L. Wearable computers as packet transport mechanisms in highly-partitioned Ad hoc networks [ C ] //Fifth International Symposium on : Wearable Computers, 2001: 141-148.
  • 8Krifa A, Baraka C, Spyropoulos T. Optimal buffer management policies for delay tolerant networks [ C ] //SECON'08.5^th Annual IEEE Communications Society Conference. San Francisco: IEEE Communications Society Magazines, 2008 : 260-268.
  • 9Khabbaz M J, Assi C M, Fawaz W F. Disruptian-tolerant networking: A comprehensive survey on recent develop- ments and persisting challenges[J]. IEEE Communications Surveys and Tutorials ,2012,14 ( 2 ) :607 - 640.
  • 10Milena R, Andrew G. Efficient and adaptive congestion control for heterogeneous delay-tolerant networks [ J ]. AdHoe Networks,2012,10(7) : 1322 - 1345.

共引文献17

同被引文献25

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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