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

Sensors

A Coalitional Formation Game for Physical Layer Security of Cooperative Compressive Sensing Multi-Relay Networks

Jialun Li, Shuai Chang, Xiaomei Fu, Liang Zhang, Yishan Su, Zhigang Jin

Published Sep 4, 2018• 1 citation
Publisher

Abstract

Cooperative relaying is an effective technology to improve the capacity of physical-layer security, in which the relay helps forward the received signal to the destination. In this paper, a cooperative compressive sensing and amplify-and-forward (CCS-AF) scheme, which combines the compressive sensing theory and amplify-and-forward strategy, is proposed to increase the secrecy capacity. To optimize the secrecy performance, a coalition formation algorithm based on coalitional game theory of optimal relay selection is proposed to maximize the secrecy capacity. Different to maximizing the individual utility based on the traditional pareto order, the max-coalition order rule is newly defined to guide the coalitional formation. Simulation results indicate that with the proposed algorithm, part of the relays could form a coalition to forward the information and the proposed algorithm could significantly improve the secrecy capacity of cooperative multi-relay networks.

DOI
10.3390/s18092942

Related papers

Energy Harvesting for Physical Layer Security in Cooperative Networks Based on Compressed Sensing

Shuai Chang, Jialun Li, Xiaomei Fu +1 more

Energy harvesting (EH) has attracted a lot of attention in cooperative communication networks studies for its capability of transferring energy from sources to relays. In this paper, we study the secrecy capacity of a cooperative compressed sensing amplify and forward (CCS-AF) wireless network in the presence of eavesdroppers based on an energy harvesting protocol. In this model, the source nodes send their information to the relays simultaneously, and then the relays perform EH from the received radio-frequency signals based on the power splitting-based relaying (PSR) protocol. The energy harvested by the relays will be used to amplify and forward the received information to the destination. The impacts of some key parameters, such as the power splitting ratio, energy conversion efficiency, relay location, and the number of relays, on the system secrecy capacity are analyzed through a group of experiments. Simulation results reveal that under certain conditions, the proposed EH relaying scheme can achieve higher secrecy capacity than traditional relaying strategies while consuming equal or even less power.

Entropy•Sep 1, 2017•14 citations

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

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

Feiwen Li, Shunliang Zhang

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.

•Jun 1, 2021•1 citation

Compressed Sensing for Physical Layer Security in Single Relay Cooperative System

Guangyao Han, Xiaomei Fu, Qing Lyu

In this paper, we investigate the physical layer security of single amplify-and-forward (AF) relay communication system based on compressed sensing (CS). Different to the traditional method by compressing the source data with a specific measurement matrix (e.g. Gaussian matrix)to achieve security, we first demonstrate that the combination matrix of the compression measurement matrix and cooperative AF channel matrix between legitimate nodes (source, relay, and destination) can be considered as a secure measurement matrix for physical layer security. Compared with CS scenario without AF (CS Non-AF), the eavesdropper in the proposed scheme can hardly decode the original data correctly even when it has a perfect knowledge of eavesdropper channel state information (ECSI). The robustness of the scheme in the presence of one eavesdropper is also investigated.

IEEE International Conference on Signal, Information and Data Processing (ICSIDP)•Dec 1, 2019•0 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: 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
Cooperative relaying is an effective technology to improve the capacity of physical-layer security, in which the relay helps forward the received signal to the destination. In this paper, a cooperative compressive sensing and amplify-and-forward (CCS-AF) scheme, which combines the compressive sensing theory and amplify-and-forward strategy, is proposed to increase the secrecy capacity. To optimize the secrecy performance, a coalition formation algorithm based on coalitional game theory of optimal relay selection is proposed to maximize the secrecy capacity. Different to maximizing the individual utility based on the traditional pareto order, the max-coalition order rule is newly defined to guide the coalitional formation. Simulation results indicate that with the proposed algorithm, part of the relays could form a coalition to forward the information and the proposed algorithm could significantly improve the secrecy capacity of cooperative multi-relay networks.
Energy harvesting (EH) has attracted a lot of attention in cooperative communication networks studies for its capability of transferring energy from sources to relays. In this paper, we study the secrecy capacity of a cooperative compressed sensing amplify and forward (CCS-AF) wireless network in the presence of eavesdroppers based on an energy harvesting protocol. In this model, the source nodes send their information to the relays simultaneously, and then the relays perform EH from the received radio-frequency signals based on the power splitting-based relaying (PSR) protocol. The energy harvested by the relays will be used to amplify and forward the received information to the destination. The impacts of some key parameters, such as the power splitting ratio, energy conversion efficiency, relay location, and the number of relays, on the system secrecy capacity are analyzed through a group of experiments. Simulation results reveal that under certain conditions, the proposed EH relaying scheme can achieve higher secrecy capacity than traditional relaying strategies while consuming equal or even less power.
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.
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.
In this paper, we investigate the physical layer security of single amplify-and-forward (AF) relay communication system based on compressed sensing (CS). Different to the traditional method by compressing the source data with a specific measurement matrix (e.g. Gaussian matrix)to achieve security, we first demonstrate that the combination matrix of the compression measurement matrix and cooperative AF channel matrix between legitimate nodes (source, relay, and destination) can be considered as a secure measurement matrix for physical layer security. Compared with CS scenario without AF (CS Non-AF), the eavesdropper in the proposed scheme can hardly decode the original data correctly even when it has a perfect knowledge of eavesdropper channel state information (ECSI). The robustness of the scheme in the presence of one eavesdropper is also investigated.
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.
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.