Black Holes and Revelations: Using Evolutionary Algorithms to Uncover Vulnerabilities in Disruption-Tolerant Networks

A challenging aspect in open ad hoc networks is their resilience against malicious agents. This is especially true in complex, urban-scale scenarios where numerous moving agents carry mobile devices that create a peer-to-peer network without authentication. A requirement for the proper functioning of such networks is that all the peers act legitimately, forwarding the needed messages, and concurring to the maintenance of the network connectivity. However, few malicious agents may easily exploit the movement patterns in the network to dramatically reduce its performance. We propose a methodology where an evolutionary algorithm evolves the parameters of different malicious agents, determining their types and mobility patterns in order to minimize the data delivery rate and maximize the latency of communication in the network. As a case study, we consider a fine-grained simulation of a large-scale disruption-tolerant network in the city of Venice. By evolving malicious agents, we uncover situations where even a single attacker can hamper the network performance, and we correlate the performance decay to the number of malicious agents.

[1]  Qinghua Li,et al.  To Lie or to Comply: Defending against Flood Attacks in Disruption Tolerant Networks , 2013, IEEE Transactions on Dependable and Secure Computing.

[2]  Ellen W. Zegura,et al.  Understanding the wireless and mobile network space: a routing-centered classification , 2007, CHANTS '07.

[3]  Giovanni Squillero,et al.  Evolutionary Optimization: the µGP toolkit , 2011 .

[4]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[5]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[6]  John Burgess,et al.  Surviving attacks on disruption-tolerant networks without authentication , 2007, MobiHoc '07.

[7]  Andrew Jenkins,et al.  Delay/Disruption-Tolerant Networking: Flight test results from the international space station , 2010, 2010 IEEE Aerospace Conference.

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

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

[10]  Doina Bucur,et al.  The tradeoffs between data delivery ratio and energy costs in wireless sensor networks: a multi-objectiveevolutionary framework for protocol analysis , 2014, GECCO.

[11]  Doina Bucur,et al.  The impact of topology on energy consumption for collection tree protocols: An experimental assessment through evolutionary computation , 2014, Appl. Soft Comput..