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

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

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

81 Citations (Scopus)

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 publicationIEEE Wireless Communications and Networking Conference, WCNC
Pages1193-1199
Number of pages7
Volume2
DOIs
StatePublished - 2005
Externally publishedYes
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

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

Fingerprint

Wireless ad hoc networks
Wireless networks
Network protocols
Communication

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lazos, L., Poovendran, R., Meadows, C., Syverson, P., & Chang, L. W. (2005). Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach. In IEEE Wireless Communications and Networking Conference, WCNC (Vol. 2, pp. 1193-1199). [PHY53-5] https://doi.org/10.1109/WCNC.2005.1424678

Preventing wormhole attacks on wireless ad hoc networks : A graph theoretic approach. / Lazos, Loukas; Poovendran, R.; Meadows, C.; Syverson, P.; Chang, L. W.

IEEE Wireless Communications and Networking Conference, WCNC. Vol. 2 2005. p. 1193-1199 PHY53-5.

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

Lazos, L, Poovendran, R, Meadows, C, Syverson, P & Chang, LW 2005, Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach. in IEEE Wireless Communications and Networking Conference, WCNC. vol. 2, PHY53-5, pp. 1193-1199, 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off, New Orleans, LA, United States, 3/13/05. https://doi.org/10.1109/WCNC.2005.1424678
Lazos L, Poovendran R, Meadows C, Syverson P, Chang LW. Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach. In IEEE Wireless Communications and Networking Conference, WCNC. Vol. 2. 2005. p. 1193-1199. PHY53-5 https://doi.org/10.1109/WCNC.2005.1424678
Lazos, Loukas ; Poovendran, R. ; Meadows, C. ; Syverson, P. ; Chang, L. W. / Preventing wormhole attacks on wireless ad hoc networks : A graph theoretic approach. IEEE Wireless Communications and Networking Conference, WCNC. Vol. 2 2005. pp. 1193-1199
@inproceedings{80c477767544498a8b4661bfe1950d9f,
title = "Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach",
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.",
keywords = "Ad hoc networks, Geometric random graph, Security, Vulnerability, Wormhole",
author = "Loukas Lazos and R. Poovendran and C. Meadows and P. Syverson and Chang, {L. W.}",
year = "2005",
doi = "10.1109/WCNC.2005.1424678",
language = "English (US)",
isbn = "0780389662",
volume = "2",
pages = "1193--1199",
booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

}

TY - GEN

T1 - Preventing wormhole attacks on wireless ad hoc networks

T2 - A graph theoretic approach

AU - Lazos, Loukas

AU - Poovendran, R.

AU - Meadows, C.

AU - Syverson, P.

AU - Chang, L. W.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Ad hoc networks

KW - Geometric random graph

KW - Security

KW - Vulnerability

KW - Wormhole

UR - http://www.scopus.com/inward/record.url?scp=24944466187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944466187&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2005.1424678

DO - 10.1109/WCNC.2005.1424678

M3 - Conference contribution

AN - SCOPUS:24944466187

SN - 0780389662

VL - 2

SP - 1193

EP - 1199

BT - IEEE Wireless Communications and Networking Conference, WCNC

ER -