Distance-Based Location Management Utilizing Initial Position for Mobile Communication Networks

Application of AI techniques for locating mobile terminals in mobile wireless cellular networks: A novel paging scheme

Location management deals with how to track mobile users within the cellular network. It consists of two basic operations: location update and paging. The total location management cost is the sum of the location update cost and the paging cost. Location areas and reporting centers are two popular location management schemes. The motivation for the study is the observation that the location update cost difference between the reporting centers scheme and the location areas scheme is small whereas the paging cost in the reporting centers scheme is larger than that in the location areas scheme. The paper compares the performance of the location areas scheme and the reporting centers scheme under aggregate movement behavior mobility models by simulations. Simulation results show that the location areas scheme performs about the same as the reporting centers scheme in two extreme cases, that is, when a few cells or almost all cells are selected as the reporting cells. However, the location areas scheme outperforms the reporting centers scheme at the 100% confidence level with all call-to-mobility ratios when the reporting cells divide the whole service area into several regions.

Location management which keeps track of the mobile terminals moving from place to place in a wireless networks is a key issue in resource management particularly in 3G cellular networks. Two basic operations are involved in location management: location update and paging. It is necessary to provide a good trade off between location update and paging to reduce the total cost. This goal however needs good algorithms for both registration and paging. We propose a dynamic movement-base location management scheme for 3G networks where Home Location Registers (HLR's), Gateway Location Registers (GLR's), and Visitor Location Registers (VLR's) are formed into three level hierarchical mobility data base structure. A simulator based on MATLAB which can study location update and paging performance was developed. It is expected that the average number of location updates could be reduced using the movement-base scheme.

Location management is the basis for ensuring service continuity in low earth orbit (LEO) satellite mobile communication systems. The dual mobility of LEO satellites and mobile users triggers frequent location update procedures, which will increase the network location management overhead and bring great challenges to network location management, especially in the mega satellite networks. In this paper, we propose a location management technology solution for mega satellite networks, including location management architecture, location area design, location update, and paging procedures. A medium earth orbit (MEO) satellite-assisted location management architecture is proposed to improve the efficiency of location management. It extends the location management control plane from the ground to space and adopts a distributed location management mechanism. A dual location area, including the satellite location area and user location area, is designed to balance the network location update and paging overhead. Based on the dual location area, we systematically design low-overhead location update and paging procedures. Simulation results have verified that the proposed location management technology solution can reduce the total location management overhead and delay by at least 45.8% and 20.8%, respectively.

Mobility is the most issues for the majority ofprotocols including the RPL (IPv6 Routing Protocol for LowPower and Lossy Networks). RPL a routing protocolstandardized by IETF is usually used in Internet of ThingsTechnology. It is proposed to support communications in Lowpower and Lossy Networks (LLNs). However, mobility limitsthe use of RPL protocol in realistic study. In this paper wehave classify the mobility models in two entities in order toevaluate the performances of RPL in each entity separately. Sowe have defines two different scenarios. We first, evaluatecharacteristics of RPL with a group mobility models whichcontain Reference Point Mobility Model (RPGM) and Nomadic Mobility Model (Nomadic) Mobility Models. Then wegive another evaluation of features of RPL with the Entitymobility models which contain Random Walk Mobility Model(RWK), Random Waypoint Mobility Models (RWP) and selfsimilarleast action walk (SLAW) Mobility models. The resultsshow that the type of mobility models has a direct influence onthe protocol performances. In addition, increasing of numberof nodes causes an increasing of all parameters, especially indelivered and received data. Furthermore, the group mobilitymodels give better metrics than entity mobility models in termsof lost packets, Packet Delivery Ratio (PDR) and Throughput. Also, in each type of mobility models each model providesbetter metrics than others. RPG offers best number of lostpackets and PDR than Nomadic model and lowest in terms ofThroughput while SLAW models gives the best value in allmetrics than RWK and RWP. Our simulation shows clearlythat lost packets, PDR and Throughput are directly related tothe type of mobility models.

Cellular mobile systems provides access to a wide range of services and allow mobile terminals (MTs) to move randomly from one place to another within a well-defined geographical area. Due to the growing number of mobile users, global connectivity, and the small size of cells, one of the most critical issues regarding these networks is location management. The challenging task in a cellular system is to track the location of the mobile users effectively so that the connection establishment cost and delay is low. In recent years, several strategies have been proposed to improve the performance of the location management procedure in cellular networks. In this paper, we propose an intelligent approach by taking the User Profile History (UPH); to reduce the location update cost by combining Back-Propagation Algorithm and Cascaded Correlation Neural Network. The implementation of this strategy has been subject to extensive tests. The results obtained confirm the efficiency of UPH in significantly reducing the costs of both location updates and call delivery procedures when compared to the various other strategies well-known in the literature.

The fluid-flow model is suitable for vehicle traffic on highways but not for pedestrian movements with frequent stop-and-go behavior. Considering the change of a mobile’s velocity within a short time is limited due to physical restrictions, therefore a mobile user’s future velocity is likely to be correlated with its past and current velocity. Since Gauss– Markov model captures the essence of the correlation of a mobile’s velocity in time, we propose a Gauss–Markov process based fluid model that it is suitable for both vehicle traffic on highways and pedestrian in street and presents the total cost of location management for the Gauss– Markov process based fluid model. The performance evaluation and comparison of the Gauss– Markov process based fluid model location update scheme and existing fluid model based location update scheme are studied.

Location management plays a central role in guaranteeing the effective operation of Personal Communication Service (PCS). In this paper, a dynamic visitor location register (VLR) based location management scheme is proposed for PCS networks. In this scheme, the current mobile switching center (MSC) gathers the information about the mobile terminals from the previous MSC of mobile terminal (MT), and performs the location registration. This proposed scheme decreases the traffic over the home location register (HLR) and it also reduces the location management cost. An analytical model is developed to evaluate the performance of the proposed scheme

The paper proposes an integrated location management scheme, based on our previously proposed novel rule-based paging scheme (RBPS) for reducing the cost of terminal paging in a cellular wireless environment. We extend that scheme to propose a complete location management scheme. This requires application of RBPS together with a judicious movement based location update (LU) scheme. Numerical results show that the proposed integrated location management scheme, called RBPS*, not only attempts to resolve the issue of inherent tradeoff between the cost components, comprised of paging and LU cost, but also does reduce the total cost for location management compared to the other schemes. RBPS* significantly outperforms RBPS and the GSM-adopted blanket paging scheme along with movement based LU. When compared with the popular shortest distance first (SDF) scheme, results are again encouraging. The proposed scheme, RBPS*, is a generic one and can be deployed on-line. It has the potential for use in next generation wireless networks, irrespective of any standards.

This paper presents a dynamic anchor scheme in wireless ATM (asynchronous transfer mode) networks, which improves the location registers (LR) scheme, in which LR’s are hierarchically structured. This dynamic anchor scheme introduces the CCR (communication-to-computation cost ratio) term in the LR scheme. The proposed scheme reduces computation cost by introducing the active LR. There are at most two active LR’s in a hierarchical arrangement of LR’s and the location of one active LR is static and the location of another active LR called as anchor LR is dynamically selected among the LRs in the hierarchy in order to minimize a total location management cost. The total location management cost is calculated depending on the CCR as well as the CMR (call-to-move ratio). Numerical results show that the proposed scheme can reduce the location management cost compared with the original LR scheme for the different values of the CCR and the CMR.KeywordsWireless ATMLocation Managementanchor scheme

As PCS networks aim to provide 'anytime-anywhere' cellular services, mobile terminals' (MTs) locations should be managed continuously. Location management (LM) includes two processes; registration and paging. Registration concerned with reporting MTs current locations, while, paging locates the callee MT. Both processes incur signalling cost across the wireless channel, which need to be reduced due to the scarcity of PCS wireless bandwidth. In spite of its minimal latency, blanket paging, used in current networks, wastes the network bandwidth. This paper aims to reduce the paging signalling cost under delay bounds. The paper contributions can be summarised as: 1) establishing a family of paging strategies under two proposed probability based LM strategies (PBLM and MPBLM); 2) introducing a novel topology for PCS registration area called the 'hot spot topology' (HST); 3) based on HST, another new LM strategy called 'flower based location management' (FBLM) is introduced. The proposed paging strategies substantially lower the signalling cost compared with the blanket one. Also, experimental results have shown that FBS dramatically reduce the signalling load (up to 80%) with a minimal increase in paging delay.

Mobility management is an important aspect in LEO systems. In terrestrial wireless networks, the movement of the user triggers location updating and determines the paging scheme, while in LEO satellite systems, location updating and paging is mainly based on the movement of satellites. Terrestrial location management techniques must be altered to fit LEO systems. The paper introduces a modified movement-based location update and paging scheme in LEO networks. We propose the meta-cell concept, which includes two spot-beams of one satellite. First, we present a location management scheme based on the architecture with a meta-cell location area. Then, an analytical model is applied to formulate the cost of location updating and location paging for the movement and meta-cell based dynamic location update scheme. The comparison of performance between the meta-cell architecture method and the conventional signal-spot-cell architecture method is provided to demonstrate the cost-effectiveness and robustness of the proposed scheme under various parameters. To reduce the impact of meta-cell architecture on location paging cost, we present a forced location update strategy which is used in the case that the meta-cell includes two spot-beams from different satellites.

In this paper, we develop an analytical model of the signaling costs due to location update and paging for the radio interface in mobile communications networks. This model accounts for the effects that the savings brought by different algorithms have on the total Location Management (LM) costs. It also takes into account the trade-off between the location update and paging costs, showing that those strategies that achieve savings in the location update costs deliver a larger overall improvement in the total LM costs than those algorithms focusing on the minimization of the paging costs. Moreover, leveraging the factors studied to obtain this model, we also analyze the overall LM costs including the fixed network part.

RPL (IPv6 Routing Protocol for Low Power and Lossy Networks) is proposed by the ROLL working group at IETF. This protocol used in the Internet of Things is optimal for Low power and Lossy Networks (LLNs). However, the RPL network has some limits when the network is dense. In this paper we evaluate the performance of RPL in three different scenarios. We first, evaluate the characteristics of RPL with fixed nodes, (one sink and others are senders). Then we add mobility, and we compare mobile nodes to fixed nodes in order to show how mobility can influence protocol parameters. Finally, we study the behavior of RPL when the network is dense in order to assess the protocol performances. In this study, we use Contiki OS and Cooja software for all simulations. The results show that RPL performances are greatly influenced by the number of nodes, type of mobility and the topology of the network. When the number of nodes increases, all metrics increase too, especially the power consumption which arrives until an augmentation of 52,85%. Furthermore, Random Waypoint Mobility Model (RWP) gives better metrics than Random Walk (RWK) Mobility Model in terms of number of hops and Expected Transmission (ETX) value. Also, in RWP model, nodes consume 10,73% of power than RWK. Our simulations show clearly that the power consumption is directly related to the number of sink nodes in the network. The more this type of node is present in the network the less power is consumed. The power reduction may occur till 5%.

The growth of cellular subscribers and the increasing communication activities have generated a lot of signaling transactions in PCS network. In location management perspective, the effect of user mobility will affect signaling transactions in location update and paging operations. In this paper, we evaluate the impact of mobility activity and analyze the signaling activities in registration system: visitor location register and home location register. The number of signal transactions in HLR and VLR in terms of network resources is analyzed to obtain an efficient location management strategy. Distanced-based location update and sequential paging approach are used to evaluate the PCS network performance. First, the activity cost calculation is proposed to evaluate the mobility activities under these approaches. Then, three strategies based on location area concept which cells grouped into: single-cell, balanced-cell, and unbalanced-cell are introduced to measure the network performance for location management operations. Each of these strategies incorporates the same cell size but with different number of cells based random mobility model with 1/6 direction probability. The simulation evaluation shows that the number of signaling activity is dependent on user mobility and the chosen strategy. Results show that the location area approach give better signaling activity cost and the balanced-cell strategy outperforms in terms of signaling registration compared to the single-cell and unbalanced-cell strategies.