Performance analysis and optimization of an improved dynamic movement-based location update scheme in mobile cellular networks

Jang Hyun Baek; Jae Young Seo; Douglas C. Sicker

doi:10.1007/11424925_56

Performance analysis and optimization of an improved dynamic movement-based location update scheme in mobile cellular networks

Jang Hyun Baek^*
, Jae Young Seo
, Douglas C. Sicker

^*Corresponding author for this work

Department of Industrial and Information Systems Engineering

Jeonbuk National University
University of Colorado Boulder

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

In this study, we propose an improved version of the dynamic movement-based location update scheme that stores all cells visited by the MS, and their neighboring cells, to reduce the location update cost of the dynamic movement-based location update scheme. We show that a significant reduction in the location update cost is achieved in our scheme. We also show that our scheme has optimal total cost when the threshold is rather small. Additionally, the MS requires a minimal amount of memory to successfully implement our scheme.

Original language	English
Pages (from-to)	528-537
Number of pages	10
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3483
Issue number	IV
DOIs	https://doi.org/10.1007/11424925_56
State	Published - 2005
Event	International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 2005.05.9 → 2005.05.12

Quacquarelli Symonds(QS) Subject Topics

Computer Science & Information Systems

Access to Document

10.1007/11424925_56

Cite this

@article{f5e1ffb444124030a43b66fe1a5978dd,

title = "Performance analysis and optimization of an improved dynamic movement-based location update scheme in mobile cellular networks",

abstract = "In this study, we propose an improved version of the dynamic movement-based location update scheme that stores all cells visited by the MS, and their neighboring cells, to reduce the location update cost of the dynamic movement-based location update scheme. We show that a significant reduction in the location update cost is achieved in our scheme. We also show that our scheme has optimal total cost when the threshold is rather small. Additionally, the MS requires a minimal amount of memory to successfully implement our scheme.",

author = "Baek, \{Jang Hyun\} and Seo, \{Jae Young\} and Sicker, \{Douglas C.\}",

year = "2005",

doi = "10.1007/11424925\_56",

language = "English",

volume = "3483",

pages = "528--537",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

number = "IV",

note = "International Conference on Computational Science and Its Applications - ICCSA 2005 ; Conference date: 09-05-2005 Through 12-05-2005",

}

Performance analysis and optimization of an improved dynamic movement-based location update scheme in mobile cellular networks. / Baek, Jang Hyun; Seo, Jae Young; Sicker, Douglas C.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3483, No. IV, 2005, p. 528-537.

Research output: Contribution to journal › Conference article › peer-review

TY - JOUR

T1 - Performance analysis and optimization of an improved dynamic movement-based location update scheme in mobile cellular networks

AU - Baek, Jang Hyun

AU - Seo, Jae Young

AU - Sicker, Douglas C.

PY - 2005

Y1 - 2005

N2 - In this study, we propose an improved version of the dynamic movement-based location update scheme that stores all cells visited by the MS, and their neighboring cells, to reduce the location update cost of the dynamic movement-based location update scheme. We show that a significant reduction in the location update cost is achieved in our scheme. We also show that our scheme has optimal total cost when the threshold is rather small. Additionally, the MS requires a minimal amount of memory to successfully implement our scheme.

AB - In this study, we propose an improved version of the dynamic movement-based location update scheme that stores all cells visited by the MS, and their neighboring cells, to reduce the location update cost of the dynamic movement-based location update scheme. We show that a significant reduction in the location update cost is achieved in our scheme. We also show that our scheme has optimal total cost when the threshold is rather small. Additionally, the MS requires a minimal amount of memory to successfully implement our scheme.

UR - https://www.scopus.com/pages/publications/24944547592

U2 - 10.1007/11424925_56

DO - 10.1007/11424925_56

M3 - Conference article

AN - SCOPUS:24944547592

SN - 0302-9743

VL - 3483

SP - 528

EP - 537

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

IS - IV

T2 - International Conference on Computational Science and Its Applications - ICCSA 2005

Y2 - 9 May 2005 through 12 May 2005

ER -

Performance analysis and optimization of an improved dynamic movement-based location update scheme in mobile cellular networks

Abstract

Quacquarelli Symonds(QS) Subject Topics

Access to Document

Other files and links

Fingerprint

Cite this