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 in computer and information science

Secrecy Rate Optimization for the Power Beacon-Assisted Secrecy Network Based on Stackelberg Game

MahmudaAkter Keya, Long Jiao, Yao Ge, Weiyang Li, Ning Wang

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-96-0151-6_20

Related papers

Secrecy outage performance of multi-hop LEACH networks using power beacon aided cooperative jamming with jammer selection methods

Duy-Hung Ha, Tran Trung Duy, Miroslav Vozn̆ák

AEU - International Journal of Electronics and Communications•Jul 25, 2020•8 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

Simulations for Deep Random Secrecy Protocol

Thibault de Valroger

arXiv:1611.01683•Advances in intelligent systems and computing•Nov 1, 2018•0 citations

Cooperative Secrecy in Wireless Communications

Şennur Ulukuş, Ersen Ekrem

Springer eBooks•Jan 1, 2009•31 citations

Secure Transmission in MISOME Wiretap Channel With Multiple Assisting Jammers: Maximum Secrecy Rate and Optimal Power Allocation

Huici Wu, Xiaofeng Tao, Zhu Han +2 more

This paper investigates the secrecy rate maximization problem for the multiple-input-single-output multiple-antenna-eavesdropper (MISOME) wiretap channel with multiple randomly located jammers. The multi-antenna base station (BS) transmits information signals along with artificial noise (AN) to disturb the eavesdropper. Moreover, the friendly jammers are properly selected to assist the legitimate link for better secure transmission with some payoffs. With this system model, we first formulate a Stackelberg game between the BS and the assisting jammers with full channel state information. Stackelberg equilibriums, including optimal fraction of transmit power for AN, optimal transmit power, and asking prices of assisting jammers, are first proved to exist and then analytically derived. A policy iterative algorithm is also proposed to obtain the optimal solutions. We then extend the Stackelberg game to the case of MISOME broadcast wiretap channel with channel distribution information of eavesdropper. Numerical results verify the accuracy of the derived results and the efficiency of the proposed algorithm. The results reveal that the proposed jammer-assisted secure transmission can greatly improve the secrecy performance and meanwhile save more energy for information signals, which is significant for future wireless communication.

IEEE Transactions on Communications•Dec 6, 2016•58 citations

Achievable Secrecy Rate Regions for Relay Networks

Amir Sonee, Mahmoud Salmasi zadeh

•Jan 1, 2010•0 citations
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.
This paper investigates the secrecy rate maximization problem for the multiple-input-single-output multiple-antenna-eavesdropper (MISOME) wiretap channel with multiple randomly located jammers. The multi-antenna base station (BS) transmits information signals along with artificial noise (AN) to disturb the eavesdropper. Moreover, the friendly jammers are properly selected to assist the legitimate link for better secure transmission with some payoffs. With this system model, we first formulate a Stackelberg game between the BS and the assisting jammers with full channel state information. Stackelberg equilibriums, including optimal fraction of transmit power for AN, optimal transmit power, and asking prices of assisting jammers, are first proved to exist and then analytically derived. A policy iterative algorithm is also proposed to obtain the optimal solutions. We then extend the Stackelberg game to the case of MISOME broadcast wiretap channel with channel distribution information of eavesdropper. Numerical results verify the accuracy of the derived results and the efficiency of the proposed algorithm. The results reveal that the proposed jammer-assisted secure transmission can greatly improve the secrecy performance and meanwhile save more energy for information signals, which is significant for future wireless communication.