In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for...In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.展开更多
Most resource allocation algorithms are based on interference power constraint in cognitive radio networks.Instead of using conventional primary user interference constraint,we give a new criterion called allowable si...Most resource allocation algorithms are based on interference power constraint in cognitive radio networks.Instead of using conventional primary user interference constraint,we give a new criterion called allowable signal to interference plus noise ratio(SINR) loss constraint in cognitive transmission to protect primary users.Considering power allocation problem for cognitive users over flat fading channels,in order to maximize throughput of cognitive users subject to the allowable SINR loss constraint and maximum transmit power for each cognitive user,we propose a new power allocation algorithm.The comparison of computer simulation between our proposed algorithm and the algorithm based on interference power constraint is provided to show that it gets more throughput and provides stability to cognitive radio networks.展开更多
文摘物理层安全(Physical Layer Security,PLS)技术是一种利用无线信道固有物理属性来保护无线信道免受非法窃听的有效手段,受到了人们的广泛关注。因此,研究了联合多用户调度与友好干扰的功率资源分配优化问题,考虑存在信道估计误差以及多个窃听者通过协作方式获机密信息的情况,联合多用户调度策略与友好干扰选择,提出了联合多用户调度和随机干扰选择(Multiuser Scheduling and Random Jammer Selection,MS-RJS)方案和联合多用户调度和最佳干扰选择(Multiuser Scheduling and Optimal Jammer Selection,MS-OJS)方案,即选择最佳用户向基站传输机密信息的同时,选择友好干扰发射人工噪声降低窃听者的性能,并将传统多用户调度(Conventional Multiuser Scheduling,CMS)方案作为基准方案。对此,在通信系统总功率受限的情况下,以最小化所提方案的窃听概率和中断概率之和为目标,构建最佳用户与友好干扰之间的功率资源分配优化问题,并设计了一种基于黄金搜索的最佳功率分配迭代算法。实验结果表明,带有最佳功率分配因子的MS-RJS方案和MS-OJS方案相比于CMS方案具有显著的性能优势。
基金supported in part by the State Major Science and Technology Special Projects under Grant No. 2012ZX03004001the National Basic Research Program (973) of China under Grants No. 2012CB315801, No. 2011CB302901the Chinese Universities Scientific Fund under Grant No. 2012RC0306
文摘In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.
基金ACKNOWLEDGEMENTS This work is supported by National Natural Science Foundation of China （No. 61171079）. The authors would like to thank the editors and the anonymous reviewers for their detailed constructive comments that helped to improve the presentation of this paper.
文摘Most resource allocation algorithms are based on interference power constraint in cognitive radio networks.Instead of using conventional primary user interference constraint,we give a new criterion called allowable signal to interference plus noise ratio(SINR) loss constraint in cognitive transmission to protect primary users.Considering power allocation problem for cognitive users over flat fading channels,in order to maximize throughput of cognitive users subject to the allowable SINR loss constraint and maximum transmit power for each cognitive user,we propose a new power allocation algorithm.The comparison of computer simulation between our proposed algorithm and the algorithm based on interference power constraint is provided to show that it gets more throughput and provides stability to cognitive radio networks.
