Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

Simon, Vilmos; Imre, Sándor

doi:10.4018/jbdcn.2007040103

Cited by 4 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using again Eq. (15), N max = 14 (higher value than for the rural environment, because of the cell sizes and numbers), for that value the SABLAF algorithm gives again the minimum of the registration cost, therefore we can summarize, that for both mobility environments the SABLAF algorithm gives the best results, decreasing the registration cost almost for 50% more effective than the manual solution, and for approximately 20% more than the GREAL algorithm. …”

Section: Resultsmentioning

confidence: 89%

“…Therefore the manual LAs can be considered as a planed partition, but not the optimal one. The input data, the boundary crossing and incoming call database, for the algorithms was generated by our realistic mobile environment simulator [15] (see Fig. 3.).…”

Section: Resultsmentioning

confidence: 99%

“…We have tested the two LA forming algorithms for two types of networks (rural and urban mobile environment, already presented in [15]) and compared them with a manual solution where the cell partitions are made intuitively, the cells are grouped along the main moving directions of the MTs. Therefore the manual LAs can be considered as a planed partition, but not the optimal one.…”

Section: Resultsmentioning

confidence: 99%

“…We designed a realistic mobile environment simulator [15], which will generate this boundary crossing database, a handover rate for each cell pair, defined on the border of these cells. The incoming call statistic can be also generated for every cell; therefore the paging cost can be calculated at the same time for every LA.…”

Section: Greedy Algorithm (Greal)mentioning

confidence: 99%

See 3 more Smart Citations

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

Simon

Imre

2007

Mobile Information Systems

Self Cite

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

Section: Resultsmentioning

confidence: 89%

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Greedy Algorithm (Greal)mentioning

confidence: 99%

See 2 more Smart Citations

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

Simon

Imre

2007

Mobile Information Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is an NP full problem to calculate the optimal cell structure, but there are algorithms approaching it very good in some sense. We have run the algorithms developed and published in [10] and obtained g C .…”

Section: Parameter G Cmentioning

confidence: 99%

Enhanced Mobility Management Modelling Framework

Fülöp

Kovàcs

2007

6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)

View full text Add to dashboard Cite

This paper investigates mobility management strategies from the point of view of their need of signalling and processing resources on the backbone network and load on the air interface. A method is proposed to model the serving network and mobile node mobility in order to be able to model the different types of mobility management algorithms. To obtain a good description of the network we calculate parameters from given topologies that we think are the most important ones. Mobility approaches derived from existing protocols and other, possible mobility scenarios are analyzed and their performance is numerically compared in various network and mobility scenarios. The aim is to give general designing guidelines for the next generation mobility managements on given network and mobility properties.

show abstract

Mobility Management Algorithms for the Client-Driven Mobility Frame System–Mobility from a Brand New Point of View

Fülöp

Kovàcs

Imre

2009

Mobile Information Systems

Self Cite

View full text Add to dashboard Cite

In this paper a new mobility management is introduced. The main idea in this approach is that the mobil node should manage the mobility for itself not the network. The network nodes provide only basic services for mobile entities: connectivity and administration. We construct a framework called the Client-based Mobility Frame System (CMFS) for this mobility environment. We developed the CMFS protocol as a solution over IPv4 and we show how to use Mobile IPv6 to realize our concept. We propose some basic mobility management solutions that can be implemented into the mobile clients and give details about a working simulation of a complete Mobility Management System. Example mobility management approaches such as the centralized- and hierarchical- or cellular-like ones are also defined and hints are given what kind of algorithms might be implemented upon the Client-based Mobility Frame System over IPv4 and IPv6 as well. We introduce some example algorithms that can work with the CMFS making mobility management efficient by minimizing signalling load on the network. In the present work modeling and detailed discussion on the parameters of the algorithms is given and comparison to existing mobility approaches and protocols is done. We prepared a simulation to test our protocol and to back up the proposals we provide the reader with simulation results. We stress that still one the most important benefit of our findings is that all the MNs can run different management strategies and can optimize mobility for themselves.

show abstract

Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks

Cited by 4 publications

References 17 publications

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

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

Enhanced Mobility Management Modelling Framework

Mobility Management Algorithms for the Client-Driven Mobility Frame System–Mobility from a Brand New Point of View

Contact Info

Product

Resources

About