The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

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

  • Kim, Yoora (University of Ulsan, Department of Mathematics)
  • Received : 2016.08.05
  • Accepted : 2016.08.18
  • Published : 2016.08.31
Download PDF
⟨ Previous Next ⟩

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.

Keywords

Acknowledgement

Supported by : University of Ulsan

References

  1. H. Jin, B. C. Jung, and V. C. Leung, "Fundamental limits of CDF-based scheduling: Throughput, fairness, and feedback overhead," IEEE/ACM Trans. Netw., vol. 23, no. 3, pp. 894-907, Jun. 2015. https://doi.org/10.1109/TNET.2014.2312534
  2. K. Lee, D.-H. Cho, and B. C. Chung, "Resource allocation method for improving energy efficiency and receiver fairness in wireless networks," J. KICS, vol. 40, no. 5, pp. 826-832, May 2015. https://doi.org/10.7840/kics.2015.40.5.826
  3. D. Park, H. Seo, H. Kwon, and B. G. Lee, "Wireless packet scheduling based on the cumulative distribution function of user transmission rates," IEEE Trans. Commun., vol. 53, no. 11, pp. 1919-1929, Nov. 2005. https://doi.org/10.1109/TCOMM.2005.858675
  4. D. Park and B. G. Lee, "QoS support by using CDF-based wireless packet scheduling in fading channels," IEEE Trans. Commun., vol. 54, no. 11, pp. 2051-2061, Nov. 2006. https://doi.org/10.1109/TCOMM.2006.884847

Cited by

  1. Starvation Analysis of CDF-Based Scheduling Over Nakagami- $m$ Markov Fading Channels vol.22, pp.2, 2018, https://doi.org/10.1109/LCOMM.2017.2765308