Data networks (2nd ed.)
RCBR: a simple and efficient service for multiple time-scale traffic
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Distributed fair scheduling in a wireless LAN
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Distributed multi-hop scheduling and medium access with delay and throughput constraints
Proceedings of the 7th annual international conference on Mobile computing and networking
Fair medium access in 802.11 based wireless ad-hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Dynamic Bandwidth Management in Single-hop Ad hoc Wireless Networks
Dynamic Bandwidth Management in Single-hop Ad hoc Wireless Networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Price-Based Channel Time Allocation in Wireless LANs
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
A bandwidth management framework for wireless camera array
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
Contention-Aware Admission Control for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Group management for mobile Ad Hoc networks: design, implementation and experiment
Proceedings of the 6th international conference on Mobile data management
A Fault-Tolerant Protocol for Energy-Efficient Permutation Routing in Wireless Networks
IEEE Transactions on Computers
End-to-end QoS framework for heterogeneous wired-cum-wireless networks
Wireless Networks
SoftMAC: Layer 2.5 Collaborative MAC for Multimedia Support in Multihop Wireless Networks
IEEE Transactions on Mobile Computing
Proceedings of the 3rd international conference on Mobile multimedia communications
Mobile Networks and Applications
Bandwidth estimation with RTS/CTS mechanism for IEEE 802.11 adhoc networks using cross layer design
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
QoS-Aware routing based on local information for mobile ad hoc networks
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Understanding bandwidth-delay product in mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
Distributed weighted fair scheduling schemes for QoS support in wireless networks have not yet become standard. In this paper we propose an Admission Control and Dynamic Bandwidth Management scheme that provides fairness in the absence of distributed link level weightedfair scheduling. In case weighted fair scheduling becomes available, our system assists it by supplying the scheduler with weights and adjusting them dynamically as network and traffic characteristics vary. To obtain these weights, we convert the bandwidth requirement of the application into a channel time requirement. Our Bandwidth Manager then allots each flow a share of the channel time depending on its requirement relative to the requirements of other flows in the network. It uses a max-min fairness algorithm with minimum guarantees. The flow controls its packet transmission rate so it only occupies the channel for the fraction of time allotted to it by the Bandwidth Manager. As available bandwidth in the network and the traffic characteristics of various flows change, the channel time proportion allotted also dynamically varies. Our experiments show that, at the cost of a very low overhead, there is a high probability that every flow in the network will receive at least its minimum requested share of the network bandwidth.