Proportional Increase Multiplicative Decrease (PIMD) Wireless Scheduler: An Efficient Scheduler for IEEE 802.11e HCF

Arshad Hussain; Shaban Qaiser

AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers

Research Article

Proportional Increase Multiplicative Decrease (PIMD) Wireless Scheduler: An Efficient Scheduler for IEEE 802.11e HCF

Download

458 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-04648-3_24,
    author={Arshad Hussain and Shaban Qaiser},
    title={Proportional Increase Multiplicative Decrease (PIMD) Wireless Scheduler: An Efficient Scheduler for IEEE 802.11e HCF},
    proceedings={AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers},
    proceedings_a={ACCESSNETS},
    year={2012},
    month={5},
    keywords={},
    doi={10.1007/978-3-642-04648-3_24}
}

Arshad Hussain
Shaban Qaiser
Year: 2012
Proportional Increase Multiplicative Decrease (PIMD) Wireless Scheduler: An Efficient Scheduler for IEEE 802.11e HCF
ACCESSNETS
Springer
DOI: 10.1007/978-3-642-04648-3_24

Arshad Hussain¹^,*, Shaban Qaiser¹^,*

1: National University of Computer & Emerging Sciences

*Contact email: arshad.hussain@nu.edu.pk, shaban.qaiser@nu.edu.pk

Abstract

In this paper, we propose a new wireless scheduling algorithm for the IEEE 802.11e HCF. The algorithm grants the mobile stations variable time for the upstream data flow in proportion to the queue size of the transmission buffer. At the same time, it retrieves half of the extra time allocated in previous cycle from those flows whose requirement has stopped. Hence, the system achieves stability by preventing the ping-pong phenomena. The algorithm is computationally simple, and as compared to the other algorithms, it gives bounded delays and jitter to the real-time applications under heavy load conditions.

Published: 2012-05-11

: http://dx.doi.org/10.1007/978-3-642-04648-3_24