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.展开更多
This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s...This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.展开更多
数据中心(data center,DC)之间通过部署流量工程来提高连接各个数据中心骨干网的利用率,虽然效率提升显著,但对不同类型汇聚流的带宽分配的公平性没有考虑.将多个汇聚流对带宽分配的竞争行为建模为一个合作博弈,通过寻求此博弈的纳什谈...数据中心(data center,DC)之间通过部署流量工程来提高连接各个数据中心骨干网的利用率,虽然效率提升显著,但对不同类型汇聚流的带宽分配的公平性没有考虑.将多个汇聚流对带宽分配的竞争行为建模为一个合作博弈,通过寻求此博弈的纳什谈判解(Nash bargaining solution,NBS)来确定优化的带宽分配策略CGBA(cooperation game based bandwidth allocation),权衡各汇聚流的最小带宽保证与带宽分配的公平性.在Mininet平台上进行实验仿真并和典型的带宽分配策略对比,结果表明CGBA不但可保证各汇聚流的最小带宽需求,还确保了各类流对带宽资源竞争的公平性.展开更多
基金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.
基金supported by National Natural Science Foundation of China (No.60972059)Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions+3 种基金Fundamental Research Funds for the Central Universities of China (No.2010QNA27)China Postdoctoral Science Foundation(No.20100481185)Postdoctoral Research Funds of Jiangsu Province(No.1101108C)Postdoctoral Fellowship Program of the China Scholarship Council
文摘This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.
文摘数据中心(data center,DC)之间通过部署流量工程来提高连接各个数据中心骨干网的利用率,虽然效率提升显著,但对不同类型汇聚流的带宽分配的公平性没有考虑.将多个汇聚流对带宽分配的竞争行为建模为一个合作博弈,通过寻求此博弈的纳什谈判解(Nash bargaining solution,NBS)来确定优化的带宽分配策略CGBA(cooperation game based bandwidth allocation),权衡各汇聚流的最小带宽保证与带宽分配的公平性.在Mininet平台上进行实验仿真并和典型的带宽分配策略对比,结果表明CGBA不但可保证各汇聚流的最小带宽需求,还确保了各类流对带宽资源竞争的公平性.
