Skip to main content
SpringerLink
Log in

Secure Multi-copy Routing in Compromised Delay Tolerant Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Routing in delay tolerant networks (DTNs) is challenging due to their unique characteristics of intermittent node connectivity. Different protocols (single-, multi-copy, erasure-coding-based etc.) utilizing store-carry-and-forward paradigm have been proposed to achieve routing of messages in such environments by opportunistic message exchanges between nodes that are in the communication range of each other. The sparsity and distributed nature of these networks together with the lack of stable connectivity between source destination pairs make these networks vulnerable to malicious nodes which might attempt to learn the content of the messages being routed between the nodes. In this paper, we study DTNs in which malicious nodes are present, to which we refer to as compromised DTNs. We discuss and analyze the effects of presence of malicious nodes on routing of messages in compromised DTNs. We propose a two period routing approach which aims at achieving the desired delivery ratio by a given delivery deadline in presence of malicious nodes. Our simulation results with both random networks and real DTN traces show that, with proper parameter setting, the proposed method can achieve delivery ratios which surpass those reached by other algorithms by a given delivery deadline.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. We use attacker and malicious node interchangeably throughout the paper.

  2. In Sect. 5, we also discuss the application of proposed algorithm to real DTN traces where nodes have heterogeneous meeting behaviors.

  3. We also show the results with no attacker for reference to the maximum achievable delivery ratios in a secure environment.

References

  1. Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In Proceedings of the ACM ASPLOS.

  2. Disruption tolerant networking. http://www.darpa.mil/ato/solicit/DTN/.

  3. Ott, J., & Kutscher, D. (2005). A disconnection-tolerant transport for drive-thru internet environments. In Proceedings of the IEEE INFOCOM.

  4. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networking. In Proceedings of the INFOCOM, pp. 1–11.

  5. Bulut, E., Geyik, S., & Szymanski, B. (2010). Efficient routing in delay tolerant networks with correlated node mobility. In Proceedings of the 7th IEEE international conference on mobile ad-hoc and sensor systems (MASS).

  6. Daly, E., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets. In Proceedings of the ACM MobiHoc.

  7. Bulut, E., & Szymanski, B. K. (2012). Exploiting friendship relations for efficient routing in mobile social networks. In Ivan Stojmenovic (Ed.), IEEE transactions on parallel and distributed systems (Vol. 23(12), pp. 2254–2265). New York: IEEE.

  8. Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communication Review, 7(3), 19–20.

    Google Scholar 

  9. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Duke University, Tech. Rep. CS-200006.

  10. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90.

    Google Scholar 

  11. Wang, Y., Jain, S., Martonosi, M., & Fall, K. (2005). Erasure coding based routing for opportunistic networks. In Proceedings of the ACM SIGCOMM workshop on delay tolerant networking (WDTN).

  12. Bulut, E., Wang, Z., & Szymanski, B. (2010). Cost efficient erasure coding based routing in delay tolerant networks. In Proceedings of the ICC, South Africa.

  13. Lin, Y., Li, B., & Liang, B. (2008). Efficient network coded data transmissions in disruption tolerant networks. In Proceedings of the IEEE INFOCOM.

  14. Burgess, J., Bissias, G. D., Comer, M. D., & Levine, B. N. (2007). Surviving attacks on disruption-tolerant networks without authentication. In Proceedings of the Mobihoc ’07, pp. 61–70.

  15. Choo, F. C., Chan, M. C., & Chang, E. (2010). Robustness of DTN against routing attacks. In Proceedings of the second international conference on communication systems and networks (COMSNETS), pp. 1–10.

  16. Li, F., & Wu, J. (2009). Thwarting blackhole attacks in disruption–tolerant networks using encounter tickets. In Proceedings of the INFOCOM, pp. 2428–2436.

  17. Nelson, S. C., Bakht, M., & Kravets, R. (2009). Encounter-based routing in DTNs. In Proceedings of the IEEE Infocom, Rio De Janeiro, Brazil, pp. 846–854.

  18. Ren, Y., Chuah, M. C., Yang, J., & Chen, Y. (2010). Muton: Detecting malicious nodes in disruption-tolerant networks. In Proceedings of the WCNC.

  19. Ren, Y., Chuah, M. C., Yang, J., & Chen, Y. (2010). Detecting blackhole attacks in disruption-tolerant networks through packet exchange recording. In Proceedings of the 1st workshop on D-SPAN (colocated with WoWMoM).

  20. Li, Q., & Cao, G. (2012). Mitigating routing misbehavior in disruption tolerant networks. In IEEE transactions on information forensics and security (to appear).

  21. Dini, G., & Duca, A. L. (2010). A reputation-based approach to tolerate misbehaving carriers in delay tolerant networks. In Proceedings of the 15th IEEE symposium on computers and communications, Italy.

  22. Li, N., & Das, S. K. (2010). RADON: Reputation-assisted data forwarding in opportunistic networks. In Proceedings of the MobiOpp, pp. 8–14.

  23. Chen, I. R., Bao, F., Chang, M. J., & Cho, J. H. (2010). Trust management for encounter-based routing in delay tolerant networks. In IEEE global communications conference, Miami, USA.

  24. Adali, S., Escriva, R., Hayvanovych, M., Magdon-Ismail, M., Szymanski, B., Wallace, W., et al. (2010). Measuring behavioral trust in social networks.In IEEE innternational conference on intelligence and security informatics (ISI 2010), pp. 150–152, Vancouver, BC, May 23–26, 2010.

  25. Bulut, E., Wang, Z., & Szymanski, B. (2010). Cost effective multi-period spraying for routing in delay tolerant networks. In IEEE/ACM transactions on networking, Vol. 18.

  26. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2006). Performance analysis of mobility-assisted routing. In MobiHoc.

  27. Srinivasa, S., & Krishnamurthy, S. (2009). CREST: An opportunistic forwarding protocol based on conditional residual time. In Proceedings of the SECON.

  28. A European Union funded project in situated and autonomic communications. www.haggleproject.org.

  29. Leguay, J., Lindgren, A., Scott, J., Friedman, T., Crowcroft, J., & Hui, P. (2006). CRAWDAD data set upmc/content (v. 2006-11-17). Downloaded from http://crawdad.cs.dartmouth.edu/upmc/content.

  30. Tournoux, P. U., Leguay, J., Benbadis, F., Conan, V., Amorim, M., & Whitbeck, J. (2009). The accordion phenomenon: Analysis, characterization, and impact on DTN pouting. In Proceedings of the INFOCOM.

  31. Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2006). Impact of human mobility on the design of opportunistic forwarding algorithms. In Proceedings of the INFOCOM.

  32. Zhang, X., Kurose, J. F., Levine, B., Towsley, D., & Zhang, H. (2007). Study of a bus-based disruption tolerant network: Mobility modeling and impact on routing. In Proceedings of the ACM MobiCom.

  33. Pujol, J. M., Toledo, A. L., & Rodriguez, P. (2009). Fair routing in delay tolerant networks. In Proceedings of the IEEE INFOCOM.

  34. Bulut, E., & Szymanski, B. (2011). On secure multi-copy based routing in delay tolerant networks. In Proceedings of the first international workshop on privacy, security and trust in mobile and wireless systems (MobiPST 2011), in conjunction with ICCN.

Download references

Author information

Authors and Affiliations

  1. 2200 E President George Bush Hwy, Richardson, TX, 75081, USA

    Eyuphan Bulut

  2. Społeczna Akademia Nauk, ul. Sienkiewicza 9, Łódź, 90-113, Poland

    Boeslaw K. Szymanski

  3. Network Science and Technology Center Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY, 12180, USA

    Boeslaw K. Szymanski

Authors
  1. Eyuphan Bulut
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boeslaw K. Szymanski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eyuphan Bulut.

Additional information

An initial version of this work is published in [34]

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bulut, E., Szymanski, B.K. Secure Multi-copy Routing in Compromised Delay Tolerant Networks. Wireless Pers Commun 73, 149–168 (2013). https://doi.org/10.1007/s11277-012-0960-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0960-4

Keywords

Search

Navigation