Abstract
As tremendous mobile devices access to the Internet in the future, the cells which can provide high data rate and more capacity are expected to be deployed. Specifically, in the next generation of mobile communication 5G, cloud computing is supposed to be applied to radio access network. In cloud radio access network (Cloud-RAN), the traditional base station is divided into two parts, that is, remote radio heads (RRHs) and base band units (BBUs). RRHs are geographically distributed and densely deployed, so as to achieve high data rate and low latency. However, the ultradense deployment inevitably deteriorates spectrum efficiency due to the severer intercell interference among RRHs. In this paper, the downlink spectrum efficiency can be improved through the cooperative transmission based on forming the coalitions of RRHs. We formulate the problem as a coalition formation game in partition form. In the process of coalition formation, each RRH can join or leave one coalition to maximize its own individual utility while taking into account the coalition utility at the same time. Moreover, the convergence and stability of the resulting coalition structure are studied. The numeric simulation result demonstrates that the proposed approach based on coalition formation game is superior to the noncooperative method in terms of the aggregate coalition utility.
Highlights
It is estimated that mobile data traffic will grow 1000 times from 2010 to 2020, as more and more devices which are capable of accessing to the Internet emerge with the development of mobile Internet and Internet of Things (IoTs) [1, 2]
According to the definition elaborated in Algorithm 1, to solve the cooperation problem for remote radio heads (RRHs), we propose a novel and efficient algorithm which is based on the hedonic shift rule [14]: given coalition structure πN = {S1, S2, . . . , Sl} defined on RRHs set N and preference relation ≻i, for any RRH i ∈ N that decides to leave its current coalition Sc to join another one S ∈ πN ∪ φ if and only if S∪{i} ≻i Sc, that is, RRH i can benefit more from being one of the members of coalition S than staying at coalition Sc
With the densification of the deployment for RRHs, the proposed algorithm shows that each RRH can acquire more payoff than the noncooperative method, which indicates that the spectrum efficiency can be improved through the cooperative transmission among RRHs
Summary
It is estimated that mobile data traffic will grow 1000 times from 2010 to 2020, as more and more devices which are capable of accessing to the Internet emerge with the development of mobile Internet and Internet of Things (IoTs) [1, 2]. The problem of cooperative interference management in an OFDMA two-tier small cell network was studied [18], and a decentralized algorithm was proposed to allow small cell base stations to interact and self-organize into a stable overlapping coalition structure. These works just focused on eliminating the mutual interference without considering turning the interference into the additional gain in a coalition. (i) We proposed a novel approach based on coalition formation game to improve the spectrum efficiency within the framework of Cloud-RAN, so as to effectively suppress the mutual interference in the ultradense network.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
