期刊文献+

DTN中基于生命游戏的拥塞控制策略 被引量:6

Game of Life Based Congestion Control Strategy in Delay Tolerant Networks
下载PDF
导出
摘要 为了应对容迟网络中拓扑结构剧烈变化、节点间连接频繁中断等问题,报文通常采用"存储—携带—转发"的方式进行传输:节点将报文存储在缓存中,携带报文直到遇到合适的机会才将报文转发给其他节点.因为缓存有限,这样的传输方式会使节点缓存溢出,导致拥塞的发生.在容迟网络环境下提出一种基于生命游戏的拥塞控制策略(game of life based congestion control strategy in delay tolerant networks,GLCCS),并将其应用于Epidemic路由方式.GLCCS借鉴生命游戏的演化思想,依据邻居节点中持有特定报文的节点比例来决定节点本地缓存中相应报文的操作.同时还提出了基于全网信息的报文排队机制和丢弃策略,依据传递或者丢弃一个报文对整个网络投递成功率的影响,计算出报文的效用值,按照效用值对缓存中报文进行排队和丢弃.在机会网络模拟器ONE中对仿真移动模型和真实运动轨迹进行模拟,实验结果表明,GLCCS与其他拥塞控制策略相比提高了投递成功率,减小了网络时延、丢包率以及负载比率. In delay tolerant networks, to deal with the problems that the topology of the network changes dramatically and the disconnections between nodes are prevalent, researchers propose the store-carry-forward protocols: nodes store the messages in buffers and may carry them for a long time until they encounter the proper next hops or the destination nodes. Because of the limited buffer capacity of nodes, this way of message transmission is bound to bring buffer overflows and then lead to network congestion. A congestion control strategy based on the game of life is proposed for delay tolerant networks in this paper and it is applied to classic Epidemic routing protocol. This strategy determines the specific operations of a message stored in the local buffer of node according to the proportion of the holders of this message in all the nodes' neighbors. Furthermore, the policies of message queuing and dropping are designed. The utility value of a certain message is calculated based on the influence of delivering or dropping this message on the delivery ratio of the whole network, and the messages stored in the buffers are queued by the utility value. The messages with large utility values have high priority to send and the messages with small utility values are dropped. Experiments under movement model (which is the build-in model in the ONE) and real trajectories are carried out in the ONE. Simulation results show that the congestion control strategy based on the game of life significantly improves the delivery ratio compared with other congestion control strategies, while the delivery latency, packet loss rate and overhead ratio are reduced at the same time.
出处 《计算机研究与发展》 EI CSCD 北大核心 2014年第11期2393-2407,共15页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61272412) 高等学校博士学科点专项科研基金项目(20120061110044) 吉林省科技发展计划重点项目(20120303)
关键词 容迟网络 生命游戏 EPIDEMIC 排队机制 丢弃策略 delay tolerant networks (DTN) game of life Epidemic queuing mechanism dropping policy
  • 相关文献

参考文献6

二级参考文献108

  • 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.
  • 9KUROSE P J, LEVINE B N. A survey of practical issues in underwater networks[C]//Proc of ACM International Conference on Underwater Networks. New York : ACM Press, 2006 : 17 - 24.
  • 10FALL K. A delay-tolerant network architecture for challenged Internet [C]//Proc of ACM SIGCOMM. 2003:27-34.

共引文献31

同被引文献60

  • 1王仲君,王能超,冯飞,田武峰.元胞自动机的演化行为研究[J].计算机应用研究,2007,24(8):38-41. 被引量:13
  • 2FALL K. A delay-tolerant network architecture for challenged Internets[A]. Proc of the ACM SIGCOMM[C]. 2003.27-34.
  • 3BURLEIGH S, HOOKE A, TORGERSON L, et aJ. Delay tolerant networking: an approach to interplanetary intemet[J]. IEEE Communications Magazine, 2003.41(6):128-136.
  • 4AKYILDIZ I F, SU W, SANKARASUBRAMANIAM Y, et al. A survey on sensor networks[J]. IEEE Communications Magazine, 2002, 40(8): 102-114.
  • 5JONES E, WARD P. Routing strategies for delay-tolerant networks[A]. Proc of International Conference on Wireless Communications and Mobile Computing[C].2006.
  • 6JAIN S, FALL K, PATRA R. Routing in delay tolerant network[A]. Proc ofSIGCOMM[C]. New York: ACM Press, 2004.145-157.
  • 7VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc networks[R]. Duke University, 2000.
  • 8TANG L, ZHENG Q, LIU J, et aJ. SMART: A selective controlled-flooding routing for delay tolerant networks[A]. Fourth International Conference on IEEE Broadband Communications, Networks and Systems[C]. 2007.356-365.
  • 9SOYROPOULOS T, PSOUNIS K, RAGHA VENDRA C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks[A]. Proc of the ACM SIGCOMM Workshop on Delay- Tolerant Networking[C]. 2005.252-259.
  • 10SU J, CHIN A, POPIVANOVA A, et aJ. User mobility for opportunistic ad-hoc networking[A]. Proc of the 6th IEEE Workshop on Mobile Computing System and Applications[C]. 2004.41-50.

引证文献6

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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