Call Admission Schemes for Multimedia Services in CDMA Cellular Systems 


Vol. 31,  No. 3, pp. 232-238, Mar.  2006


PDF
  Abstract

We propose a novel call admission control scheme which improves the handoff drop and the new call block probabilities of high priority services, minimizing the negative impact on low priority services, in multimedia service cellular networks. This paper proposes three schemes to solve this problem; the packing scheme in which available channels of a cell distributed to each frequency channel are concentrated on one frequency channel and a high transmission rate service is assigned to the frequency channel; the queuing scheme in which the queue is used for high transmission rate calls; and the power reallocation scheme in which the power assigned to calls under service is temporarily reduced and a high transmission rate service is allowed. The simulation results revealed that our scheme improved the drop and the block probabilities of the high priority services compared with the conventional scheme.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. G. Choi, "Call Admission Schemes for Multimedia Services in CDMA Cellular Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 3, pp. 232-238, 2006. DOI: .

[ACM Style]

Sung Gu Choi. 2006. Call Admission Schemes for Multimedia Services in CDMA Cellular Systems. The Journal of Korean Institute of Communications and Information Sciences, 31, 3, (2006), 232-238. DOI: .

[KICS Style]

Sung Gu Choi, "Call Admission Schemes for Multimedia Services in CDMA Cellular Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 3, pp. 232-238, 3. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880