Channel Occupancy Times and Handoff Rate for Mobile Computing and PCS Networks

Channel Occupancy Times and Handoff Rate for Mobile Computing and PCS Networks
复制标题

DOI:
10.1109/12.689647
复制
发表时间:
1998-06
期刊:
IEEE Trans. Computers
影响因子:
--
通讯作者:
Yuguang Fang;I. Chlamtac;Yi-Bing Lin
Yuguang Fang;I. Chlamtac;Yi-Bing Lin
中科院分区:
其他
文献类型:
--
作者:
Yuguang Fang;I. Chlamtac;Yi-Bing Lin

文献摘要

被引文献

相似文献

本文提出了一种研究的信道占用时间和切换率的移动的计算在MC(移动的计算)和PCS(个人通信服务)网络,使用一般的操作假设。它示出,指数分布的呼叫保持时间,更适合于传统的语音电话的分布,信道占用时间是指数分布的,当且仅当细胞的驻留时间是指数分布的。它进一步表明,合并业务从新的呼叫和切换呼叫是泊松当且仅当细胞的停留时间是指数分布,太。当小区驻留时间服从一般分布时,一种更适合于移动的计算会话建模的方法得到了信道占用时间分布的新公式。此外,当呼叫保持时间和小区驻留时间具有一般(非格)分布时,给出了计算呼叫连接期间的越区切换率和越区切换呼叫到达小区的速率的一般公式。我们的分析说明了为什么呼叫保持时间的指数假设的结果在低估的切换率,从而导致实际的阻塞概率高于阻塞概率的MC/PCS网络设计使用的呼叫保持时间的指数分布近似。本文的分析结果可为MC/PCS网络的话务分析和系统设计提供参考。
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.