节点文献

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

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

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

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

【Author】 TENG Yinglei, HUANG Tao, LIU Yuanyuan, MAN Yi, SONG Mei Beijing University of Posts and Telecommunications, Beijing 100876, China

【机构】 Beijing University of Posts and Telecommunications

【摘要】 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.

【Abstract】 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.

【基金】 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
  • 【文献出处】 中国通信 ,China Communications , 编辑部邮箱 ,2013年02期
  • 【分类号】TN929.53
  • 【被引频次】3
  • 【下载频次】43
节点文献中: 

本文链接的文献网络图示:

本文的引文网络