Detecting wormhole attacks in wireless networks

Ritesh Maheshwari; Jie Gao; Samir R. Das

doi:10.1109/WIMESH.2006.288607

Detecting wormhole attacks in wireless networks

Ritesh Maheshwari
, Jie Gao
, Samir R. Das

Computer Science

Stony Brook University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.

Original language	English
Title of host publication	2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	109-111
Number of pages	3
ISBN (Print)	142440732X, 9781424407323
DOIs	https://doi.org/10.1109/WIMESH.2006.288607
State	Published - 2006
Event	2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006 - Reston, VA, United States Duration: Sep 25 2006 → Sep 28 2006

Publication series

Name	2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006

Conference

Conference	2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006
Country/Territory	United States
City	Reston, VA
Period	09/25/06 → 09/28/06

Access to Document

10.1109/WIMESH.2006.288607

Cite this

@inproceedings{fcda5c6b448d40e18985920ec9f0a8ad,

title = "Detecting wormhole attacks in wireless networks",

abstract = "We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.",

author = "Ritesh Maheshwari and Jie Gao and Das, \{Samir R.\}",

year = "2006",

doi = "10.1109/WIMESH.2006.288607",

language = "English",

isbn = "142440732X",

series = "2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "109--111",

booktitle = "2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006",

note = "2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006 ; Conference date: 25-09-2006 Through 28-09-2006",

}

Maheshwari, R, Gao, J & Das, SR 2006, Detecting wormhole attacks in wireless networks. in 2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006., 4068262, 2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006, Institute of Electrical and Electronics Engineers Inc., pp. 109-111, 2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006, Reston, VA, United States, 09/25/06. https://doi.org/10.1109/WIMESH.2006.288607

Detecting wormhole attacks in wireless networks. / Maheshwari, Ritesh; Gao, Jie; Das, Samir R.
2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006. Institute of Electrical and Electronics Engineers Inc., 2006. p. 109-111 4068262 (2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Detecting wormhole attacks in wireless networks

AU - Maheshwari, Ritesh

AU - Gao, Jie

AU - Das, Samir R.

PY - 2006

Y1 - 2006

N2 - We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.

AB - We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.

UR - https://www.scopus.com/pages/publications/43949135198

U2 - 10.1109/WIMESH.2006.288607

DO - 10.1109/WIMESH.2006.288607

M3 - Conference contribution

AN - SCOPUS:43949135198

SN - 142440732X

SN - 9781424407323

T3 - 2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006

SP - 109

EP - 111

BT - 2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2006 2nd IEEE Workshop on Wireless Mesh Networks, WiMESH 2006

Y2 - 25 September 2006 through 28 September 2006

ER -

Detecting wormhole attacks in wireless networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this