期刊文献+

基于接收阈值的容延网络拥塞控制机制 被引量:15

Congestion Control Mechanism Based on Accepting Threshold in Delay Tolerant Networks
下载PDF
导出
摘要 为了减少容延网络的资源开销,研究者提出了单副本转发路由算法.研究发现,这些转发算法导致节点流量负载极度不均衡,使得那些连接度较大的节点产生了拥塞.针对该问题,提出了一种基于接收阈值的拥塞控制机制,可以有效降低节点拥塞.该机制使每个DTN(delay tolerant network)节点根据自身的拥塞状况动态调整自己的拥塞控制机制,而且该机制独立于节点所运行的转发路由算法,不影响路由算法对中继节点的选择,具有很好的普适性.为了验证所提出机制的有效性,将该拥塞控制机制与现有的SimBet路由算法加以结合,提出了具有拥塞控制功能的SimBetCC算法.实验结果表明,SimBetCC算法在取得很好的拥塞控制的前提下,其递交率和递交时延等性能方面均优于具有拥塞控制功能的FairRoute路由算法. In order to decrease the resource cost in delay tolerant networks, single-copy forwarding protocols have been proposed by researchers. However, recent research has pointed out that single-copy forwarding protocols lead to great unfairness of the nodes' traffic load and make the highly connected nodes suffer congestion. In order to bridge this gap, a congestion control mechanism based on accepting the threshold is put forward in this paper, which makes each DTN node dynamically adjust to its accepting threshold and accordingly to its congestion state. Moreover, the mechanism can be widely adopted, since it is independent of the forwarding protocols and does not affect the choice of the relay nodes made by the forwarding protocol. In order to validate the proposed mechanism, an algorithm named SimBetCC is proposed, which incorporates the congestion control mechanism with existing SimBet protocol. Experimental results show that SimBetCC can cope with congestion and also outperforms FairRoute with congestion control in many aspects, e.g., the message delivery ratio, the delivery delay.
作者 赵广松 陈鸣
出处 《软件学报》 EI CSCD 北大核心 2013年第1期153-163,共11页 Journal of Software
基金 国家自然科学基金(61070173 61103225) 国家重点基础研究发展计划(973)(2012CB315806) 江苏省自然科学基金(BK2010133)
关键词 容延网络 单副本 拥塞控制 中继节点 接收阈值 delay tolerant network single-copy congestion control relay node accepting threshold
  • 相关文献

参考文献16

  • 1Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. Technical Report, CS-2000-06, Duke University, 2000. 被引量:1
  • 2Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing Communications Review, 2003,7(3): 19-20. [doi: 10.1145/961268]. 被引量:1
  • 3Spyropoulos T, Psounis K, Raghavendra CS. Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. on Network, 2008,16(1):77-90. [doi: 10.1109/TNET.2007.897964]. 被引量:1
  • 4Balasubramanian A, Levine BN, Venkataramani A. DTN routing as a resource allocation problem. In: Proc. of the ACM SIGCOMM 2007. Kyoto: ACM Press, 2007. 373-384. [doi: 10.1145/1282380.1282422]. 被引量:1
  • 5Burgess J, Gallagher B, Jensen D, Levine BN. MaxPrup: Routing for vehicle-based disruption-tolerant networks. In: Proc. of the IEEE INFOCOM 2006. Barcelona: IEEE Communications Society, 2006. 1-11. [doi: 10.1109/INFOCOM.2006.228]. 被引量:1
  • 6Costa P, Mascolo C, Musolesi M, Picco GP. Socially-Aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal of Selected Areas in Communication, 2008,26(5):748-760. [doi: 10.1109/JSAC.2008.080602]. 被引量:1
  • 7Daly E, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proc. of the MobiHoc 2007. Montreal: ACM Press, 2007. 32-40. [doi: 10.1145/1288107.1288113]. 被引量:1
  • 8Pan H, Crowcroft JEY. BUBBLE rap: Social-Based forwarding in delay tolerant networks. In: Proc. of the MobiHoc 2008. Hong Kong: ACM Press, 2008.241-250. [doi: 10.1109/TMC.2010.246]. 被引量:1
  • 9Pujol J, Toledo A, Rodriguez P. Fair routing in delay tolerant networks. In: Proc. of the IEEE INFOCOM 2009. Brazil, 2009. 837-845. [doi: 10.1109/INFCOM.2009.5061993]. 被引量:1
  • 10Grundy A, Radenkovic M. Promoting congestion control in opportunistic networks. In: Proc. of the IEEE WiMob 2010. Niagara Falls, 2010. 324-330. [doi: 10.1109/WlMOB.2010.5645048]. 被引量:1

同被引文献118

  • 1Jacobson V. Congestion avoidance and control [J ]. Computer Communication Review, 1988,18(4):314-329. 被引量:1
  • 2W.RichardStevens.TCP/IP详解:卷1协议[M].范建华,胥光辉,张涛,等译.北京:机械工业出版社,2000:235-237. 被引量:1
  • 3Gao J B,Rao N S V. TCP AIMD dynamics over Internet con- necfions[J ]. IEEE Communications Letters,2005,9(1):4-6. 被引量:1
  • 4Hayder N J, Zukarnain Z A, Othman M, et al. Fairness of the TCP-based new AIMD congestion control algorithm[J ]. Journal of Theoretical and applied Information Technology,2009,12 (5): 568-576. 被引量:1
  • 5Ababou Mohamed, Elkouch Raehid, Bellafkih Mostata, et al. New Strategy to Optimize the Performance of Epidemic Routing Protocol[ J ]. International Journal of Computer Applications ,2014,4 (92) : 27 - 33. 被引量:1
  • 6Sulma Rashid, Qaisar Ayub, M. Soperi Mohd Zahid, et al. Message Drop Control Buffer Management Policy for DTN Routing Protocols [ J ]. Wireless Personal Communications ,2013 ( 1 ) : 653 - 669. 被引量:1
  • 7Ari Keranen ,Teemu Karkkainen ,Jorg Ott. Simulating Mobility and DTNs with the ONE ( Invited Paper) [ J]. Journal of Communications ,2010,5 (2) : 92 - 105. 被引量:1
  • 8王建新,龚皓,陈建二.高带宽延时网络中一种协同式拥塞控制协议[J].软件学报,2008,19(1):125-135. 被引量:20
  • 9Chen Zhongnan, Nan Guofang. Optimization of sensor de- ployment for mobile wireless sensor networks [ A ]. Inter- national Conference on Computational Intelligence and Ve- hicular System [ C ]. Washington D C: IEEE Computer Society ,2010:218-221. 被引量:1
  • 10Gundy A, Radenkovic M. Promoting congestion control in opportunistic networks [ C ]//Proc of the IEEE inforcom,Brazil, 2009 : 837 -845. 被引量:1

引证文献15

二级引证文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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