A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. ...A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.展开更多
This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot a...This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.展开更多
In this paper,we propose a cooperative spectrum sharing strategy based on the Nash bargaining solution.Specifically,the primary system leases a fraction of its transmission time to the secondary system in exchange for...In this paper,we propose a cooperative spectrum sharing strategy based on the Nash bargaining solution.Specifically,the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to improve its transmission performance.To gain access to the spectrum of the primary system,the secondary system needs to split a fraction of its transmission bandwidth to help to forward the primary signal.As a reward,the secondary system can use the remaining bandwidth to transmit its own signal.We find a unique solution for this time and bandwidth allocation using the Nash bargaining solution.Simulation results demonstrate that the performance of the primary and secondary systems can both be improved by the proposed spectrum sharing strategy.展开更多
According to the utility function and spectrum demand of the cognitive users,a novel mechanism based on Nash bargaining for primary system game was proposed under the wireless environment of Rayleigh fading.On the bas...According to the utility function and spectrum demand of the cognitive users,a novel mechanism based on Nash bargaining for primary system game was proposed under the wireless environment of Rayleigh fading.On the basis of this mechanism,we proposed a new distributed bargaining algorithm based on Nash product;then the spectrum prices and system utilities were obtained.Theoretical analysis results showed that with a close total utility to the optimal,the Nash bargaining mechanism cannot only improve the fairness between primary systems remarkably,but also reach to the stable equilibrium in finitely repeated games.Finally,simulation results were given to demonstrate the correctness of these conclusions and the efficiency of the algorithm.展开更多
Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information...Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.展开更多
基金The National Natural Science Foundation of China(No.61201143)Innovation Foundations of CAST(ITS)(No.F-WYY-2013-016)the Fundamental Research Funds for the Central Universities(No.HIT.IBRSEM.201309)
文摘A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.
基金supported by National Basic Research Program of China (973 Program) (No. 2010CB731800)Key Project of National Natural Science Foundation of China (No. 60934003)Scientific and Technological Supporting Project of Hebei Province(No. 072435155D)
文摘This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.
基金supported by the National Natural Science Foundation of China under Grants No.61372087,No.61303235the Zhejiang Leading Team of Science and Technology Innovation on Modem Communication and Network System under Grant No.2010R50011the Project of the Zhejiang Provincial Science and Technology Department under Grant No.Y201329389
文摘In this paper,we propose a cooperative spectrum sharing strategy based on the Nash bargaining solution.Specifically,the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to improve its transmission performance.To gain access to the spectrum of the primary system,the secondary system needs to split a fraction of its transmission bandwidth to help to forward the primary signal.As a reward,the secondary system can use the remaining bandwidth to transmit its own signal.We find a unique solution for this time and bandwidth allocation using the Nash bargaining solution.Simulation results demonstrate that the performance of the primary and secondary systems can both be improved by the proposed spectrum sharing strategy.
基金Sponsored by the National High Technology Research and Development Program of China(863Program)(Grant No.2008AA12Z305)
文摘According to the utility function and spectrum demand of the cognitive users,a novel mechanism based on Nash bargaining for primary system game was proposed under the wireless environment of Rayleigh fading.On the basis of this mechanism,we proposed a new distributed bargaining algorithm based on Nash product;then the spectrum prices and system utilities were obtained.Theoretical analysis results showed that with a close total utility to the optimal,the Nash bargaining mechanism cannot only improve the fairness between primary systems remarkably,but also reach to the stable equilibrium in finitely repeated games.Finally,simulation results were given to demonstrate the correctness of these conclusions and the efficiency of the algorithm.
基金supported by National Natural Science Foundation of China (No. 60972059)Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD)+3 种基金Fundamental Research Funds for the Central Universities of China (Nos. 2010QNA27 and 2011QNB26)China Postdoctoral Science Foundation (No. 20100481185)the Ph. D. Programs Foundation of Ministry of Education of China (Nos. 20090095120013 and 20110095120006)Talent Introduction Program, and Young Teacher Sailing Program of China University of Mining and Technology
文摘Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.
