Search

Frequent handover is a key challenge in 5G Ultra-Dense Networks (UDN). In this paper, we show the significance of configuring Neighbor Cell List (NCL) in handover procedure. To cope with the high dynamic of UDN, we propose an online-learning method, namely the Cost-aware Cascading Bandits NCL configuration (CCB-NCL) algorithm, which applies the cascading model and Multi-Armed Bandits (MAB) theory to configure the efficient Neighbor Cell List (eNCL) and improves the handover performance by assisting the User Equipment (UE) to choose the optimal target Base Station (BS). We provide rigorous proof of regret bound to show the asymptotic convergence of the proposed CCB-NCL algorithm. The robustness and efficiency of the proposed algorithm are both demonstrated in different network scenarios, where varies BS densities, BS dynamic and network heterogeneity are considered respectively. In the simulation work, we reproduce two existing methods of configuring NCL in handover management, named dynamic threshold based solution and received signal strength based solution. In comparison with the existing solutions, the proposed algorithm can reduce the overlarge signaling cost and unnecessary delay in the preparation phase of handover procedure by significantly shortening the length of NCLs and reducing the number of scanned BSs. Extensive simulations are conducted in different scenarios to validate the robustness of the proposed algorithm and the results show that the proposed CCB-NCL algorithm is a superior approach to efficient handover management.

To address the problems in end-to-end networks, researchers have proposed an information-centric network(ICN). In-network caching is one of the important features of ICN, which can greatly improve the efficiency of content distribution. However, the Internet Service Providers(ISP) only deploy Innetwork caching if there is some financial incentives. The existing ICN pricing mechanisms only study paid content but ignore free content in the network. In addition, the existing ICN economic models do not take into account ISP cooperating with Content Provider(CP) to deploy in-network caches. Therefore, the pricing mechanisms already in place cannot be applied in practice. In this paper, different from the existing models which based on the paid content, a new ICN pricing model with free content based on non-cooperative game theory was proposed for the first time and advertisers were effectively added to the ICN pricing model. After analyzing the behavioral relationships between entities within the network, the authors establish the utility function for each entity. The authors analyze the impact of caching and pricing on the revenues of all entities and solve the equilibrium point to develop win-win pricing strategies. Considering the case where paid content coexists with free content in real networks, the authors proposes a more realistic and integrated model. In this paper, many experimental analyses have been conducted in addition to the theoretical analysis, and the experimental results show that the new model is closer to reality than the existing models and can provide better theoretical guidance for network pricing.

In this work we analyze the performance of a full-duplex (FD) multi-cell network where Poisson point process (PPP) distributed half-duplex (HD) users are served by FD base stations (BSs). The use of FD BSs instead of traditional half-duplex (HD) ones results in a surge in the amount of interference present in the network. In order to address this challenge we, (a) adopt a self-interference (SI) cancellation scheme at each BS, (b) apply linear interference alignment (IA) in each cell to cancel out intra-cell interference, and (c) model the distribution of the BSs as a Matern hard-core point process (HCPP) to mitigate inter-cell interference. The performance of both downlink (DL) and uplink (UL) users is analyzed by deriving general expressions, and easily computable good approximations for the ergodic capacity of each type of user.

In this paper, we analyse the performance of a millimeter wave (mmWave) cloud radio access network (CRAN), where remote radio heads (RRHs) are modelled as a homogeneous Poisson point process (PPP) and blockages are randomly distributed. In contrast to the previous works on CRAN that operate below 6GHz, we consider CRAN operating in mmWave range (30-300 GHz). Since blockages have a significant impact on mmWave communications, we adopt a distance-dependent line-of-sight (LOS) probability function and model the locations of the LOS and non-line-of-sight (NLOS) RRHs as two independent non-homogeneous PPP. The outage performance and ergodic capacity of the LOS and NLOS RRHs are analysed and compared. When the RRH with the best channel is selected for transmission, the expressions of outage probability and throughput are provided. The presented results show that due to the severe path loss in NLOS links, in low transmitted power regime, the best RRH (BR) is always LOS. However, in high transmitted power regime, NLOS RRHs can be BR.

In this paper, the performance of a cloud radio access network (CRAN) is analysed, which consists of multiple randomly distributed remote radio heads (RRHs) and a macro base station (MBS). Different from previous works on CRAN where Poisson Point Process (PPP) is used to model spatial distribution of RRHs, a more realistic Matern Hard-core point process (MHCPP) model is adopted in this work. To compare system performance of CRAN when different transmission strategies are used, two RRH selection schemes are adopted including 1) the best RRH selection (BRS) and 2) all RRHs participation (ARP). Considering downlink transmission, the outage probability and system throughput of CRAN are analytically characterized. The presented results demonstrate that compared to PPP model, the presence of hard-core distance will increase outage probability. Furthermore, the BRS scheme is more energy-efficient than the ARP scheme. Moreover, it is shown that the hard-core distance has a more significant impact on systems with higher intensity of PPP distributed candidate points and in large hard-core distance regime increasing the intensity of candidate points can only provide a small improvement in outage performance.