Distributed multi-hop scheduling and medium access with delay and throughput constraints
Proceedings of the 7th annual international conference on Mobile computing and networking
Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Distributed priority scheduling and medium access in ad hoc networks
Wireless Networks
Balancing distance and lifetime in delay constrained ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A short-term fair MAC protocol for WLANs
Ad Hoc Networks
Modified Distributed Laxity Based Priority Scheduling Scheme
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which offer no QoS guarantee and suffer the problems of fairness and low throughput at high load, our algorithm provides fairness and bandwidth reservation in an integrated services environment and at the same time achieves high throughput. Moreover, while most reservation-based multiaccess protocols require a centralized scheduler and a separate channel for arbitration, our algorithm is truly distributed in the sense that network nodes coordinate their transmissions only via headers in the packets. We derive theoretical bounds illustrating how our distributed algorithm approximates the optimal centralized algorithm. Simulation results are also presented to justify our claims.