Handoff counting in hierarchical cellular system with overflow scheme

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In mobile computing scenario, the number of handoff (called as handoff counting) is very important for the signalling network design and traffic load analysis. In this paper, we study the handoff counting characteristics in terms of probability mass function (pmf) and statistical moments in the hierarchical cellular system applying overflow scheme under the general cell residence time and general call holding time distribution. The analytical result and the algorithm for the evaluation of handoff counting are, respectively, presented for the cases whether or not the Laplace-Stieltjes Transform of call holding time exists. The numerical results reveal that as the call holding time is heavy-tailed, the handoff counting follows the heavy-tailed tendency. In addition, the handoff counting pmf as well as the average value shows a significant different pattern with the utilization of different call holding time distribution. © 2004 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Yan, Z. (2004). Handoff counting in hierarchical cellular system with overflow scheme. Computer Networks, 46(4), 541–554. https://doi.org/10.1016/j.comnet.2004.05.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free