Secure Communication for Two-Way Relay Networks with Imperfect CSI
This paper considers a two-way relay network, where two legitimate users exchange messages through several cooperative relays in the presence of an eavesdropper, and the Channel State Information (CSI) of the eavesdropper is imperfectly known. The Amplify-and-Forward (AF) relay protocol is used. We...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2017-09-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/19/10/522 |
| _version_ | 1798040040559869952 |
|---|---|
| author | Cong Sun Ke Liu Dahu Zheng Wenbao Ai |
| author_facet | Cong Sun Ke Liu Dahu Zheng Wenbao Ai |
| author_sort | Cong Sun |
| collection | DOAJ |
| description | This paper considers a two-way relay network, where two legitimate users exchange messages through several cooperative relays in the presence of an eavesdropper, and the Channel State Information (CSI) of the eavesdropper is imperfectly known. The Amplify-and-Forward (AF) relay protocol is used. We design the relay beamforming weights to minimize the total relay transmit power, while requiring the Signal-to-Noise-Ratio (SNRs) of the legitimate users to be higher than the given thresholds and the achievable rate of the eavesdropper to be upper-bounded. Due to the imperfect CSI, a robust optimization problem is summarized. A novel iterative algorithm is proposed, where the line search technique is applied, and the feasibility is preserved during iterations. In each iteration, two Quadratically-Constrained Quadratic Programming (QCQP) subproblems and a one-dimensional subproblem are optimally solved. The optimality property of the robust optimization problem is analyzed. Simulation results show that the proposed algorithm performs very close to the non-robust model with perfect CSI, in terms of the obtained relay transmit power; it~achieves higher secrecy rate compared to the existing work. Numerically, the proposed algorithm converges very quickly, and more than 85% of the problems are solved optimally. |
| first_indexed | 2024-04-11T22:02:01Z |
| format | Article |
| id | doaj.art-32e215ca567e44468f9bebd836bfaa07 |
| institution | Directory Open Access Journal |
| issn | 1099-4300 |
| language | English |
| last_indexed | 2024-04-11T22:02:01Z |
| publishDate | 2017-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj.art-32e215ca567e44468f9bebd836bfaa072022-12-22T04:00:52ZengMDPI AGEntropy1099-43002017-09-01191052210.3390/e19100522e19100522Secure Communication for Two-Way Relay Networks with Imperfect CSICong Sun0Ke Liu1Dahu Zheng2Wenbao Ai3Current address: No. 10, Xi Tu Cheng Road, Haidian District, Beijing 100876, China.School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Science, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Science, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaThis paper considers a two-way relay network, where two legitimate users exchange messages through several cooperative relays in the presence of an eavesdropper, and the Channel State Information (CSI) of the eavesdropper is imperfectly known. The Amplify-and-Forward (AF) relay protocol is used. We design the relay beamforming weights to minimize the total relay transmit power, while requiring the Signal-to-Noise-Ratio (SNRs) of the legitimate users to be higher than the given thresholds and the achievable rate of the eavesdropper to be upper-bounded. Due to the imperfect CSI, a robust optimization problem is summarized. A novel iterative algorithm is proposed, where the line search technique is applied, and the feasibility is preserved during iterations. In each iteration, two Quadratically-Constrained Quadratic Programming (QCQP) subproblems and a one-dimensional subproblem are optimally solved. The optimality property of the robust optimization problem is analyzed. Simulation results show that the proposed algorithm performs very close to the non-robust model with perfect CSI, in terms of the obtained relay transmit power; it~achieves higher secrecy rate compared to the existing work. Numerically, the proposed algorithm converges very quickly, and more than 85% of the problems are solved optimally.https://www.mdpi.com/1099-4300/19/10/522physical layer securityamplify-and-forward two-way relayimperfect CSIrobust optimizationline search technique |
| spellingShingle | Cong Sun Ke Liu Dahu Zheng Wenbao Ai Secure Communication for Two-Way Relay Networks with Imperfect CSI Entropy physical layer security amplify-and-forward two-way relay imperfect CSI robust optimization line search technique |
| title | Secure Communication for Two-Way Relay Networks with Imperfect CSI |
| title_full | Secure Communication for Two-Way Relay Networks with Imperfect CSI |
| title_fullStr | Secure Communication for Two-Way Relay Networks with Imperfect CSI |
| title_full_unstemmed | Secure Communication for Two-Way Relay Networks with Imperfect CSI |
| title_short | Secure Communication for Two-Way Relay Networks with Imperfect CSI |
| title_sort | secure communication for two way relay networks with imperfect csi |
| topic | physical layer security amplify-and-forward two-way relay imperfect CSI robust optimization line search technique |
| url | https://www.mdpi.com/1099-4300/19/10/522 |
| work_keys_str_mv | AT congsun securecommunicationfortwowayrelaynetworkswithimperfectcsi AT keliu securecommunicationfortwowayrelaynetworkswithimperfectcsi AT dahuzheng securecommunicationfortwowayrelaynetworkswithimperfectcsi AT wenbaoai securecommunicationfortwowayrelaynetworkswithimperfectcsi |