Efficiency and detectability of random reactive jamming in carrier sense wireless networks
Ni An, Steven Weber

TL;DR
This paper models the behavior of reactive jammers in wireless networks using Markov chains, analyzing their detectability and optimal strategies, and proposing a detection framework based on carrier sensing violations.
Contribution
It introduces a Markov chain model for reactive jamming detection and optimizes the jammer's behavior to evade detection while disrupting communication.
Findings
Derived the receiver operating characteristic for detection
Identified the tradeoff between jamming effectiveness and detectability
Proposed an optimized reactive jamming strategy
Abstract
A natural basis for the detection of a wireless random reactive jammer (RRJ) is the perceived violation by the detector (typically located at the access point (AP)) of the carrier sensing protocol underpinning many wireless random access protocols (e.g., WiFi). Specifically, when the wireless medium is perceived by a station to be busy, a carrier sensing compliant station will avoid transmission while a RRJ station will often initiate transmission. However, hidden terminals (HTs), i.e., activity detected by the AP but not by the sensing station, complicate the use of carrier sensing as the basis for RRJ detection since they provide plausible deniability to a station suspected of being an RRJ. The RRJ has the dual objectives of avoiding detection and effectively disrupting communication, but there is an inherent performance tradeoff between these two objectives. In this paper we capture…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Distributed Sensor Networks and Detection Algorithms
