Load Distribution of Base Stations in User-Centric Heterogeneous UDN

In ultra-dense networks(UDN),multiple association can be regarded as a user-centric pattern in which a user can be served by multiple base stations(BSs).The data rate and quality of service can be improved.However,BSs in user-centric paradigm are required to serve more users due to this multiple association scheme.The improvement of system performance may be limited by the improving load of BSs.In this letter,we develope an analytical framework for the load distribution of BSs in heterogeneous user-centric UDN.Based on open loop power control(OLPC),a user-centric scheme is considered in which the clustered serving BSs can provide given signal to interference plus noise ratio(SINR)for any typical user.As for any BS in different tiers,by leveraging stochastic geometry,we derive the Probability Mass Function(PMF)of the number of the served users,the Cumulative Distribution Function(CDF)of total power consumption,and the CDF bounds of downlink sum data rate.The accuracy of the theoretical analysis is validated by numerical simulations,and the effect the system parameters on the load of BSs is also presented.

A Novel Resource Allocation Algorithm based on Downlink and Uplink Decouple Access Scheme in Heterogeneous Networks

Traditional cellular network requires that a user equipment(UE) should associate to the same base station(BS) in both the downlink(DL) and the uplink(UL). Based on dual connectivity(DC) introduced in LTE-Advanced R12, DL/UL decouple access scheme has been proposed, which is especially suitable for heterogeneous networks(Het Nets). This paper is the pioneer to take the DL/UL decouple access scheme into consideration and develop a novel resource allocation algorithm in a two-tier Het Net to improve the total system throughput in the UL and ease the load imbalance between macro base stations(MBSs) and pico base stations(PBSs). A model is formulated as a nonlinear integer programming, and the proposed algorithm is a sub-optimal algorithm based on the graph theory. First, an undirected and weighted interference graph is obtained. Next, the users are grouped to let users with large mutual interferences to be assigned to different clusters. Then, the users in different clusters are allocated to different resource blocks(RBs) by using the Hungarian algorithm. Simulation results show that the proposed algorithm can provide great promotions for both the total system throughput and the average cell edge user throughput and successfully ease the load imbalance between MBSs and PBSs.

A Sphere Detection Based Adaptive MIMO Detection Algorithm for LTE-A System

An adaptive MIMO detection algorithm for LTE-A system which is based on sphere detection is proposed in this paper. The proposed algorithm uses M-algorithm for reference to remove unreliable constellation candidates before search, and the number of constellation reservation is adaptively adjusted according to SNR. Simulations of LTE-A downlink show that the BER performance of the proposed detection algorithm is nearly the same as maximum likelihood (ML) detection algorithm. However, the complexity is reduced by about 30% compared with full constellation sphere detection.