2,652 research outputs found
How to Solve the Fronthaul Traffic Congestion Problem in H-CRAN?
The design of efficient wireless fronthaul connections for future heterogeneous networks incorporating emerging paradigms such as heterogeneous cloud radio access network (H-CRAN) has become a challenging task that requires the most effective utilization of fronthaul network resources. In this paper, we propose and analyze possible solutions to facilitate the fronthaul traffic congestion in the scenario of Coordinated Multi-Point (CoMP) for 5G cellular traffic which is expected to reach ZetaByte by 2017. In particular, we propose to use distributed compression to reduce the fronthaul traffic for H-CRAN. Unlike the conventional approach where each coordinating point quantizes and forwards its own observation to the processing centre, these observations are compressed before forwarding. At the processing centre, the decompression of the observations and the decoding of the user messages are conducted in a joint manner. Our results reveal that, in both dense and ultra-dense urban small cell deployment scenarios, the usage of distributed compression can efficiently reduce the required fronthaul rate by more than 50% via joint operation
Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks
Soaring capacity and coverage demands dictate that future cellular networks
need to soon migrate towards ultra-dense networks. However, network
densification comes with a host of challenges that include compromised energy
efficiency, complex interference management, cumbersome mobility management,
burdensome signaling overheads and higher backhaul costs. Interestingly, most
of the problems, that beleaguer network densification, stem from legacy
networks' one common feature i.e., tight coupling between the control and data
planes regardless of their degree of heterogeneity and cell density.
Consequently, in wake of 5G, control and data planes separation architecture
(SARC) has recently been conceived as a promising paradigm that has potential
to address most of aforementioned challenges. In this article, we review
various proposals that have been presented in literature so far to enable SARC.
More specifically, we analyze how and to what degree various SARC proposals
address the four main challenges in network densification namely: energy
efficiency, system level capacity maximization, interference management and
mobility management. We then focus on two salient features of future cellular
networks that have not yet been adapted in legacy networks at wide scale and
thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and
device-to-device (D2D) communications. After providing necessary background on
CoMP and D2D, we analyze how SARC can particularly act as a major enabler for
CoMP and D2D in context of 5G. This article thus serves as both a tutorial as
well as an up to date survey on SARC, CoMP and D2D. Most importantly, the
article provides an extensive outlook of challenges and opportunities that lie
at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201
Spatial Coordination Strategies in Future Ultra-Dense Wireless Networks
Ultra network densification is considered a major trend in the evolution of
cellular networks, due to its ability to bring the network closer to the user
side and reuse resources to the maximum extent. In this paper we explore
spatial resources coordination as a key empowering technology for next
generation (5G) ultra-dense networks. We propose an optimization framework for
flexibly associating system users with a densely deployed network of access
nodes, opting for the exploitation of densification and the control of overhead
signaling. Combined with spatial precoding processing strategies, we design
network resources management strategies reflecting various features, namely
local vs global channel state information knowledge exploitation, centralized
vs distributed implementation, and non-cooperative vs joint multi-node data
processing. We apply these strategies to future UDN setups, and explore the
impact of critical network parameters, that is, the densification levels of
users and access nodes as well as the power budget constraints, to users
performance. We demonstrate that spatial resources coordination is a key factor
for capitalizing on the gains of ultra dense network deployments.Comment: An extended version of a paper submitted to ISWCS'14, Special Session
on Empowering Technologies of 5G Wireless Communication
Hierarchical Resource Allocation Framework for Hyper-Dense Small Cell Networks
This paper considers joint power control and subchannel allocation for co-tier interference
mitigation in extremely dense small cell networks, which is formulated as a combinatorial optimization problem. Since it is intractable to obtain the globally optimum assignment policy for existing techniques due to the huge computation and communication overheads in ultra-dense scenario, in this paper, we propose a hierarchical resource allocation framework to achieve a desirable solution. Speci cally, the solution is obtained by dividing the original optimization problem into four stages in partially distributed manner. First, we propose a divide-and-conquer strategy by invoking clustering technique to decompose
the dense network into smaller disjoint clusters. Then, within each cluster, one of the small cell access points is elected as a cluster head to carry out intra-cluster subchannel allocation with a low-complexity algorithm. To tackle the issue of inter-cluster interference, we further develop a distributed learning-base coordination mechanism. Moreover, a local power adjustment scheme is also presented to improve the system performance. Numerical results verify the ef ciency of the proposed hierarchical scheme, and demonstrate that our solution outperforms the state-of-the-art methods, especially for hyper-dense networks
Interference-aware energy efficiency maximization in 5G ultra-dense networks
Ultra-dense networks can further improve the spectrum efficiency (SE) and the energy efficiency (EE). However, the interference avoidance and the green design are becoming more complex due to the intrinsic densification and scalability. It is known that the much denser small cells are deployed, the more cooperation opportunities exist among them. In this work, we characterize the cooperative behaviors in the Nash bargaining cooperative game-theoretic framework, where we maximize the EE performance with a certain sacrifice of SE performance. We first analyze the relationship between the EE and the SE, based on which we formulate the Nash-product EE maximization problem.We achieve the closed-form sub-optimal SE equilibria to maximize the EE performance with and without the minimum SE constraints. We finally propose a CE2MG algorithm, and numerical results verify the improved EE and fairness of the presented CE2MG algorithm compared with the non-cooperative scheme
Sequentially Distributed Coalition Formation Game for Throughput Maximization in C-RANs
Cloud radio access network (C-RAN) has been proposed as a solution to reducing the huge cost of network upgrade while providing the spectral and energy efficiency needed for the new generation cellular networks. In order to reduce the interference that occur in C-RAN and maximize throughput, this paper proposes a sequentially distributed coalition formation (SDCF) game in which players, in this case the remote radio heads (RRHs), can sequentially join multiple coalitions to maximize their throughput. Contrary to overlapping coalition formation (OCF) game where players contribute fractions of their limited resources to different coalitions, the SDCF game offers better stability by allowing sequential coalition formation depending on the availability of resources and therefore providing a balance between efficient spectrum use and interference management. An algorithm for the proposed model is developed based on the merge-only method. The performance of the proposed algorithm in terms of stability, complexity and convergence to final coalition structure is also investigated. Simulation results show that the proposed SDCF game did not only maximize the throughput in the C-RAN, but it also shows better performances and larger capabilities to manage interference with increasing number of RRHs compared to existing methods
- …