| 虚拟两天线蜂窝网络中考虑中继公平性的协作博弈调度方法(英文) |
| |
| 引用本文： | 滕颖蕾,黄韬,刘媛媛,满毅,宋梅.虚拟两天线蜂窝网络中考虑中继公平性的协作博弈调度方法(英文)[J].中国通信学报,2013,10(2):56-70. |
| |
| 作者姓名： | 滕颖蕾 黄韬 刘媛媛 满毅 宋梅 |
| |
| 作者单位： | Beijing University of Posts and Telecommunications |
| |
| 基金项目： | supported in part by the State Major Science and Technology Special Projects under Grant No. 2012ZX03004001;the National Basic Research Program (973) of China under Grants No. 2012CB315801, No. 2011CB302901;the 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.
|
| 关 键 词： | relay network resource allocation cooperative game theory NBS |
| 收稿时间： | 2013-03-06; |
Cooperative Game Approach for Scheduling in Two-Virtual-Antenna Cellular Networks with Relay Stations Fairness Consideration |
| |
| TENG Yinglei,HUANG Tao,LIU Yuanyuan,MAN Yi,SONG Mei.Cooperative Game Approach for Scheduling in Two-Virtual-Antenna Cellular Networks with Relay Stations Fairness Consideration[J].China communications magazine,2013,10(2):56-70. |
| |
| Authors: | TENG Yinglei HUANG Tao LIU Yuanyuan MAN Yi SONG Mei |
| |
| Affiliation: | Beijing University of Posts and Telecommunications, Beijing 100876, China |
| |
| Abstract: | In thsssse cellular network, Relay Stations (RSs) help to improve the system per-formance; 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. |
| |
| Keywords: | relay network resource allocation cooperative game theory NBS |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《中国通信学报》浏览原始摘要信息 |
|
点击此处可从《中国通信学报》下载全文 |
