JR-SND: Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks

Rui Zhang, Yanchao Zhang, Xiaoxia Huang

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

7 Citations (Scopus)

Abstract

Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exchange messages to discover and authenticate each other. It is vulnerable to the jamming attack in which the adversary intentionally sends radio signals to prevent neighboring nodes from exchanging messages. Anti-jamming communications often rely on spread-spectrum techniques which depend on a spreading code common to the communicating parties but unknown to the jammer. The spread code is, however, impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependency, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jammingresilient secure neighbor discovery scheme for MANETs based on Direct Sequence Spread Spectrum and random spread-code pre-distribution. JR-SND enables neighboring nodes to securely discover each other with overwhelming probability despite the presence of omnipresent jammers. Detailed theoretical and simulation results confirm the efficacy and efficiency of JRSND.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Pages529-538
Number of pages10
DOIs
StatePublished - 2011
Event31st International Conference on Distributed Computing Systems, ICDCS 2011 - Minneapolis, MN, United States
Duration: Jun 20 2011Jul 24 2011

Other

Other31st International Conference on Distributed Computing Systems, ICDCS 2011
CountryUnited States
CityMinneapolis, MN
Period6/20/117/24/11

Fingerprint

Jamming
Mobile ad hoc networks
Atmospheric spectra
Communication

Keywords

  • Jamming
  • MANET
  • Secure neighbor discovery

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Zhang, R., Zhang, Y., & Huang, X. (2011). JR-SND: Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks. In Proceedings - International Conference on Distributed Computing Systems (pp. 529-538). [5961707] https://doi.org/10.1109/ICDCS.2011.53

JR-SND : Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks. / Zhang, Rui; Zhang, Yanchao; Huang, Xiaoxia.

Proceedings - International Conference on Distributed Computing Systems. 2011. p. 529-538 5961707.

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

Zhang, R, Zhang, Y & Huang, X 2011, JR-SND: Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks. in Proceedings - International Conference on Distributed Computing Systems., 5961707, pp. 529-538, 31st International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, MN, United States, 6/20/11. https://doi.org/10.1109/ICDCS.2011.53
Zhang R, Zhang Y, Huang X. JR-SND: Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks. In Proceedings - International Conference on Distributed Computing Systems. 2011. p. 529-538. 5961707 https://doi.org/10.1109/ICDCS.2011.53
Zhang, Rui ; Zhang, Yanchao ; Huang, Xiaoxia. / JR-SND : Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks. Proceedings - International Conference on Distributed Computing Systems. 2011. pp. 529-538
@inproceedings{8de4a138f7cd43d8b09495e8dd944c61,
title = "JR-SND: Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks",
abstract = "Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exchange messages to discover and authenticate each other. It is vulnerable to the jamming attack in which the adversary intentionally sends radio signals to prevent neighboring nodes from exchanging messages. Anti-jamming communications often rely on spread-spectrum techniques which depend on a spreading code common to the communicating parties but unknown to the jammer. The spread code is, however, impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependency, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jammingresilient secure neighbor discovery scheme for MANETs based on Direct Sequence Spread Spectrum and random spread-code pre-distribution. JR-SND enables neighboring nodes to securely discover each other with overwhelming probability despite the presence of omnipresent jammers. Detailed theoretical and simulation results confirm the efficacy and efficiency of JRSND.",
keywords = "Jamming, MANET, Secure neighbor discovery",
author = "Rui Zhang and Yanchao Zhang and Xiaoxia Huang",
year = "2011",
doi = "10.1109/ICDCS.2011.53",
language = "English (US)",
isbn = "9780769543642",
pages = "529--538",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",

}

TY - GEN

T1 - JR-SND

T2 - Jamming-resilient secure neighbor discovery in mobile Ad Hoc networks

AU - Zhang, Rui

AU - Zhang, Yanchao

AU - Huang, Xiaoxia

PY - 2011

Y1 - 2011

N2 - Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exchange messages to discover and authenticate each other. It is vulnerable to the jamming attack in which the adversary intentionally sends radio signals to prevent neighboring nodes from exchanging messages. Anti-jamming communications often rely on spread-spectrum techniques which depend on a spreading code common to the communicating parties but unknown to the jammer. The spread code is, however, impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependency, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jammingresilient secure neighbor discovery scheme for MANETs based on Direct Sequence Spread Spectrum and random spread-code pre-distribution. JR-SND enables neighboring nodes to securely discover each other with overwhelming probability despite the presence of omnipresent jammers. Detailed theoretical and simulation results confirm the efficacy and efficiency of JRSND.

AB - Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exchange messages to discover and authenticate each other. It is vulnerable to the jamming attack in which the adversary intentionally sends radio signals to prevent neighboring nodes from exchanging messages. Anti-jamming communications often rely on spread-spectrum techniques which depend on a spreading code common to the communicating parties but unknown to the jammer. The spread code is, however, impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependency, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jammingresilient secure neighbor discovery scheme for MANETs based on Direct Sequence Spread Spectrum and random spread-code pre-distribution. JR-SND enables neighboring nodes to securely discover each other with overwhelming probability despite the presence of omnipresent jammers. Detailed theoretical and simulation results confirm the efficacy and efficiency of JRSND.

KW - Jamming

KW - MANET

KW - Secure neighbor discovery

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

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

U2 - 10.1109/ICDCS.2011.53

DO - 10.1109/ICDCS.2011.53

M3 - Conference contribution

SN - 9780769543642

SP - 529

EP - 538

BT - Proceedings - International Conference on Distributed Computing Systems

ER -