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

International Conference on Awareness Science and Technology (iCAST)

Secrecy Rate Analysis for the Cooperative Communications

Jong-Shin Chen, Cheng‐Ying Yang, Jenq-Foung JF Yao, Min‐Shiang Hwang

Published Nov 9, 2023• 0 citations
Publisher

Abstract

Due to the character of low cost and easily to implemented, the cooperative communication is the future tendency. Three fundamental mode, Amplify-and-Forward (AF) mode, Decode-and-Forward (DF) mode and Compress and Forward (CF) mode are employed to the system. In the cooperative system, relays function to transmit the delivered signal to the destination. Each node in the system could play as the source station, the relay and the destination station. Currently, the issue of privacy and security are seriously requested in the communication. There could be the eavesdroppers pre-tend as the relay to steal the message. Hence, the secrecy protection becomes important. In the higher layer, the encryption scheme is applied to protect the message. However, it is difficult for those devices with low computing resources, the example of IoT (Internet of Things). With Shannon Theory, a secure communication could be supported with a positive secrecy rate. Hence, secure cooperative communication could be possible if there exist a positive secrecy rate between the two ends in the transmissions. Base on the secrecy rate analysis, the maximum secrecy rate is the initial step toward a secure communication. In the cooperative system, the delivered signal could be transmitted via relays. Hence, the path from the source to the destination could be a huge combination. With the exhaustive method to find the optimal secrecy rate could be realized. Hence, in this work, the numerical experiment, the AF and DF mode cooperative mode is adopted.

DOI
10.1109/icast57874.2023.10359261

Related papers

Secrecy Rate Analysis in The Cooperative Communication System

Jong-Shin Chen, Cheng‐Ying Yang, Jenq-Foung JF Yao +1 more

With the assistance of relays, cooperative communication provides the benefits of spatial diversity to improves the system performance. It could be prospective for the application of wireless networks. The issue of security is highly requested for personal privacy in the internet. With applying this cooperative system to internet service, security is critically requested. Usually, in the higher layer networks, it adopts an encryption to approach the security request. However, a complex encryption spends a lot of computer resource. It is not practical for Internet of things (IoT) application which has a limited computing resource. Shannon perfect secrecy illustrates the secure communication could be implemented on the physical layer. Assuming the relays in the system is the eavesdroppers, this paper provides the secrecy analysis for the cooperative system and gives a theoretical solution. With an appropriate assignment of relay, the results show that the cooperative system could provide a secure communication if the number of available relays is larger than that of eavesdroppers. A proper choosing the relays to transmit the information could be the important issue in the cooperative communication system.

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)•Sep 15, 2021•3 citations

Analyzing Amplify-and-Forward and Decode-and-Forward Cooperative Strategies in Wyner's Channel Model

Pengyu Zhang, Jian Yuan, Jianshu Chen +2 more

The benefits of Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative relay for secure communication are investigated within Wyner's wiretap channel. We characterize the secrecy rate when source, destination, relay and eavesdropper all use single antenna and the channel conditions are fix. Both AF and DF cooperative strategies are proved theoretically to be able to facilitate secure communication. Detailed analysis of AF and DF scheme reveals a trade off between secrecy area and request secrecy rate. In addition, secrecy constraints in cooperative secure communication are discussed and are used to explain the differences in AF and DF scheme. Overall, our work establishes the utility of cooperation and compares each advantage of AF and DF scheme in facilitating secure communication over wireless channel.

IEEE Wireless Communications and Networking Conference•Apr 1, 2009•41 citations

Evaluation of Secrecy Rate in Cooperative Communication System

Cheng‐Ying Yang, Hsinying Liang, Pin-Yen Huang Huang

Cooperative system is a tendency for future communications because of its spatial diversity to improve the system performance. However, the security is a critical issue in the wireless application with a highly private request. Although the encryption schemes have been proposed to approach the secure purpose, those schemes need a lot of computing resource. It is not practical for the applications with limited computing ability, such as IoT. According to Shannon theory of perfect secrecy, the security could be implemented on the physical layer. Based on the positive secrecy rate, the evaluation of security, secure communication could be practical. This work concentrates on the theoretical solution to the secrecy rate in the AF mode cooperative communication system. Also, the numerical results with the proposed methodology are given. It shows the effects of eavesdropper could not affect the secure communication if the number of the eavesdropper is less than that of relays in the system. The appropriate relay assignment benefits the secure communication.

EPiC series in computing•Mar 13, 2019•2 citations

Performance analysis of cooperative schemes under total transmit power constraint in single hop wireless relaying system

Rupali Sinha, Poonam Jindal

In wireless communication, physical layer security is widely used for secure communication between the transmitter and the receiver. In this paper, the secrecy performance of two cooperative schemes, decode-and-forward (DF) and amplify-and-forward (AF) relays is investigated in a single hop wireless relaying system. The achievable secrecy rate is investigated with these two types of relays under the constraint of total power transmitted. In the given jamming relay network, the relay transmits jamming signal while receiving data signal from the source. It is indicated by the resulting analysis that the AF relays have better secrecy rate as compared to the DF relays in the given condition. The secrecy rate of the AF relay is higher than that of the DF relay by 71.88% at a distance of 70 m between the relay and the eavesdropper in this jamming relay network.

International Conference on Communication, Control and Intelligent Systems (CCIS)•Nov 1, 2016•3 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

Improving Wireless Physical Layer Security via Cooperating Relays

Lun Dong, Zhu Han, Athina P. Petropulu +1 more

Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.

IEEE Transactions on Signal Processing•Dec 11, 2009•1,366 citations
Due to the character of low cost and easily to implemented, the cooperative communication is the future tendency. Three fundamental mode, Amplify-and-Forward (AF) mode, Decode-and-Forward (DF) mode and Compress and Forward (CF) mode are employed to the system. In the cooperative system, relays function to transmit the delivered signal to the destination. Each node in the system could play as the source station, the relay and the destination station. Currently, the issue of privacy and security are seriously requested in the communication. There could be the eavesdroppers pre-tend as the relay to steal the message. Hence, the secrecy protection becomes important. In the higher layer, the encryption scheme is applied to protect the message. However, it is difficult for those devices with low computing resources, the example of IoT (Internet of Things). With Shannon Theory, a secure communication could be supported with a positive secrecy rate. Hence, secure cooperative communication could be possible if there exist a positive secrecy rate between the two ends in the transmissions. Base on the secrecy rate analysis, the maximum secrecy rate is the initial step toward a secure communication. In the cooperative system, the delivered signal could be transmitted via relays. Hence, the path from the source to the destination could be a huge combination. With the exhaustive method to find the optimal secrecy rate could be realized. Hence, in this work, the numerical experiment, the AF and DF mode cooperative mode is adopted.
With the assistance of relays, cooperative communication provides the benefits of spatial diversity to improves the system performance. It could be prospective for the application of wireless networks. The issue of security is highly requested for personal privacy in the internet. With applying this cooperative system to internet service, security is critically requested. Usually, in the higher layer networks, it adopts an encryption to approach the security request. However, a complex encryption spends a lot of computer resource. It is not practical for Internet of things (IoT) application which has a limited computing resource. Shannon perfect secrecy illustrates the secure communication could be implemented on the physical layer. Assuming the relays in the system is the eavesdroppers, this paper provides the secrecy analysis for the cooperative system and gives a theoretical solution. With an appropriate assignment of relay, the results show that the cooperative system could provide a secure communication if the number of available relays is larger than that of eavesdroppers. A proper choosing the relays to transmit the information could be the important issue in the cooperative communication system.
The benefits of Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative relay for secure communication are investigated within Wyner's wiretap channel. We characterize the secrecy rate when source, destination, relay and eavesdropper all use single antenna and the channel conditions are fix. Both AF and DF cooperative strategies are proved theoretically to be able to facilitate secure communication. Detailed analysis of AF and DF scheme reveals a trade off between secrecy area and request secrecy rate. In addition, secrecy constraints in cooperative secure communication are discussed and are used to explain the differences in AF and DF scheme. Overall, our work establishes the utility of cooperation and compares each advantage of AF and DF scheme in facilitating secure communication over wireless channel.
Cooperative system is a tendency for future communications because of its spatial diversity to improve the system performance. However, the security is a critical issue in the wireless application with a highly private request. Although the encryption schemes have been proposed to approach the secure purpose, those schemes need a lot of computing resource. It is not practical for the applications with limited computing ability, such as IoT. According to Shannon theory of perfect secrecy, the security could be implemented on the physical layer. Based on the positive secrecy rate, the evaluation of security, secure communication could be practical. This work concentrates on the theoretical solution to the secrecy rate in the AF mode cooperative communication system. Also, the numerical results with the proposed methodology are given. It shows the effects of eavesdropper could not affect the secure communication if the number of the eavesdropper is less than that of relays in the system. The appropriate relay assignment benefits the secure communication.
In wireless communication, physical layer security is widely used for secure communication between the transmitter and the receiver. In this paper, the secrecy performance of two cooperative schemes, decode-and-forward (DF) and amplify-and-forward (AF) relays is investigated in a single hop wireless relaying system. The achievable secrecy rate is investigated with these two types of relays under the constraint of total power transmitted. In the given jamming relay network, the relay transmits jamming signal while receiving data signal from the source. It is indicated by the resulting analysis that the AF relays have better secrecy rate as compared to the DF relays in the given condition. The secrecy rate of the AF relay is higher than that of the DF relay by 71.88% at a distance of 70 m between the relay and the eavesdropper in this jamming relay network.
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.
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.