Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach

L. Lazos, R. Poovendran, C. Meadows, P. Syverson, L. W. Chang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

82 Scopus citations

Abstract

We study the problem of characterizing the wormhole attack, an attack that can be mounted on a wide range of wireless network protocols without compromising any cryptographic quantity or network node. Making use of geometric random graphs induced by the communication range constraint of the nodes, we present the necessary and sufficient conditions for detecting and defending against wormholes. Using our theory, we also present a defense mechanism based on local broadcast keys. We believe our work is the first one to present analytical calculation of the probabilities of detection. We also present simulation results to illustrate our theory.

Original languageEnglish (US)
Title of host publication2005 IEEE Wireless Communications and Networking Conference, WCNC 2005
Subtitle of host publicationBroadband Wireless for the Masses - Ready for Take-off
Pages1193-1199
Number of pages7
DOIs
StatePublished - 2005
Event2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off - New Orleans, LA, United States
Duration: Mar 13 2005Mar 17 2005

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
Volume2
ISSN (Print)1525-3511

Other

Other2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
CountryUnited States
CityNew Orleans, LA
Period3/13/053/17/05

Keywords

  • Ad hoc networks
  • Geometric random graph
  • Security
  • Vulnerability
  • Wormhole

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach'. Together they form a unique fingerprint.

Cite this