Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks

Rui Zhang, Jingchao Sun, Yanchao Zhang, Xiaoxia Huang

Research output: Contribution to journalArticle

9 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 transmits 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, however, is impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependence, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on direct-sequence spread spectrum and random spread-code predistribution. 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 JR-SND.

Original languageEnglish (US)
Article number7115955
Pages (from-to)5588-5601
Number of pages14
JournalIEEE Transactions on Wireless Communications
Volume14
Issue number10
DOIs
StatePublished - Oct 1 2015

Fingerprint

Jamming
Mobile ad hoc networks
Mobile Ad Hoc Networks
Spread Spectrum
Vertex of a graph
Atmospheric spectra
Efficacy
Attack
Unknown
Communication
Simulation

Keywords

  • Jamming
  • MANET
  • secure neighbor discovery

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks. / Zhang, Rui; Sun, Jingchao; Zhang, Yanchao; Huang, Xiaoxia.

In: IEEE Transactions on Wireless Communications, Vol. 14, No. 10, 7115955, 01.10.2015, p. 5588-5601.

Research output: Contribution to journalArticle

Zhang, Rui ; Sun, Jingchao ; Zhang, Yanchao ; Huang, Xiaoxia. / Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks. In: IEEE Transactions on Wireless Communications. 2015 ; Vol. 14, No. 10. pp. 5588-5601.
@article{2d9aae8984f54becb8a0534f8cf1105b,
title = "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 transmits 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, however, is impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependence, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on direct-sequence spread spectrum and random spread-code predistribution. 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 JR-SND.",
keywords = "Jamming, MANET, secure neighbor discovery",
author = "Rui Zhang and Jingchao Sun and Yanchao Zhang and Xiaoxia Huang",
year = "2015",
month = "10",
day = "1",
doi = "10.1109/TWC.2015.2439688",
language = "English (US)",
volume = "14",
pages = "5588--5601",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks

AU - Zhang, Rui

AU - Sun, Jingchao

AU - Zhang, Yanchao

AU - Huang, Xiaoxia

PY - 2015/10/1

Y1 - 2015/10/1

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 transmits 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, however, is impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependence, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on direct-sequence spread spectrum and random spread-code predistribution. 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 JR-SND.

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 transmits 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, however, is impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependence, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on direct-sequence spread spectrum and random spread-code predistribution. 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 JR-SND.

KW - Jamming

KW - MANET

KW - secure neighbor discovery

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

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

U2 - 10.1109/TWC.2015.2439688

DO - 10.1109/TWC.2015.2439688

M3 - Article

VL - 14

SP - 5588

EP - 5601

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 10

M1 - 7115955

ER -