Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Throughput maximization under rate requirements for the OFDMA downlink channel with limited feedback
EURASIP Journal on Wireless Communications and Networking - Multicarrier Systems
Markov Chains and Stochastic Stability
Markov Chains and Stochastic Stability
Queueing analysis for the OFDMA downlink: throughput regions, delay and exponential backlog bounds
IEEE Transactions on Wireless Communications
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
IEEE Transactions on Information Theory
Queue proportional scheduling via geometric programming in fading broadcast channels
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Stability with respect to a given scheduling policy has become an important issue for wireless communication systems; but hard to prove in particular scenarios. In this paper two sufficient conditions for stability in a broadcast setting are derived, which are often very easy to check. Moreover, it is shown that if the given scheduling policy complies with both conditions the resulting throughput region of the policy equals the ergodic achievable rate region and the system is stable in a strong sense. This extends results presented in [1] where the statement was shown for scheduling policies fulfilling so-called integrability condition. Additionally, in this paper we also present a partial converse to the statement which is demonstrated by an application example.