In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non...In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non-cooperative game theory,the pure Byzantine attack strategy and defense strategy in cooperative spectrum sensing are analyzed from the perspective of the Byzantine attacker and network administrator.The cost and benefit of the pure strategy on both sides are defined. Secondly,the mixed attack and defense strategy are also derived. The closed form Nash equilibrium is obtained by the Lemke-Howson algorithm. Furthermore,the impact of the benefit ratio and penalty rate on the dynamic process of the noncooperative game is analyzed. Numerical simulation results show that the proposed game-theory approach can effectively defend against the Byzantine attack and save the defensive cost.展开更多
We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it.The scheme is implemented with a single spin qubit system and a two-entangled-qubit system....We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it.The scheme is implemented with a single spin qubit system and a two-entangled-qubit system.The Nash Equilibrium Theorem is proved for the models.展开更多
Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellu...Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellular networks, most of the previous works have focused on performance optimization for content caching. To the best of our knowledge, the problem of caching resource sharing for multiple service provider servers (SPSs) has been largely ignored. In this paper, by assuming that the caching capability is deployed in the base station of a radio access network, we consider the problem of caching resource sharing for multiple SPSs competing for the caching space. We formulate this problem as an oligopoly market model and use a dynamic non-cooperative game to obtain the optimal amount of caching space needed by the SPSs. In the dynamic game, the SPSs gradually and iteratively adjust their strategies based on their previous strategies and the information given by the base station. Then through rigorous mathematical analysis, the Nash equilibrium and stability condition of the dynamic game are proven. Finally, simulation results are presented to show the performance of the proposed dynamic caching resource allocation scheme.展开更多
基金The National Natural Science Foundation of China(No.61771126)
文摘In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non-cooperative game theory,the pure Byzantine attack strategy and defense strategy in cooperative spectrum sensing are analyzed from the perspective of the Byzantine attacker and network administrator.The cost and benefit of the pure strategy on both sides are defined. Secondly,the mixed attack and defense strategy are also derived. The closed form Nash equilibrium is obtained by the Lemke-Howson algorithm. Furthermore,the impact of the benefit ratio and penalty rate on the dynamic process of the noncooperative game is analyzed. Numerical simulation results show that the proposed game-theory approach can effectively defend against the Byzantine attack and save the defensive cost.
文摘We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it.The scheme is implemented with a single spin qubit system and a two-entangled-qubit system.The Nash Equilibrium Theorem is proved for the models.
基金Project supported by the National Natural Science Foundation of China (No. 61501042), the National Science and Technology Major Project (No. 2015ZX03003002- 002), the BUPT Special Program for Youth Scientific Research Innovation (No. 2015RC10), the Beijing Nova Program (No. Z151100000315078), and the State Key Laboratory of Net-working and Switching Technology Scientific Research Project, China (No. NST20140104)
文摘Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellular networks, most of the previous works have focused on performance optimization for content caching. To the best of our knowledge, the problem of caching resource sharing for multiple service provider servers (SPSs) has been largely ignored. In this paper, by assuming that the caching capability is deployed in the base station of a radio access network, we consider the problem of caching resource sharing for multiple SPSs competing for the caching space. We formulate this problem as an oligopoly market model and use a dynamic non-cooperative game to obtain the optimal amount of caching space needed by the SPSs. In the dynamic game, the SPSs gradually and iteratively adjust their strategies based on their previous strategies and the information given by the base station. Then through rigorous mathematical analysis, the Nash equilibrium and stability condition of the dynamic game are proven. Finally, simulation results are presented to show the performance of the proposed dynamic caching resource allocation scheme.