Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A topology-independent fair queueing model in ad hoc wireless networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Routing support for providing guaranteed end-to-end quality-of-service
Routing support for providing guaranteed end-to-end quality-of-service
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Load Balancing Routing in Multi-Channel HybridWireless Networks with Single Network Interface
Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
QoS issues in ad hoc wireless networks
IEEE Communications Magazine
| Hi-index | 0.24 |
In this paper, we consider a multihop wireless network with infrastructure support (MWNI) which can be built upon existing IEEE 802.11 based WLANs to extend the coverage and provide more flexibility to adapt to the dynamics of the network. To support integrated services in MWNI, a QoS framework is proposed to achieve the following objectives: (1) allow more real-time flows to be admitted into the network, (2) optimize the performance of best-effort traffic without losing fairness and (3) enhance QoS performance of admitted real-time traffic. There are three main components in our framework to provide corresponding solutions. First, a new QoS routing protocol that discovers global optimized topology based on the network interference modeled by flow contention graph. Second, admission control is performed at the access point (AP) so that a flow will be admitted only if the network has enough bandwidth to support its minimum bandwidth requirement. Third, a two-level hierarchical scheduling algorithm based on weighted fair queueing is implemented at the APs. The efficiency of individual component, as well as the QoS framework is evaluated through simulation studies, and the results show our proposed QoS framework is able to enhance the QoS of real-time traffic and still achieve high network utilization.