In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single...In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single PU in their frameworks. In this paper, we will consider a more complicated scenario with multiple PUs and try to investigate the cooperative jamming between multiple PUs and a single SU. When there are multiple PUs in CRN, in order to obtain more spectrum for data transmission, SU will cooperate with multiple PUs at the same time. Considering that both PU and SU are rational and selfish individuals, the interaction between PUs and SU is formulated as a multi-leaders and single-follower Stackelberg game, wherein PU is the leader and SU is the follower. And the Stackelberg Equilibrium(SE) is considered as the final decisions accepted by all PUs and SU. Furthermore, we also prove that when a specific condition is satisfied, the existence of SE can be guaranteed. And a Gauss-Jacobi iterative algorithm is proposed to compute a SE. Finally, simulation results are given to verify the performance and demonstrate that both of the PUs' secrecy rate and the SU's transmission rate can be improved through cooperation.展开更多
基金supported in part by the National Key Research and Development Program of China under Grant 2016QY01W0204in part by Key Industrial Innovation Chain in Industrial Domain under Grant 2016KTZDGY-02in part by National High-Level TalentsSpecial Support Program of China under Grant CS31117200001
文摘In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single PU in their frameworks. In this paper, we will consider a more complicated scenario with multiple PUs and try to investigate the cooperative jamming between multiple PUs and a single SU. When there are multiple PUs in CRN, in order to obtain more spectrum for data transmission, SU will cooperate with multiple PUs at the same time. Considering that both PU and SU are rational and selfish individuals, the interaction between PUs and SU is formulated as a multi-leaders and single-follower Stackelberg game, wherein PU is the leader and SU is the follower. And the Stackelberg Equilibrium(SE) is considered as the final decisions accepted by all PUs and SU. Furthermore, we also prove that when a specific condition is satisfied, the existence of SE can be guaranteed. And a Gauss-Jacobi iterative algorithm is proposed to compute a SE. Finally, simulation results are given to verify the performance and demonstrate that both of the PUs' secrecy rate and the SU's transmission rate can be improved through cooperation.
