Congestion Control Mechanism Based on Accepting Threshold in Delay Tolerant Networks
Author:
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [17]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    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.

    Reference
    [1] Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. Technical Report, CS-2000-06, Duke University, 2000.
    [2] Lindgren 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]
    [3] Spyropoulos 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]
    [4] Balasubramanian 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]
    [5] Burgess J, Gallagher B, Jensen D, Levine BN. MaxProp: 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]
    [6] Costa 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]
    [7] Daly 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]
    [8] Pan 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]
    [9] Pujol 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]
    [10] Grundy A, Radenkovic M. Promoting congestion control in opportunistic networks. In: Proc. of the IEEE WiMob 2010. Niagara Falls, 2010. 324-330. [doi: 10.1109/WIMOB.2010.5645048]
    [11] Radenkovic M, Grundy A. Congestion aware forwarding in delay tolerant and social opportunistic networks. In: Proc. of the WONS 2011. Bardoneccia, 2011. 60-67. [doi: 10.1109/WONS.2011.5720201]
    [12] Nelson SC, Bakht M, Kravets R, HarrisIII S. Encounter-Based routing in DTNs. Mobile Computing and Communications Review, 2009,13(1):56-59. [doi: 10.1145/1558590]
    [13] Thompson N, Kravets R. Poster abstract: Understanding and controlling congestion in delay tolerant networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2009,13(3):42-45. [doi: 10.1145/1710130.1710139]
    [14] Seligman M, Fall K, Mundur P. Storage routing for DTN congestion control. Wireless Communications and Mobile Computing, 2007,7(10):1183-1196. [doi: 10.1002/wcm.v7:10]
    [15] Dawande M, Kalagnanam J, Keskinocak P, Ravi R, Salman F. Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization, 2000,4:171-186. [doi: 10.1023/A:1009894503716]
    [16] Eagle N, Pentland A. Reality mining: Sensing complex social systems. Personal and Ubiquitous Computing, 2006,10(4):255-268.
    [doi: 10.1007/s00779-005-0046-3]
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

赵广松,陈鸣.基于接收阈值的容延网络拥塞控制机制.软件学报,2013,24(1):153-163

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 20,2011
  • Revised:April 09,2012
  • Online: December 29,2012
You are the first2049429Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063