Cooperative Game Approach for Scheduling in Two-Virtual-Antenna Cellular Networks with Relay Stations Fairness Consideration  

虚拟两天线蜂窝网络中考虑中继公平性的协作博弈调度方法(英文)

作　　者：滕颖蕾 黄韬 刘媛媛 满毅 宋梅 

机构地区：[1]Beijing University of Posts and Telecommunications

出　　处：《China Communications》2013年第2期56-70,共15页中国通信（英文版）

基　　金：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.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 ap-proaches for scheduling in the wireless relay networks with two-virtual-antenna array mode After defining the metric of relay channel ca-pacity, we form a cooperative game for sched-uling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining So- lution （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 se- lection 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 alloca-tion cooperative game theory NBS 

分 类 号：TN929.53[电子电信—通信与信息系统] F224.32[电子电信—信息与通信工程]