1998
DOI: 10.1109/12.689647
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: 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 traffi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
117
0
4

Year Published

2002
2002
2012
2012

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 221 publications
(121 citation statements)
references
References 27 publications
0
117
0
4
Order By: Relevance
“…We assume that the arrival process for new calls and the arrival process for handoff calls are all Poisson, and the channel holding times for new calls and handoff calls are exponentially distributed, respectively. Although it has been observed [5], [6] that the handoff call arrival rate is closely related to the new call arrival rate, and that the channel holding times for new calls and handoff calls also depend on the cell residence time distribution, our study here is to show how call-blocking probabilities can be approximated when the channel holding times for new calls and handoff calls have different averages.…”
Section: Call Admission Control Schemesmentioning
confidence: 99%
See 3 more Smart Citations
“…We assume that the arrival process for new calls and the arrival process for handoff calls are all Poisson, and the channel holding times for new calls and handoff calls are exponentially distributed, respectively. Although it has been observed [5], [6] that the handoff call arrival rate is closely related to the new call arrival rate, and that the channel holding times for new calls and handoff calls also depend on the cell residence time distribution, our study here is to show how call-blocking probabilities can be approximated when the channel holding times for new calls and handoff calls have different averages.…”
Section: Call Admission Control Schemesmentioning
confidence: 99%
“…1 shows that the average channel holding times for new calls and handoff calls are different. In this figure, when the cell residence time is Gamma distributed with shape parameter varying at and (the latter two cases are in fact Erlang distributed), the average channel holding times for new calls and handoff calls computed using the formulas in [6] are significantly different for some cases. Thus, the one-dimensional Markov chain model for some guard channel CAC schemes assuming that the new calls and handoff calls are identically distributed may not be appropriate; the multidimensional Markov chain may be needed.…”
Section: ) Guard Channel (Gc) Schemesmentioning
confidence: 99%
See 2 more Smart Citations
“…In fact, T C is a statistical value calculated by BS's [9]. For example, T C could be the average value of last N call calls, namely:…”
Section: B Three Algorithms For Source Selection Proceduresmentioning
confidence: 99%