اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSecure Communications over Fading Channels
192
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy capacity of the fading wire-tap channel, which is achieved with the source node dynamically changing the power allocation according to the channel state realization. An optimal source power allocation is obtained to achieve the secrecy capacity.
قيم البحث
اقرأ أيضاً
Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading. Instead, the
base stations are connected to the central decoder through orthogonal finite-capacity links, whose connectivity is subject to random fluctuations. There is only receive-side channel state information, and hence the mobile users are unaware of the channel state and of the backhaul connectivity state, while the base stations know the fading coefficients but are uncertain about the backhaul links state. The base stations are oblivious to the mobile users codebooks and employ compress-and-forward to relay information to the central decoder. Upper and lower bounds are derived on average achievable throughput with respect to the prior distribution of the fading coefficients and of the backhaul links states. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach and layered distributed compression techniques. The upper bound is obtained by assuming that all the nodes know the channel state. Numerical results confirm the advantages of the proposed approach with respect to conventional non-robust strategies in both scenarios with and without fading.
In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert communication fr
om being detected by the warden. We propose an uncoordinated jammer selection scheme where those helpers whose instantaneous channel gains to the legitimate receiver fall below a pre-established selection threshold will be chosen as jammers radiating jamming signals to defeat the warden. By doing so, the detection accuracy of the warden is expected to be severely degraded while the desired covert communication is rarely affected. We then jointly design the optimal selection threshold and message transmission rate for maximizing covert throughput under the premise that the detection error of the warden exceeds a certain level. Numerical results are presented to validate our theoretical analyses. It is shown that the multi-jammer assisted covert communication outperforms the conventional single-jammer method in terms of covert throughput, and the maximal covert throughput improves significantly as the total number of helpers increases, which demonstrates the validity and superiority of our proposed scheme.
A major performance degrading factor in free space optical communication (FSO) systems is atmospheric turbulence. Spatial diversity techniques provide a promising approach to mitigate turbulence-induced fading. In this paper, we study the error rate
performance of FSO links with spatial diversity over atmospheric turbulence channels described by the Double Generalized Gamma distribution which is a new generic statistical model covering all turbulence conditions. We assume intensity modulation/direct detection with on-off keying and present the BER performance of single-input multiple-output (SIMO), multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) FSO systems over this new channel model.
We assume a full-duplex (FD) cooperative network subject to hostile attacks and undergoing composite fading channels. We focus on two scenarios: textit{a)} the transmitter has full CSI, for which we derive closed-form expressions for the textit{avera
ge secrecy rate}; and textit{b)} the transmitter only knows the CSI of the legitimate nodes, for which we obtain closed-form expressions for the textit{secrecy outage probability}. We show that secure FD relaying is feasible, even under strong self-interference and in the presence of sophisticated multiple antenna eavesdropper.
The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wire-tap c
hannel, in which two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and confidentiality of secure HARQ protocols are studied by the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance of repetition time diversity (RTD) and incremental redundancy (INR) protocols are investigated based on good Wyner code sequences, which ensure that the confidential message is decoded successfully by the legitimate receiver and is kept in total ignorance by the eavesdropper for a given set of channel realizations. This paper first illustrates that there exists a good rate-compatible Wyner code family which ensures a secure INR protocol. Next, two types of outage probabilities, connection outage and secrecy outage probabilities are defined in order to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdroppers link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical computations demonstrate the benefits of HARQ protocols to throughput and secrecy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
