Hierarchical paging - Efficient location management

M. Szalay, S. Imre

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

This paper introduces a new location management algorithm called Hierarchical Paging. A mathematical model for the proposed scheme is also presented. We have compared our solution to two other location management solutions using simulations. The environment, setup, simulation details and results are presented in this paper. It is concluded that there is a wide range of parameters where Hierarchical Paging is more efficient than the other location management algorithms.

Original languageEnglish
Title of host publicationProceedings - ECUMN 2007
Subtitle of host publicationFourth European Conference on Universal Multiservice Networks
Pages301-310
Number of pages10
DOIs
Publication statusPublished - 2007
EventECUMN 2007: Fourth European Conference on Universal Multiservice Networks - Toulouse, France
Duration: Feb 14 2007Feb 16 2007

Publication series

NameProceedings - ECUMN 2007: Fourth European Conference on Universal Multiservice Networks

Other

OtherECUMN 2007: Fourth European Conference on Universal Multiservice Networks
CountryFrance
CityToulouse
Period2/14/072/16/07

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Hierarchical paging - Efficient location management'. Together they form a unique fingerprint.

  • Cite this

    Szalay, M., & Imre, S. (2007). Hierarchical paging - Efficient location management. In Proceedings - ECUMN 2007: Fourth European Conference on Universal Multiservice Networks (pp. 301-310). [4115214] (Proceedings - ECUMN 2007: Fourth European Conference on Universal Multiservice Networks). https://doi.org/10.1109/ECUMN.2007.26