Mobility Prediction Method to Optimize Resource Allocation in Heterogeneous Networks

We address the problem of uplink and downlink resource allocation in heterogeneous networks where device-to-device (D2D) communication is allowed. We consider a realistic, large-scale LTE network in which users can download/upload data using different paradigms, namely, downlink/uplink transmissions from/to macro or micro base stations, and D2D communication in the uplink LTE bands. We propose an approximate dynamic programming algorithm to perform resource allocation scheduling for both upload and download data traffic, while taking into account the interference caused by resource sharing between the different data transfer paradigms. Through simulation, we compare the performance of our approach to solutions employed in today's networks, such as eICIC techniques and proportional fairness scheduling. Results show that our approach significantly improves the system performance in terms of both overall throughput and energy efficiency.

This paper investigates the problem of joint base station selection and resource allocation in an orthogonal frequency division multiple access (OFDMA) heterogeneous cellular network. The original throughput maximization problem is NP-hard and we propose solving it by using game theoretic stochastic learning approaches. To this end, we first transform the original problem into a tractable form, which has a weighted utility function. Then we prove that an exact potential game applies and it exists the best Nash equilibria which is a near optimal solution of the original problem when an efficient solution method of the weights is employed. To obtain the optimal solution, we redesign the utility function by leveraging a state space to formulate the original problem into an ordinal state based potential game, which is proved that it exists a recurrent state equilibrium point that maximizes system throughput. Furthermore, we propose two different variants of Max-logit learning algorithm based on these two games respectively: one is a simultaneous learning algorithm with less information exchange, which achieves the best Nash equilibria point of the exact potential game and the other is an efficient learning algorithm for the ordinal state based potential game, which can converge to the global optimization solution. Finally, numerical results are given to validate that theoretical findings.

In heterogeneous networks, interference management is very important since the interference due to spectrum-sharing can significantly decrease the overall performance. In the existing work, various resource allocation methods are proposed to either improve energy efficiency or alleviate interference. Very little research has addressed their joint interaction. Furthermore, most existing work assumes that all of the channel state information is known, which might not be realistic. In this paper, we propose a game-theoretical scheme using energy-efficient resource allocation and interference pricing for an interference-limited environment in two-tier heterogeneous networks without complete channel state information. We formulate the problems of resource allocation and interference management as a two-stage Stackelberg game with incomplete information. A backward induction method is used to analyze the proposed game, since it can capture the sequential dependencies of the decisions in the stages of the game.

This paper proposes a deep-Q-network (DQN) controller for network selection and adaptive resource allocation in heterogeneous networks, developed on the ground of a Markov decision process (MDP) model of the problem. Network selection is an enabling technology for multi-connectivity, one of the core functionalities of 5G. For this reason, the present work considers a realistic network model that takes into account path-loss models and intra-RAT (radio access technology) interference. Numerical simulations validate the proposed approach and show the improvements achieved in terms of connection acceptance, resource allocation, and load balancing. In particular, the DQN algorithm has been tested against classic reinforcement learning one and other baseline approaches.

Here I have special thanks to Dr. Xiao Yong

In this paper, we present an energy-per-bit minimized radio resource allocation scheme in heterogeneous networks equipped with multi-homing capability, simultaneously connecting to different wireless interfaces. Specifically, we formulate an optimization problem related to minimization of energy-per-bit which takes a form of nonlinear fractional programming. Then we derive a parametric optimization problem out of that fractional programming and solve the original problem by using a double-loop iteration method. In each iteration, we derive the optimal resource allocation policy by applying Lagrangian duality and an efficient dual update method. In addition, we present suboptimal resource allocation algorithms using the properties of the optimal resource allocation policy. Numerical results reveal that the optimal allocation algorithm improves energy efficiency significantly over the existing resource allocation algorithms designed for homogeneous networks and its performance is superior to suboptimal algorithms in reducing energy consumption as well as in enhancing network energy efficiency.

Dynamic obstructions such as trees in the road environment can affect the quality of images captured by industrial cameras. In order to improve the quality of image acquisition in high dynamic scenes, this study proposes a new imaging algorithm based on convolutional neural networks and combined with single exposure high dynamic range imaging methods. This algorithm is mainly divided into a color camera image signal processing link module and a single exposure high dynamic range image enhancement module. The above two modules can improve the resolution of high dynamic range images. The experimental results show that the algorithm proposed in this study can achieve a response time of 63ms at the fastest, with PSNR, SSIM, and perceptual loss scores reaching 38.67, 0.976, and 0.087, respectively. Research has found that this algorithm has good application value in the field of high dynamic range image imaging.

A heterogeneous cellular network (HCN) is useful to increase the spectral and energy efficiency of wireless networks and to reduce the traffic load from the macro cell.The performance of the secondary user equipment (SUE) is affected by interference from the eNodeB (eNB) in a macro cell.To decrease the interference between the macro cell and the small cell, allocating resources properly is essential to an HCN.This study considers the scenario of a software-defined heterogeneous cellular network and performs the resource allocation process.First, we show the system model of HCN and formulate the optimization problem.The optimization problem is a complex process including power and frequency resource allocation, which imposes an extremely high complexity to the HCN.Therefore, a hierarchical resource allocation scheme is proposed, which including subchannel selection and a particle swarm optimization (PSO)-based power allocation algorithm.Simulation results show that the proposed hierarchical scheme is effective in improving the system capacity and energy efficiency.

Next generation high data rate applications such as High-Definition (HD) video transmission place a heavy load on wireless network resources. To achieve the strict quality of service requirements of HD video in a multi-user network requires efficient resource allocation. Rate-distortion theory provides an appropriate basis for this. The Nash Bargaining Solution (NBS) is proven to generate an optimal solution to a rate-distortion based convex resource allocation problem. Particle Swarm Optimization (PSO) is a meta-heuristic optimizer capable of generating near-optimal solutions. PSO, however, is not constrained to convex optimization problems. The motivation of this work is to demonstrate a PSO implementation capable of achieving an optimal solution to the resource allocation problem. The capability of the PSO approach to reach an optimal solution suggests its potential for resource allocation in a network of heterogeneous applications where convex optimization methods do not apply.

This paper is devoted to studying the processes of resource allocation in dynamic resource networks. In such networks, the capacities of the arcs depend on time. Resource allocation in the network occurs in discrete time. The resource of each vertex is distributed only between adjacent vertices according to some rules. The study of the processes of resource redistribution in such networks is carried out. The main goal is to develop methods for finding the limit state (distribution) of a resource in a dynamic resource network. It is shown that the approach based on the construction of an auxiliary network is also applicable to reduce the problem of resource allocation in a dynamic network to a similar problem in an auxiliary network. Theorems on the existence of a limit state on an auxiliary graph are proved for strongly regular periodic dynamical networks. To find the limit states, one can use the approaches which are developed for the shortest path problem in dynamic networks.

Heterogeneous Networks (HetNets) have gained the attraction of the communication industry recently, due to their promising ability to enhance the performance of future broadband Fifth Generation (5G) networks and are integral parts of 5G systems. They can be viewed in multi-dimensional space where, each slice represents a unique tier that has its own Base Station (BS)s and User Equipment (UE)s. Different tiers cooperate with each other for their mutual benefit. Data can be interactively exchanged among the tiers, and UEs have the flexibility to switch between the tiers. The cells in such a heterogeneous cellular networks have variable sizes, shapes, and coverage regions. However, in HetNets with ultra dense BSs, the distance between them gets very small and, they suffer from very high levels of mutual interference. To improve the performance of HetNets, we have done multiple contributions in this dissertation. First, we have developed analytical derivations for optimizing pilot sequence length which is a very crucial factor in acquiring the Channel State Information (CSI) and the channel estimation process in general. Poisson Point Process (PPP) has been widely used to allocate BSs among various tiers so far. However, BS locations obtained using PPP approach may not be optimum to reduce interference. Therefore, in this dissertation, BSs locations are optimized to reduce the interference and improve the coverage and received signal power. Also, we have derived expressions for static UEs coverage probability and network energy efficiency in HetNets. A proper UE association algorithm for HetNets is a great challenge. The classic max-Signal to Interference and Noise Ratio (SINR) or max-received signal strength (RSS) user association algorithms are inappropriate solutions for HetNets as UEs in this context will tend to connect to the Macro BS, which is the one with the highest signal power. A severe load imbalance and significant inefficiency arises and impacts the performance. The aforementioned algorithms tend to associate UEs to BSs with the best received signal power or signal quality. In HetNets, usually Macro BSs are the ones transmitting the strongest signals; hence most UEs tend to associate with the Macro BS leaving Micro BSs with less load. Also, the conventional max-SINR and max-RSS algorithms do not provide adequate results in multi-tier systems. We suggest two centralized algorithms, LSTD and RTLB, for an even UE association to provide fair load distribution. However RTLB outperforms LSTD in real time scenarios as it easily and quickly adapts to rapid network changes. Furthermore, we consider the mobility of nodes. We derive coverage probability for moving UEs considering both handover and no handover scenarios. Proposed algorithms are fast enough to associate the moving users to different Micro and Macro BSs appropriately in real time. Our algorithms are proved to be feasible and provide a path towards attainable future communication systems.

How many small cell (SC) access points (APs) are required to guarantee a chosen quality of service in a heterogeneous network? In this chapter, we answer this question considering two different network models. The first is the downlink of a finite-area SC network where the locations of APs within the chosen area are uniformly distributed. A key step in obtaining the closed-form expressions is to generalize the well-accepted moment matching approximation for the linear combination of lognormal random variables. For the second model, we focus on a two-layer downlink heterogeneous network with frequency reuse-1 hexagonal macro cells (MCs), and SC APs that are placed at locations that do not meet a chosen quality of service from macro base stations (BSs). An important property of this model is that the SC AP locations are coupled with the MC coverage. Here, simple bounds for the average total interference within an MC makes the formulation possible for the percentage of MC area in outage, as well as the required average number of SCs (per MC) to overcome outage, assuming isolated SCs. Introduction Heterogeneous cellular networks (HCNs) are being considered as an efficient way to improve system capacity as well as effectively enhance network coverage [1, 2]. Comprising multiple layers of access points (APs), HCNs encompass a conventional macro cellular network (first layer) overlaid with a diverse set of small cells (SCs) (higher layers). Cell deployment is an important problem in heterogeneous networks, both in terms of the number and positioning of the SCs. Traditional network models are either impractically simple (such as the Wyner model [3]) or excessively complex (e.g., the general case of random user locations in a hexagonal lattice network [4]) to accurately model SC networks. A useful mathematical model that accounts for the randomness in SC locations and irregularity in the cells uses spatial point processes, such as Poisson point process (PPP), to model the location of SCs in the network [5–10]. The independent placement of SCs from the MC layer, has the advantage of analytical tractability and leads to many useful SINR and/or rate expressions. However, even assuming that wireless providers would deploy SCs to support mobile broadband services, the dominant assumption remains that SCs are deployed randomly and independent of the MC layer [11].

An LTE-Advanced (LTE-A) Heterogeneous Network (HetNet) constitutes of a macro cell and small cells, where, the former acts as an overlay network and the latter as an underlay network. In HetNet, enabling Carrier Aggregation (CA) usually results in severe downlink interference at small cells from macro cell because of high powered transmissions from macro cell on over-lapping component carriers (co-channels). The intensity of downlink interference is much more profound in HetNet enabled with CA than compared with a single carrier HetNet and ultimately affects the Quality of Service (QoS) of users connected to small cells. Some frequency domain solutions like cross carrier scheduling, soft frequency reuse, and downlink power control have been proposed so far, but they do not provide complete orthogonal transmissions among macro and small cells, leading to adjacent channel interference. Also, a few time domain approaches like Almost Blank Subframe (ABS), dynamic ABS have been proposed in the literature. However, the resource utilization of cells decreases due to high number of ABS assignments in the dense deployment, which also results in low user throughput. In this paper, we propose a combined time domain and frequency domain novel idea for downlink interference control, which is via adaptive Discontinuous Reception (DRX) settings through Multi-Objective optimizations and an optimal carrier allocation scheme, respectively. The proposed idea mitigates the downlink co-channel interference by enabling intermittent data reception at the User Equipment (UE) through adaptive DRX settings, also it utilizes an effective carrier allocation scheme such that users are always allocated to carriers with least interference. The analytical model and simulation results reveal that the proposed idea achieves average gain of 3.5 times w.r.t cell throughput when compared with well-known downlink interference mitigation schemes.

Existing location management (LM) methods for macrocells in LTE-Advanced have tracking area list (TAL) granularity. Therefore, a user equipment (UE) triggers a location update (LU) whenever it leaves its current TAL, and it is searched through paging (PG) with TAL accuracy. However, these procedures are not well-suited for small cells (SCs). The reasons are twofold. First, dense deployments of SCs imply that paging has a low probability to be successful in the first attempt, increasing the signaling overhead in the core network (CN). Second, smaller coverage areas lead to a higher mobility among cells, increasing the signaling overhead in the CN due to LUs. In this work, two LM schemes with fine granularity are proposed. These schemes update UE's location to a local anchor (LA) in a SC or tracking area (TA) basis, respectively. By increasing the accuracy of UE's location, a significant reduction of signaling overhead in the CN due to PG is achieved. Moreover, LUs to the LA are performed through direct X2-interface links to avoid signaling overhead in the CN. A versatile mobility model is developed and closed-form expressions for UEs’ mobility metrics are found to validate the proposed schemes through variations of critical parameters such as TA/TAL configuration, UE's mobility patterns and cell residence times.

In mobile communications networks, if we can estimate the location of each user equipment (UE) with high accuracy, efficient cell planning and network optimization become possible. However, it is difficult for operators to estimate the location of most commercial UEs because they cannot feedback their location information directly to their serving base stations with the exception of UEs with Minimization of Drive Test (MDT) functions specified in LTE Release 10. Radio Frequency (RF) fingerprint method is known as an effective localization method, with which we can estimate the location of UEs with only RF signature and location information beforehand. In LTE, RF fingerprint database can be collected by conducting drive tests or using measurement data from UEs compatible with MDT. Although the estimation accuracy can be better with more RF signatures, the increase in the amount of RF signatures causes the increase in the feedback, which consumes the uplink capacity and UE battery. Furthermore, keeping all RF signatures in database is inefficient because some RF signatures do not have effect on improving estimation accuracy. Hence, it is important to clarify the effect of each RF signature and use only effective ones in the localization. In this paper, we conducted a field experiment to create an RF fingerprint database in dense urban area, and evaluated the effectiveness of each RF signature by making several localization models based on machine learning. Eventually, we clarified minimum RF signatures required to operate RF fingerprint localization in LTE network.