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

EURASIP Journal on Wireless Communications and Networking

Physical Layer Security Game: Interaction between Source, Eavesdropper, and Friendly Jammer

Zhu Han, Ninoslav Marina, Merouane Abdelkader Debbah, Are Hjørungnes

Published Jan 6, 2010• 116 citations
Publisher

Abstract

Physical layer security is an emerging security area that achieves perfect secrecy data transmission between intended network nodes, while malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. We investigate the interaction between the source that transmits the useful data and friendly jammers who assist the source by "masking" the eavesdropper. To obtain distributed solution, we introduce a game theoretic approach. The game is defined such that the source pays the jammers to interfere the eavesdropper, therefore, increasing the secrecy capacity. The friendly jammers charge the source with a certain price for the jamming, and there is a tradeoff for the price. If too low, the profit of the jammers is low; and if too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we investigate a Stackelburg type of game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The distributed game solution is shown to have similar performances to those of the centralized one.

DOI
10.1155/2009/452907

Related papers

Physical layer security game: How to date a girl with her boyfriend on the same table

Han Zhu, Ninoslav Marina, Merouane Abdelkader Debbah +1 more

Physical layer security is an emerging security concept that achieves perfect secrecy data transmission between the intended network nodes, while the eavesdropping malicious nodes obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdropping malicious nodes while the interference to the intended destination is limited. In this paper, we investigate the interaction between the source that transmits the desired data and friendly jammers who assist the source by "disguising" the eavesdropper. In order to obtain a distributed solution, we introduce a game theoretic approach. The game is defined in such a way that the source pays the friendly jammers to interfere the eavesdropper, and, therefore, increasing its secrecy capacity. Friendly jammers charge the source with a certain price for this "jamming service". There is a tradeoff for the price: If the price is too low, the profit of the jammers is low; and if the price is too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we define and investigate a Stackelberg game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The fancy title comes from the fact that it is similar to a scenario where the main fellow character (the source) tries to send a dating message to a lady (the intended destination), whose "poor" boyfriend plays the role of the eavesdropper that may hear the message. Friends of the source, the so-called "friendly jammers," try to distract the boyfriend, so that the dating message can be secretly transmitted. The game is defined in order to derive what is the optimal price that the friends can charge for this "friendly" action.

International Conference on Game Theory for Networks•May 1, 2009•62 citations

Improved Wireless Secrecy Capacity using Distributed Auction Theory

Zhu Han, Ninoslav Marina, Merouane Abdelkader Debbah +1 more

Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by “masking” the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.

•Dec 16, 2009•4 citations

Improved Wireless Secrecy Rate Using Distributed Auction Theory

Zhu Han, Ninoslav Marina, Merouane Abdelkader Debbah +1 more

Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy rate can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by ''masking" the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.

International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)•Jan 1, 2009•23 citations

Physical Layer Security for Two-Way Untrusted Relaying With Friendly Jammers

Rongqing Zhang, Lingyang Song, Zhu Han +1 more

In this paper, we consider a two-way relay system where the two sources can only communicate through an untrusted intermediate relay and investigate the physical layer security issue in this two-way untrusted relay scenario. Specifically, we regard the intermediate relay as an eavesdropper from which the information transmitted by the sources needs to be kept confidential, despite the fact that its cooperation in relaying this information is essential. We first indicate that a nonzero secrecy rate is indeed achievable in this two-way untrusted relay system even without the help of external friendly jammers. As for the system with friendly jammers, after further analysis, we can obtain the secrecy rate of the sources can be effectively improved by utilizing proper jamming power from the friendly jammers. Then, we formulate a Stackelberg game between the sources and the friendly jammers as a power control scheme to achieve the optimized secrecy rate of the sources, in which the sources are treated as the sole buyer and the friendly jammers are the sellers. In addition, the optimal solutions of the jamming power and the asking prices are given, and a distributed updating algorithm to obtain the Stackelberg equilibrium is provided for the proposed game. Finally, the simulation results verify the properties and efficiency of the proposed Stackelberg-game-based scheme.

arXiv:1202.3824•IEEE Transactions on Vehicular Technology•Jul 23, 2012•225 citations

Distributed stable matching algorithm for physical layer security with multiple source-destination pairs and jammer nodes

Siavash Bayat, Raymond H. Y. Louie, Zhu Han +2 more

In wireless communications, the physical layer security is an emerging security research area that explores the possibilities of achieving high secrecy data transmission between source-destination nodes, while malicious eavesdroppers will obtain zero information from the source nodes. In this paper we consider enhancing the security level of a network comprising of multiple source-destination pairs, multiple friendly jammers and a malicious eavesdropper. We propose a distributed algorithm to facilitate secure data transmission from each source to its corresponding destination, through the help of friendly jammers. The key idea behind the proposed algorithm is that the friendly jammers help the source nodes to increase their secrecy rates and in exchange, the source nodes provide monetary compensation to the friendly jammers. We prove that after a limited number of iterations, the proposed algorithm converges to an optimal stable matching. Numerical analysis also reveals that the distributed algorithm can achieve a performance comparable to an optimal centralized solution, but with a significantly less overhead and complexity.

IEEE Wireless Communications and Networking Conference•Apr 1, 2012•16 citations

Physical Layer Security for Two Way Relay Communications with Friendly Jammers

Rongqing Zhang, Lingyang Song, Zhu Han +2 more

In this paper, we consider a two-way relay network where two sources can communicate only through an unauthenticated intermediate relay node. We investigate secure communications of this two-way relay scenario using physical layer security. Specifically, we treat the relay node as an eavesdropper from whom the information transmitted by the sources needs to be kept secret, despite the fact that its cooperation in relaying this information is essential. We first find that a non-zero secrecy rate is indeed achievable in this two-way relay network even without external jammers. Further still, with the help of friendly jammers who can transmit jamming signals to distract the malicious relay, a positive gain of the secrecy rate can be realized. In order to obtain the maximum secrecy rate, we define and then analyze an optimization problem. Finally, an optimal solution of jamming power allocation is provided for the system with friendly jammers.

Globecom•Dec 1, 2010•72 citations
Physical layer security is an emerging security area that achieves perfect secrecy data transmission between intended network nodes, while malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. We investigate the interaction between the source that transmits the useful data and friendly jammers who assist the source by "masking" the eavesdropper. To obtain distributed solution, we introduce a game theoretic approach. The game is defined such that the source pays the jammers to interfere the eavesdropper, therefore, increasing the secrecy capacity. The friendly jammers charge the source with a certain price for the jamming, and there is a tradeoff for the price. If too low, the profit of the jammers is low; and if too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we investigate a Stackelburg type of game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The distributed game solution is shown to have similar performances to those of the centralized one.
Physical layer security is an emerging security concept that achieves perfect secrecy data transmission between the intended network nodes, while the eavesdropping malicious nodes obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdropping malicious nodes while the interference to the intended destination is limited. In this paper, we investigate the interaction between the source that transmits the desired data and friendly jammers who assist the source by "disguising" the eavesdropper. In order to obtain a distributed solution, we introduce a game theoretic approach. The game is defined in such a way that the source pays the friendly jammers to interfere the eavesdropper, and, therefore, increasing its secrecy capacity. Friendly jammers charge the source with a certain price for this "jamming service". There is a tradeoff for the price: If the price is too low, the profit of the jammers is low; and if the price is too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we define and investigate a Stackelberg game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The fancy title comes from the fact that it is similar to a scenario where the main fellow character (the source) tries to send a dating message to a lady (the intended destination), whose "poor" boyfriend plays the role of the eavesdropper that may hear the message. Friends of the source, the so-called "friendly jammers," try to distract the boyfriend, so that the dating message can be secretly transmitted. The game is defined in order to derive what is the optimal price that the friends can charge for this "friendly" action.
Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by “masking” the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.
Physical layer security is an emerging security area that explores possibilities of achieving perfect secrecy data transmission between the intended network nodes, while possible malicious nodes that eavesdrop the communication obtain zero information. The so-called secrecy rate can be improved using friendly jammers that introduce extra interference to the eavesdroppers. Here, we investigate the interaction between the multiple source-destination links and a friendly jammer who assists by ''masking" the eavesdropper. In order to obtain a distributed solution, one possibility is to introduce a distributed auction theoretic approach. The auction is defined such that the source-destination links provide bids for the jammer to interfere the eavesdropper, therefore increasing their secrecy capacities. We propose a distributed auction using the share auction and iteratively updating the bids. To compare with the performances, we construct a centralized solution and a VCG auction, which cannot be implemented in practice. Our analysis and simulation results show the effectiveness of friendly jamming and convergence of the proposed scheme. The distributed game solution is shown to have similar performances to those of the centralized ones.
In this paper, we consider a two-way relay system where the two sources can only communicate through an untrusted intermediate relay and investigate the physical layer security issue in this two-way untrusted relay scenario. Specifically, we regard the intermediate relay as an eavesdropper from which the information transmitted by the sources needs to be kept confidential, despite the fact that its cooperation in relaying this information is essential. We first indicate that a nonzero secrecy rate is indeed achievable in this two-way untrusted relay system even without the help of external friendly jammers. As for the system with friendly jammers, after further analysis, we can obtain the secrecy rate of the sources can be effectively improved by utilizing proper jamming power from the friendly jammers. Then, we formulate a Stackelberg game between the sources and the friendly jammers as a power control scheme to achieve the optimized secrecy rate of the sources, in which the sources are treated as the sole buyer and the friendly jammers are the sellers. In addition, the optimal solutions of the jamming power and the asking prices are given, and a distributed updating algorithm to obtain the Stackelberg equilibrium is provided for the proposed game. Finally, the simulation results verify the properties and efficiency of the proposed Stackelberg-game-based scheme.
In wireless communications, the physical layer security is an emerging security research area that explores the possibilities of achieving high secrecy data transmission between source-destination nodes, while malicious eavesdroppers will obtain zero information from the source nodes. In this paper we consider enhancing the security level of a network comprising of multiple source-destination pairs, multiple friendly jammers and a malicious eavesdropper. We propose a distributed algorithm to facilitate secure data transmission from each source to its corresponding destination, through the help of friendly jammers. The key idea behind the proposed algorithm is that the friendly jammers help the source nodes to increase their secrecy rates and in exchange, the source nodes provide monetary compensation to the friendly jammers. We prove that after a limited number of iterations, the proposed algorithm converges to an optimal stable matching. Numerical analysis also reveals that the distributed algorithm can achieve a performance comparable to an optimal centralized solution, but with a significantly less overhead and complexity.
In this paper, we consider a two-way relay network where two sources can communicate only through an unauthenticated intermediate relay node. We investigate secure communications of this two-way relay scenario using physical layer security. Specifically, we treat the relay node as an eavesdropper from whom the information transmitted by the sources needs to be kept secret, despite the fact that its cooperation in relaying this information is essential. We first find that a non-zero secrecy rate is indeed achievable in this two-way relay network even without external jammers. Further still, with the help of friendly jammers who can transmit jamming signals to distract the malicious relay, a positive gain of the secrecy rate can be realized. In order to obtain the maximum secrecy rate, we define and then analyze an optimization problem. Finally, an optimal solution of jamming power allocation is provided for the system with friendly jammers.