اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNon-Coherent Fast-Forward Relays for Full-Duplex Jamming Attack
86
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This work addresses a strategy to mitigate jamming attack on low-latency communication by a Full-Duplex (FD) adversary in fast-fading channel conditions. The threat model is such that the FD adversary can jam a frequency band and measure the jammed bands power level. We first point out that due to the presence of this FD adversary, Frequency Hopping (FH) fails. We then propose a fast-forward cooperative relaying scheme, wherein the victim node hops to the frequency band of a nearby FD helper node that fast-forwards the victims symbol along with its symbol. At the same time, the victim and the helper cooperatively pour some fraction of their power on the jammed band to engage the adversary. Due to fast-fading channel conditions, the victim and the helper use amplitude based non-coherent signalling referred to as Non-Coherent Fast-Forward Full-Duplex (NC-F2FD) relaying. To minimize the error-rate of this strategy, we jointly design the constellations at the helper node and the victim node by formulating an optimization problem. Using non-trivial results, we first analyse the objective function and then, based on the analytical results, propose a low-complexity algorithm to synthesize the fast-forwarded constellations. Through simulations, we show that the error performance of the victim improves after employing our countermeasure.
قيم البحث
اقرأ أيضاً
In this work, we address reliable communication of low-latency packets in the presence of a full-duplex adversary that is capable of executing a jamming attack while also being able to measure the power levels on various frequency bands. Due to the p
resence of a strong adversary, first, we point out that traditional frequency-hopping does not help since unused frequency bands may not be available, and moreover, the victims transition between the frequency bands would be detected by the full-duplex adversary. Identifying these challenges, we propose a new cooperative mitigation strategy, referred to as the Semi-Coherent Fast-Forward Full-Duplex (SC-FFFD) relaying technique, wherein the victim node, upon switching to a new frequency band, seeks the assistance of its incumbent user, which is also a full-duplex radio, to instantaneously forward its messages to the destination using a portion of their powers. Meanwhile, the two nodes cooperatively use their residual powers on the jammed frequency band so as to engage the adversary to continue executing the jamming attack on the same band. Using on-off keying (OOK) and phase-shift-keying (PSK) as the modulation schemes at the victim and the helper node, respectively, we derive upper bounds on the probability of error of jointly decoding the information symbols of the two nodes, and subsequently derive analytical solutions to arrive at the power-splitting factor between the two frequency bands to minimize the error of both the nodes. We also present extensive simulation results for various signal-to-noise-ratio values and PSK constellations to showcase the efficacy of the proposed approach.
We propose a new adversarial attack on frequency-hopping based wireless communication between two users, namely Alice and Bob. In this attack, the adversary, referred to as Eve, instantaneously modifies the transmitted signal by Alice before forwardi
ng it to Bob within the symbol-period. We show that this attack forces Bob to incorporate Eves signal in the decoding process; otherwise, treating it as noise would further degrade the performance akin to jamming. Through this attack, we show that Eve can convert a slow-fading channel between Alice and Bob to a rapid-fading one by modifying every transmitted symbol independently. As a result, neither pilot-assisted coherent detection techniques nor blind-detection methods are directly applicable as countermeasures. As potential mitigation strategies, we explore the applicability of frequency-hopping along with (i) On-Off keying (OOK) and (ii) Binary Frequency-Shift-Keying (FSK) as modulation schemes. In the case of OOK, the attacker attempts to introduce deep-fades on the tone carrying the information bit, whereas in the case of BFSK, the attacker pours comparable energy levels on the tones carrying bit-$0$ and bit-$1$, thereby degrading the performance. Based on extensive analyses and experimental results, we show that (i) when using OOK, Bob must be equipped with a large number of receive antennas to reliably detect Alices signal, and (ii) when using BFSK, Alice and Bob must agree upon a secret-key to randomize the location of the tones carrying the bits, in addition to randomizing the carrier-frequency of communication.
In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has considered information theoretic limits of the bi-directional relay channel with a
single relay. In this work we consider bi-directional relaying with multiple relays. We derive achievable rate regions and outer bounds for half-duplex protocols with multiple decode and forward relays and compare these to the same protocols with amplify and forward relays in an additive white Gaussian noise channel. We consider three novel classes of half-duplex protocols: the (m,2) 2 phase protocol with m relays, the (m,3) 3 phase protocol with m relays, and general (m, t) Multiple Hops and Multiple Relays (MHMR) protocols, where m is the total number of relays and 3<t< m+3 is the number of temporal phases in the protocol. The (m,2) and (m,3) protocols extend previous bi-directional relaying protocols for a single m=1 relay, while the new (m,t) protocol efficiently combines multi-hop routing with message-level network coding. Finally, we provide a comprehensive treatment of the MHMR protocols with decode and forward relaying and amplify and forward relaying in the Gaussian noise, obtaining their respective achievable rate regions, outer bounds and relative performance under different SNRs and relay geometries, including an analytical comparison on the protocols at low and high SNR.
This paper proposes a virtual harvest-transmit model and a harvest-transmit-store model for amplify-and-forward full-duplex relay (FDR) networks with power splitting-based simultaneous wireless information and power transfer. The relay node employs a
battery group consisting of two rechargeable batteries. By switching periodically between two batteries for charging and discharging in two consecutive time slots of each transmission block, all the harvested energy in each block has been applied for full duplex transmission in the virtual harvest-transmit model. By employing energy scheduling, the relay node switches among the harvesting, relaying, harvesting-relaying, and idle behaviors at a block level, so that a part of the harvested energy in a block can be scheduled for future usage in the harvest-transmit-store model. A greedy switching policy is designed to implement the harvest-transmit-store model, where the FDR node transmits when its residual energy ensures decoding at the destination. Numerical results verify the outage performance of the proposed schemes.
Recent work has characterized the sum capacity of time-varying/frequency-selective wireless interference networks and $X$ networks within $o(log({SNR}))$, i.e., with an accuracy approaching 100% at high SNR (signal to noise power ratio). In this pape
r, we seek similar capacity characterizations for wireless networks with relays, feedback, full duplex operation, and transmitter/receiver cooperation through noisy channels. First, we consider a network with $S$ source nodes, $R$ relay nodes and $D$ destination nodes with random time-varying/frequency-selective channel coefficients and global channel knowledge at all nodes. We allow full-duplex operation at all nodes, as well as causal noise-free feedback of all received signals to all source and relay nodes. The sum capacity of this network is characterized as $frac{SD}{S+D-1}log({SNR})+o(log({SNR}))$. The implication of the result is that the capacity benefits of relays, causal feedback, transmitter/receiver cooperation through physical channels and full duplex operation become a negligible fraction of the network capacity at high SNR. Some exceptions to this result are also pointed out in the paper. Second, we consider a network with $K$ full duplex nodes with an independent message from every node to every other node in the network. We find that the sum capacity of this network is bounded below by $frac{K(K-1)}{2K-2}+o(log({SNR}))$ and bounded above by $frac{K(K-1)}{2K-3}+o(log({SNR}))$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
