Efficient low complexity power allocation policies for wireless communication systems guaranteeing QoS

Abstract

We consider near-optimal policies for a single user transmitting on a wireless channel which minimize average queue length under average power constraint. The power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. Later, we also extend these results to the multiuser case. We show that our policies can be used in a system with energy harvesting sources at the transmitter. Next we consider data users which require minimum rate guarantees. Finally we consider the system which has both data and real time users. Our policies have low computational complexity, closed form expression for mean delays and require only the mean arrival rate with no queue length information.

Joint routing, scheduling and power control providing hard deadline in wireless multihop networks

“…The adoption of mobile technology by citizens of a country positively affects both the income of its citizens as well as the gross domestic product (GDP) of the country. At the same time growing carbon footprint of Telecommunication industry has been a cause of concern and green communications has been the goal of next generation cellular systems ( [6], [35]). Thus, this paper addresses the question of providing Quality of Service (QoS) to real time applications while minimizing the transmit power.…”

“…[14] considered the problem of minimizing average delay under average power constraint, proved existence of an optimal policy and obtained structural results for the optimal policy. Near-optimal closed-form solution is obtained in [35] that minimizes the average queue length under average power constraint when the rate is a linear function of power. In [33] considered the problem of minimizing the average power under average queue constraint, and show the existence of an optimal policy.…”