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

Enhanced distance-based location management of mobile communication systems using a cell coordinates approach

In managing the locations of mobile users in mobile communication systems, the distance-based strategy has been proven to have better performance than other dynamic strategies, but is difficult to implement. In this paper, a simple approach is introduced to implement the distance-based strategy by using the cell coordinates in calculating the physical distance traveled. This approach has the advantages of being independent of the size, shape, and distribution of cells, as well as catering for the direction of movement in addition to the speed of each mobile terminal. An enhanced distance-based location management strategy is proposed to dynamically adjust the size and shape of location area for each individual mobile terminal according to the current speed and direction of movement. It can reduce the location management signaling traffic of the distance-based strategy by half when mobile terminals have predictable directions of movement. Three types of location updating schemes are discussed, namely, Circular Location Area, Optimal Location Area, and Elliptic Location Area. Paging schemes using searching techniques such as expanding distance search based on the last reported location and based on the predicted location, and expanding direction search are also explored to further reduce paging signal traffic by partitioning location areas into paging areas.published_or_final_versio

The MobyDick Project: A Mobile Heterogeneous All-IP Architecture

Proceedings of Advanced Technologies, Applications and Market Strategies for 3G (ATAMS 2001). Cracow, Poland: 17-20 June, 2001.This paper presents the current stage of an IP-based architecture for heterogeneous environments, covering UMTS-like W-CDMA wireless access technology, wireless and wired LANs, that is being developed under the aegis of the IST Moby Dick project. This architecture treats all transmission capabilities as basic physical and data-link layers, and attempts to replace all higher-level tasks by IP-based strategies. The proposed architecture incorporates aspects of mobile-IPv6, fast handover, AAA-control, and Quality of Service. The architecture allows for an optimised control on the radio link layer resources. The Moby dick architecture is currently under refinement for implementation on field trials. The services planned for trials are data transfer and voice-over-IP.Publicad

A Data Mining Approach for Location Management in 4G Wireless Heterogeneous Networks

A report submitted by Sherif Rashad to the Research and Creative Productions Committee in 2008 on the problem of location management. in the fourth generation (4G) of wireless mobile networks

Location Management Cost Reduction Using Adaptive Velocity-movement Based Scheme

Wireless personal communication networks (PCNs) consist of a fixed wireless network and a large number of mobile terminals. These terminals are free to travel within the PC coverage area without service interruption. Each terminal periodically reports its location to the network by a process called location update (or registration). When a call arrives for a particular mobile terminal, the network will determine the exact location of the destination terminal by a process called terminal paging. One major problem that arises in this scenario is the cost associated with paging and registration. Several papers in the literature attempt to reduce the cost by devising new schemes for paging and registration. One of the many interesting schemes was presented by Wan and Lin (1998) that considers a dynamic paging scheme based on the semi-real time velocity information of an individual mobile user, which allows a more accurate prediction of the user location when a call arrives. In this paper, we modified the scheme presented by Wan and Lin by creating an adaptive velocity timer that changes according to the speed of the mobile and applies the same analysis to the movement-based scheme. The investigation shows that the proposed approach of Wan and Lin has better results than what was reported therein and our new approach helps reduce the total cost drastically compared to the original scheme. Results also show that the movement threshold and the adaptive velocity time unit, when they are adaptive, provide significant savings of cost under different cell sizes and velocities in high and low mobility systems

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