IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
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
A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Improving protocol capacity with model-based frame scheduling in IEEE 802.11-operated WLANs
Proceedings of the 9th annual international conference on Mobile computing and networking
WCFQ: an opportunistic wireless scheduler with statistical fairness bounds
IEEE Transactions on Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Supporting service differentiation in wireless packet networks using distributed control
IEEE Journal on Selected Areas in Communications
Mitigating performance anomaly of TFRC in multi-rate IEEE 802.11 wireless LANs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Review: A comprehensive survey on scheduler for VoIP over WLAN
Journal of Network and Computer Applications
Hi-index | 0.00 |
Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments. We propose a wireless packet scheduling algorithm that uses the multistate (multi-rate) wireless channel model and performs packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow. Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS (D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile stations, the overall throughput is not degraded as the number of mobile stations increases.