Loading...
Please wait, while we are loading the content...
Similar Documents
Analysis of performance trade-offs for an adaptive channel-aware wireless scheduler.
| Content Provider | CiteSeerX |
|---|---|
| Author | Rom, Raphael Tan, Hwee Pink |
| Abstract | 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 optimizes the buffer requirement at each wireless receiver while maintaining good throughput and fairness performance. 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 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 only make use of the instantaneous channel state in a heterogenous channel. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Adaptive Channel-aware Wireless Scheduler Performance Trade-off Wireless Scheduler Buffer Requirement Wireless Channel Unique Characteristic Challenging Problem Typical First-order Quality Wireless Receiver Heterogeneous Wireless Channel Instantaneous Channel State Performance Analysis Higher-order Metric Short-term Error Behavior Scheduler Design Novel Idea High Overall Throughput Data Packet Heterogenous Channel Good Throughput Scheduling Problem Low Buffer Requirement Input Flow Fairness Performance |
| Content Type | Text |
