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

International Conference on Wireless Communications and Signal Processing (WCSP)

Cooperative jammer power allocation — A Nash bargaining solution method

Bowen Duan, Yueming Cai, Jianchao Zheng, Wendong Yang

Published Oct 1, 2015• 4 citations
Publisher

Abstract

In this paper, we investigate a multi-source multi-destination wireless communication network in the presence of an eavesdropper and a cooperative jammer. Nash bargaining solution (NBS) is introduced to investigate the negotiation among the sources on jammer power allocation. In order to improve the network sum-secrecy-rate and maintain sources' fairness at the same time, the optimization problem is formulated as a Nash bargaining game (NBG), which is proved to be a convex optimization problem. The effect of bargaining power selection on sum-secrecy-rate and sources' fairness is investigated analytically and a simple but efficient centralized algorithm is proposed to implement the NBS-based scheme. Simulation results validate the effectiveness and fairness of our proposed scheme.

DOI
10.1109/wcsp.2015.7341069

Related papers

Improve physical layer security in cooperative wireless network using distributed auction games

Rongqing Zhang, Lingyang Song, Zhu Han +1 more

In this paper, we investigate a cooperative wireless network with jamming-based secure communications, where a friendly jammer can transmit jamming signals to interfere the malicious eavesdropper. We find that the secrecy rate of the source-destination link can be effectively improved with the help of the friendly jammer, and each source intends to obtain optimal jamming power from the friendly jammer to maximize its secrecy rate for data transmission. We then formulate this power allocation problem as an auction game and propose two distributively auction-based power allocation schemes, which are power allocation using Traditional Ascending Clock Auction (ACA-T) and power allocation using Alternative Ascending Clock Auction (ACA-A), considering the friendly jammer as the auctioneer and the sources as the bidders. In addition, we prove that both the proposed schemes can converge in a finite number of iterations. We also prove that the ACA-A scheme is cheat-proof while the ACA-T scheme is not. Finally, simulation results are presented to demonstrate the efficiency of the proposed auction-based schemes in improving secrecy rate of wireless networks.

IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•Apr 1, 2011•42 citations

Secure Communications With Cooperative Jamming: Optimal Power Allocation and Secrecy Outage Analysis

Kanapathippillai Cumanan, George C. Alexandropoulos, Zhiguo Ding +1 more

This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.

arXiv:1701.03383•IEEE Transactions on Vehicular Technology•Jan 24, 2017•91 citations

Maximized secrecy rate based power allocation for wireless cooperative network with control jamming

Kiran Kumar Gurrala, Susmita Das

In this paper, we propose efficient power allocation techniques using both convex optimization (using Lagrange multiplier method) and a soft evolutionary approach (using Differential Evolution (DE) algorithm) to optimize both the relay and jammer powers in addition to an increase in the system performance in terms of secrecy rate. Here, we consider a cooperative wireless network with control jamming comprising of a source-destination pair with a set of relay nodes in the presence of single and multiple eavesdroppers. Optimal relay node is selected based on the SNR received at each relay, which transmits the data to the destination using decode and forward strategy. Amongst the remaining nodes, selection of jammer is done based on the SNR value of the relay to eavesdropper link. The proposed power allocation schemes are compared with equal power allocation policy for using the Monte-Carlo simulation study and these schemes are found to be superior in terms of average secrecy rate.

IEEE Malaysia International Conference on Communications (MICC)•Nov 1, 2015•0 citations

Fairness-guaranteed pricing and power allocation with a friendly jammer against eavesdropping

Jianting Yue, Bo Yang, Xinping Guan

In wireless communication, jamming is a promising solution to provide improvement in secrecy rate, especially when security requirement is difficult to satisfy in realistic environment. Users could pay the friendly jammer for some interference to the eavesdropper and consequently improve the secrecy rate of their own, while the jammer wants to get maximum revenue within its capability. Thereby a Stackelberg game is introduced. Fairness also deserves particular attention, as unfair allocation of the limited resource deteriorates the performance of whole network. In this paper, we discuss a network with one jammer and several users, where they participate in the game and reach equilibrium ultimately. We utilize Kalai-Smorodinsky bargaining solution to guarantee fairness among users, making them balance their utility so as to make the best of the interference from the jammer. Moreover, we propose implementation of algorithm and demonstrate the performance.

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

Power allocation based on Stackelberg game in a jammer-assisted secure network

Junyue Qu, Jianchao Zheng, Nianfeng Weng +4 more

In this paper, the problem of improving the secrecy communication for a cooperative jamming based network in which there is a friendly jammer, an eavesdropper and N pairs of sources and destinations is addressed. A Stackelberg game is formulated to tackle the joint utility maximization of the jammer and sources subject to a maximum jamming power constraint at the jammer. In this game, the jammer behaves as the leader and the sources are followers. A uniform pricing algorithm is proposed and we prove in theory that it can maximize the secrecy rate of the system. The Stackelberg equilibrium for the proposed game is characterized, and an effective distributed algorithm with guaranteed convergence is proposed. Numerical examples are presented to validate our analysis. It is shown that the proposed distributed algorithm can obtain almost the same performance as the optimal power allocation algorithm. Besides, we also investigate the performance of the proposed distributed algorithm in different scenarios. It is shown that the proposed algorithm can obtain significant improvement for secrecy rate in the sparse scenario where all the nodes are deployed sparsely. It can enhance the secrecy rate for about 0.3 dB.

International Conference on Cyberspace Technology (CCT)•Jan 1, 2013•3 citations

Game between Source and Jamming Relay in Wireless Communication

Jie Zhou

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.

Communications technology•Jan 1, 2013•0 citations
In this paper, we investigate a multi-source multi-destination wireless communication network in the presence of an eavesdropper and a cooperative jammer. Nash bargaining solution (NBS) is introduced to investigate the negotiation among the sources on jammer power allocation. In order to improve the network sum-secrecy-rate and maintain sources' fairness at the same time, the optimization problem is formulated as a Nash bargaining game (NBG), which is proved to be a convex optimization problem. The effect of bargaining power selection on sum-secrecy-rate and sources' fairness is investigated analytically and a simple but efficient centralized algorithm is proposed to implement the NBS-based scheme. Simulation results validate the effectiveness and fairness of our proposed scheme.
In this paper, we investigate a cooperative wireless network with jamming-based secure communications, where a friendly jammer can transmit jamming signals to interfere the malicious eavesdropper. We find that the secrecy rate of the source-destination link can be effectively improved with the help of the friendly jammer, and each source intends to obtain optimal jamming power from the friendly jammer to maximize its secrecy rate for data transmission. We then formulate this power allocation problem as an auction game and propose two distributively auction-based power allocation schemes, which are power allocation using Traditional Ascending Clock Auction (ACA-T) and power allocation using Alternative Ascending Clock Auction (ACA-A), considering the friendly jammer as the auctioneer and the sources as the bidders. In addition, we prove that both the proposed schemes can converge in a finite number of iterations. We also prove that the ACA-A scheme is cheat-proof while the ACA-T scheme is not. Finally, simulation results are presented to demonstrate the efficiency of the proposed auction-based schemes in improving secrecy rate of wireless networks.
This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.
In this paper, we propose efficient power allocation techniques using both convex optimization (using Lagrange multiplier method) and a soft evolutionary approach (using Differential Evolution (DE) algorithm) to optimize both the relay and jammer powers in addition to an increase in the system performance in terms of secrecy rate. Here, we consider a cooperative wireless network with control jamming comprising of a source-destination pair with a set of relay nodes in the presence of single and multiple eavesdroppers. Optimal relay node is selected based on the SNR received at each relay, which transmits the data to the destination using decode and forward strategy. Amongst the remaining nodes, selection of jammer is done based on the SNR value of the relay to eavesdropper link. The proposed power allocation schemes are compared with equal power allocation policy for using the Monte-Carlo simulation study and these schemes are found to be superior in terms of average secrecy rate.
In wireless communication, jamming is a promising solution to provide improvement in secrecy rate, especially when security requirement is difficult to satisfy in realistic environment. Users could pay the friendly jammer for some interference to the eavesdropper and consequently improve the secrecy rate of their own, while the jammer wants to get maximum revenue within its capability. Thereby a Stackelberg game is introduced. Fairness also deserves particular attention, as unfair allocation of the limited resource deteriorates the performance of whole network. In this paper, we discuss a network with one jammer and several users, where they participate in the game and reach equilibrium ultimately. We utilize Kalai-Smorodinsky bargaining solution to guarantee fairness among users, making them balance their utility so as to make the best of the interference from the jammer. Moreover, we propose implementation of algorithm and demonstrate the performance.
In this paper, the problem of improving the secrecy communication for a cooperative jamming based network in which there is a friendly jammer, an eavesdropper and N pairs of sources and destinations is addressed. A Stackelberg game is formulated to tackle the joint utility maximization of the jammer and sources subject to a maximum jamming power constraint at the jammer. In this game, the jammer behaves as the leader and the sources are followers. A uniform pricing algorithm is proposed and we prove in theory that it can maximize the secrecy rate of the system. The Stackelberg equilibrium for the proposed game is characterized, and an effective distributed algorithm with guaranteed convergence is proposed. Numerical examples are presented to validate our analysis. It is shown that the proposed distributed algorithm can obtain almost the same performance as the optimal power allocation algorithm. Besides, we also investigate the performance of the proposed distributed algorithm in different scenarios. It is shown that the proposed algorithm can obtain significant improvement for secrecy rate in the sparse scenario where all the nodes are deployed sparsely. It can enhance the secrecy rate for about 0.3 dB.