Routing Algorithm Based on Ant Colony Optimization for DTN Congestion Control

Due to the limitation of DTN resource and intermittent connection, it's challenging to design a mechanism which achieves high message delivery successful ratio and control congestion to satisfy the demand. In this paper, a novel DTN congestion control routing mechanism, Ant Colony Optimization(ACO) for DTN congestion control algorithm(ADC) is proposed. In the message delivery, this mechanism can actively leverage pheromone and heuristic in ACO to evaluate the selection of transfer node. Pheromone can guarantee the message successful delivery ratio and heuristic prevent network congestion in real time. The evaluation of this congestion control routing algorithm shows the evident improvement of some parameters in network circumstance.

[1]  Raj Jain,et al.  Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I: Concepts, Goals and Methodology , 1988, ArXiv.

[2]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[3]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[4]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[5]  Victor Firoiu,et al.  A study of active queue management for congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

[7]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[8]  Fernando Paganini,et al.  Congestion control for high performance, stability, and fairness in general networks , 2005, IEEE/ACM Transactions on Networking.

[9]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[10]  Nei Kato,et al.  Wireless loss-tolerant congestion control protocol based on dynamic aimd theory , 2010, IEEE Wireless Communications.

[11]  Kevin R. Fall,et al.  Storage routing for DTN congestion control , 2007, Wirel. Commun. Mob. Comput..

[12]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[13]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[15]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[16]  Kevin R. Fall,et al.  Alternative custodians for congestion control in delay tolerant networks , 2006, CHANTS '06.

[17]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[19]  Brighten Godfrey,et al.  Incentive compatibility and dynamics of congestion control , 2010, SIGMETRICS '10.

[20]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[21]  Wei Hong,et al.  Custody Transfer for Reliable Delivery in Delay Tolerant Networks , 2003 .