Modelling and quantitative analysis of LTRACK - A novel mobility management algorithm

Benedek Kovács, M. Szalay, Sándor Imre

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

This paper discusses the improvements and parameter optimization issues of LTRACK, a recently proposed mobility management algorithm. Mathematical modelling of the algorithm and the behavior of the Mobile Node (MN) are used to optimize the parameters of LTRACK. A numerical method is given to determine the optimal values of the parameters. Markov chains are used to model both the base algorithm and the so-called loop removal effect. An extended qualitative and quantitative analysis is carried out to compare LTRACK to existing handover mechanisms such as MIP, Hierarchical Mobile IP (HMIP), Dynamic Hierarchical Mobility Management Strategy (DHMIP), Telecommunication Enhanced Mobile IP (TeleMIP), Cellular IP (CIP) and HAWAII. LTRACK is sensitive to network topology and MN behavior so MN movement modelling is also introduced and discussed with different topologies. The techniques presented here can not only be used to model the LTRACK algorithm, but other algorithms too. There are many discussions and calculations to support our mathematical model to prove that it is adequate in many cases. The model is valid on various network levels, scalable vertically in the ISO-OSI layers and also scales well with the number of network elements.

Original languageEnglish
Pages (from-to)21-50
Number of pages30
JournalMobile Information Systems
Volume2
Issue number1
Publication statusPublished - 2006

Fingerprint

Chemical analysis
Topology
Markov processes
Telecommunication
Numerical methods
Mathematical models

Keywords

  • Location tracking
  • LTRACK
  • Markov chain
  • Mobility management

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Modelling and quantitative analysis of LTRACK - A novel mobility management algorithm. / Kovács, Benedek; Szalay, M.; Imre, Sándor.

In: Mobile Information Systems, Vol. 2, No. 1, 2006, p. 21-50.

Research output: Contribution to journalArticle

@article{4291b5aab2344ea6bcff1fd8b2045e5c,
title = "Modelling and quantitative analysis of LTRACK - A novel mobility management algorithm",
abstract = "This paper discusses the improvements and parameter optimization issues of LTRACK, a recently proposed mobility management algorithm. Mathematical modelling of the algorithm and the behavior of the Mobile Node (MN) are used to optimize the parameters of LTRACK. A numerical method is given to determine the optimal values of the parameters. Markov chains are used to model both the base algorithm and the so-called loop removal effect. An extended qualitative and quantitative analysis is carried out to compare LTRACK to existing handover mechanisms such as MIP, Hierarchical Mobile IP (HMIP), Dynamic Hierarchical Mobility Management Strategy (DHMIP), Telecommunication Enhanced Mobile IP (TeleMIP), Cellular IP (CIP) and HAWAII. LTRACK is sensitive to network topology and MN behavior so MN movement modelling is also introduced and discussed with different topologies. The techniques presented here can not only be used to model the LTRACK algorithm, but other algorithms too. There are many discussions and calculations to support our mathematical model to prove that it is adequate in many cases. The model is valid on various network levels, scalable vertically in the ISO-OSI layers and also scales well with the number of network elements.",
keywords = "Location tracking, LTRACK, Markov chain, Mobility management",
author = "Benedek Kov{\'a}cs and M. Szalay and S{\'a}ndor Imre",
year = "2006",
language = "English",
volume = "2",
pages = "21--50",
journal = "Mobile Information Systems",
issn = "1574-017X",
publisher = "IOS Press",
number = "1",

}

TY - JOUR

T1 - Modelling and quantitative analysis of LTRACK - A novel mobility management algorithm

AU - Kovács, Benedek

AU - Szalay, M.

AU - Imre, Sándor

PY - 2006

Y1 - 2006

N2 - This paper discusses the improvements and parameter optimization issues of LTRACK, a recently proposed mobility management algorithm. Mathematical modelling of the algorithm and the behavior of the Mobile Node (MN) are used to optimize the parameters of LTRACK. A numerical method is given to determine the optimal values of the parameters. Markov chains are used to model both the base algorithm and the so-called loop removal effect. An extended qualitative and quantitative analysis is carried out to compare LTRACK to existing handover mechanisms such as MIP, Hierarchical Mobile IP (HMIP), Dynamic Hierarchical Mobility Management Strategy (DHMIP), Telecommunication Enhanced Mobile IP (TeleMIP), Cellular IP (CIP) and HAWAII. LTRACK is sensitive to network topology and MN behavior so MN movement modelling is also introduced and discussed with different topologies. The techniques presented here can not only be used to model the LTRACK algorithm, but other algorithms too. There are many discussions and calculations to support our mathematical model to prove that it is adequate in many cases. The model is valid on various network levels, scalable vertically in the ISO-OSI layers and also scales well with the number of network elements.

AB - This paper discusses the improvements and parameter optimization issues of LTRACK, a recently proposed mobility management algorithm. Mathematical modelling of the algorithm and the behavior of the Mobile Node (MN) are used to optimize the parameters of LTRACK. A numerical method is given to determine the optimal values of the parameters. Markov chains are used to model both the base algorithm and the so-called loop removal effect. An extended qualitative and quantitative analysis is carried out to compare LTRACK to existing handover mechanisms such as MIP, Hierarchical Mobile IP (HMIP), Dynamic Hierarchical Mobility Management Strategy (DHMIP), Telecommunication Enhanced Mobile IP (TeleMIP), Cellular IP (CIP) and HAWAII. LTRACK is sensitive to network topology and MN behavior so MN movement modelling is also introduced and discussed with different topologies. The techniques presented here can not only be used to model the LTRACK algorithm, but other algorithms too. There are many discussions and calculations to support our mathematical model to prove that it is adequate in many cases. The model is valid on various network levels, scalable vertically in the ISO-OSI layers and also scales well with the number of network elements.

KW - Location tracking

KW - LTRACK

KW - Markov chain

KW - Mobility management

UR - http://www.scopus.com/inward/record.url?scp=85013614954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013614954&partnerID=8YFLogxK

M3 - Article

VL - 2

SP - 21

EP - 50

JO - Mobile Information Systems

JF - Mobile Information Systems

SN - 1574-017X

IS - 1

ER -