Channel holding time distribution in cellular telephony

Barcelo, F.; Jordan, J.

doi:10.1049/el:19980165

Cited by 47 publications

(22 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Channel holding time, however, does not necessarily obey the exponential assumption [6], [7] as there exist certain conditions to be held (a necessary and sufficient condition is given in [5]). Jedrzycki ad Leung [11] showed that a lognormal distribution is a more accurate model for channel holding time through field data, and a similar conclusion was drawn in [3]. In this paper, for mathematical derivation, we assume that channel holding time is exponentially distributed with being the rate of handoff from cell to a neighboring cell .…”

Section: The Control Algorithmmentioning

confidence: 62%

A dynamic call admission policy with precision QoS guarantee using stochastic control for mobile wireless networks

Wong

2002

IEEE/ACM Trans. Networking

118

View full text Add to dashboard Cite

Abstract-Call admission control is one of the key elements in ensuring the quality of serivce in mobile wireless networks. The traditional trunk reservation policy and its numerous variants give preferential treatment to the handoff calls over new arrivals by reserving a number of radio channels exclusively for handoffs. Such schemes, however, cannot adapt to changes in traffic pattern due to the static nature. This paper introduces a novel stable dynamic call admission control mechanism (SDCA), which can maximize the radio channel utilization subject to a predetermined bound on the call dropping probability. The novelties of the proposed mechanism are: 1) it is adaptive to wide range of system parameters and traffic conditions due to its dynamic nature; 2) the control is stable under overloading traffic conditions, thus can effectively deal with sudden traffic surges; 3) the admission policy is stochastic, thus spreading new arrivals evenly over a control period, and resulting in more effective and accurate control; and 4) the model takes into account the effects of limited channel capacity and time dependence on the call dropping probability, and the influences from nearest and next-nearest neighboring cells, which greatly improve the control precision. In addition, we introduce local control algorithms based on strictly local estimations of the needed traffic parameters, without requiring the status information exchange among different cells, which makes it very appealing in actual implementation. Most of the computational complexities lie in off-line precalculations, except for the nonlinear equation of the acceptance ratio, in which a coarse-grain numerical integration is shown to be sufficient for stochastic control. Extensive simulation results show that our scheme steadily satisfies the hard constraint on call dropping probability while maintaining a high channel throughput.

show abstract

Section: The Control Algorithmmentioning

confidence: 62%

A dynamic call admission policy with precision QoS guarantee using stochastic control for mobile wireless networks

Wong

2002

IEEE/ACM Trans. Networking

118

View full text Add to dashboard Cite

show abstract

“…For these systems, contrary to the classical modeling assumptions of telephony systems, field trials show that call holding time, cell residence time and channel holding time are no longer exponentially distributed [1], [7], [10]. We observe that the channel holding time depends on the users' mobility, which in turn can be characterized by the cell residence time (dwell time), the time that a mobile user stays in a cell.…”

Section: Introductionmentioning

confidence: 74%

Analytical generalized results for handoff probability in wireless networks

Fang

Chlamtac

2002

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…It is also the case when the PU has high traffic or when a long sensing period is used. Different PU traffic models represented by different PU channel holding time distributions, including exponential [9], [10], log-normal [11], [12], Gamma [13], [14] and Erlang [15] …”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Spectrum Sensing with Multiple Status Changes in Primary User Traffic

et al. 2012

View full text Add to dashboard Cite

Abstract-In this letter, the impact of primary user traffic with multiple status changes on the spectrum sensing performance is analyzed. Closed-form expressions for the probabilities of false alarm and detection are derived. Numerical results show that the multiple status changes of the primary user cause considerable degradation in the sensing performance. This degradation depends on the number of changes, the primary user traffic model, the primary user traffic intensity and the signal-to-noise ratio of the received signal. Numerical results also show that the amount of degradation decreases when the number of changes increases, and converges to a minimum sensing performance due to the limited sensing period and primary holding time.Index Terms-Cognitive radio, primary user traffic, spectrum sensing.

show abstract

Channel holding time distribution in cellular telephony

Cited by 47 publications

References 4 publications

A dynamic call admission policy with precision QoS guarantee using stochastic control for mobile wireless networks

A dynamic call admission policy with precision QoS guarantee using stochastic control for mobile wireless networks

Analytical generalized results for handoff probability in wireless networks

Performance Analysis of Spectrum Sensing with Multiple Status Changes in Primary User Traffic

Contact Info

Product

Resources

About