By Topic

Channel occupancy times and handoff rate for mobile computing and PCS networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yuguang Fang ; Erik Jonsson Sch. of Eng. & Comput. Sci., Texas Univ., Dallas, TX, USA ; Chlamtac, I. ; Yi-Bing Lin

This paper presents a study of channel occupancy times and handoff rate for mobile computing in MC (Mobile Computing) and PCS (Personal Communications Services) networks, using general operational assumptions. It is shown that, for exponentially distributed call holding times, a distribution more appropriate for conventional voice telephony, the channel occupancy times are exponentially distributed if and only if the cell residence times are exponentially distributed. It is further shown that the merged traffic from new calls and handoff calls is Poisson if and only if the cell residence times are exponentially distributed, too. When cell residence times follow a general distribution, a more appropriate way to model mobile computing sessions, new formulae for channel occupancy time distributions are obtained. Moreover, when the call holding times and the cell residence times have general (nonlattice) distributions, general formulae for computing the handoff rate during a call connection and handoff call arrival rate to a cell are given. Our analysis illustrates why the exponential assumption for call holding time results in the underestimation of handoff rate, which then leads to the actual blocking probabilities being higher than the blocking probabilities for MC/PCS networks designed using the exponential distribution approximation for call holding time. The analytical results presented in this paper can be expected to play a significant role in teletraffic analysis and system design for MC/PCS networks

Published in:

Computers, IEEE Transactions on  (Volume:47 ,  Issue: 6 )