Detecting wormhole attacks in wireless networks using connectivity information

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 107-115

  Maheshwari, Ritesh ^a   Gao, Jie ^a   Das, Samir R ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

CONNECTIVITY INFORMATION; FORBIDDEN SUBSTRUCTURES; WIRELESS MULTI-HOP NETWORKS;

WIRELESS NETWORKS;

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

References (20)

1. P. Papadimitratos and Z. J. Haas, "Secure routing for mobile ad hoc networks," in SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), 2002.
2. Y. C. Hu, A. Perrig, and D. Johnson, "Packet leashes: a defense against wormhole attacks in wireless networks," in INFOCOM, 2003.
3. K. Sanzgiri, B. Dahill, B. Levine, and E. Belding-Royer, "A secure routing protocol for ad hoc networks," in International Conference on Network Protocols (ICNP), November 2002.
4. J. Eriksson, S. Krishnamurthy, and M. Faloutsos, "Truelink: A practical countermeasure to the wormhole attack," in ICNP, 2006.
5. L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks," Computer, vol. 26, no. 2, pp. 62-76, 1993.
6. A. Scaglione and Y. W. Hong, "Opportunistic large arrays: Cooperative transmission in wireless multihop ad hoc networks to reach far distances," IEEE Transactions on Signal Processing, vol. 51, no. 8, 2003.
7. L. Hu and D. Evans, "Using directional antennas to prevent wormhole attacks," in Network and Distributed System Security Symposium (NDSS), 2004.
8. N. Sastry, U. Shankar, and D. Wagner, "Secure verification of location claims," in ACM Workshop on Wireless Security (WiSe 2003), September 2003.
9. R. Poovendran and L. Lazos, "A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks," ACM Journal of Wireless Networks (WINET), 2005.
10. W. Wang and B. Bhargava, "Visualization of wormholes in sensor networks," in WiSe '04: Proceedings of the 2004 ACM workshop on Wireless security, New York, NY, USA, 2004, pp. 51-60.
11. F. Kuhn and A. Zollinger, "Ad-hoc networks beyond unit disk graphs," in Proc. 2003 Joint Workshop on Foundations of mobile computing, 2003, pp. 69-78.
12. "TOSSIM: A simulator for tinyos networks," User's manual in TinyOS documentation.
13. S. Capkun, L. Buttyn, and J. P. Hubaux, "SECTOR: Secure tracking of node encounters in multi-hop wireless networks," in 1st ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), October 2003.
14. I. Khalil, S. Bagchi, and N. B. Shroff, "LITEWORP: A Lightweight Countermeasure for the Wormhole attack in multihop wireless network," in International Conference on Dependable Systems and Networks (DSN), 2005.
15. I. Khalil, S. Bagchi, and N. Shroff, "MOBIWORP: Mitigation of the wormhole attack in mobile multihop wireless networks," in Second International Conference on Security and Privacy in Communication Networks (SecureComm 2006), 2006.
16. H. Breu and D. G. Kirkpatrick, "Unit disk graph recognition is NP-hard," Computational Geometry. Theory and Applications, vol. 9, no. 1-2, pp. 3-24, 1998. [Online]. Available: citeseer.ist.psu.edu/breu93unit. html
17. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. New York, NY: Springer-Verlag, 1993.
18. M. R. Garey, R. L. Graham, and D. S. Johnson, "Some NP-complete geometric problems," in Proc. 8th Annu ACM Sympos. Theory Comput., 1976, pp. 10-22.
19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W. H. Freeman, 1979.
20. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker, "Complex behavior at scale: An experimental study of low-power wireless sensor networks," UCLA, Tech. Rep. UCLA/CSD-TR 02-0013, 2002.