Anti-jamming Communication Research Articles

Wireless Communications under Broadband Reactive Jamming Attacks

A reactive jammer jams wireless channels only when target devices are transmitting; Compared to constant jamming, reactive jamming is harder to track and compensate against [2] , [38] . Frequency hopping spread spectrum (FHSS) and direct sequence spread spectrum (DSSS) have been widely used as countermeasures against jamming attacks. However, both will fail if the jammer jams all frequency channels or has high transmit power. In this paper, we propose an anti-jamming communication system that allows communication in the presence of a broadband and high power reactive jammer. The proposed system transmits messages by harnessing the reaction time of a reactive jammer. It does not assume a reactive jammer with limited spectrum coverage and transmit power, and thus can be used in scenarios where traditional approaches fail. We develop a prototype of the proposed system using GNURadio. Our experimental evaluation shows that when a powerful reactive jammer is present, the prototype still keeps communication, whereas other schemes such as 802.11 DSSS fail completely.

Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks

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.

Adaptive Jamming Suppression in Coherent FFH System Using Weighted Equal Gain Combining Receiver over Fading Channels with Imperfect CSI

Fast frequency hopping (FFH) is commonly used as an antijamming communication method. In this paper, we propose efficient adaptive jamming suppression schemes for binary phase shift keying (BPSK) based coherent FFH system, namely, weighted equal gain combining (W-EGC) with the optimum and suboptimum weighting coefficient. We analyze the bit error ratio (BER) of EGC and W-EGC receivers with partial band noise jamming (PBNJ), frequency selective Rayleigh fading, and channel estimation errors. Particularly, closed-form BER expressions are presented with diversity order two. Our analysis is verified by simulations. It is shown that W-EGC receivers significantly outperform EGC. As compared to the maximum likelihood (ML) receiver in conventional noncoherent frequency shift keying (FSK) based FFH, coherent FFH/BPSK W-EGC receivers also show significant advantages in terms of BER. Moreover, W-EGC receivers greatly reduce the hostile jammers’ jamming efficiency.

Study on Pattern Reconfiguration of Plasma Antenna Excited by Surface Wave

For the purpose of anti-jamming communications, the radiation pattern reconfiguration of plasma antenna excited by surface wave were studied. The self-consistent model used to describe the relation between the pump signal and radiation pattern is put forward by combining the Boltzmann Equation and Maxwell Equation. And the correctness of the model is validated by using FDTD approach. The experiment system that used to measure the radiation pattern is established to validate the correctness of the self-consistent model. The investigation results show that the radiation pattern are reconfigurable by controlling the pump signal.

A Survey on Preventing Jamming Attacks in Wireless Communication

Communication in wireless network is possible with an air medium. Due to the high security threats in this system, the network may face various difficulties. One of the major threat is jamming attack which comes under Denial Of Service (DOS) attack. Jamming attack is common among many exploits that compromises the wireless environment. The work of authorized users is by denying service to as legitimate traffic is jammed by the overwhelming frequencies of illegitimate traffic.In order to mitigate the impact of jamming, three techniques are being used: (a) how to thwart jamming in control channel (b) An Anti-jamming broadcast communication using Uncoordinated Spread Spectrum (USS) technique (c) Mitigating jamming impact in timing channel. We analyse these methods for reducing jamming inside a network.

Towards Optimal Adaptive UFH-Based Anti-Jamming Wireless Communication

Anti-jamming communication without pre-shared secrets has gained increasing research interest recently and is commonly tackled by utilizing the technique of uncoordinated frequency hopping (UFH). Existing researches, however, are almost all based on ad hoc designs of frequency hopping strategies, mainly due to lack of theoretical foundations for scheme performance evaluation. To fill this gap, in this paper we introduce the online optimization theory into our solution and, for the first time, make the thorough quantitative performance characterization possible for UFH-based anti-jamming communications. Specifically, we formulate the UFH-based anti-jamming communication as a non-stochastic multi-armed bandit (MAB) problem and propose an online learning-based UFH algorithm achieving asymptotic optimum. To reduce the time and space complexity, we further develop an enhanced algorithm exploiting the internal structure of strategy selection process. We analytically prove the optimality of the proposed algorithms under various message coding scenarios. An extensive simulation study is conducted to validate our theoretical analysis and show that the learning-based UFH algorithms are resilient against both oblivious and adaptive jamming attacks.

Compromise-resilient anti-jamming communication in wireless sensor networks

Jamming is a kind of Denial-of-Service attack in which an adversary purposefully emits radio frequency signals to corrupt the wireless transmissions among normal nodes. Although some research has been conducted on countering jamming attacks, few works consider jamming attacks launched by insiders, where an attacker first compromises some legitimate sensor nodes to acquire the common cryptographic information of the sensor network and then jams the network through those compromised nodes. In this paper, we address the insider jamming problem in wireless sensor networks. In our proposed solutions, the physical communication channel of a sensor network is determined by the group key shared by all the sensor nodes. When insider jamming happens, the network will generate a new group key to be shared only by the non-compromised nodes. After that, the insider jammers are revoked and will not be able to predict the future communication channels used by the non-compromised nodes. Specifically, we propose two compromise-resilient anti-jamming schemes: the split-pairing scheme which deals with a single insider jammer, and the key-tree-based scheme which copes with multiple colluding insider jammers. We implement and evaluate the proposed solutions using Mica2 Motes. Experimental results show that our solutions have low recovery latency and low communication overhead, and hence they are suitable for resource constrained sensor networks.

Modulation and Simulation of Subcarriers Skipping Anti-jamming Communication for HF Multitone Parallel Transmission

摘要: 论文建立了短波数据链多音并行体制的通信仿真模型，在此模型的基础上分析研究了其抗窄带干扰和宽带干扰的性能。提出了一种针对窄带多音干扰的短波数据链副载波跳变抗干扰新方法，并通过建立的通信仿真模型多音副载波在信道带宽内、信道带宽外跳变等多种条件下进行了仿真。仿真结果表明，基于多音并行体制短波战术数据链通信使用该方法能够有效躲避多音等窄带干扰。 关键词: 短波通信 / 多音并行 / 副载波跳变 / 抗干扰

Anti-jamming broadcast communication using uncoordinated spread spectrum techniques

Jamming-resistant communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. In such applications, mission-critical messages are broadcast to a large and unknown number of (potentially untrusted) receivers that rely on the availability, integrity, and authenticity of the messages; here, availability primarily refers to the ability to communicate in the presence of jamming. Common techniques to counter jamming-based denial-of-service attacks such as Frequency Hopping (FH) and Direct Sequence Spread Spectrum (DSSS) cannot be applied in such settings because they depend on secret pairwise or group keys shared between the sender and the receivers before the communication. This dependency entails serious or unsolvable scalability and keysetup problems or weak jamming-resistance (a single malicious receiver can compromise the whole system). As a solution, in this work, we propose uncoordinated spread spectrum techniques that enable anti-jamming broadcast communication without shared secrets. Uncoordinated spread spectrum techniques can handle an unlimited amount of (malicious) receivers. We present two instances (Uncoordinated FH and Uncoordinated DSSS) and analyze differences in their performance as well as their combination. We further discuss the applications of these techniques to anti-jamming navigation broadcast, bootstrapping of coordinated spread spectrum communication, and anti-jamming emergency alerts.

A perspective on the evolution of multiple access satellite communication

The evolution of communication satellites is reviewed, with an emphasis on multiple access by large populations of users employing mobile and personal terminals. It is argued that the basic problem of mutual interference rejection is most effectively solved by employing modern digital technology to implement spread-spectrum modulation systems based on military antijam communication systems which are inherently robust to interference. A perspective on the impact of this approach on future networks of low-Earth-orbit satellites is presented, along with concluding remarks on the well-established theoretical foundations of emerging satellite technologies. >

Performance of error-erasure-correction decoding of Reed-Solomon codes for frequency-hop communications in multitone interference

The performance of a recently proposed efficient anti-jam communication system is examined. The system employs frequency hopping, MFSK modulation, diversity, Reed-Solomon (RS) coding and parallel error-erasure-correction decoding. It has previously been shown to be very effective in partial band noise jamming, and is one of the best known systems against jamming. In the paper, the performance of the system in multitone jamming is evaluted. An exact method is used rather than a bounding technique. The worst case jamming parameter is determined. In the worst case of multitone jamming, the conclusion is twofold. When the redundancy is not large, from the jammer's point of view, multitone jamming tends to be more effective than partial band noise jamming for nonbinary FSK. However, when large redundancy can be provided by diversity and RS coding, the worst case multitone jamming, one jamming tone per M-ary band, can be nullified with a properly designed system. The optimum design of the system under worst case jamming is presented in terms of the combination of MFSK, diversity and RS coding. This forces the jammer to consider using multiple jamming tones per M-ary band. For a system having low redundancy, the design is locally optimised. These results provide detailed information on the design of a robust system.

PLRS development testing

A description is given of the Position Location Reporting System (PLRS), which provides position location, tracking, and reporting for communities of hundreds of cooperating users in a tactical environment. PLRS uses time-of-arrival measurements aided by barometric pressure measurements to establish position tracking of these large communities of user terminals. The system uses the positions of a few user terminals as grid references, so that all positions are available both to the cooperating users and to command centers. All control, measurement reporting, and data exchange are cryptographically secured in a synchronous antijam communications network. Testing with live communities of 50 or more user terminals has been conducted at many sites throughout the US and in West Germany, with consistently good results. In addition, testing has been accomplished with computer-simulated communities of up to 380 user terminals. Recent live testing has successfully demonstrated an automated GPS interface for operation without fixed grid reference units. Results are presented, with an emphasis on position accuracy tests.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Error-Correcting Codes Against the Worst-Case Partial-Band Jammer

This paper provides performance analyses of a broad spectrum of error-correcting codes in an antijam communication system under worst-case partial-band noise jamming conditions. These analyses demonstrate the coding advantages available for systems operating with and without frequency diversity. Utilizing both the exact approach (where possible) and upper-bounding approaches (Chernoff and union bounds), the decoded bit error rates for typical error-correcting codes (binary and M -ary, block and convolutional) have been obtained, and these codes have been compared according to the E_{b}/N_{0} required to achieve a bit error rate of 10-5. The best performance is achieved with the use of M -ary signaling and optimum diversity with M -ary codes, such as Reed-Solomon block codes, dual- k convolutional codes, convolutional orthogonal codes, or concatenated codes.

Partial Processing Satellite Relays for Frequency-Hop Antijam Communications

Military satellite communications systems may be implemented with varying levels of satellite on-board processing. For frequency-hop (FH) spread-spectrum signals two options are the dehop-rehop transponder (DRT) and the symbol regenerative processor (SRP). This paper considers FH, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</tex> -ary FSK modulation in the presence of full band and worst case partial-band noise jamming. The relationships among end-to-end signal-to-noise ratio (SNR) performance or probability of bit errors and the uplink and downlink SNR are derived. For a DRT, an additional parameter is the satellite filter bandwidth W <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> since this may differ from the despread modulation bandwidth W <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</inf> for a particular user access under TDMA variable-data-rate operation. The SNR performance in this case depends upon the ratio <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">W_{s}/W_{r}</tex> a well as the uplink and downlink SNR. The resulting penalty in the link budget of the weaker of the uplink or downlink is much less than the mismatched ratio <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">W_{s}/W_{r}</tex> and diminishes as the links become unbalanced. The SRP slightly outperforms the DRT but it is more complex and does not as easily accommodate variable data rates.

Design trade-offs in antijam military satellite communications

Design trade-offs in antijam military satellite communications

Coded Error Probability Evaluation for Antijam Communication Systems

Presents a general union-Chernoff bound on the bit error probability for coded communication systems and apply it to examples of antijam systems. The key feature of this bound is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge.