计算机科学 ›› 2016, Vol. 43 ›› Issue (Z11): 296-300.doi: 10.11896/j.issn.1002-137X.2016.11A.069

• 无线网络与通信 • 上一篇    下一篇

稀疏机会网络中基于固定中继节点与消息相关性的缓存管理策略

马学彬,李爱丽,张晓娟,贾磊磊,肖静   

  1. 内蒙古大学计算机学院 呼和浩特010021,内蒙古大学计算机学院 呼和浩特010021,内蒙古大学计算机学院 呼和浩特010021,内蒙古大学计算机学院 呼和浩特010021,内蒙古大学计算机学院 呼和浩特010021
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(121142),内蒙古自然科学基金(2104MS0605)资助

Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportunistic Networks

MA Xue-bin, LI Ai-li, ZHANG Xiao-juan, JIA Lei-lei and XIAO Jing   

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

摘要: 针对稀疏机会网络中固定中继节点和移动节点间的相遇频率以及缓存资源的差异性问题,在多副本路由协议中,提出一种结合固定中继节点重要性和消息相关性的缓存管理策略。该策略通过交互固定节点和移动节点的接触信息和消息队列信息,减少固定中继节点缓存中冗余消息的数量,从而合理地利用固定中继节点的缓存资源。仿真结果表明,所提的缓存管理策略能够在保证消息传输成功率的基础上提高固定中继节点缓存空间的利用率。

关键词: 机会网络,缓存管理,消息相关性,节点重要性

Abstract: Aiming at the difference of contact frequency and buffer resources between fixed relay nodes and mobile nodes in the sparse opportunistic networks, a buffer management strategy combining the importance of fixed relay nodes with message correlation was proposed in the multiple copy routing protocols.The proposed strategy can reduce the number of redundant messages in the buffer of fixed relay nodes by interacting the contact information and the message queue information of fixed relay nodes and mobile nodes so that using the buffer space of fixed relay nodes reasonably.Experiments show that the proposed buffer management strategy can improve the cache space utilization of fixed relay nodes on the basis of guaranteeing the successful rate of message transmission.

Key words: Opportunistic networks,Buffer management,Message correlation,Node importance

[1] Shahbazi S,Karunasekera S,Harwood A.Improving perfor-mance in delay/disruption tolerant networks through passive relay points[J].Wireless Networks,2012,18(1):9-31
[2] Ying Z,Zhang C,Wang Y.Social based throwbox placement in large-scale throwbox-assisted delay tolerant networks[C]∥2014 IEEE International Conference on Communications (ICC).IEEE,2014:2472-2477
[3] Li F,Yin Z,Tang S,et al.k-Throwbox placement problem in throwbox-assisted delay tolerant networks[C]∥2014 IEEE Global Communications Conference (GLOBECOM).IEEE,2014:253-258
[4] Li F,Yin Z,Tang S,et al.Optimization Problems in Throwbox-Assisted Delay Tolerant Networks:Which Throwboxes to Activate? How Many Active Ones I Need?[J].IEEE Transaction on Computers,2016,5(5):1663-1670
[5] Erramilli V,Crovella M.Forwarding in opportunistic networks with resource constraints[C]∥Proceedings of the Third ACM Workshop on Challenged Networks.ACM,2008:41-48
[6] 应俊,杨慧娉,王汝言.带有相遇概率估计的机会网络缓存替换策略[J].上海交通大学学报,2015,49(11):1680-1684
[7] 黄沛昱,应俊.消息替换风险动态感知的缓存管理策略[J].重庆邮电大学学报(自然科学版),2014,26(2):233-237
[8] Liu Y,Wang J,Zhang S,et al.A buffer management scheme based on message transmission status in delay tolerant networks [C]∥2011 IEEE Global Telecommunications Conference (GLOBECOM 2011) .IEEE,2011:1-5
[9] Shin K,Kim S.Enhanced buffer management policy that utilises message properties for delay-tolerant networks[J].Communications,IET,2011,5(6):753-759
[10] Iranmanesh S.A novel queue management policy for delay-tole-rant networks[J].Eurasip Journal on Wireless Communications and Networking,2016,2016(88):1-23
[11] Rashid S,Abdullah A H,Ayub Q,et al.Dynamic predictionbased multi queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network[J].Journal of Network and Computer Applications,2013,36(5):1395-1402
[12] Liu Q,Li G,Li Y,et al.Cache scheduling policy for opportunistic networks based on message priority[J].Journal of Information and Computational Science,2013,10(2):621-632
[13] Wu D,Zhou J,Zhang P,et al.Intelligent Dynamical BufferScheduling Mechanism for Intermittently Connected Mobile Network[J].Wireless Personal Communications,2013,73(3):1269-1288
[14] Rashid S,Ayub Q,Abdullah A H.Reactive Weight Based BufferManagement Policy for DTN Routing Protocols[J].Wireless Personal Communications,2015,80(3):993-1010
[15] 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
[16] Pan D,Ruan Z,Zhou N,et al.A comprehensive-integrated buffer management strategy for opportunistic networks[J].EURASIP Journal on Wireless Communications and Networking,2013,2013(1):1-10
[17] 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
[18] Ekman F,Kernen A,Karvo J,et al.Working day movement model[C]∥Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models.ACM,2008:33-40

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] 雷丽晖,王静. 可能性测度下的LTL模型检测并行化研究[J]. 计算机科学, 2018, 45(4): 71 -75, 88 .
[2] 夏庆勋,庄毅. 一种基于局部性原理的远程验证机制[J]. 计算机科学, 2018, 45(4): 148 -151, 162 .
[3] 厉柏伸,李领治,孙涌,朱艳琴. 基于伪梯度提升决策树的内网防御算法[J]. 计算机科学, 2018, 45(4): 157 -162 .
[4] 王欢,张云峰,张艳. 一种基于CFDs规则的修复序列快速判定方法[J]. 计算机科学, 2018, 45(3): 311 -316 .
[5] 孙启,金燕,何琨,徐凌轩. 用于求解混合车辆路径问题的混合进化算法[J]. 计算机科学, 2018, 45(4): 76 -82 .
[6] 张佳男,肖鸣宇. 带权混合支配问题的近似算法研究[J]. 计算机科学, 2018, 45(4): 83 -88 .
[7] 伍建辉,黄中祥,李武,吴健辉,彭鑫,张生. 城市道路建设时序决策的鲁棒优化[J]. 计算机科学, 2018, 45(4): 89 -93 .
[8] 刘琴. 计算机取证过程中基于约束的数据质量问题研究[J]. 计算机科学, 2018, 45(4): 169 -172 .
[9] 钟菲,杨斌. 基于主成分分析网络的车牌检测方法[J]. 计算机科学, 2018, 45(3): 268 -273 .
[10] 史雯隽,武继刚,罗裕春. 针对移动云计算任务迁移的快速高效调度算法[J]. 计算机科学, 2018, 45(4): 94 -99, 116 .