Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Layer Safety Communication Technology Based on Reliability Mixed Retransmission Protocol

ZOU Qinyu,ZHANG Bangning,GUO Daoxing,ZHAO Bing

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

In physical layer secure communication system,the existing retransmission technology retransmits the whole wrong message when the legitimate user is in error,which may lead to the eavesdropper receives a lot of useful information.Aiming at solving the above problems,the Reliability-based Hybrid Automatic Repeat Request (RB-HARQ) protocol is introduced in,and a secure communication technology is proposed.RB-HARQ protocol can just retransmit the unreliable bits required by the legitimate user and minimizing the information leak to eavesdropper,thus secure and reliable communication can be achieved.Simulation results show that,compared with the traditional HARQ protocol,RB-HARQ protocol can enhance the physical layer security performance of the communication system.

Related papers

Increasing physical layer security through reliability-based HARQ

Qinyu Zou, Bangning Zhang, Yanqing Ma +1 more

In this paper, we proposed a secure communication scheme based on Reliability-Based Hybrid Automatic Repeat reQuest (RB-HARQ) protocol over the additive white Gaussian noise (AWGN) wiretap channel. RB-HARQ protocol aims at retransmitting the unreliable bits required for the authorized user's (Bob) successfully decoding and minimizing the information leakage that may benefit to eavesdropper (Eve). The secrecy level in this paper is assessed through the bit error rate (BER) at both the authorized user (Bob) and eavesdropper (Eve). Therefore, we analyze the BER of our proposed scheme through theoretical arguments and simulations. Numerical results suggest that RB-HARQ protocol can significantly enhance the security performance of our communication system.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2016•2 citations

Secure Communication Based on a Modified RB-HARQ Protocol

Qinyu Zou, Bangning Zhang, Zhan Ye +1 more

This paper presents a secure communication scheme based on a modified Reliability-Based Hybrid Automatic Repeat reQuest (RB-HARQ) protocol over the additive white Gaussian noise (AWGN) wiretap channel. RB-HARQ protocol is firstly implemented in the secure communication system and showed a significant enhancement of the physical layer security. The retransmission encoding scheme is the main difference between traditional RB-HARQ and modified RB-HARQ, which can encode the unreliable bits of the authorized user (Bob) and retransmit the encoded unreliable bits through the AWGN wiretap channel. With the retransmission encoding scheme, the maximum retransmission number of RB-HARQ protocol can be largely reduced and secure communication can still be ensured, which is much more practical in long distance communication system. Bit error rate (BER) at both the authorized user (Bob) and eavesdropper (Eve) is used to assess the secrecy performance in this paper. So we calculate the BER of our proposed scheme through theoretical analysis and simulations. The results suggest that the modified RB-HARQ protocol can strongly enhance the reliability and security of our system, with the maximum retransmission number at a low level.

IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)•Dec 1, 2016•0 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, 2007•7 citations

On Channel-Aware Secure HARQ-IR

Jinho Choi

In this paper, we study secure hybrid automatic retransmission request (HARQ) over block-fading channels when the channel from a legitimate transmitter (i.e., Alice) to an eavesdropper (i.e., Eve) is less noisy than that to a legitimate receiver (i.e., Bob). In order to have a positive secrecy rate, we exploit the notion of the channel reciprocity in time division duplex mode, where the shared channel state information between Alice and Bob is used as a secret key. The resulting HARQ scheme is referred to as channel-aware secure HARQ (CAS-HARQ) in this paper. In this scheme, in order to keep Eve ignorant of the confidential message from Alice to Bob, deliberative transmissions of random message blocks are considered when the channel to Bob is weak. We derive closed-form expressions for bounds on the probabilities of connection outage and secrecy outage to see reliability and security, respectively, of CAS-HARQ. Based on our analysis, we can see that it is possible to have a positive secrecy rate with certain outage probabilities even if the channel to Eve is less noisy than that to Bob.

IEEE Transactions on Information Forensics and Security•Sep 27, 2016•11 citations

Secret sharing in fast fading channels based on reliability-based hybrid ARQ

Chan Wong Wong, John M. Shea, Tan F. Wong

Consider a wireless transmission from Alice to Bob in the presence of an eavesdropper, Eve. We propose a technique to allow Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have begun to develop practical schemes. However, we consider a challenging version in which the channel from Alice to Eve may be as good or better than the channel from Alice to Bob. There have been no practical secrecy coding techniques that have been developed for this scenario. The key to allow secret communication in such a scenario is feedback from Bob to Alice (which Eve can also observe). The scheme we develop uses reliability-based hybrid automatic-repeat-request (RB-HARQ) over a fast fading channel to provide a decoding advantage at Bob. Bob requests information about received symbols that suffer from deep fades. The retransmitted symbols improve Bobpsilas ability to decode the message faster than at Eve, who sees retransmission of bits with random reliabilities. We evaluate the proposed scheme by performance measures such as the probability of successful decoding and the equivocation rate at Eve.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2008•9 citations

On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević +1 more

The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. Thehybridautomaticretransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, 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-freepublicchannel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance ofrepetition time diversity(RTD) andincremental redundancy(INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines theconnection outageandsecrecy outageprobabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's 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 calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.

arXiv:0712.4135•IEEE Transactions on Information Theory•Mar 19, 2009•145 citations
In physical layer secure communication system,the existing retransmission technology retransmits the whole wrong message when the legitimate user is in error,which may lead to the eavesdropper receives a lot of useful information.Aiming at solving the above problems,the Reliability-based Hybrid Automatic Repeat Request (RB-HARQ) protocol is introduced in,and a secure communication technology is proposed.RB-HARQ protocol can just retransmit the unreliable bits required by the legitimate user and minimizing the information leak to eavesdropper,thus secure and reliable communication can be achieved.Simulation results show that,compared with the traditional HARQ protocol,RB-HARQ protocol can enhance the physical layer security performance of the communication system.
In this paper, we proposed a secure communication scheme based on Reliability-Based Hybrid Automatic Repeat reQuest (RB-HARQ) protocol over the additive white Gaussian noise (AWGN) wiretap channel. RB-HARQ protocol aims at retransmitting the unreliable bits required for the authorized user's (Bob) successfully decoding and minimizing the information leakage that may benefit to eavesdropper (Eve). The secrecy level in this paper is assessed through the bit error rate (BER) at both the authorized user (Bob) and eavesdropper (Eve). Therefore, we analyze the BER of our proposed scheme through theoretical arguments and simulations. Numerical results suggest that RB-HARQ protocol can significantly enhance the security performance of our communication system.
This paper presents a secure communication scheme based on a modified Reliability-Based Hybrid Automatic Repeat reQuest (RB-HARQ) protocol over the additive white Gaussian noise (AWGN) wiretap channel. RB-HARQ protocol is firstly implemented in the secure communication system and showed a significant enhancement of the physical layer security. The retransmission encoding scheme is the main difference between traditional RB-HARQ and modified RB-HARQ, which can encode the unreliable bits of the authorized user (Bob) and retransmit the encoded unreliable bits through the AWGN wiretap channel. With the retransmission encoding scheme, the maximum retransmission number of RB-HARQ protocol can be largely reduced and secure communication can still be ensured, which is much more practical in long distance communication system. Bit error rate (BER) at both the authorized user (Bob) and eavesdropper (Eve) is used to assess the secrecy performance in this paper. So we calculate the BER of our proposed scheme through theoretical analysis and simulations. The results suggest that the modified RB-HARQ protocol can strongly enhance the reliability and security of our system, with the maximum retransmission number at a low level.
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.
In this paper, we study secure hybrid automatic retransmission request (HARQ) over block-fading channels when the channel from a legitimate transmitter (i.e., Alice) to an eavesdropper (i.e., Eve) is less noisy than that to a legitimate receiver (i.e., Bob). In order to have a positive secrecy rate, we exploit the notion of the channel reciprocity in time division duplex mode, where the shared channel state information between Alice and Bob is used as a secret key. The resulting HARQ scheme is referred to as channel-aware secure HARQ (CAS-HARQ) in this paper. In this scheme, in order to keep Eve ignorant of the confidential message from Alice to Bob, deliberative transmissions of random message blocks are considered when the channel to Bob is weak. We derive closed-form expressions for bounds on the probabilities of connection outage and secrecy outage to see reliability and security, respectively, of CAS-HARQ. Based on our analysis, we can see that it is possible to have a positive secrecy rate with certain outage probabilities even if the channel to Eve is less noisy than that to Bob.
Consider a wireless transmission from Alice to Bob in the presence of an eavesdropper, Eve. We propose a technique to allow Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have begun to develop practical schemes. However, we consider a challenging version in which the channel from Alice to Eve may be as good or better than the channel from Alice to Bob. There have been no practical secrecy coding techniques that have been developed for this scenario. The key to allow secret communication in such a scenario is feedback from Bob to Alice (which Eve can also observe). The scheme we develop uses reliability-based hybrid automatic-repeat-request (RB-HARQ) over a fast fading channel to provide a decoding advantage at Bob. Bob requests information about received symbols that suffer from deep fades. The retransmitted symbols improve Bobpsilas ability to decode the message faster than at Eve, who sees retransmission of bits with random reliabilities. We evaluate the proposed scheme by performance measures such as the probability of successful decoding and the equivocation rate at Eve.
The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. Thehybridautomaticretransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, 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-freepublicchannel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance ofrepetition time diversity(RTD) andincremental redundancy(INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines theconnection outageandsecrecy outageprobabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's 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 calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.