Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
A clean-slate architecture for reliable data delivery in wireless mesh networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
An Efficient Algorithm for the Performance of TCP over Multi-hop Wireless Mesh Networks
ITNG '10 Proceedings of the 2010 Seventh International Conference on Information Technology: New Generations
The design and evaluation of fair scheduling in wireless mesh networks
Journal of Computer and System Sciences
A practical adaptive pacing scheme for TCP in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Loss differentiation schemes for TCP over wireless networks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
A study of topology formation in 802.11s multiradio wireless mesh networks
LCN '11 Proceedings of the 2011 IEEE 36th Conference on Local Computer Networks
| Hi-index | 0.00 |
Wireless mesh networks (WMN) are efficient and low cost solutions for the deployment of broadband access in various environments. To support real-time applications such as multimedia and emergency services throughout the network, WMNs must provide appropriate quality of service (QoS). While the capacity and the bandwidth availability of single radio WMNs may severely limit QoS for such traffic, multiradio cognitive WMNs (CWMN) can overcome these restrictions and provide better QoS mechanisms. This paper describes a scheduling algorithm with an integrated backpressure mechanism for CWMN. This algorithm ensures that the available bandwidth is properly shared considering the type of traffic to forward, the distance of the clients from the portal and the fluctuating conditions of the links. The performance of our new scheduling algorithm is evaluated in a simulated environment. We show that, while increasing throughput, our algorithm not only achieves nearly perfect fairness, but can also prevent bandwidth wastage.