Dynamic C-RAN resource sharing scheme based on a hierarchical game approach

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

6

초록

Over the past decade, wireless applications have experienced tremendous growth, and this growth is likely to multiply in the near future. To cope with expected drastic data traffic growth, a new cloud computing-based radio access network (C-RAN) has been proposed for next-generation cellular networks. It is considered as a cost-efficient way of meeting high resource demand of future wireless access networks. In this paper, we propose a novel resource sharing scheme for future C-RAN systems. Based on the Indian buffet game, we formulate the C-RAN resource allocation problem as a two-level game model and find an effective solution according to the coopetition approach. Our proposed scheme constantly monitors the current C-RAN system conditions and adaptively responds in a distributed manner. The experimental results validate the effectiveness and efficiency of our proposed scheme under dynamic C-RAN situations.

키워드

Cloud radio access networkIndian buffet gameResource allocationTwo-level game modelAsymptotic shapley valueCoopetition approachCHANNEL ALLOCATIONNETWORKSACCESSMOBILE
제목
Dynamic C-RAN resource sharing scheme based on a hierarchical game approach
저자
Kim, Sungwook
DOI
10.1186/s13638-015-0507-y
발행일
2016-01-04
유형
Article
저널명
Eurasip Journal on Wireless Communications and Networking
2016
1
페이지
1 ~ 12