Rate Adaption for Secure HARQ-CC System with Multiple Eavesdroppers

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.

Download Full-text

Asymptotic Bound of Secrecy Capacity for MIMOME-Based Transceivers: A Suboptimally Tractable Solution for Imperfect CSI

Mathematical Problems in Engineering ◽

10.1155/2017/3656547 ◽

2017 ◽

Vol 2017 ◽

pp. 1-11

Author(s):

Makan Zamanipour

Keyword(s):

Outage Probability ◽

Estimation Error ◽

Closed Form Solution ◽

Form Solution ◽

Secrecy Outage Probability ◽

Secrecy Capacity ◽

Worst Case ◽

Wiretap Channel ◽

Asymptotic Bound ◽

Imperfect Knowledge

The paper principally proposes a suboptimally closed-form solution in terms of a general asymptotic bound of the secrecy capacity in relation to MIMOME-based transceivers. Such pivotal solution is essentially tight as well, fundamentally originating from the principle convexity. The resultant novelty, per se, is strictly necessary since the absolutely central criterion imperfect knowledge of the wiretap channel at the transmitter should also be highly regarded. Meanwhile, ellipsoidal channel uncertainty set-driven strategies are physically taken into consideration. Our proposed solution is capable of perfectly being applied for other general equilibria such as multiuser ones. In fact, this in principle addresses an entirely appropriate alternative for worst-case method-driven algorithms utilising some provable inequality-based mathematical expressions. Our framework is adequately guaranteed regarding a totally acceptable outage probability (as 1 − preciseness coefficient). The relative value is almost 10% for the estimation error values (EEVs) ⩽0.5 for 2×2-based transceivers, which is noticeably reinforced at nearly 5% for EEVs ⩽0.9 for the case 4×4. Furthermore, our proposed scheme basically guarantees the secrecy outage probability (SOP) less than 0.05% for the case of having EEVs ⩽0.3, for the higher power regime.

Download Full-text

Secrecy outage probability of wirelessly powered wiretap channels

2016 24th European Signal Processing Conference (EUSIPCO) ◽

10.1109/eusipco.2016.7760357 ◽

2016 ◽

Cited By ~ 2

Author(s):

Xin Jiang ◽

Caijun Zhong ◽

Xiaoming Chen ◽

Zhaoyang Zhang

Keyword(s):

Outage Probability ◽

Secrecy Outage Probability ◽

Wiretap Channels ◽

Secrecy Outage

Download Full-text

On Secrecy Outage Probability for Downlink NOMA Systems With Relay-Antenna Selection

10.21203/rs.3.rs-1119431/v1 ◽

2021 ◽

Author(s):

Shu Xu ◽

Chen Liu ◽

Hong Wang ◽

Mujun Qian ◽

Wenfeng Sun

Keyword(s):

Outage Probability ◽

Multiple Access ◽

Antenna Selection ◽

Maximal Ratio Combining ◽

Selection Combining ◽

Secrecy Outage Probability ◽

Channel State ◽

Secrecy Outage ◽

Secure Transmission ◽

Theoretical Results

Abstract Secure transmission is essential for future non-orthogonal multiple access (NOMA) system. This paper investigates relay-antenna selection (RAS) to enhance physical-layer security (PLS) of cooperative NOMA system in the presence of an eavesdropper, where multiple antennas are deployed at the relays, the users, and the eavesdropper. In order to reduce expense on radio frequency (RF) chains, selection combining (SC) is employed at both the relays and the users, whilst the eavesdropper employs either maximal-ratio combining (MRC) or selection combining (SC) to process the received signals. Under the condition that the channel state information (CSI) of the eavesdropping channel is available or unavailable, two e↵ective relay-antenna selection schemes are proposed. Additionally, the closed-form expressions of secrecy outage probability (SOP) are derived for the proposed relay-antenna selection schemes. In order to gain more deep insights on the derived results, the asymptotic performance of the derived SOP is analyzed. In simulations, it is demonstrated that the theoretical results match well with the simulation results and the SOP of the proposed schemes is less than that of the conventional orthogonal multiple access (OMA) scheme obviously.

Download Full-text

Cross-Layer Routing for Outage Minimization in Multihop Ad-Hoc Networks

International Journal for Research in Applied Science and Engineering Technology ◽

10.22214/ijraset.2021.36998 ◽

2021 ◽

Vol 9 (VII) ◽

pp. 3130-3134

Author(s):

Partha Sarathi Dutta

Keyword(s):

Outage Probability ◽

Power Allocation ◽

Ad Hoc ◽

Closed Form Solution ◽

Form Solution ◽

Cross Layer ◽

Transmission Power ◽

Routing Metric ◽

Multihop Ad Hoc Networks ◽

End To End

In this study, cross-layer approach for joint routing and power allocation problem is formulated in an optimization framework for end-to-end outage minimization under the constraint of total permissible transmission power. A closed form solution for optimal transmission power is obtained following the extraction of routing metric. The scheme is referred as minimum end-to-end outage probability (MEO) strategy. A distributed implementation of the proposed strategy is also presented. Simulation results prove that our proposed MEO routing and power allocation strategy succeeds in achieving significant improvement of end-to-end outage probability over MEO routing and equal power allocation scheme.

Download Full-text