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

arXiv:1212.6627

Exploring Relay Cooperation Scheme for Load-Balance Control in Two-hop Secure Communication System

Yulong Shen, Xiaohong Jiang, Jianfeng Ma

Published Dec 29, 2012• 0 citations
arXivHTMLPDF

Abstract

This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop secure transmission protocols in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper proposes a secure transmission protocol in case that the path-loss is identical between all pairs of nodes, in which the relay is randomly selected from the first $k$ preferable assistant relays. This protocol enables load-balance among relays to be flexibly controlled by a proper setting of the parameter $k$, and covers the available works as special cases, like ones with the optimal relay selection ($k=1$) and ones with the random relay selection ($k = n$, i.e. the number of system nodes). The theoretic analysis is further provided to determine the maximum number of eavesdroppers one network can tolerate by applying the proposed protocol to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability.

DOI
10.48550/arxiv.1212.6627

Related papers

Generalized Secure Transmission Protocol for Flexible Load-Balance Control with Cooperative Relays in Two-Hop Wireless Networks

Yulong Shen, Xiaohong Jiang, Jianfeng Ma

This work considers secure transmission protocol for flexible load-balance control in two-hop relay wireless networks without the information of both eavesdropper channels and locations. The available secure transmission protocols via relay cooperation in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper extends the conventional works and proposes a general transmission protocol with considering load-balance control, in which the relay is randomly selected from the first $k$ preferable assistant relays located in the circle area with the radius $r$ and the center at the middle between source and destination (2HR-($r,k$) for short). This protocol covers the available works as special cases, like ones with the optimal relay selection ($r=\infty$, $k=1$) and with the random relay selection ($r=\infty$, $k = n$ i.e. the number of system nodes) in the case of equal path-loss, ones with relay selected from relay selection region ($r \in (0, \infty), k = 1$) in the case of distance-dependent path-loss. The theoretic analysis is further provided to determine the maximum number of eavesdroppers one network can tolerate to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability. The analysis results also show the proposed protocol can balance load distributed among the relays by a proper setting of $r$ and $k$ under the premise of specified secure and reliable requirements.

arXiv:1301.1746•Jan 9, 2013•3 citations

Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks

Dennis Goeckel, Sudarshan Vasudevan, Don Towsley +3 more

The secure transmission of information in wireless networks without knowledge of eavesdropper channels or locations is considered. Two key mechanisms are employed: artificial noise generation from system nodes other than the transmitter and receiver, and a form of multi-user diversity that allows message reception in the presence of the artificial noise. We determine the maximum number of independently-operating and uniformly distributed eavesdroppers that can be present while the desired secrecy is achieved with high probability in the limit of a large number of system nodes. While our main motivation is considering eavesdroppers of unknown location, we first consider the case where the path-loss is identical between all pairs of nodes. In this case, a number of eavesdroppers that is exponential in the number of systems nodes can be tolerated. In the case of uniformly distributed eavesdroppers of unknown location, any number of eavesdroppers whose growth is sub-linear in the number of system nodes can be tolerated. The proposed approach significantly outperforms a power control approach based on standard multi-user diversity.

IEEE Journal on Selected Areas in Communications•Nov 21, 2011•101 citations

Link Selection for Secure Cooperative Networks with Buffer-Aided Relaying

Ji He, Jia Liu, Yulong Shen +1 more

This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. Depending on the availability of instantaneous channel state information of the source, two cases of transmission mechanisms, i.e., adaptive-rate transmission and fixed-rate transmission are considered. To enhance the security of the system, novel link selection policies are proposed for both cases to select source-to-relay, relay-to-destination, or no link transmission based on the channels qualities. Closed-form expressions are derived for the end-to-end secrecy outage probability (SOP), secrecy outage capacity (SOC), and exact secrecy throughput (EST), respectively. Furthermore, we prove the condition that EST reaches its maximum, and explore how to minimize the SOP and maximize the SOC by optimizing the link selection parameters. Finally, simulations are conducted to demonstrate the validity of our theoretical performance evaluation, and extensive numerical results are provided to illustrate the efficiency of the proposed link selection polices for the secure communication in two-hop cooperative networks.

arXiv:1802.06538•Feb 19, 2018•2 citations

Relay self-selection for secure cooperative in Amplify-And-Forward networks

Shi Yan, Mugen Peng, Wenbo Wang +2 more

Cooperative communication in wireless relay systems can improve the physical layer security, and the relay selection has great impacts on the security performances. In this paper the relay selection in Amplify-and-Forward (AF) cooperative networks is investigated. The system model constitutes of a source, an eavesdropper, a destination, and a number of intermediate nodes with secrecy constraints. The proposed optimal selection (OS) algorithm is based on the instantaneous channel state information (CSI) of two hops, jointly protects the target destination against eavesdropping and interference. To simplify the complexity of OS, the suboptimal selection (SS) algorithm is also presented, which is based on the instantaneous of the first hop and the statistical CSI of the second hop respectively. The secrecy capacity and secrecy outage probability of these two relay selection algorithms are analyzed. Simulation results of OS and SS validate our theoretical analysis and show enhancement in the secrecy rate over the direct transmission.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2012•7 citations

Physical layer security in two-hop cooperative networks based on multi-node SWIPT

Dandan Guo, Baogang Li, Yabo Lv +1 more

In this paper, we consider a multi-node-assisted two-hop cooperative network, where an energy constrained source (S) aims to establish secure communications with a legitimate user in the presence of an eavesdropper. The cooperative nodes simultaneously assist the transmission from base station to legitimate user. Each cooperative node applies power splitting protocol to coordinate the received signal energy for information decoding and energy harvesting. The power splitting ratios at multi-node are formulated based on decode-and-forward (DF) relaying protocols. Depending on the available channel state information (CSI) at the source, we propose two different jamming schemes for secrecy performance enhancement. An optimal node is selected as a jammer to interfere the eavesdropper or a relay to forward the information to legitimate user. we evaluate the network performance based on secrecy outage probability (SOP). In addition, simple and accurate approximations are obtained at different transmission speed thresholds. Furthermore, numerical results reveal that there exist unique splitting ratios and harvesting efficiency that minimize the SOP.

IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)•Oct 1, 2017•0 citations

Physical Layer Security in Multi-hop Cooperative Wireless Relaying

Sajad Hatamnia, Mahdi Morafah, Bill Lin

In the last decade, multi-hop cooperation has evolved bringing several advantages including coverage improvement, more reliability of wireless links, and power consumption reduction. Still, its application has raised several challenges, such as the need for secure transmission at each hop, algorithms to perform relay selection and the accurate models to facilitate performance analysis. This paper addresses the problem of physical layer (PHY) security in a multi-hop wireless cooperative network, where communication at each hop is assisted by multiple relays forming a cluster, each cluster being surrounded by multiple eavesdroppers which together may tap transmissions from both the source and the relays. The main focus of the study is on analyzing the benefits of various relay selection schemes for protecting the source-destination transmission against the eavesdroppers, which can collude and combine information via diversity combining techniques. To be specific, four relay selection schemes, which differ in the way they employ available measures link quality, are considered to deliver the source information to the destination via a decode-and-forward (DF) strategy. To evaluate the security performance of the multi-hop cooperative link in the presence of colluding eavesdroppers, we derive novel closed-form analytical expressions for the secrecy outage probability (SOP) with consideration of special cases of practical interest.

•Oct 15, 2021•0 citations
This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop secure transmission protocols in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper proposes a secure transmission protocol in case that the path-loss is identical between all pairs of nodes, in which the relay is randomly selected from the first kkk preferable assistant relays. This protocol enables load-balance among relays to be flexibly controlled by a proper setting of the parameter kkk, and covers the available works as special cases, like ones with the optimal relay selection (k=1k=1k=1) and ones with the random relay selection (k=nk = nk=n, i.e. the number of system nodes). The theoretic analysis is further provided to determine the maximum number of eavesdroppers one network can tolerate by applying the proposed protocol to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability.
This work considers secure transmission protocol for flexible load-balance control in two-hop relay wireless networks without the information of both eavesdropper channels and locations. The available secure transmission protocols via relay cooperation in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper extends the conventional works and proposes a general transmission protocol with considering load-balance control, in which the relay is randomly selected from the first kkk preferable assistant relays located in the circle area with the radius rrr and the center at the middle between source and destination (2HR-(r,kr,kr,k) for short). This protocol covers the available works as special cases, like ones with the optimal relay selection (r=∞r=\inftyr=∞, k=1k=1k=1) and with the random relay selection (r=∞r=\inftyr=∞, k=nk = nk=n i.e. the number of system nodes) in the case of equal path-loss, ones with relay selected from relay selection region (r∈(0,∞),k=1r \in (0, \infty), k = 1r∈(0,∞),k=1) in the case of distance-dependent path-loss. The theoretic analysis is further provided to determine the maximum number of eavesdroppers one network can tolerate to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability. The analysis results also show the proposed protocol can balance load distributed among the relays by a proper setting of rrr and kkk under the premise of specified secure and reliable requirements.
The secure transmission of information in wireless networks without knowledge of eavesdropper channels or locations is considered. Two key mechanisms are employed: artificial noise generation from system nodes other than the transmitter and receiver, and a form of multi-user diversity that allows message reception in the presence of the artificial noise. We determine the maximum number of independently-operating and uniformly distributed eavesdroppers that can be present while the desired secrecy is achieved with high probability in the limit of a large number of system nodes. While our main motivation is considering eavesdroppers of unknown location, we first consider the case where the path-loss is identical between all pairs of nodes. In this case, a number of eavesdroppers that is exponential in the number of systems nodes can be tolerated. In the case of uniformly distributed eavesdroppers of unknown location, any number of eavesdroppers whose growth is sub-linear in the number of system nodes can be tolerated. The proposed approach significantly outperforms a power control approach based on standard multi-user diversity.
This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. Depending on the availability of instantaneous channel state information of the source, two cases of transmission mechanisms, i.e., adaptive-rate transmission and fixed-rate transmission are considered. To enhance the security of the system, novel link selection policies are proposed for both cases to select source-to-relay, relay-to-destination, or no link transmission based on the channels qualities. Closed-form expressions are derived for the end-to-end secrecy outage probability (SOP), secrecy outage capacity (SOC), and exact secrecy throughput (EST), respectively. Furthermore, we prove the condition that EST reaches its maximum, and explore how to minimize the SOP and maximize the SOC by optimizing the link selection parameters. Finally, simulations are conducted to demonstrate the validity of our theoretical performance evaluation, and extensive numerical results are provided to illustrate the efficiency of the proposed link selection polices for the secure communication in two-hop cooperative networks.
Cooperative communication in wireless relay systems can improve the physical layer security, and the relay selection has great impacts on the security performances. In this paper the relay selection in Amplify-and-Forward (AF) cooperative networks is investigated. The system model constitutes of a source, an eavesdropper, a destination, and a number of intermediate nodes with secrecy constraints. The proposed optimal selection (OS) algorithm is based on the instantaneous channel state information (CSI) of two hops, jointly protects the target destination against eavesdropping and interference. To simplify the complexity of OS, the suboptimal selection (SS) algorithm is also presented, which is based on the instantaneous of the first hop and the statistical CSI of the second hop respectively. The secrecy capacity and secrecy outage probability of these two relay selection algorithms are analyzed. Simulation results of OS and SS validate our theoretical analysis and show enhancement in the secrecy rate over the direct transmission.
In this paper, we consider a multi-node-assisted two-hop cooperative network, where an energy constrained source (S) aims to establish secure communications with a legitimate user in the presence of an eavesdropper. The cooperative nodes simultaneously assist the transmission from base station to legitimate user. Each cooperative node applies power splitting protocol to coordinate the received signal energy for information decoding and energy harvesting. The power splitting ratios at multi-node are formulated based on decode-and-forward (DF) relaying protocols. Depending on the available channel state information (CSI) at the source, we propose two different jamming schemes for secrecy performance enhancement. An optimal node is selected as a jammer to interfere the eavesdropper or a relay to forward the information to legitimate user. we evaluate the network performance based on secrecy outage probability (SOP). In addition, simple and accurate approximations are obtained at different transmission speed thresholds. Furthermore, numerical results reveal that there exist unique splitting ratios and harvesting efficiency that minimize the SOP.
In the last decade, multi-hop cooperation has evolved bringing several advantages including coverage improvement, more reliability of wireless links, and power consumption reduction. Still, its application has raised several challenges, such as the need for secure transmission at each hop, algorithms to perform relay selection and the accurate models to facilitate performance analysis. This paper addresses the problem of physical layer (PHY) security in a multi-hop wireless cooperative network, where communication at each hop is assisted by multiple relays forming a cluster, each cluster being surrounded by multiple eavesdroppers which together may tap transmissions from both the source and the relays. The main focus of the study is on analyzing the benefits of various relay selection schemes for protecting the source-destination transmission against the eavesdroppers, which can collude and combine information via diversity combining techniques. To be specific, four relay selection schemes, which differ in the way they employ available measures link quality, are considered to deliver the source information to the destination via a decode-and-forward (DF) strategy. To evaluate the security performance of the multi-hop cooperative link in the presence of colluding eavesdroppers, we derive novel closed-form analytical expressions for the secrecy outage probability (SOP) with consideration of special cases of practical interest.