Entropy

Rate Adaption for Secure HARQ-CC System with Multiple Eavesdroppers

Yue Wu, Shishu Yin, Jian Zhou, Pei Yang, Hongwen Yang

Published Mar 31, 2020• 1 citation

Abstract

In this paper, we studied the secure transmission of a hybrid automatic repeat request with chase combining (HARQ-CC) system, under the existence of multiple eavesdroppers and limited latency. First, we analyzed some critical performance metrics, including connection outage probability (COP), secrecy outage probability (SOP) and effective secrecy throughput (EST). Then, to maximize the EST, three optimization problems of rate adaption were discussed: (i) optimizing the code rate with a given secrecy redundancy rate by a parameterized closed-form solution; (ii) optimizing the secrecy redundancy rate with a given code rate by a fixed-point method; (iii) optimizing both code rate and secrecy redundancy rate by an iterative optimization algorithm. We also considered COP and SOP constraints among the problems while corresponding solutions were deduced. Finally, numerical and simulated results verified our conclusions that the approximated SOP matches well with Monte-Carlo simulation for a strict reliable constraint, and that the optimized transmitting rate enhances EST efficiently with multiple eavesdroppers and retransmissions. Moreover, the influence of the number of eavesdroppers on secrecy performance was analyzed. Briefly, secrecy performance inevitably deteriorates with increasing number of eavesdroppers due to raised information leakage.

DOI: 10.3390/e22040403

Related papers

Rate Adaptation for Secure HARQ Protocols

Maël Le Treust, Leszek Szczeciński, Fabrice Labeau

This paper investigates the incremental-redundancy hybrid-automatic repeat request (IR-HARQ) transmission over independent block-fading channels in the presence of an eavesdropper, where the secrecy of the transmission is ensured via introduction of dummy messages. Since the encoder only knows the statistics of the channel state, the secrecy and the reliability are defined in a probabilistic framework. Unlike previous works on this subject, we design a coding strategy tailored to IR-HARQ by splitting the dummy-message rate over several rate parameters. These additional degrees of freedom improve the match between the dummy-message rates and the realizations of the eavesdropper channels. We evaluate the performance in terms of secrecy outage probability, connection outage probability, and throughput and compare it with the benchmark paper by Tang et al. Numerical examples illustrate that, comparing to existing alternatives, splitting of the dummy-message rate provides higher throughput and lower expected duration/average delay.

IEEE Transactions on Information Forensics and SecurityMay 7, 201813 citations

Rate Adaptation for Incremental Redundancy Secure HARQ

Zeina Mheich, Maël Le Treust, Florence Alberge +1 more

This paper studies secure communication based on incremental redundancy (INR) secure hybrid automatic retransmission request (HARQ) protocol over block-fading wiretap channels. The transmitter has no instantaneous channel state information (CSI) available from either main channel or the eavesdropper channel, hence the coding rates cannot be adapted to instantaneous channel conditions. We investigate the outage performance for two schemes of INR secure HARQ protocols: case 1) when there exists two reliable multibit feedback channels from both legitimate receiver and eavesdropper to the transmitter carrying a function of outdated CSI, and case 2) when there is a multibit feedback channel only from legitimate receiver. In both cases, we demonstrate that using the information carried via multibit feedback channels, the transmitter can adapt the coding rates in order to achieve a better secrecy throughput using a smaller number of transmissions comparing to the ACK/NACK feedback channel model. For some parameters, our rate adaptation protocol achieves a strictly positive secrecy throughput whereas it is equal to zero for the protocol with ACK/NACK feedback. We show that for some set of parameters, the loss of secrecy throughput between case 1 and case 2 is very small compared to the gain provided by both protocols.

IEEE Transactions on CommunicationsJan 4, 201615 citations

Rate Adaptation for Secure HARQ Protocols

Maël Le Treust, Leszek Szczeciński, Fabrice Labeau

This paper investigates the incremental-redundancy hybrid-automatic repeat request (IR-HARQ) transmission over independent block-fading channels in the presence of an eavesdropper, where the secrecy of the transmission is ensured via introduction of dummy-messages. Since the encoder only knows the statistics of the channel state, the secrecy and the reliability are defined in a probabilistic framework. Unlike previous works on this subject, we design a coding strategy tailored to IR-HARQ by splitting the dummy-message rate over several rate parameters. These additional degrees of freedom improve the match between the dummy-message rates and the realizations of the eavesdropper channels. We evaluate the performance in terms of secrecy outage probability, connection outage probability and throughput and we compare it with the benchmark paper by Tang et al. Numerical examples illustrate that, comparing to existing alternatives, splitting of the dummy-message rate provides higher throughput and lower expected duration/average delay.

arXiv:1611.09143Nov 28, 20160 citations

Physical Layer Security in HARQ-Assisted Non-Orthogonal Multiple Access Networks

Zhongwu Xiang, Weiwei Yang, Yueming Cai +2 more

This paper investigates physical layer security (PLS) in hybrid automatic repeat request (HARQ)-assisted non-orthogonal multiple access (NOMA) networks, where a security-required user is paired with a quality of service (QoS)-required user to perform NOMA in presence of an eavesdropper (Eve). We derive the closed-form expressions for connection outage probability (COP) of security-required and QoS-required users. In addition, the closed-form expressions for secrecy outage probability (SOP) secrecy transmission probability (RSP), and effective secrecy throughput (EST) of security-required user are also derived. Although the expression of SOP demonstrates that HARQ increases the risk of leaking confidential message to eavesdropper (Eve), however, from the perspective of Eve and security-required user, secrecy performance improves significantly, in terms of EST and RSP, when applying HARQ.

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)Jan 1, 20194 citations

An Achievable Secrecy Throughput of Hybrid-ARQ Protocols for Block Fading Channels

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević

In applications of wireless packet-oriented data networks, a special coding scheme, the hybrid automatic retransmission request (HARQ) exhibits high throughput efficiency by adapting its error correcting code redundancy to channel conditions. Motivated by the increasing importance of secure communication over wireless networks, we investigate secure packet communication based on HARQ over block-fading (BF) channels. More specifically, we consider two legitimate users communicating over a BF channel in the presence of a passive eavesdropper who intercepts the transmission through another independent BF channel. We assume that the transmitter can obtain a 1-bit ACK/NACK feedback from the receiver via a reliable public channel. Under this setting, we consider incremental redundancy (IR) and repetition time diversity (RTD) HARQ schemes based on rate-compatible Wyner secrecy codes from an information theoretic point of view. We study a good Wyner code sequence, with which the legitimate receiver can decode the message and the eavesdropper can be perfectly confused. For a given pair of reliability/secrecy outage probabilities, we derive an achievable secrecy throughput of HARQ protocols for block-fading channels. Finally, we illustrate numerically that HARQ can benefit both throughput and secrecy.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20077 citations

Secure IoT Communications Using HARQ-Based Beamforming for MISOSE Channels

Heejung Yu, Jingon Joung

In this article, we consider physical-layer security (PLS) of the Internet-of-Things (IoT) communications based on hybrid automatic repeat request (HARQ) protocols in multiple-input single-output single-eavesdropper (MISOSE) channels. Owing to the reciprocity of wireless channels, a negative acknowledge frame can be used to obtain the channel state information (CSI) from a source with multiple antennas to an IoT destination device, and this CSI of a legitimate link is used for beamforming for the next transmission round (TR). Therefore, a higher secrecy rate can be expected from retransmissions with beamforming based on the CSI as compared to the first TR without CSI. To evaluate the secrecy throughput under time-invariant and time-varying channels, connection and secrecy outage probabilities (OPs) are derived. By exploiting the characteristics of the OPs, we suggest an approximated secrecy throughput. We then consider the optimization of the approximated secrecy throughput considering the rate parameters for legitimate and eavesdropping links. With an alternating optimization approach, an algorithm to find convergent system parameters, i.e., the rates for legitimate and eavesdropping links, is proposed. Moreover, an asymptotic analysis with the large number of transmit antennas indicates an interesting behavior of the secrecy rate with regard to the number of TRs. The analytical results are verified by rigorous numerical simulations and they can serve as a useful guideline to those involved in the design of secure IoT communication systems with HARQ in MISOSE channels.

IEEE Internet of Things JournalMay 6, 202116 citations