Dynamic resource allocation with outage probability constraint for fading wireless channels

In this paper we present a new dynamic resource allocation scheme that enables us to trade-off ergodic capacity for outage probability. We first derive optimal bandwidth and time adaptation policies with constant transmit power subject to average bandwidth and time constraints. These policies lead to maximum ergodic capacities with respect to fixed allocation policies. On the other hand, in the context of water-filling algorithms fixed allocation schemes result in minimum average capacity but have the advantage of simultaneously minimizing outage probability. Our proposed resource allocation technique is a convex combination of adaptive and fixed allocation policies where the outage probability is controlled by varying the boundary between fixed and dynamic allocations. We then apply our algorithm to multiple access networks and using numerical results show that our algorithm is effective in managing the trade-off between average capacity and outage probability for both TDMA and FDMA schemes.