An efficient call delivery algorithm in hierarchical cellular networks

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

1 Citation (Scopus)

Abstract

The multiple registration scheme can reduce the location update cost in hierarchical cellular networks; however, it leads to the increased call setup latency to find out the current location of a mobile terminal. In this paper, we propose an efficient call delivery algorithm that employs a timer estimating the low-tier cell residence time. Analytical and simulation results demonstrate that the proposed algorithm outperforms high-tier cell first and low-tier cell first algorithms in terms of call setup latency.

Original languageEnglish
Title of host publication2009 1st International Conference on Ubiquitous and Future Networks, ICUFN 2009
Pages74-78
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 1st International Conference on Ubiquitous and Future Networks, ICUFN 2009 - Hong Kong, China
Duration: 2009 Jun 72009 Jun 9

Publication series

Name2009 1st International Conference on Ubiquitous and Future Networks, ICUFN 2009

Other

Other2009 1st International Conference on Ubiquitous and Future Networks, ICUFN 2009
CountryChina
CityHong Kong
Period09/6/709/6/9

Keywords

  • Call dellvery algorithm
  • Call setup latency
  • Hierarchical cellular networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'An efficient call delivery algorithm in hierarchical cellular networks'. Together they form a unique fingerprint.

  • Cite this

    Pack, S., An, J., & Lee, W. (2009). An efficient call delivery algorithm in hierarchical cellular networks. In 2009 1st International Conference on Ubiquitous and Future Networks, ICUFN 2009 (pp. 74-78). [5174288] (2009 1st International Conference on Ubiquitous and Future Networks, ICUFN 2009). https://doi.org/10.1109/ICUFN.2009.5174288