Data networks
IEEE/ACM Transactions on Networking (TON)
Fair scheduling in wireless packet networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Adapting packet fair queueing algorithms to wireless networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A wireless fair service algorithm for packet cellular networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A unified architecture for the design and evaluation of wireless fair queueing algorithms
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
SCED: a generalized scheduling policy for guaranteeing quality-of-service
IEEE/ACM Transactions on Networking (TON)
A Markov-based channel model algorithm for wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Enhancing throughput over wireless LANs using channel state dependent packet scheduling
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Performance Analysis of Packet Aggregation in WLANs with Simultaneous Multi-user Access
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
| Hi-index | 0.00 |
In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as throughput and average delay, our performance analysis of the scheduler permits the evaluation of higher-order metrics, which are needed to evaluate the buffer requirement. We show that variants of the proposed scheduler can achieve high overall throughput or fairness as well as low buffer requirement when compared to other wireless schedulers that either make use only of the instantaneous channel state or are channel-state independent in a heterogenous channel.