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.
- secure neighbor discovery
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Science Applications
- Applied Mathematics