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

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

doi:10.1109/WCNC.2005.1424678

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 proceeding › Conference contribution

95 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 language	English (US)
Title of host publication	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005
Subtitle of host publication	Broadband Wireless for the Masses - Ready for Take-off
Pages	1193-1199
Number of pages	7
DOIs	https://doi.org/10.1109/WCNC.2005.1424678
State	Published - 2005
Externally published	Yes
Event	2005 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 2005 → Mar 17 2005

Publication series

Name	IEEE Wireless Communications and Networking Conference, WCNC
Volume	2
ISSN (Print)	1525-3511

Other

Other	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
Country/Territory	United States
City	New Orleans, LA
Period	3/13/05 → 3/17/05

Keywords

Ad hoc networks
Geometric random graph
Security
Vulnerability
Wormhole

ASJC Scopus subject areas

General Engineering

Access to Document

10.1109/WCNC.2005.1424678

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 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off (pp. 1193-1199). Article PHY53-5 (IEEE Wireless Communications and Networking Conference, WCNC; Vol. 2). https://doi.org/10.1109/WCNC.2005.1424678

Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach. / Lazos, L.; Poovendran, R.; Meadows, C. et al.
2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off. 2005. p. 1193-1199 PHY53-5 (IEEE Wireless Communications and Networking Conference, WCNC; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off., PHY53-5, IEEE Wireless Communications and Networking Conference, WCNC, vol. 2, 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 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off. 2005. p. 1193-1199. PHY53-5. (IEEE Wireless Communications and Networking Conference, WCNC). doi: 10.1109/WCNC.2005.1424678

@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 = "L. 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",

series = "IEEE Wireless Communications and Networking Conference, WCNC",

pages = "1193--1199",

booktitle = "2005 IEEE Wireless Communications and Networking Conference, WCNC 2005",

note = "2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off ; Conference date: 13-03-2005 Through 17-03-2005",

}

TY - GEN

T1 - Preventing wormhole attacks on wireless ad hoc networks

T2 - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off

AU - Lazos, L.

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

T3 - IEEE Wireless Communications and Networking Conference, WCNC

SP - 1193

EP - 1199

BT - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005

Y2 - 13 March 2005 through 17 March 2005

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this