Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Adapting packet fair queueing algorithms to wireless networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
A topology-independent fair queueing model in ad hoc wireless networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Fair scheduling with QoS support in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
Shared channel, multihop wireless ad hoc network has some unique characteristics that make the fair scheduling in such environment challenging. In this paper we propose a new QoS-aware fair queueing model for ad hoc networks. Our proposed algorithm ensures a distributed coordination of fair channel access while maximize the throughput using spatial reuse of bandwidth. We consider the presence of both guaranteed and best effort flows. The goal is to satisfy the minimum bandwidth requirement of guaranteed flows and provide a fair share of residual bandwidth to all flows. We propose a flow weight calculation scheme to both guaranteed and best-effort flows and a distributed, localized mechanism to implement the time-stamp based ad hoc fair queueing model.