An alternative strategy for location update and paging in mobile networks

2004 ◽  
Vol 27 (15) ◽  
pp. 1509-1523 ◽  
Author(s):  
Alejandro Quintero ◽  
Oscar Garcia ◽  
Samuel Pierre
Keyword(s):  
Mobile Networks ◽  
Alternative Strategy ◽  
Location Update

Tunnel MTU discovery for nested mobile networks based on location update

2013 ◽  
Vol 32 (8) ◽  
pp. 2090-2094
Author(s):  
Long CHEN ◽  
Hong-bo TANG ◽  
Ling-wei WANG
Keyword(s):  
Mobile Networks ◽  
Location Update

Autonomic Group Location Update for Mobile Networks

2006 ◽  
pp. 133-142
Author(s):  
Lai Tu ◽  
Furong Wang ◽  
Fan Zhang ◽  
Jian Zhang
Keyword(s):  
Mobile Networks ◽  
Location Update

Mobility Management in Mobile Computing and Networking Environments

2009 ◽  
pp. 650-681
Author(s):  
Samuel Pierre
Keyword(s):  
Mobile Networks ◽  
Mobility Management ◽  
Location Management ◽  
Cost Savings ◽  
Memory Model ◽  
Location Update ◽  
Management Scheme ◽  
Location Register ◽  
Wireless Communications Systems ◽  
The Cost

This chapter analyzes and proposes some mobility management models and schemes by taking into account their capability to reduce search and location update costs in wireless mobile networks. The first model proposed is called the built-in memory model; it is based on the architecture of the IS-41 network and aims at reducing the home-location-register (HLR) access overhead. The performance of this model was investigated by comparing it with the IS-41 scheme for different call-to-mobility ratios (CMRs). Experimental results indicate that the proposed model is potentially beneficial for large classes of users and can yield substantial reductions in total user-location management costs, particularly for users who have a low CMR. These results also show that the cost reduction obtained on the location update is very significant while the extra costs paid to locate a mobile unit simply amount to the costs of crossing a single pointer between two location areas. The built-in memory model is also compared with the forwarding pointers’ scheme. The results show that this model consistently outperforms the forwarding pointers’ strategy. A second location management model to manage mobility in wireless communications systems is also proposed. The results show that significant cost savings can be obtained compared with the IS-41 standard location-management scheme depending on the value of the mobile units’ CMR.

Mobility Management in Mobile Computing and Networking Environments

2011 ◽  
pp. 213-250
Author(s):  
Samuel Pierre
Keyword(s):  
Mobile Networks ◽  
Mobility Management ◽  
Location Management ◽  
Cost Savings ◽  
Memory Model ◽  
Location Update ◽  
Management Scheme ◽  
Location Register ◽  
Wireless Communications Systems ◽  
The Cost

This chapter analyzes and proposes some mobility management models and schemes by taking into account their capability to reduce search and location update costs in wireless mobile networks. The first model proposed is called the built-in memory model; it is based on the architecture of the IS-41 network and aims at reducing the home-location-register (HLR) access overhead. The performance of this model was investigated by comparing it with the IS-41 scheme for different call-to-mobility ratios (CMRs). Experimental results indicate that the proposed model is potentially beneficial for large classes of users and can yield substantial reductions in total user-location management costs, particularly for users who have a low CMR. These results also show that the cost reduction obtained on the location update is very significant while the extra costs paid to locate a mobile unit simply amount to the costs of crossing a single pointer between two location areas. The built-in memory model is also compared with the forwarding pointers’ scheme. The results show that this model consistently outperforms the forwarding pointers’ strategy. A second location management model to manage mobility in wireless communications systems is also proposed. The results show that significant cost savings can be obtained compared with the IS-41 standard location-management scheme depending on the value of the mobile units’ CMR.

scholarly journals Dynamic Location and Forwarding Pointers for Mobility Management

2005 ◽  
Vol 1 (1) ◽  
pp. 3-24 ◽  
Author(s):  
Charles Abondo ◽  
Samuel Pierre
Keyword(s):  
Mobile Networks ◽  
Mobility Management ◽  
Dynamic Models ◽  
Hybrid Architecture ◽  
Location Update ◽  
Processing Load ◽  
Limited Bandwidth ◽  
Management Standards ◽  
Home Location ◽  
Dynamic Location

GSM and IS-41 are two mobility management standards widely used in second generation networks. These two standards lean on a centralized architecture made up of home location registers (HLRs) and visitor location registers (VLRs). From these standards, the location update and search procedures always imply interrogation of the HLR, even if the two mobile terminals that want to communicate are in the same location area. Given the limited bandwidth of the radio operator channel and the new time sensitive applications of third-generation systems, such an approach of mobility management is not convenient for the next generation mobile networks. This paper proposes a method for reducing the processing load and the signalization traffic generated by update and search location procedures compared to IS-41 standard. Taking into account the specific characteristics of the traffic in the mobile networks, it introduces a semi-dynamic approach based on a hybrid architecture using forwarding pointers without the load related to the dynamic models. Numerical results show that such a method significantly improves the efficiency of location procedures.

Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

2009 ◽  
pp. 682-695
Author(s):  
Vilmos Simon ◽  
Sándor Imre
Keyword(s):  
Mobile Networks ◽  
Quality Parameters ◽  
Point Of View ◽  
Next Generation ◽  
Location Update ◽  
Mobile Environment ◽  
Qos Parameters ◽  
Location Area ◽  
The Cost ◽  
Delay Variation

In the next generation, IP-based mobile networks, one of the most important QoS parameters, are the delay and the delay variation. The cell handover causes incremental signalling traffic, which can be critical from the point of view of delay variation. It worsens the quality parameters of the real-time services, which are the backbone of next generation mobile commercial services. We have designed and implemented two algorithms: a location area forming algorithm (LAFA) and a cell regrouping algorithm (CEREAL), which can help us to guarantee QoS parameters in the next generation mobile networks. We used our realistic mobile environment simulator to generate input statistics on cell changes and incoming calls for our algorithms and by comparing the values of the cost functions proposed by us, we recognized that significant reduction was achieved in the amount of the signalling traffic; the location update cost was decreased by 40-60% in average.

Sign in / Sign up

Export Citation Format

Share Document