pith. sign in

arxiv: 1611.09143 · v3 · pith:AHG2QVTBnew · submitted 2016-11-28 · 💻 cs.IT · math.IT

Rate Adaptation for Secure HARQ Protocols

classification 💻 cs.IT math.IT
keywords ratedummy-messagesecrecychannelseavesdropperir-harqoutageprobability
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.