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

Information

Hybrid Destination-Based Jamming and Opportunistic Scheduling with Optimal Power Allocation to Secure Multiuser Untrusted Relay Networks

Fan Ding, Yongming Zhou

Published Apr 9, 2018• 0 citations
Publisher

Abstract

In this paper, we investigate secure communication for a dual-hop multiuser relay network, where a source communication with N ( N ≥ 1 ) destinations via an untrusted variable gains relay. To exploit multiuser diversity while protecting source’s confidential message, we first propose a joint destination-based jamming and opportunistic scheduling (DJOS) scheme. Then, we derive closed-form approximated and asymptotic expressions of the secrecy outage probability (SOP) for the considered system with DJOS. Furthermore, we determine an asymptotical optimal power allocation (OPA), which minimizes the asymptotic SOP, to further improve the secrecy performance. Our analytical results show that the achievable secrecy diversity order in terms of SOP with fixed power allocation is min ( 1 , N 2 ) , whereas, with OPA, the achievable secrecy diversity order can be improved up to min ( 1 , 2 N N + 2 ) . This interesting result reveals that OPA can improve the secrecy diversity order of the single-user network. This is intuitive since full diversity order of 1 cannot be achieved when N = 1 , thus leaving some space for OPA to improve the diversity order. Nevertheless, for N ≥ 2 , the effect of OPA is to increase the secrecy array gain rather than the secrecy diversity order since full diversity order 1 has been achieved by the OS scheme. Finally, simulation results are presented to validate our analysis.

DOI
10.3390/info9040084

Related papers

Multiuser untrusted relay networks with joint cooperative jamming and opportunistic scheduling under perfect and outdated CSI

Fan Ding, Hui Wang, Shengli Zhang +1 more

A joint cooperative jamming and opportunistic scheduling (CJOS) scheme is proposed for a downlink multiuser relay network (MRN) with an untrusted fixed‐gain amplify‐and‐forward relay. Specifically, the source's confident message is protected by employing CJ at the destinations and multiuser diversity is harvested via OS. Unified tight approximation and asymptotic expressions for the system secrecy outage probability with perfect/outdated channel state information (CSI) are derived. Our results explicitly show that with perfect CSI, CJOS scheme can improve the secrecy diversity order from 1/2 in single‐user networks up to full diversity of 1 in MRNs. However, the outdated CSI degrades the secrecy diversity order from 1 to 1/2.

Electronics Letters•Oct 4, 2016•9 citations

Secrecy Performance Analysis of Opportunistic Scheduling in Multiuser Untrusted Relay Networks

Zhao Ru

To improve the physical-layer security performance in the multiuser untrusted relay networks,we propose an opportunistic scheduling combined with cooperative jamming(OSCJ)scheme.We derive the analytical expression of the ergodic secrecy capacity(ESC)lower bound for the OSCJ scheme and the closed-form expression of the lower bound of the secrecy outage probability(SOP).Furthermore,we conduct an asymptotic analysis for ESC.The numerical simulations validate the accuracy of our analysis and show that the proposed OSCJ scheme outperforms the random scheduling and jamming scheme in terms of both ESC and SOP performance.

Journal of Shanxi University•Jan 1, 2015•0 citations

Impact of Relay’s Eavesdropping on Untrusted Amplify-and-Forward Networks Over Nakagami- $m$ Fading

Fan Ding, Hui Wang, Yongming Zhou +1 more

We investigate the impact of eavesdropping on the secrecy outage performance of dual-hop amplify-and-forward networks with a single untrusted relay, in which cooperative jamming technique is employed at the destination to realize positive secrecy rate. Under Nakagami-m fading channels, we derive tight closed-form and asymptotic expressions for the lower and upper bounds of the secrecy outage probability (SOP). Our results explicitly show that a secrecy diversity order of min(m1, m2/2) in terms of the SOP is achieved, where m1and m2are the respective integer fading parameters of the source-relay and relay-destination links. Afterwards, we propose an asymptotically optimal power allocation (OPA) scheme that minimizes the SOP. Numerical and simulation results show that the proposed OPA offers significant improvement on the SOP performance, especially in the case of m1> m2/2.

IEEE Wireless Communications Letters•Sep 26, 2017•13 citations

Secure Multiuser Scheduling for Hybrid Relay-Assisted Wireless Powered Cooperative Communication Networks With Full-Duplex Destination-Based Jamming

Xiaohui Shang, Hao Yin, Yida Wang +2 more

In this paper, we investigate secure communication in a hybrid relay (HR)-assisted wireless powered cooperative communication network (WPCCN), where an eavesdropper tries to intercept the data transmitted by a source user and the HR simultaneously. The HR has the ability to wireless powered the energy-constrained multiple users in the downlink and to relay the received confidential information in the uplink. In particular, the full-duplex destination-based jamming (FD-DBJ) strategy is exploited to improve the secrecy performance. Moreover, in order to conduct effective secure communications, we design two multiuser scheduling schemes, i.e., random user selection (RUS), and best user selection (BUS) based on the main channel quality. In order to evaluate the secrecy performance, we analytically derive the energy outage probability (EOP), the secrecy outage probability (SOP), and the hybrid outage probability (HOP), respectively. As such, we formulate the secrecy throughput (ST) maximization problem to optimize the predetermined transmission rate. Our analysis and numerical results reveal that: 1) The BUS scheme has better security performance. 2) Both of the energy conversion efficiency and the number of users have a positive effect on secrecy performance. 3) The FD-DBJ scheme is an effective method to achieve secure communications. 4) The time-switching factor and predetermined transmission rate have a crucial influence on the secrecy performance, which should be considered carefully in system design.

IEEE Access•Jan 1, 2021•14 citations

Energy-efficient secure multiuser scheduling in energy harvesting untrusted relay networks

Dechuan Chen, Yunpeng Cheng, Xiangdong Wang +3 more

In this paper, we investigate opportunistic secure multiuser scheduling in energy harvesting untrusted relay networks, where an energy-constrained amplify-and-forward (AF) relay harvests energy from the received radio frequency signal via using the power splitting protocol. To exploit the potential advantages (e.g., multiuser diversity and direct links) for secrecy improvement, we examine three opportunistic user scheduling schemes, i.e., optimal scheduling scheme, maximum scheduling scheme, and minimum scheduling scheme. Specifically, the optimal scheduling scheme performs user selection by maximizing the ratio between the signal-to-noise-ratio (SNR) at the destination and the corresponding SNR at the untrusted relay. The maximum scheduling scheme is conventional user selection that maximizes the channel gain of the direct links. For the minimum scheduling scheme, we try to reduce the overheard information at the untrusted relay by selecting the user with the lowest channel gain of the relay links. For these three schemes, we comprehensively examine the achievable secrecy performance including probability of positive secrecy rate, secrecy outage probability (SOP), asymptotic SOP, secrecy throughput (ST), as well as secure energy efficiency (SEE) to help facilitate an energy-efficient secure transmission design. Simulation results demonstrate that the maximum scheduling scheme outperforms the minimum scheduling scheme in terms of SOP at relatively low SNRs and target secrecy rates.

Journal of Communications and Networks•Jun 19, 2019•20 citations

Joint Antenna and User Selection for Untrusted Relay Networks

Bingtao He, Qiang Ni, Jian Chen +2 more

In this paper, we investigate secure communication for an untrusted relay network, in which a source equipped with NS antennas communicates to M users with the help of an untrusted relay. To protect the data confidentially while concurrently relying on the untrusted relays, joint antenna and user selection scheme has been proposed with the aid of cooperative jamming. Furthermore, the impacts of both the number of antennas and the number of users on system performance are studied. Both the secrecy outage probability (SOP) and ergodic secrecy rate (ESR) are derived in closed form, and the secrecy diversity order of the considered networks is proved to be min(NS, M/2). Compared with the traditional single antenna and single source-destination scenario, both SOP and ESR can achieve a great improvement owing to the mutual effects of antenna diversity and user diversity. In addition, numerical results are conducted to demonstrate the validity of the proposed scheme.

Globecom•Dec 1, 2018•0 citations
In this paper, we investigate secure communication for a dual-hop multiuser relay network, where a source communication with N ( N ≥ 1 ) destinations via an untrusted variable gains relay. To exploit multiuser diversity while protecting source’s confidential message, we first propose a joint destination-based jamming and opportunistic scheduling (DJOS) scheme. Then, we derive closed-form approximated and asymptotic expressions of the secrecy outage probability (SOP) for the considered system with DJOS. Furthermore, we determine an asymptotical optimal power allocation (OPA), which minimizes the asymptotic SOP, to further improve the secrecy performance. Our analytical results show that the achievable secrecy diversity order in terms of SOP with fixed power allocation is min ( 1 , N 2 ) , whereas, with OPA, the achievable secrecy diversity order can be improved up to min ( 1 , 2 N N + 2 ) . This interesting result reveals that OPA can improve the secrecy diversity order of the single-user network. This is intuitive since full diversity order of 1 cannot be achieved when N = 1 , thus leaving some space for OPA to improve the diversity order. Nevertheless, for N ≥ 2 , the effect of OPA is to increase the secrecy array gain rather than the secrecy diversity order since full diversity order 1 has been achieved by the OS scheme. Finally, simulation results are presented to validate our analysis.
A joint cooperative jamming and opportunistic scheduling (CJOS) scheme is proposed for a downlink multiuser relay network (MRN) with an untrusted fixed‐gain amplify‐and‐forward relay. Specifically, the source's confident message is protected by employing CJ at the destinations and multiuser diversity is harvested via OS. Unified tight approximation and asymptotic expressions for the system secrecy outage probability with perfect/outdated channel state information (CSI) are derived. Our results explicitly show that with perfect CSI, CJOS scheme can improve the secrecy diversity order from 1/2 in single‐user networks up to full diversity of 1 in MRNs. However, the outdated CSI degrades the secrecy diversity order from 1 to 1/2.
To improve the physical-layer security performance in the multiuser untrusted relay networks,we propose an opportunistic scheduling combined with cooperative jamming(OSCJ)scheme.We derive the analytical expression of the ergodic secrecy capacity(ESC)lower bound for the OSCJ scheme and the closed-form expression of the lower bound of the secrecy outage probability(SOP).Furthermore,we conduct an asymptotic analysis for ESC.The numerical simulations validate the accuracy of our analysis and show that the proposed OSCJ scheme outperforms the random scheduling and jamming scheme in terms of both ESC and SOP performance.
Impact of Relay’s Eavesdropping on Untrusted Amplify-and-Forward Networks Over Nakagami- mmm Fading
We investigate the impact of eavesdropping on the secrecy outage performance of dual-hop amplify-and-forward networks with a single untrusted relay, in which cooperative jamming technique is employed at the destination to realize positive secrecy rate. Under Nakagami-m fading channels, we derive tight closed-form and asymptotic expressions for the lower and upper bounds of the secrecy outage probability (SOP). Our results explicitly show that a secrecy diversity order of min(m1, m2/2) in terms of the SOP is achieved, where m1and m2are the respective integer fading parameters of the source-relay and relay-destination links. Afterwards, we propose an asymptotically optimal power allocation (OPA) scheme that minimizes the SOP. Numerical and simulation results show that the proposed OPA offers significant improvement on the SOP performance, especially in the case of m1> m2/2.
In this paper, we investigate secure communication in a hybrid relay (HR)-assisted wireless powered cooperative communication network (WPCCN), where an eavesdropper tries to intercept the data transmitted by a source user and the HR simultaneously. The HR has the ability to wireless powered the energy-constrained multiple users in the downlink and to relay the received confidential information in the uplink. In particular, the full-duplex destination-based jamming (FD-DBJ) strategy is exploited to improve the secrecy performance. Moreover, in order to conduct effective secure communications, we design two multiuser scheduling schemes, i.e., random user selection (RUS), and best user selection (BUS) based on the main channel quality. In order to evaluate the secrecy performance, we analytically derive the energy outage probability (EOP), the secrecy outage probability (SOP), and the hybrid outage probability (HOP), respectively. As such, we formulate the secrecy throughput (ST) maximization problem to optimize the predetermined transmission rate. Our analysis and numerical results reveal that: 1) The BUS scheme has better security performance. 2) Both of the energy conversion efficiency and the number of users have a positive effect on secrecy performance. 3) The FD-DBJ scheme is an effective method to achieve secure communications. 4) The time-switching factor and predetermined transmission rate have a crucial influence on the secrecy performance, which should be considered carefully in system design.
In this paper, we investigate opportunistic secure multiuser scheduling in energy harvesting untrusted relay networks, where an energy-constrained amplify-and-forward (AF) relay harvests energy from the received radio frequency signal via using the power splitting protocol. To exploit the potential advantages (e.g., multiuser diversity and direct links) for secrecy improvement, we examine three opportunistic user scheduling schemes, i.e., optimal scheduling scheme, maximum scheduling scheme, and minimum scheduling scheme. Specifically, the optimal scheduling scheme performs user selection by maximizing the ratio between the signal-to-noise-ratio (SNR) at the destination and the corresponding SNR at the untrusted relay. The maximum scheduling scheme is conventional user selection that maximizes the channel gain of the direct links. For the minimum scheduling scheme, we try to reduce the overheard information at the untrusted relay by selecting the user with the lowest channel gain of the relay links. For these three schemes, we comprehensively examine the achievable secrecy performance including probability of positive secrecy rate, secrecy outage probability (SOP), asymptotic SOP, secrecy throughput (ST), as well as secure energy efficiency (SEE) to help facilitate an energy-efficient secure transmission design. Simulation results demonstrate that the maximum scheduling scheme outperforms the minimum scheduling scheme in terms of SOP at relatively low SNRs and target secrecy rates.
In this paper, we investigate secure communication for an untrusted relay network, in which a source equipped with NS antennas communicates to M users with the help of an untrusted relay. To protect the data confidentially while concurrently relying on the untrusted relays, joint antenna and user selection scheme has been proposed with the aid of cooperative jamming. Furthermore, the impacts of both the number of antennas and the number of users on system performance are studied. Both the secrecy outage probability (SOP) and ergodic secrecy rate (ESR) are derived in closed form, and the secrecy diversity order of the considered networks is proved to be min(NS, M/2). Compared with the traditional single antenna and single source-destination scenario, both SOP and ESR can achieve a great improvement owing to the mutual effects of antenna diversity and user diversity. In addition, numerical results are conducted to demonstrate the validity of the proposed scheme.