Communications and Networking. 11th EAI international Conference, ChinaCom 2016 Chongqing, China, September 24-26, 2016, Proceedings, Part II

Research Article

Resource Allocation with Multiple QoS Constraints in OFDMA-Based Cloud Radio Access Network

Download
202 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-66628-0_43,
        author={Shichao Li and Gang Zhu and Siyu Lin and Qian Gao and Shengfeng Xu and Lei Xiong and Zhangdui Zhong},
        title={Resource Allocation with Multiple QoS Constraints in OFDMA-Based Cloud Radio Access Network},
        proceedings={Communications and Networking. 11th EAI international Conference, ChinaCom 2016 Chongqing, China, September 24-26, 2016, Proceedings, Part II},
        proceedings_a={CHINACOM},
        year={2017},
        month={10},
        keywords={Cloud radio access network Multiple QoS requirements Subcarrier and power allocation Time-sharing and alternating methods},
        doi={10.1007/978-3-319-66628-0_43}
    }
    
  • Shichao Li
    Gang Zhu
    Siyu Lin
    Qian Gao
    Shengfeng Xu
    Lei Xiong
    Zhangdui Zhong
    Year: 2017
    Resource Allocation with Multiple QoS Constraints in OFDMA-Based Cloud Radio Access Network
    CHINACOM
    Springer
    DOI: 10.1007/978-3-319-66628-0_43
Shichao Li1, Gang Zhu1, Siyu Lin,*, Qian Gao1, Shengfeng Xu1, Lei Xiong1, Zhangdui Zhong1
  • 1: Beijing Jiaotong University
*Contact email: sylin@bjtu.edu.cn

Abstract

Due to the spread of mobile Internet and development of many new multimedia applications, there are much different quality-of-service (QoS) requirements of users in fifth generation (5G) communication system. In this paper, we consider two types of users with different QoS requirements in OFDMA based cloud radio access network (C-RAN). One type QoS requirements of users are joint bit error rate (BER) and data rate (type I users), and the other type is the data rate (type II users). We formulate the resource allocation problem in OFDMA-based C-RAN, the problem is maximal weighted sum rate for type II users subject to the QoS requirements of type I users and the fronthaul capacity constraint. Since the formulated problem is a non-convex problem, two subproblems are reformulated firstly, and then based on the CPLEX package, time-sharing and alternating methods, we proposed an iterative algorithm. Simulation results confirm that the proposed algorithm can achieve good performance.