Routing Algorithm Based on Nash Equilibrium against Malicious Attacks for DTN Congestion Control

In Delay-Tolerant Network(DTN), certain malicious node might generate congestion in attack to reduce the overall performance of the whole network, especially the target of message successful delivery ratio. In this paper, a novel Nash equilibrium based congestion control routing algorithm with the function of security defense (NESD) is proposed. In the process of message delivery, node can use Nash equilibrium to compute the largest proportion of transfer messages occupancy to node memory capacity. This mechanism constrains the attack from malicious node and guarantees the message transfer of regular node. This congestion control routing algorithm for security defense is evaluated by experiment. It is important application in the field of homeland defense. The results show that related key parameters are significantly improved in DTN scenario.

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

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

[3]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

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

[5]  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).

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

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

[8]  Jie Wu,et al.  Thwarting Blackhole Attacks in Disruption-Tolerant Networks using Encounter Tickets , 2009, IEEE INFOCOM 2009.

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

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

[11]  Bruce Bueno de Mesquita,et al.  An Introduction to Game Theory , 2014 .

[12]  Martin J. Osborne,et al.  An Introduction to Game Theory , 2003 .

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

[14]  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).

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

[16]  Turgay Korkmaz,et al.  A Comparative Review of Connectivity-Based Wireless Sensor Localization Techniques , 2012, J. Internet Serv. Inf. Secur..

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

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

[19]  P. Morris.  Introduction to Game Theory , 1994 .

[20]  Xiuming Shan,et al.  Aggregate Human Mobility Modeling Using Principal Component Analysis , 2010, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

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

[22]  Karl Andersson,et al.  Interworking Techniques and Architectures for Heterogeneous Wireless Networks , 2012, J. Internet Serv. Inf. Secur..

[23]  Sencun Zhu,et al.  Resource-misuse attack detection in delay-tolerant networks , 2011, 30th IEEE International Performance Computing and Communications Conference.

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

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

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

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

[28]  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.

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