An adaptive contention-based scheduling scheme for proportional service differentiation in multichannel wireless networks

Authors:
Sugam Pandey; Niranjan;Aura Ganz
Affiliations:
University of Massachusetts, Amherst;University of Massachusetts, Amherst;University of Massachusetts, Amherst
Venue:
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Year:
2006

Citing 9
Cited 0

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Design and analysis of low-power access protocols for wireless and mobile ATM networks

Wireless Networks
Scheduling in Wireless Networks with Multiple Transmission Channels

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Routing in multi-radio, multi-hop wireless mesh networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Achieving proportional delay differentiation in wireless LAN via cross-layer scheduling: Research Articles

Wireless Communications & Mobile Computing - Special Issue: Emerging WLAN Apllications and Technologies
Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem

Journal of Global Optimization
Scalable multiple channel scheduling with optimal utility in wireless local area networks

Wireless Networks
Proportional service differentiation in wireless LANs using spacing-based channel occupancy regulation

Mobile Networks and Applications
Scheduling algorithms for multiple channel wireless local area networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an adaptive contention-based MAC scheduling scheme called Multi-channel Contention-based TDMA (MC/TDMA) for Multichannel wireless networks which provides proportional service differentiation while achieving high resource utilization. The MC/TDMA scheme adaptively schedules the traffic over multiple non-overlapping channels by controlling the number of competing nodes on a common channel based on the system load. The scheduling problem of MC/TDMA scheme is solved in two phases. The first phase called the Timeslot Allocation phase is reduced to a modified open-shop scheduling problem which allows us to use known efficient open-shop scheduling algorithms. For the second phase called Channel Allocation Phase, which is a non-convex Non-linear Programming (NL-P) problem (an NP-Hard problem) we develop a greedy heuristic. In order to maximize the utilization of the network resources while achieving proportional service differentiation, we propose a tuning knob called the collision factor 'a' which can be adaptively adjusted based on the network load. Through extensive simulations using OPNET we show that the proposed MC/TDMA scheme can provide proportional service differentiation in a multichannel wireless network while optimizing the utilization of the network resources.