zCap: a zero configuration adaptive paging and mobility management mechanism

Today, cellular networks rely on fixed collections of cells (tracking areas) for user equipment localisation. Locating users within these areas involves broadcast search (paging), which consumes radio bandwidth but reduces the user equipment signalling required for mobility management. Tracking areas are today manually configured, hard to adapt to local mobility and influence the load on several key resources in the network. We propose a decentralised and self-adaptive approach to mobility management based on a probabilistic model of local mobility. By estimating the parameters of this model from observations of user mobility collected online, we obtain a dynamic model from which we construct local neighbourhoods of cells where we are most likely to locate user equipment. We propose to replace the static tracking areas of current systems with neighbourhoods local to each cell. The model is also used to derive a multi-phase paging scheme, where the division of neighbourhood cells into consecutive phases balances response times and paging cost. The complete mechanism requires no manual tracking area configuration and performs localisation efficiently in terms of signalling and response times. Detailed simulations show that significant potential gains in localisation effi- ciency are possible while eliminating manual configuration of mobility management parameters. Variants of the proposal can be implemented within current (LTE) standards

Design of personalized location areas for future Pcs networks

In Global Systems for Mobile Communications (GSM), always-update location strategy is used to keep track of mobile terminals within the network. However future Personal Communication Networks (PCS) will require to serve a wide range of services (digital voice, video, data, and email) and also will have to support a large population of users. Under such demands, determining the exact location of a user by traditional strategies would be difficult and would result in increasing the signaling load imposed by location-update and paging procedures. The problem is not only in increasing cost, but also in non-efficient utilization of a precious resource, i.e., radio bandwidth; In this thesis, personalized Location Areas (PLAs) are formed considering the mobility patterns of individual users in the system such that the signaling due to location update and paging is minimized. We prove that the problem in this formulation is of NP complexity. Therefore we study efficient optimization techniques able to avoid combinatorial search. Three known classes of optimization techniques are studied. They are Simulated Annealing, Tabu Search and Genetic Search. Three algorithms are designed for solving the problem. Modeling does not assume any specific cell structure or network topology that makes the proposal widely applicable. The behavior of mobile terminals in the network is modeled as Random Walk with an absorbing state and the Markov chain is used for cost analysis; Numeric simulation carried out for 25 and 100 hexagonal cell networks have shown that Simulated Annealing based algorithm outperforms other two by indicators of the runtime complexity and signaling cost of location management. The ID\u27s of cells populating the calculated area are provided to the mobile terminal and saved in its local memory every time the mobile subscriber moves out its current location area. Otherwise, no location update is performed, but only paging. Thus, at the expense of small local memory, the location management is carried more efficiently

Performance Analysis of Millimeter Wave Massive MIMO Systems in Centralized and Distributed Schemes

This paper considers downlink multi-user millimeter-wave massive multiple-input multiple-output (MIMO) systems in both centralized and distributed configurations, referred to as C-MIMO and D-MIMO, respectively. Assuming the fading channel is composite and comprised of both large-scale fading and small-scale fading, a hybrid precoding algorithm leveraging antenna array response vectors is applied into both the C-MIMO system with fully connected structure and the D-MIMO system with partially connected structure. First, the asymptotic spectral efficiency (SE) of an arbitrary user and the asymptotic average SE of the cell for the C-MIMO system are analyzed. Then, two radio access unit (RAU) selection algorithms are proposed for the D-MIMO system, based on minimal distance (D-based) and maximal signal-to-interference-plus-noise-ratio (SINR) (SINR-based), respectively. For the D-MIMO system with circular layout and D-based RAU selection algorithm, the upper bounds on the asymptotic SE of an arbitrary user and the asymptotic average SE of the cell are also investigated. Finally, numerical results are provided to assess the analytical results and evaluate the effects of the numbers of total transmit antennas and users on system performance. It is shown that, from the perspective of the cell, the D-MIMO system with D-based scheme outperforms the C-MIMO system and achieves almost alike performance compared with the SINR-based solution while requiring less complexity.Peer reviewe