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

Communications technology

Game between Source and Jamming Relay in Wireless Communication

Jie Zhou

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

A four-terminal Gaussian network,composed of source,destination,eavesdropper and jammer relay,is discussed.The source aims to maximize the achievable secrecy rates,whereas the jammer relay times to minimize these rates.And the source and the jammer relay form a game problem,and with non-cooperative zero-sum game for this problem,the saddle-point solutions are found.The simulation shows that by using both relay and sending noise,the secrecy rate could be effectively decreased.

Related papers

A secrecy game with an informed jammer relay

Melda Yüksel, Xi Liu, Elza Erkip

A four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is investigated when the jammer relay is causally given the source message. The source aims to increase the achievable secrecy rates, whereas the jammer relay aims to decrease it. To help the eavesdropper and to decrease achievable perfect secrecy rates, the jammer relay can use pure relaying and/or send interference to assist eavesdropping. The problem is formulated as a zero-sum game and the saddle point solutions are found. The results are compared to the case when the jammer relay is not informed about the source message.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2010•6 citations

A secure communication game with a relay helping the eavesdropper

Melda Yüksel, Xi Liu, Elza Erkip

In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.

IEEE Information Theory Workshop (ITW)•Jan 1, 2009•13 citations

A Secure Communication Game with a Relay Helping the Eavesdropper

Melda Yüksel, Xi Liu, Elza Erkip

In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.

arXiv:0911.0089•Oct 31, 2009•0 citations

A Secure Communication Game With a Relay Helping the Eavesdropper

M. Yuksel, Xi Liu, E. Erkip

In this work, a four-terminal complex Gaussian network composed of a source, a destination, an eavesdropper, and a jammer relay is studied under two different set of assumptions: 1) The jammer relay does not hear the source transmission, and 2) The jammer relay is causally given the source message. In both cases, the jammer relay assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase it. To help the eavesdropper, the jammer relay can use pure relaying and/or send interference. Each of the problems is formulated as a two-player, noncooperative, zero-sum continuous game. Assuming Gaussian strategies at the source and the jammer relay in the first problem, the Nash equilibrium is found and shown to be achieved with mixed strategies in general. The optimal cumulative distribution functions (cdfs) for the source and the jammer relay that achieve the value of the game, which is the Nash equilibrium secrecy rate, are found. For the second problem, the Nash equilibrium solution is found and the results are compared to the case when the jammer relay is not informed about the source message.

arXiv:1103.1306•IEEE Transactions on Information Forensics and Security•Mar 15, 2011•56 citations

On Maximizing the Secrecy Rate in a Cooperative Wireless Network using Friendly Jammers

Mohammad Hatami, Hamid Behroozi

In this paper, the security of two-phase relaying system with multiple intermediate nodes in the presence of a malicious eavesdropper is investigated. To enhance the secrecy, a joint cooperative beamforming and jamming combined with relay and jammer selection is proposed. First, the source broadcasts its signal to the relays that are located close to source in a cluster, i.e., the source node uses a small amount of power to broadcast its message locally to other nodes of the cluster, while destination and the eavesdropper are located outside this cluster. In the second phase, two relays transmit re-encoded signal with optimal beamforming such that the secrecy rate is maximized. Simultaneously, two other intermediate nodes (which act as friendly jammers) transmit random jamming signals to degrade the eavesdropper’s channel. Our goal in this paper is to maximize the secrecy rate by applying different methods such as cooperative beamforming, cooperative jamming and relay and jammer selection. To avoid operational complexity, we consider the minimum number of intermediate nodes needed for relaying and jamming without losing the performance, i.e., achieving a non-zero secrecy rate. Cooperative beamforming with multiple relays demands high amount of information exchange and therefore increases the operational complexity. Thus, we aim to reduce the number of relays which take part in cooperative beamforming. Limiting the number of relays may have a bad effect on the coding gain which we compensate it with a proposed selection gain scheme. Numerical results demonstrate the advantage of our proposed scheme compared to the scheme with no cooperative jamming. The main contribution of this work is combining cooperative beamforming and jamming with relay and jammer selection to enhance the physical layer security.

•Sep 1, 2016•1 citation

Outage secrecy rate in wireless relay channels using cooperative jamming

Jiangyuan Li, Shuangyu Luo, Athina P. Petropulu

A wireless relay channel is considered, consisting of a multi-antenna source, a single-antenna destination, a single-antenna eavesdropper and a set of multi-antenna relays (helpers) that act as jammers to the eavesdropper. Each helper knows only its own link to the receiver and independently transmits jamming noise, lying in the null space of its own link to the destination, thus causes no interference to the destination. The source, knowing the main channel explicitly and having statistical information on the eavesdropper channel, designs the input covariance matrix so that the secrecy rate is maximized subject to an outage probability constraint and a sum power constraint. We show that the optimal input covariance matrix has rank one. Assuming that the eavesdropper channels follow a zero-mean Gaussian distribution with known covariance, the outage probability and outage secrecy rate are derived in closed form. Simulation results in support of the analysis are provided.

Globecom•Dec 1, 2012•5 citations
A four-terminal Gaussian network,composed of source,destination,eavesdropper and jammer relay,is discussed.The source aims to maximize the achievable secrecy rates,whereas the jammer relay times to minimize these rates.And the source and the jammer relay form a game problem,and with non-cooperative zero-sum game for this problem,the saddle-point solutions are found.The simulation shows that by using both relay and sending noise,the secrecy rate could be effectively decreased.
A four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is investigated when the jammer relay is causally given the source message. The source aims to increase the achievable secrecy rates, whereas the jammer relay aims to decrease it. To help the eavesdropper and to decrease achievable perfect secrecy rates, the jammer relay can use pure relaying and/or send interference to assist eavesdropping. The problem is formulated as a zero-sum game and the saddle point solutions are found. The results are compared to the case when the jammer relay is not informed about the source message.
In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.
In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.
In this work, a four-terminal complex Gaussian network composed of a source, a destination, an eavesdropper, and a jammer relay is studied under two different set of assumptions: 1) The jammer relay does not hear the source transmission, and 2) The jammer relay is causally given the source message. In both cases, the jammer relay assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase it. To help the eavesdropper, the jammer relay can use pure relaying and/or send interference. Each of the problems is formulated as a two-player, noncooperative, zero-sum continuous game. Assuming Gaussian strategies at the source and the jammer relay in the first problem, the Nash equilibrium is found and shown to be achieved with mixed strategies in general. The optimal cumulative distribution functions (cdfs) for the source and the jammer relay that achieve the value of the game, which is the Nash equilibrium secrecy rate, are found. For the second problem, the Nash equilibrium solution is found and the results are compared to the case when the jammer relay is not informed about the source message.
In this paper, the security of two-phase relaying system with multiple intermediate nodes in the presence of a malicious eavesdropper is investigated. To enhance the secrecy, a joint cooperative beamforming and jamming combined with relay and jammer selection is proposed. First, the source broadcasts its signal to the relays that are located close to source in a cluster, i.e., the source node uses a small amount of power to broadcast its message locally to other nodes of the cluster, while destination and the eavesdropper are located outside this cluster. In the second phase, two relays transmit re-encoded signal with optimal beamforming such that the secrecy rate is maximized. Simultaneously, two other intermediate nodes (which act as friendly jammers) transmit random jamming signals to degrade the eavesdropper’s channel. Our goal in this paper is to maximize the secrecy rate by applying different methods such as cooperative beamforming, cooperative jamming and relay and jammer selection. To avoid operational complexity, we consider the minimum number of intermediate nodes needed for relaying and jamming without losing the performance, i.e., achieving a non-zero secrecy rate. Cooperative beamforming with multiple relays demands high amount of information exchange and therefore increases the operational complexity. Thus, we aim to reduce the number of relays which take part in cooperative beamforming. Limiting the number of relays may have a bad effect on the coding gain which we compensate it with a proposed selection gain scheme. Numerical results demonstrate the advantage of our proposed scheme compared to the scheme with no cooperative jamming. The main contribution of this work is combining cooperative beamforming and jamming with relay and jammer selection to enhance the physical layer security.
A wireless relay channel is considered, consisting of a multi-antenna source, a single-antenna destination, a single-antenna eavesdropper and a set of multi-antenna relays (helpers) that act as jammers to the eavesdropper. Each helper knows only its own link to the receiver and independently transmits jamming noise, lying in the null space of its own link to the destination, thus causes no interference to the destination. The source, knowing the main channel explicitly and having statistical information on the eavesdropper channel, designs the input covariance matrix so that the secrecy rate is maximized subject to an outage probability constraint and a sum power constraint. We show that the optimal input covariance matrix has rank one. Assuming that the eavesdropper channels follow a zero-mean Gaussian distribution with known covariance, the outage probability and outage secrecy rate are derived in closed form. Simulation results in support of the analysis are provided.