期刊文献+

基于Epdemic算法的社区机会网络缓存管理优化 被引量:1

Community Opportunity Network Cache Management Optimization Based on Epidemic Algorithm
下载PDF
导出
摘要 针对现有机会网络路由算法应用到社区中会产生缓存溢出,副本数量过多等问题,论文提出了一种有效的控制副本数量的方案。通过预先计算出每个节点在整个网络中能投放的副本数量最大值,再计算两个节点相遇的平均时间和信息从初始节点转发到目的节点的总时间以此来确定信息被转发的次数。节点转发的次数就是节点能产生的副本数。同时为了防止缓存溢出又采用退避机制来管理缓存中的信息。 In this paper,an effective scheme is proposed to control the number of replicas.In this paper,the number of nodes can be calculated in the whole network.In this paper,a scheme is proposed to control the number of replicas.The maximum number of copies.The number of times the information is forwarded can be determined by calculating the average time at which two nodes meet and the total time from which the information is forwarded from the initial node to the destination node.The number of times that the node is forwarded is the number of copies that the node can produce.At the same time the back-off mechanism is used in order to prevent the cache overflow and to manage the information in the cache.
作者 黄成兵 HUANG Chengbing(Computer Science Department,Aba Teachers College,Wenchuan 623002)
出处 《计算机与数字工程》 2018年第7期1396-1400,共5页 Computer & Digital Engineering
基金 四川省教育厅重点课题(编号:18ZA0003) 阿坝州应用技术研究与开发资金(编号:YYJS2017051)资助
关键词 节点相遇 转发次数 副本 退避机制 node encounter forwarding number copy backoff mechanism
  • 相关文献

参考文献3

二级参考文献31

  • 1Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: Efficient routing in intermittently connected mobile networks [C] //Proc of ACM SIGCOMM Workshop on Delay Tolerant Networking (WDTN). New York: ACM, 2005: 45-53.
  • 2Spyropoulos T, Psounis K, Raghavendra C S, et al. Spray and focus : Efficient mobility-assisted routing for heterogeneous and correlated mobility [C]//Proc of the 5th Annual IEEE Int Conf on Pervasive Computing and Communications Workshops. New York: IEEE, 2007: 79- 85.
  • 3Lindgren, Doria A, Schelen O. Probabilistic routing in intermittently connected networks [C] //Proc of ACM SIGMOBILE Mobile Computing and Communications. New York: ACM, 2003:239-254.
  • 4Pan Hui, Jon Crowcroft, Eiko Yoneki. BUBBLE Rap: Socia-based forwarding in delay tolerant networks [C] //Proc of the 9th ACM Int Symp on Mobile Ad Hoc Networking and Computing. New York: ACM, 2008:241-250.
  • 5Musolesi M, Mascolo C. A community based mobility model for ad hoc network research [C] //Proc of the 2nd Int Workshop on Multi-hop Ad Hoc Networks: From Theory to Reality. New York: ACM, 2006:26-26.
  • 6Newman M E J. Analysis of weighted networks [J]. Physical Review E, 2004, 70(5): 70-78.
  • 7Spyropoulos T, Psounis K, Raghavendra C S. Performance analysis of mobility assisted routing [C] //Proc of the 7th ACM Int Symp on Mobile Ad Hoc Networking and Computing. New York: ACM, 2006:49-60.
  • 8Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks, CS-200006 [R]. Durham, North Carolina: Duke University, 2000.
  • 9Pelusi L, Passarella A, Cont I M. Opportunistic networking: Da- ta forwarding in disconnected mobile ad hoe networks[J]. IEEE Communications Magazine, 2006,44 (11) : 134-14 1.
  • 10Pasarella A,Kumar M, Oonti M, et al. Minimum- Delay Service Provisioning in Opportunistic Networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2011,22(8) : 1267-1275.

共引文献79

同被引文献11

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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