Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
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
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
W2F2Q: packet fair queuing in wireless packet networks
WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
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
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Error modeling schemes for fading channels in wireless communications: A survey
IEEE Communications Surveys & Tutorials
High-rate wireless personal area networks
IEEE Communications Magazine
| Hi-index | 0.00 |
IEEE 802.15.3 High-Rate WPAN(Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents the waste of channel time by allocating CTA of the devices that are in channel error status to other devices and preserves the fairness among the devices by compensating the channel time to the devices recovering from channel error. Simulation results show that proposed scheduling algorithm is superior to existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.