The deterministic time-linearity of service provided by Rayleigh fading channels

Yunquan Dong, Qing Wang, Pingyi Fan, Khaled Ben Letaief

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In the paper, we study the channel service process of an independent and identically distributed (i.i.d.) Rayleigh channel. The channel service process S(t) is defined as the amount of service provided by the channel, i.e., integral of the instantaneous channel capacity over a time interval of length t. The channel side information (CSI) is assumed available at the receiver. Using the Moment Generation Function (MGF) approach and the infinitely divisible law, it is proved that the channel service process S(t) is a deterministic linear function of time t other than the generally recognized certain curve form, namely, S(t) = c* t, where c* is a constant.

Original languageEnglish
Title of host publicationIWCMC 2011 - 7th International Wireless Communications and Mobile Computing Conference
Pages1519-1523
Number of pages5
DOIs
Publication statusPublished - 12 Sep 2011
Event7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011 - Istanbul, Turkey
Duration: 4 Jul 20118 Jul 2011

Publication series

NameIWCMC 2011 - 7th International Wireless Communications and Mobile Computing Conference

Other

Other7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011
CountryTurkey
CityIstanbul
Period4/7/118/7/11

    Fingerprint

Keywords

  • i.i.d. Rayleigh fading channel
  • service process
  • time Linearit

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Dong, Y., Wang, Q., Fan, P., & Ben Letaief, K. (2011). The deterministic time-linearity of service provided by Rayleigh fading channels. In IWCMC 2011 - 7th International Wireless Communications and Mobile Computing Conference (pp. 1519-1523). [5982763] (IWCMC 2011 - 7th International Wireless Communications and Mobile Computing Conference). https://doi.org/10.1109/IWCMC.2011.5982763