Non-Coherent Fast-Forward Relays for Full-Duplex Jamming Attack

Chaudhary, Veena; Harshan, J.

doi:10.1109/globecom46510.2021.9685041

Cited by 5 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the countermeasure contributed by [15]- [17], it is assumed that the processing delay at the helper in forwarding the victim's symbols is negligible. Thus, the victim's symbols and the multiplexed symbols from the helper reach the destination during the same symbol interval.…”

Section: A Motivationmentioning

confidence: 99%

“…However, when using practical FD radios, the forwarding process may not be instantaneous, and the processing delay at the helper can be of the order of several symbol durations. In such cases, the symbols on the two links reach the destination during different symbol intervals, thereby yieliding a signal model different from that of [15]- [17]. Moreover, if the helper decides to use multiple receive-antennas to improve the diversity order, the processing delay further increases due to additional delay contributed by the self-interfernce cancellation (SIC) blocks of the FD radios [20].…”

Section: A Motivationmentioning

confidence: 99%

“…Moreover, if the helper decides to use multiple receive-antennas to improve the diversity order, the processing delay further increases due to additional delay contributed by the self-interfernce cancellation (SIC) blocks of the FD radios [20]. Thus, using practical FD radios to combat reactive adversaries has the following three consequences: (i) The existing analysis of [15]- [17] does not hold as the symbols on the Victim-to-Destination and the Helper-to-Destination links are observed at the destination in an asynchronous fashion, (ii) Due to the processing delay, a few multiplexed symbols reach the destination after the deadline, thereby violating the low-latency constraint, and (iii) The symbols on the victim's and the helper's frequencies are uncoordinated in energy, resulting in fluctuations in the average energy level of both the frequencies, thereby increasing the probability of detection by the energy detector. Thus, these limitations of the existing countermeasures motivate us to design new countermeasures that consider the helper's practical limitations in facilitating reliable and low-latency communication of the victim's symbols.…”

Section: A Motivationmentioning

confidence: 99%

See 2 more Smart Citations

Low-Latency Communication Using Delay-Aware Relays Against Reactive Adversaries

Chaudhary

Harshan

2023

IEEE Trans. Commun.

View full text Add to dashboard Cite

This work addresses a reactive jamming attack on the low-latency messages of a victim, wherein the jammer deploys countermeasure detection mechanisms to change its strategy. We highlight that the existing schemes against reactive jammers use relays with instantaneous full-duplex (FD) radios to evade the attack.However, due to the limitation of the radio architecture of the FD helper, instantaneous forwarding may not be possible in practice, thereby leading to increased decoding complexity at the destination and a high detection probability at the adversary. Pointing at this drawback, we propose a delay-aware cooperative framework wherein the victim seeks assistance from a delay-aware FD helper to forward its messages to the destination within the latency constraints. In particular, we first model the processing delay at the helper based on its hardware architecture, and then propose two low-complexity mitigation schemes, wherein the victim and the helper share their uplink frequencies using appropriate energy-splitting factors. For both the schemes, we solve the optimization problems of computing the near-optimal energy-splitting factors that minimize the joint error rates at the destination. Finally, through analytical and simulation results, we show that the proposed schemes facilitate the victim in evading the jamming attack whilst deceiving the reactive adversary.

show abstract

Section: A Motivationmentioning

confidence: 99%

Section: A Motivationmentioning

confidence: 99%

Section: A Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Low-Latency Communication Using Delay-Aware Relays Against Reactive Adversaries

Chaudhary

Harshan

2023

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…1. Some preliminary results on the NC-FFFD scheme have been presented by us in [1], where we compute the optimal energy levels at the victim and the helper for M = 2. In addition, the results of this work are generalisable for M ≥ 2.…”

Section: B Related Work and Noveltymentioning

confidence: 99%

“…8, we show the improvement in Alice's performance when using NC-FFFD relaying scheme. In terms of feasibility of implementation, the complexity analysis of TLGD algorithm has been discussed in the conference proceedings of this work [1].…”

Section: ) Two-layer Greedy Descent (Tlgd) Algorithmmentioning

confidence: 99%

Constellation Design for Non-Coherent Fast-Forward Relays to Mitigate Full-Duplex Jamming Attacks

Chaudhary¹,

Harshan²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

With potential applications to short-packet communication, we address communication of low-latency messages in fast-fading channels under the presence of a reactive jammer. Unlike a traditional jammer, we assume a full-duplex (FD) jammer capable of detecting pre-existing countermeasures and subsequently changing the target frequency band. To facilitate reliable communication amidst a strong adversary, we propose non-coherent fast-forward full-duplex relaying scheme wherein the victim uses a helper in its vicinity to fast-forward its messages to the base station, in addition to ensuring that the countermeasures are undetected by the FD adversary. Towards designing the constellations for the proposed scheme, we identify that existing non-coherent constellation for fast-fading channels are not applicable owing to the cooperative nature of the fast-forward scheme. As a result, we formulate an optimization problem of designing the non-coherent constellations at the victim and the helper such that the symbol-error-probability at the base station is minimized. We theoretically analyze the optimization problem and propose several strategies to compute near-optimal constellations based on the helper's data-rate and fast-forwarding abilities. We show that the proposed constellations provide near-optimal error performance and help the victim evade jamming.Finally, we also prove the scheme's efficacy in deceiving the countermeasure detectors at the jammer.

show abstract