Contact avoidance routing in delay tolerant networks

Delay tolerant networks (DTNs) are widely adopted to many network applications, such as disaster recovery and battlefield communications. Such critical network scenarios call for an outright prevention mechanism against contact-based attacks, e.g., blackmailing a legitimate user to compromise sensitive information at a contact. To the best of our knowledge, there is no work on secure routing protocol against contact-based attacks in DTNs. Therefore, in this paper, we first formulate the problem of contact avoidance routing, in which the node holding a message tries to avoid having a contact with an adversary. By applying the phase-type distribution, we build the secure opportunistic path model, which integrates the delivery probability within the deadline and the safety of opportunistic paths. Then, we propose a contact avoidance routing (CAR) protocol to securely deliver a message to its destination against the contact-based compromise attack. In addition, we further propose an adaptive CAR (A-CAR) to accommodate complicated network scenarios, where the capabilities of adversaries are parameterized. The extensive simulations using real traces as well as random graphs demonstrate that the proposed CAR and A-CAR protocols achieve their design goals.

[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]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[3]  Hanoch Levy,et al.  Area Avoidance Routing in Distance-Vector Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[5]  Thomas F. La Porta,et al.  Networking smartphones for disaster recovery , 2016, 2016 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[6]  Guohong Cao,et al.  Supporting Cooperative Caching in Disruption Tolerant Networks , 2011, 2011 31st International Conference on Distributed Computing Systems.

[7]  Xiuzhen Cheng,et al.  Routing in pocket switched networks , 2012, IEEE Wireless Communications.

[8]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[9]  Peter L. Reiher,et al.  Securing data through avoidance routing , 2009, NSPW '09.

[10]  Qinghua Li,et al.  Mitigating Routing Misbehavior in Disruption Tolerant Networks , 2012, IEEE Transactions on Information Forensics and Security.

[11]  Qinghua Li,et al.  Forwarding redundancy in opportunistic mobile networks: Investigation and elimination , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[12]  Bobby Bhattacharjee,et al.  Alibi Routing , 2015, Comput. Commun. Rev..

[13]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[14]  Mooi Choo Chuah,et al.  Detecting wormhole attacks in delay-tolerant networks [Security and Privacy in Emerging Wireless Networks] , 2010, IEEE Wireless Communications.

[15]  Jie Wu,et al.  An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[16]  C. O'Cinneide Phase-type distributions: open problems and a few properties , 1999 .

[17]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[18]  Pan Hui,et al.  CRAWDAD dataset cambridge/haggle (v.2009-05-29) , 2009 .

[19]  Jie Wu,et al.  Multi-path Based Avoidance Routing in Wireless Networks , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[20]  Hanoch Levy,et al.  Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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