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

Secure transmission in cooperative wireless networks: A two-level coalitional game approach

Feiwen Li, Shunliang Zhang

Published Jun 1, 2021• 1 citation
Publisher

Abstract

In this paper, we propose a novel hybrid beamforming and jamming strategy to secure the transmission in wireless cooperative networks. It enhances the secrecy capacity by cooperatively using distributed multi-antenna techniques to maximize the secrecy capacity, as well as nullify the information leakage at the eavesdropper and the interference at the legitimate users. The optimum intermediate relays and jammers selection is modeled as a two-level coalitional game problem. A distributed coalition formation algorithm based on merge-and-split rules is devised to solve the problem. The approach enables the intermediate nodes self-organize into independent disjoint coalitions and requires much less computational complexity. Then the optimal relaying and jamming coalitions are selected to secure transmission in a cooperative way. Extensive simulations demonstrate that the proposed coalition formation method can improve the secrecy capacity significantly compared with the existing non-collaborate relaying and jamming nodes selection scheme and random selection approach.

DOI
10.1109/ict52184.2021.9511540

Related papers

Hybrid relaying and jamming for wireless physical layer security based on cooperative beamforming

HuiMing WANG, Miao Luo, Qinye Yin

To improve the information-theoretic security of two-way wireless cooperative communication systems, we propose in this study a hybrid relaying and jamming mechanism based on multi-node cooperative beamforming to enhance the security of the physical layer transmission of information. The basic concept is that in the cooperative transmission phase, some intermediate nodes adopt distributed beamforming to help the transmitter send messages to legitimate users and simultaneously others jam the eavesdropper, which can significantly improve the security performance of the system in the broadcast phase. Two different cooperative beamforming schemes are proposed with and without the instantaneous channel state information (CSI) of the eavesdropper. We show that optimizing both the schemes requires the mathematical solving of one or a series of second-order convex cone programming (SOCP) problems, which can be executed by efficiently using the interior point method. Simulation and comparisons show that our proposed hybrid relaying, jamming mechanism and beamforming approaches significantly increase the security sum rate of the two source terminals and outperform both the relays-only and jammers-only mechanisms when the number of intermediate nodes is relatively large.

Scientia Sinica Informationis•Apr 1, 2013•4 citations

Hybrid relaying and jamming for secure two-way relay networks with per-node power constraint

Hui‐Ming Wang, Miao Luo, Qinye Yin

Cooperative relaying and jamming are two efficient schemes to improve the physical-layer security of a wireless transmission in the presence of an eavesdropper. In this paper, we propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where some intermediate nodes adopt distributed beamforming to improve the channel quality to legitimate terminals and others jam the eavesdropper, simultaneously. Subjected to the more practical per-node power constraint of each cooperative node, we propose a secrecy scheme to maximize the secrecy sum rate of the two terminals. It is shown that the problem can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. We then propose a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization technique in the previous literature. Simulations show that the proposed hybrid schemes greatly improve the security of the two-way relay networks.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2012•1 citation

Hybrid relaying and jamming for Physical layer security improvement in two-way relay networks

Kuo Cao, Xinrong Guan, Yueming Cai

Cooperative relaying and jamming are two efficient schemes to improve the Physical-layer security of a wireless transmission in the presence of multiple eavesdroppers. In this paper, we consider their cooperation in the context of AF-based two-way relay. We propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where all the intermediate nodes not only adopt distributed beamforming but also jam the eavesdroppers to maximize the sum secrecy rate of the two terminals. We give the closed form solution of jamming weight vector and present the optimal relay beamforming scheme as well as an efficient algorithm to compute the optimal beamforming matrix based on convex optimization techniques. Simulations show that the proposed scheme greatly improves the security of the two-way relay network.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2013•2 citations

Hybrid relaying and jamming for secure two-way relay networks with passive eavesdroppers

Hui‐Ming Wang, Xiang‐Gen Xia, Qinye Yin +1 more

Exploiting the idea of cooperative communications is an efficient way to improve the physical-layer security of a wireless transmission in the presence of passive eavesdroppers. In this paper, we propose a hybrid cooperative relaying and jamming scheme to enhance the security of a two-way relay network, where some intermediate nodes help to relay the signal to the legitimate terminals via distributed beamforming and the others jam the eavesdropper simultaneously. In such a way, both two cooperative phases of the data transmission are protected. Subjected to the more practical per-node power constraint of each node and without the channel state information (CSI) of the eavesdropper, we propose a scheme to enhance the secrecy of the two terminals. It is shown that the problem can be transformed into a semidefinite programming (SDP) problem with an additional rank-1 constraint. We then develop a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization techniques proposed in the previous literatures. Simulations show that the proposed hybrid scheme greatly improves the security of the two-way relay networks.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2013•1 citation

Physical Layer Security: Coalitional Games for Distributed Cooperation

Walid Saad, Zhu Han, Tamer Başar +2 more

Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers. While existing physical layer security literature answered the question "what are the link-level secrecy capacity gains from cooperation?", this paper attempts to answer the question of "how to achieve those gains in a practical decentralized wireless network and in the presence of a secrecy capacity cost for information exchange?". For this purpose, we model the physical layer security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Through the proposed algorithm, the wireless users can autonomously cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy capacity taking into account the security costs during information exchange. We analyze the resulting coalitional structures, discuss their properties, and study how the users can self-adapt the network topology to environmental changes such as mobility. Simulation results show that the proposed algorithm allows the users to cooperate and self-organize while improving the average secrecy capacity per user up to 25.32% relative to the non-cooperative case.

arXiv:0906.4827•Jun 26, 2009•1 citation

Physical layer security: Coalitional games for distributed cooperation

Walid Saad, Zhu Han, Tamer Başar +2 more

Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers. While existing physical layer security literature answered the question “what are the link-level secrecy capacity gains from cooperation?”, this paper attempts to answer the question of “how to achieve those gains in a practical decentralized wireless network and in the presence of a secrecy capacity cost for information exchange?”. For this purpose, we model the physical layer security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Through the proposed algorithm, the wireless users can autonomously cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy capacity taking into account the security costs during information exchange. We analyze the resulting coalitional structures, discuss their properties, and study how the users can self-adapt the network topology to environmental changes such as mobility. Simulation results show that the proposed algorithm allows the users to cooperate and self-organize while improving the average secrecy capacity per user up to 25.32% relative to the non-cooperative case.

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)•Jun 1, 2009•50 citations
In this paper, we propose a novel hybrid beamforming and jamming strategy to secure the transmission in wireless cooperative networks. It enhances the secrecy capacity by cooperatively using distributed multi-antenna techniques to maximize the secrecy capacity, as well as nullify the information leakage at the eavesdropper and the interference at the legitimate users. The optimum intermediate relays and jammers selection is modeled as a two-level coalitional game problem. A distributed coalition formation algorithm based on merge-and-split rules is devised to solve the problem. The approach enables the intermediate nodes self-organize into independent disjoint coalitions and requires much less computational complexity. Then the optimal relaying and jamming coalitions are selected to secure transmission in a cooperative way. Extensive simulations demonstrate that the proposed coalition formation method can improve the secrecy capacity significantly compared with the existing non-collaborate relaying and jamming nodes selection scheme and random selection approach.
To improve the information-theoretic security of two-way wireless cooperative communication systems, we propose in this study a hybrid relaying and jamming mechanism based on multi-node cooperative beamforming to enhance the security of the physical layer transmission of information. The basic concept is that in the cooperative transmission phase, some intermediate nodes adopt distributed beamforming to help the transmitter send messages to legitimate users and simultaneously others jam the eavesdropper, which can significantly improve the security performance of the system in the broadcast phase. Two different cooperative beamforming schemes are proposed with and without the instantaneous channel state information (CSI) of the eavesdropper. We show that optimizing both the schemes requires the mathematical solving of one or a series of second-order convex cone programming (SOCP) problems, which can be executed by efficiently using the interior point method. Simulation and comparisons show that our proposed hybrid relaying, jamming mechanism and beamforming approaches significantly increase the security sum rate of the two source terminals and outperform both the relays-only and jammers-only mechanisms when the number of intermediate nodes is relatively large.
Cooperative relaying and jamming are two efficient schemes to improve the physical-layer security of a wireless transmission in the presence of an eavesdropper. In this paper, we propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where some intermediate nodes adopt distributed beamforming to improve the channel quality to legitimate terminals and others jam the eavesdropper, simultaneously. Subjected to the more practical per-node power constraint of each cooperative node, we propose a secrecy scheme to maximize the secrecy sum rate of the two terminals. It is shown that the problem can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. We then propose a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization technique in the previous literature. Simulations show that the proposed hybrid schemes greatly improve the security of the two-way relay networks.
Cooperative relaying and jamming are two efficient schemes to improve the Physical-layer security of a wireless transmission in the presence of multiple eavesdroppers. In this paper, we consider their cooperation in the context of AF-based two-way relay. We propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where all the intermediate nodes not only adopt distributed beamforming but also jam the eavesdroppers to maximize the sum secrecy rate of the two terminals. We give the closed form solution of jamming weight vector and present the optimal relay beamforming scheme as well as an efficient algorithm to compute the optimal beamforming matrix based on convex optimization techniques. Simulations show that the proposed scheme greatly improves the security of the two-way relay network.
Exploiting the idea of cooperative communications is an efficient way to improve the physical-layer security of a wireless transmission in the presence of passive eavesdroppers. In this paper, we propose a hybrid cooperative relaying and jamming scheme to enhance the security of a two-way relay network, where some intermediate nodes help to relay the signal to the legitimate terminals via distributed beamforming and the others jam the eavesdropper simultaneously. In such a way, both two cooperative phases of the data transmission are protected. Subjected to the more practical per-node power constraint of each node and without the channel state information (CSI) of the eavesdropper, we propose a scheme to enhance the secrecy of the two terminals. It is shown that the problem can be transformed into a semidefinite programming (SDP) problem with an additional rank-1 constraint. We then develop a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization techniques proposed in the previous literatures. Simulations show that the proposed hybrid scheme greatly improves the security of the two-way relay networks.
Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers. While existing physical layer security literature answered the question "what are the link-level secrecy capacity gains from cooperation?", this paper attempts to answer the question of "how to achieve those gains in a practical decentralized wireless network and in the presence of a secrecy capacity cost for information exchange?". For this purpose, we model the physical layer security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Through the proposed algorithm, the wireless users can autonomously cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy capacity taking into account the security costs during information exchange. We analyze the resulting coalitional structures, discuss their properties, and study how the users can self-adapt the network topology to environmental changes such as mobility. Simulation results show that the proposed algorithm allows the users to cooperate and self-organize while improving the average secrecy capacity per user up to 25.32% relative to the non-cooperative case.
Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers. While existing physical layer security literature answered the question “what are the link-level secrecy capacity gains from cooperation?”, this paper attempts to answer the question of “how to achieve those gains in a practical decentralized wireless network and in the presence of a secrecy capacity cost for information exchange?”. For this purpose, we model the physical layer security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Through the proposed algorithm, the wireless users can autonomously cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy capacity taking into account the security costs during information exchange. We analyze the resulting coalitional structures, discuss their properties, and study how the users can self-adapt the network topology to environmental changes such as mobility. Simulation results show that the proposed algorithm allows the users to cooperate and self-organize while improving the average secrecy capacity per user up to 25.32% relative to the non-cooperative case.