Performance of movement-based location update and one-step paging in wireless networks with sparsely underlaid microcells

Tsai, Jung-Tsung; Hsiao, Hui-Hou

doi:10.1109/glocom.2001.965195

Cited by 3 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The LA management is classified according to its use of time, distance, movement profile information in its paging, and location update procedures. The location update can be performed due to the time elapsed since the last registration process (Jun & Ho) or the number of cell boundary crossings measured since the previous update (Tsai & Hsiao, 2001). Wong and Leung (2001) recommend a distance-based scheme where the location update will be performed when a mobile user moves a threshold number of cells away from the cell where the last registration process was carried out.…”

Section: Introductionmentioning

confidence: 99%

Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

Simon

Imre

2007

International Journal of Business Data Communications and Networking

View full text Add to dashboard Cite

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 param-eters 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 algo-rithm (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.

show abstract

Section: Introductionmentioning

confidence: 99%

Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

Simon

Imre

2007

International Journal of Business Data Communications and Networking

View full text Add to dashboard Cite

show abstract

A crossing-tier location update/paging scheme in hierarchical cellular networks

Wu¹,

Mukherjee

Bhargava³

2006

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Location update/paging strategies have been widely studied in the traditional single-tier cellular networks. We propose and evaluate a novel crossing-tier location update/paging scheme that can be used in a hierarchical macrocell/microcell cellular network. Location update is proceeded only in the macrocell tier, where a location area (LA) is made up by larger macrocells. A mobile user will stay in such a LA for longer time. Therefore, the cost on location update can be reduced due to the decreased frequency of location update. To reduce the paging delay, the paged mobile user will be searched in the macrocell tier only when the paging load is not high. Otherwise, it will be searched in the microcell tier, where a sequential searching method is applied. The operation for the scheme is simple, as the macrocell/microcell cellular network has the advantage because a mobile user can receive a signal from both a microcell and the overlaid macrocell. Analytical models have been built for cost and delay evaluation. Numerical results show that, at relatively low cost, the crossing-tier scheme also achieves low paging delay.Index Terms-Mobility management, paging, location update, hierarchical cellular network, quality of service.

show abstract

A Simulated Annealing Based Location Area Optimization in Next Generation Mobile Networks

Simon

Imre

2007

Mobile Information Systems

View full text Add to dashboard Cite

Abstract. Mobile networks have faced rapid increase in the number of mobile users and the solution for supporting the growing population is to reduce the cell sizes and to increase the bandwidth reuse. This will cause the number of location management operations and call deliveries to increase significantly, and result in high signaling overhead. We focus on minimizing this overhead, by efficient Location Area Planning (LAP). In this paper we seek to determine the location areas to achieve the minimization of the registration cost, constrained by the paging cost. For that we propose a simulated annealing algorithm, which is applied on a basic Location Area partition of cells formed by a greedy algorithm. We used our realistic mobile environment simulator to generate input (cell changing and incoming call statistics) for our algorithm, and by comparing the values of the registration cost function we recognized that significant reduction was achieved in the amount of the signaling traffic.

show abstract

Performance of movement-based location update and one-step paging in wireless networks with sparsely underlaid microcells

Cited by 3 publications

References 14 publications

Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

A crossing-tier location update/paging scheme in hierarchical cellular networks

A Simulated Annealing Based Location Area Optimization in Next Generation Mobile Networks

Contact Info

Product

Resources

About