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

IET Communications

Jamming game for secure orthogonal frequency division multiplexing access systems

Vahed Fadakar Gabalou, Behrouz Maham, Mojtaba Jahandideh

Published Mar 29, 2018• 0 citations
Publisher

Abstract

In a communication system, security and reliability have an important impact on the quality of services. In this study, the authors investigate power and subcarrier allocation of a transmitter over the downlink of an orthogonal frequency division multiplexing access system with security considerations among users in the presence of a jammer. This study considers the interaction between the jammer and the transmitter as a zero‐sum game where the objective function is the transmitter's secrecy sum‐rate. To allocate the available resources, they solve the optimisation problem of each player to characterise its optimal strategies. Considering the intractability of the closed form Nash equilibrium for general power regime, they study a matrix game for obtaining maxmin and minmax solutions and demonstrate the validity of inequality . Moreover, they show the existence of pure Nash equilibrium point for low total power regimes of the transmitter and the jammer and attain an expression for each regime. Finally, they examine the jamming power effect on the secrecy sum‐rate and acquire lower and upper bounds of this rate using simulations.

DOI
10.1049/iet-com.2017.0426

Related papers

A zero-sum power allocation game over OFDM Gaussian wiretap channel with dual jamming

Munnujahan Ara, Samah A. M. Ghanem

We investigate optimal power allocation strategies over a OFDM Gaussian wiretap channels where a legitimate transmitter and a legitimate receiver communicate in the presence of an eavesdropper and a jammer-who acts as unfriendly to both the legitimate parties and the eavesdropper. In particular, we formulate a zero-sum power allocation game between the transmitter and the jammer where the payoff function is the secrecy rate. We characterize the optimal power allocation strategies as well as the Nash equilibrium in some asymptotic regimes. We also provide a set of results that cast further insight into the problem.

IEEE International WIE Conference on Electrical and Computer Engineering•Dec 1, 2015•2 citations

A zero-sum power allocation game in the parallel Gaussian wiretap channel with an unfriendly jammer

Munnujahan Ara, Hugo Reboredo, Samah A. M. Ghanem +1 more

This paper investigates optimal power allocation strategies over a bank of independent parallel Gaussian wiretap channels where a legitimate transmitter and a legitimate receiver communicate in the presence of an eavesdropper and an unfriendly jammer. In particular, we formulate a zero-sum power allocation game between the transmitter and the jammer where the payoff function is the secrecy rate. We characterize the optimal power allocation strategies as well as the Nash equilibrium in some asymptotic regimes. We also provide a set of results that cast further insight into the problem. Our scenario, which is applicable to current OFDM communications systems, demonstrates that transmitters that adapt to jammer experience much higher secrecy rates than non-adaptive transmitters.

IEEE International Conference on Communication Systems (ICCS)•Nov 1, 2012•19 citations

Secure communication with joint resource allocation, relay and jammer selection in OFDM‐based cooperative networks

Qi Liu, Ding Xu

Summary This paper considers an orthogonal frequency division multiplexing (OFDM) based cooperative network, where a source node communicates with a destination node with the help of multiple intermediate nodes, in the presence of an eavesdropper. Each intermediate node is assumed to be able to act as a relay or a jammer to improve the physical layer security. The problem of joint subcarrier allocation, power allocation, and mode selection to maximize the sum secrecy rate is investigated. We first reformulate the problem of subcarrier allocation and intermediate node mode selection as a three‐sided matching game and propose an algorithm that achieves a stable matching. Then, the sum secrecy rate is further improved by proposing a heuristic algorithm to switch the modes of the intermediate nodes. Finally, an iterative power allocation algorithm is proposed. It is verified by simulation results that the proposed algorithm outperforms various benchmark algorithms such as the equal subcarrier allocation algorithm, the pure relay selection algorithm, and the random relay selection algorithm, especially when the transmit power limit is high and the number of intermediate nodes is large.

International Journal of Communication Systems•Mar 31, 2021•3 citations

Secure transmission with artificial noise in the multiuser downlink: Secrecy sum-rate and optimal power allocation

Na Li, Xiaofeng Tao, Qimei Cui +1 more

Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy issues have become increasingly critical for wireless networks. This paper considers the problem of secret communication in the multiuser downlink eavesdropped by a passive eavesdropper (EVE). The well-known zero-forcing preceding is adopted at the transmitter to produce concurrent data streams to the users, and at the same time an artificial noise (AN) is generated to prevent EVE from intercepting the information. We first derive an analytical closed-form expression for the secrecy sum-rate in the large system limit. We then use it as the objective function to optimize the power allocation (PA) between the information signals and the AN to maximize the secrecy sum-rate. A simple analytical expression of the optimal PA is derived in the high transmit power regime, which proves to be a near-optimal and generic strategy. The large system results are quite accurate for finite-size systems and thus can provide useful insights into system analysis and design. Our analytical and simulation results show that the AN assisted strategy achieves the same multiplexing gain as in the multiuser downlink without eavesdropping. Moreover, more power should be allocated to AN when the system serves fewer users and EVE has more antennas.

IEEE Wireless Communications and Networking Conference•Mar 1, 2015•6 citations

Wireless Powered Cooperative Jamming for Secure OFDM System

Guangchi Zhang, Jie Xu, Qingqing Wu +3 more

This paper studies the secrecy communication in an orthogonal frequency division multiplexing system, where a source sends confidential information to a destination in the presence of a potential eavesdropper. We employ wireless powered cooperative jamming to improve the secrecy rate of this system with the assistance of a cooperative jammer, which works in the harvest-then-jam protocol over two time slots. In the first slot, the source sends dedicated energy signals to power the jammer; in the second slot, the jammer uses the harvested energy to jam the eavesdropper, in order to protect the simultaneous secrecy communication from the source to the destination. In particular, we consider two types of receivers at the destination, namely Type-I and Type-II receivers, which do not have and have the capability of canceling the (a priori known) jamming signals, respectively. For both types of receivers, we maximize the secrecy rate at the destination by jointly optimizing the transmit power allocation at the source and the jammer over sub-carriers, as well as the time allocation between the two time slots. First, we present the globally optimal solution to this problem via the Lagrange dual method, which, however, is of high implementation complexity. Next, to balance the tradeoff between the algorithm complexity and performance, we propose alternative low-complexity solutions based on the minorization maximization and heuristic successive optimization, respectively. Simulation results show that the proposed approaches significantly improve the secrecy rate, as compared to benchmark schemes without joint power and time allocation.

arXiv:1707.07412•IEEE Transactions on Vehicular Technology•Sep 26, 2017•102 citations

Secure resource allocation for the SISO‐OFDM wiretap channel

SeyedMohamad MirhoseiniNejad, Vahid Tabataba Vakili, Dariush Abbasi‐Moghadam

The broadcast nature of communication systems opens the possibility for attackers to eavesdrop the data and compromise data confidentiality. This study takes the information theoretic security at the physical layer of single‐input single‐output orthogonal frequency division multiplexing (SISO‐OFDM) wiretap system into account, in which, different signal‐to‐noise ratio (SNR) values on the legitimate and eavesdropper's receivers are assumed. The optimisation problem for secure resource allocation is formulated. Then, the secrecy rate of the system is used as the objective function for resource allocation. Finally, a power allocation strategy is obtained. The upper bound of the secrecy capacity of the single‐user system is proposed as a linear function of legitimate receiver's SNR (dB), based on the mentioned strategy. In addition, an iterative power allocation algorithm is proposed for two‐user SISO‐OFDM wiretap channel. Results showed that the proposed algorithm is fast and converges to the optimal value in the second iteration. The upper bound linear model is valid in a two‐user case when there is a relatively large difference between Bob and Eve SNRs.

IET Communications•Aug 11, 2017•3 citations
In a communication system, security and reliability have an important impact on the quality of services. In this study, the authors investigate power and subcarrier allocation of a transmitter over the downlink of an orthogonal frequency division multiplexing access system with security considerations among users in the presence of a jammer. This study considers the interaction between the jammer and the transmitter as a zero‐sum game where the objective function is the transmitter's secrecy sum‐rate. To allocate the available resources, they solve the optimisation problem of each player to characterise its optimal strategies. Considering the intractability of the closed form Nash equilibrium for general power regime, they study a matrix game for obtaining maxmin and minmax solutions and demonstrate the validity of inequality . Moreover, they show the existence of pure Nash equilibrium point for low total power regimes of the transmitter and the jammer and attain an expression for each regime. Finally, they examine the jamming power effect on the secrecy sum‐rate and acquire lower and upper bounds of this rate using simulations.
We investigate optimal power allocation strategies over a OFDM Gaussian wiretap channels where a legitimate transmitter and a legitimate receiver communicate in the presence of an eavesdropper and a jammer-who acts as unfriendly to both the legitimate parties and the eavesdropper. In particular, we formulate a zero-sum power allocation game between the transmitter and the jammer where the payoff function is the secrecy rate. We characterize the optimal power allocation strategies as well as the Nash equilibrium in some asymptotic regimes. We also provide a set of results that cast further insight into the problem.
This paper investigates optimal power allocation strategies over a bank of independent parallel Gaussian wiretap channels where a legitimate transmitter and a legitimate receiver communicate in the presence of an eavesdropper and an unfriendly jammer. In particular, we formulate a zero-sum power allocation game between the transmitter and the jammer where the payoff function is the secrecy rate. We characterize the optimal power allocation strategies as well as the Nash equilibrium in some asymptotic regimes. We also provide a set of results that cast further insight into the problem. Our scenario, which is applicable to current OFDM communications systems, demonstrates that transmitters that adapt to jammer experience much higher secrecy rates than non-adaptive transmitters.
Summary This paper considers an orthogonal frequency division multiplexing (OFDM) based cooperative network, where a source node communicates with a destination node with the help of multiple intermediate nodes, in the presence of an eavesdropper. Each intermediate node is assumed to be able to act as a relay or a jammer to improve the physical layer security. The problem of joint subcarrier allocation, power allocation, and mode selection to maximize the sum secrecy rate is investigated. We first reformulate the problem of subcarrier allocation and intermediate node mode selection as a three‐sided matching game and propose an algorithm that achieves a stable matching. Then, the sum secrecy rate is further improved by proposing a heuristic algorithm to switch the modes of the intermediate nodes. Finally, an iterative power allocation algorithm is proposed. It is verified by simulation results that the proposed algorithm outperforms various benchmark algorithms such as the equal subcarrier allocation algorithm, the pure relay selection algorithm, and the random relay selection algorithm, especially when the transmit power limit is high and the number of intermediate nodes is large.
Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy issues have become increasingly critical for wireless networks. This paper considers the problem of secret communication in the multiuser downlink eavesdropped by a passive eavesdropper (EVE). The well-known zero-forcing preceding is adopted at the transmitter to produce concurrent data streams to the users, and at the same time an artificial noise (AN) is generated to prevent EVE from intercepting the information. We first derive an analytical closed-form expression for the secrecy sum-rate in the large system limit. We then use it as the objective function to optimize the power allocation (PA) between the information signals and the AN to maximize the secrecy sum-rate. A simple analytical expression of the optimal PA is derived in the high transmit power regime, which proves to be a near-optimal and generic strategy. The large system results are quite accurate for finite-size systems and thus can provide useful insights into system analysis and design. Our analytical and simulation results show that the AN assisted strategy achieves the same multiplexing gain as in the multiuser downlink without eavesdropping. Moreover, more power should be allocated to AN when the system serves fewer users and EVE has more antennas.
This paper studies the secrecy communication in an orthogonal frequency division multiplexing system, where a source sends confidential information to a destination in the presence of a potential eavesdropper. We employ wireless powered cooperative jamming to improve the secrecy rate of this system with the assistance of a cooperative jammer, which works in the harvest-then-jam protocol over two time slots. In the first slot, the source sends dedicated energy signals to power the jammer; in the second slot, the jammer uses the harvested energy to jam the eavesdropper, in order to protect the simultaneous secrecy communication from the source to the destination. In particular, we consider two types of receivers at the destination, namely Type-I and Type-II receivers, which do not have and have the capability of canceling the (a priori known) jamming signals, respectively. For both types of receivers, we maximize the secrecy rate at the destination by jointly optimizing the transmit power allocation at the source and the jammer over sub-carriers, as well as the time allocation between the two time slots. First, we present the globally optimal solution to this problem via the Lagrange dual method, which, however, is of high implementation complexity. Next, to balance the tradeoff between the algorithm complexity and performance, we propose alternative low-complexity solutions based on the minorization maximization and heuristic successive optimization, respectively. Simulation results show that the proposed approaches significantly improve the secrecy rate, as compared to benchmark schemes without joint power and time allocation.
The broadcast nature of communication systems opens the possibility for attackers to eavesdrop the data and compromise data confidentiality. This study takes the information theoretic security at the physical layer of single‐input single‐output orthogonal frequency division multiplexing (SISO‐OFDM) wiretap system into account, in which, different signal‐to‐noise ratio (SNR) values on the legitimate and eavesdropper's receivers are assumed. The optimisation problem for secure resource allocation is formulated. Then, the secrecy rate of the system is used as the objective function for resource allocation. Finally, a power allocation strategy is obtained. The upper bound of the secrecy capacity of the single‐user system is proposed as a linear function of legitimate receiver's SNR (dB), based on the mentioned strategy. In addition, an iterative power allocation algorithm is proposed for two‐user SISO‐OFDM wiretap channel. Results showed that the proposed algorithm is fast and converges to the optimal value in the second iteration. The upper bound linear model is valid in a two‐user case when there is a relatively large difference between Bob and Eve SNRs.