On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels 


Vol. 41,  No. 8, pp. 924-927, Aug.  2016


PDF
  Abstract

In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

  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]

Y. Kim, "On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 8, pp. 924-927, 2016. DOI: .

[ACM Style]

Yoora Kim. 2016. On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels. The Journal of Korean Institute of Communications and Information Sciences, 41, 8, (2016), 924-927. DOI: .

[KICS Style]

Yoora Kim, "On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 8, pp. 924-927, 8. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880