Optimum Power Randomization for the Minimization of Outage Probability

Creative Commons License

Dulek B., Vanli N. D., Gezici S., Varshney P. K.

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, vol.12, no.9, pp.4627-4637, 2013 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 12 Issue: 9
  • Publication Date: 2013
  • Doi Number: 10.1109/twc.2013.072513.121945
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.4627-4637
  • Keywords: Power randomization, outage probability, fading, jamming, wireless communications, BLOCK-FADING CHANNELS, CONVEXITY PROPERTIES, PART II, ALLOCATION, CAPACITY, SYSTEMS, LIMITS, COMMUNICATION, PERFORMANCE, ALGORITHMS
  • Hacettepe University Affiliated: No


The optimum power randomization problem is studied to minimize outage probability in flat block-fading Gaussian channels under an average transmit power constraint and in the presence of channel distribution information at the transmitter. When the probability density function of the channel power gain is continuously differentiable with a finite second moment, it is shown that the outage probability curve is a nonincreasing function of the normalized transmit power with at least one inflection point and the total number of inflection points is odd. Based on this result, it is proved that the optimum power transmission strategy involves randomization between at most two power levels. In the case of a single inflection point, the optimum strategy simplifies to on-off signaling for weak transmitters. Through analytical and numerical discussions, it is shown that the proposed framework can be adapted to a wide variety of scenarios including log-normal shadowing, diversity combining over Rayleigh fading channels, Nakagami-m fading, spectrum sharing, and jamming applications. We also show that power randomization does not necessarily improve the outage performance when the finite second moment assumption is violated by the power distribution of the fading.