اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels
225
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 channel, 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.
قيم البحث
اقرأ أيضاً
This paper studies the performance of hybrid-ARQ (automatic repeat request) in Rayleigh block fading channels. The long-term average transmitted rate is analyzed in a fast-fading scenario where the transmitter only has knowledge of channel statistics
, and, consistent with contemporary wireless systems, rate adaptation is performed such that a target outage probability (after a maximum number of H-ARQ rounds) is maintained. H-ARQ allows for early termination once decoding is possible, and thus is a coarse, and implicit, mechanism for rate adaptation to the instantaneous channel quality. Although the rate with H-ARQ is not as large as the ergodic capacity, which is achievable with rate adaptation to the instantaneous channel conditions, even a few rounds of H-ARQ make the gap to ergodic capacity reasonably small for operating points of interest. Furthermore, the rate with H-ARQ provides a significant advantage compared to systems that do not use H-ARQ and only adapt rate based on the channel statistics.
Cooperative hybrid-ARQ (HARQ) protocols, which can exploit the spatial and temporal diversities, have been widely studied. The efficiency of cooperative HARQ protocols is higher than that of cooperative protocols, because retransmissions are only per
formed when necessary. We classify cooperative HARQ protocols as three decode-and-forward based HARQ (DF-HARQ) protocols and two amplified-and-forward based (AF-HARQ) protocols. To compare these protocols and obtain the optimum parameters, two unified frameworks are developed for protocol analysis. Using the frameworks, we can evaluate and compare the maximum throughput and outage probabilities according to the SNR, the relay location, and the delay constraint for the protocols.
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 inform
ation 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.
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed fro
m the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
