Communication over fading channels with finite buffer constraints - single user and multiple access cases

We consider communication over a fading channel where arriving data is stored in a buffer of size L until it is transmitted. Any data arriving when the buffer is full is discarded. The transmitter utilizes a power and rate control policy that can depend on both the buffer occupancy as well as the channel state. The trade-off between minimizing transmission power and buffer overflow probability is analyzed in asymptotic regime as L → ∞. Both single user and multi-access models are considered.