A unified wireless LAN architecture for real-time and non-real-time communication services
IEEE/ACM Transactions on Networking (TON)
An Implicit Prioritized Access Protocol for Wireless Sensor Networks
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Fair Real-Time Traffic Scheduling over a Wireless LAN
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
IEEE Journal on Selected Areas in Communications
A greedy reclaiming scheduler for IEEE 802.11e HCCA real-time networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Hi-index | 0.00 |
This paper proposes and analyzes bandwidth reclaim scheme for IEEE 802.11 WLAN, which may suffer from severe bandwidth waste resulting from not only the variation of transmission rate and message length but also the overallocation to the real-time traffic in compensating for the delay due to the intervention of non-real-time messages. Built on top of the weighted round robin scheduling policy, we address that the polling order rearrangement according to the degree of overallocation can enhance reclaimability of unused network time and that the rearranegable slot has its message pending at the rearranging time. The simulation results show that the proposed scheme is able to reclaim up to 52.3 % of bandwidth waste when the number of streams is 2 and that it also provides stable throughput for utilization of 0.5 through 0.8.