Performance analysis of wireless opportunistic schedulers using stochastic Petri nets
Authors:
- 2 May 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 8 (4) , 2076-2087
Abstract
In this paper, performance of wireless opportunistic schedulers in multiuser systems is studied under a dynamic data arrival setting. Different from the previous studies which mostly focus on the network stability and the worst case scenarios, we emphasize on the average performance of wireless opportunistic schedulers. We first develop a framework based on Markov queueing model and then analyze it by applying decomposition and iteration techniques in the stochastic Petri nets (SPN). Since the size of the state space in our analytical model is small, the proposed framework shows an improved efficiency in computational complexity. Based on the established analytical model, performance of both opportunistic and non-opportunistic schedulers are studied and compared in terms of average queue length, mean throughput, average delay and dropping probability. Analytical results demonstrate that the multiuser diversity effect as observed in the infinite backlog scenario is only valid in the heavy traffic regime. The performance of the opportunistic schedulers in the light traffic regime is worse than that of the non-opportunistic round-robin scheduler, and becomes worse especially with the increase of the number of users. Simulations are also performed to verify the accuracy of the analytical results.Keywords
This publication has 20 references indexed in Scilit:
- Centralized Wireless Data Networks With User Arrivals and DeparturesIEEE Transactions on Information Theory, 2007
- User-level performance of channel-aware scheduling algorithms in wireless data networksIEEE/ACM Transactions on Networking, 2005
- Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and designIEEE Transactions on Wireless Communications, 2005
- Instability of the Proportional Fair Scheduling Algorithm for HDRIEEE Transactions on Wireless Communications, 2004
- Finite-state Markov model for Rayleigh fading channelsIEEE Transactions on Communications, 1999
- Finite-state Markov channel-a useful model for radio communication channelsIEEE Transactions on Vehicular Technology, 1995
- A novel approach to estimating the cell loss probability in an ATM multiplexer loaded with homogeneous on-off sourcesIEEE Transactions on Communications, 1995
- A decomposition approach for stochastic reward net modelsPerformance Evaluation, 1993
- Estimates of Error Rates for Codes on Burst-Noise ChannelsBell System Technical Journal, 1963
- Capacity of a Burst-Noise ChannelBell System Technical Journal, 1960