Thwarting blackhole attacks in distruption-tolerant networks using encounter tickets

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2428-2436

  Li, Feng ^a   Wu, Jie ^a   Srinivasan, Avinash ^b  

^a Florida Atlantic Univ   (United States)

^b BLOOMSBURG UNIVERSITY   (United States)

Author keywords

Blackhole attacks; Disruption tolerant networks (DTNs); Encounter tickets; Observation; PKI; Security; Uncertainty

Indexed keywords

BLACKHOLE ATTACKS; DISRUPTION-TOLERANT NETWORKS (DTNS); ENCOUNTER TICKETS; OBSERVATION; PKI; SECURITY; UNCERTAINTY;

FORMAL LOGIC;

ROUTING ALGORITHMS;

EID: 70349684505     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062170     Document Type: Conference Paper

References (23)

1. S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In Proc. of ACM SIGCOMM, 2004.
2. A. Balasubramanianm, B. Levine, and A. Venkataramani. DTN routing as a resource allocation problem. In Proc. of ACM SIGCOMM, 2007.
3. J. Burgess, B. Gallagher, D. Jensen, and B. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proc. of IEEE INFOCOM, 2006.
4. A. Lindgren and A. Doria. Probabilistic Routing Protocol for Intermittently Connected Networks. draft-lindgren-dtnrg-prophet-03, 2007.
5. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. In Proc. of ACM MobiHoc, 2003.
6. Y. Hu and A. Perrig. A survey of secure wireless ad hoc routing. In Proc. of IEEE Security and Privacy, 2004.
7. A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24-29, 2007.
8. S. Merugu, M. Ammar, and E. Zegura. Space-time routing in wireless networks with predictable mobility. In Technical Report GIT-CC-04-07, College of Computing, Georgia Institute of Technology, 2004.
9. A. Pentland, R. Fletcher, and A. Hasson. Daknet: Rethinking connectivity in developing nations. IEEE Computer, 37(1):78-83, 2004.
10. B. Burns, O. Brock, and B. Levine. MORA routing and capacity building in disruption-tolerant networks. Elsevier Ad hoc Networks Journal, 6(4):600-620, June 2008.
11. L. Song and D. Kotz. Evaluating opportunistic routing protocols with large realistic contact traces. In Proc. of ACM MobiCom Workshop on Challenged Networks (CHANTS), 2007.
12. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proc. of IEEE PERCOM, 2007.
13. R. Maheshwari, J. Gao, and S. R. Das. Detecting wormhole attacks in wireless networks using connectivity information. In Proc. of IEEE INFOCOM, 2007.
14. Y. Hu, A. Perrig, and D. Johnson. Ariadne: A secure on-demand routing protocol for ad hoc networks. In Proc. of ACM MobiCom, 2002.
15. J. Eriksson, S. Krishnamurthy, and M. Faloutsos. Truelink: A practical countermeasure to the wormhole attack. In Proc. of IEEE ICNP, 2006.
16. S. Capkun, L. Buttyan, and J. Hubaux. Sector: Secure tracking of node encounters in multi-hop wireless networks. In Proc. of ACM SASN, 2003.
17. Y. Sun, Z. Han, W. Yu, and K. Liu. A trust evaluation framework in distributed networks: Vulnerability analysis and defense against attacks. In Proc. of IEEE INFOCOM, 2006.
18. M. Carbone, M. Nielsen, and V. Sassone. A formal model for trust in dynamic networks. In BRICS Report RS-03-4, 2003.
19. S. Buchegger and J. Boudec. Performance analysis of the confidant protocol. In Proc. of ACM MobiHoc, pages 226-236, 2002.
20. P. Michiardi and R. Molva. Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In Communications and Multimedia Security, pages 107-121, 2002.
21. F. Li and J. Wu. Mobility reduces uncertainty in MANETs. In Proc. of IEEE INFOCOM, 2007.
22. G. Shafer. A Mathematical Theory of Evidence. Princeton University Press, 1976.
23. J. Burgess, G. Bissias, M. Corner, and B. Levine. Surviving attacks on disruption-tolerant networks without authentication. In Proc. of ACM MobiHoc, 2007.