期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

DTN网络中一种基于区域的缓存区管理策略 被引量：2

Area-based buffer management policy in delay-tolerant networks
下载PDF
导出
摘要 由于DTN低节点密度和网络拓扑结构的不断变化等特性,DTN网络中一般不存在端到端的连接,因此,DTN网络中采取"储存-携带-转发"的方式传输报文。同时为了提高DTN网络中报文的递交率,一个报文在网络中通常存在多个拷贝。当网络节点的缓存有限时,缓存策略就在很大程度上影响了DTN网络路由算法效率。文章提出了一种基于区域的缓存区管理策略,其对网络区域进行划分,通过估计报文在各个区域中数目以及对节点的运动特性进行分析来决定丢弃报文的顺序。仿真实验结果显示,与其他缓存区管理策略相比,所提出的策略可以明显地提高递交率和降低网络开销。 Due to the low node density and unpredictable network topology, the end-to-end paths can hardly be maintained in delay-tolerant networks（DTN）, so the storage-carry-forward paradigm is a- dopted to deliver messages in DTN. Meanwhile, In order to improve the delivery ratio of the mes- sage, there is more than one copy of a message in the network. The buffer management scheme large- ly affects the efficiency of the routing algorithm when the nodes have finite buffers. In this paper, an area^based buffer management policy is proposed. This scheme determines the order of discarded mes- sages by estimating the number of messages in different divided areas and analyzing the motion charac- teristics of the node. The simulation results show that the proposed scheme can apparently improve the delivery ratio and decrease the overhead ratio compared with other buffer management schemes.
作者 柏亚平 王青山 孙雪莲
机构地区 合肥工业大学数学学院
出处 《合肥工业大学学报（自然科学版）》 CAS CSCD 北大核心 2013年第9期1063-1067,共5页 Journal of Hefei University of Technology：Natural Science
基金 安徽省自然科学基金资助项目(1208085MF89 1308085MF87)
关键词 DTN网络 路由 间歇性连接 缓存区管理 delay-tolerant network（DTN） routing intermittent connection buffer management
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献12

  • 1Fall K. A delay-tolerant network architecture for chal-lenged Internets [C]//SIGCOMMJ 03 Proceedings of the2003 conference. New York: ACM Press, 2003:27—34.
  • 2Nichols R A,Hammons A R. DTN-based free-space opticaland directional RF networks [C]//Military Communica-tions Conference. San Diego, CA,2008:1 — 6.
  • 3Vahdat A, Vahdat D. Epidemic routing for partially con-nected ad hoc networks[R]. San Diego: University of Cali-fornia* 2000.
  • 4Lindgren A,Doria A, Schelen O. Probabilistic routing inintermittently connected networks[J]. ACM SIGMOBILEMobile Computing and Communications Review, 2003,7(3):19-20.
  • 5Spyropoulos T, Psounis K,Raghavendra C S. Spray andWait: an efficient routing scheme for intermittently con-nected mobile networks[C]//Proceedings of ACM SIG-COMM Workshop on Delaytolerant Networking. Philadel-phia :ACM Press .2005 : 252 — 259.
  • 6Liu Yao,Wang Jianxin,Zhang Shigeng, et al. A buffermanagement scheme based on message transmission statusin delay tolerant networks [C]//Gobal Telecommunica-tions Conference(GLOBECOM 2011). New Jersey: IEEEPress * 2011 : 1 — 5.
  • 7Zhang Xiaolan, Neglia G, Kurose J, et al. Performancemodeling of epidemic routing[J]. The International Journalof Computer and Telecommunications Networking, 2006,51:2867—2891.
  • 8Krifa A, Baraka C, Spyropoulos T. Optimal buffer man-agement policies for delay tolerant networks[C]//5th An-nual IEEE Communications Society Conference, SECONf08,San Francisco,CA,2008:260—268.
  • 9Lindgren A, Phanse S. Evaluation of queuing policies andforwarding strategies for routing in intermittently connect-ed networks [C]//Proc of IEEE COMSWARE, NewDelhi,2006:l —10.
  • 10Li Yun,Cheng Xinjian, Liu Qilie,et al. A novel conges-tion control strategy in delay tolerant networks[C]//Fu-ture Networks. 2010. ICFN10. Second International Con-ference. New Jersey: IEEE Press,2010:233 — 237.

同被引文献9

  • 1Balasubramanian A, Levine B N, Venkataramani A. DTN routing as a resource allocation problem[C]//Proceedings of SIGCOMM 2007, Kyoto, 2007 : 373- 384.
  • 2Ioannidis S, Chaintreau A, Massoulie L. Optimal and scal able distribution of content updates over a mobile social net- work[C]//Proceedings of INFOCOM 2009, IEEE, Rio de Janeiro,2009:1422- 1430.
  • 3Vahdat A, Becker D. Epidemic routing for partially con- nected ad hoc networks[R]. San Diego:University of Cali- fornia, San Diego, 2000.
  • 4Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait:an efficient routing scheme for intermittently connect- ed rrLobile networks [C]//Proceedings of the 2005 ACM SIGCOMM Workshop. New York: ACM Press, 2005: 252 259.
  • 5Spyropoulos T, Psounis K, Raghavendra C S. Spray and fo- cus: efficient mobility-assisted routing for heterogeneous and correlated mobility[C]//Proceedings of Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops. White Plains: IEEE Press, 2007= 79-85.
  • 6Erramilli V, Crovella M, Chaintreau A, et al. Delegation forwarding[C]//Proceedings of MobiHoc' 08. New York: ACM Press, 2008: 251-260.
  • 7Pan Hui, Crowcroft J. How Small labels create big im- provements[C]//Proceedings of Fifth Annual IEEE Inter- national Conference on Pervasive Computing and Communi- cations Workshops. White Plains: IEEE Press, 2007: 65-70.
  • 8Pan Hui, Crowcroft J, Yoneki E. Bubble rap: social-based forwarding in delay-tolerant networks[J]. IEEE Transac- tions on Mobile Computing. 2011,10(11) :1576 -1589.
  • 9Fan Jialu, Chen Jiming, Du Yuan,et al. DelQue: a social- ly-aware delegation query scheme in delay tolerant net- works[J]. IEEE Transactions on Vehicular Technology, 2011,60(5) : 2181 -2193.

引证文献2

二级引证文献3

合肥工业大学学报（自然科学版）
2013年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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