Throughput-optimized opportunistic scheduling for rate-guaranteed and best-effort users in wireless networks

Authors:
Wen Huang;Kwan L. Yeung
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, PRC;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, PRC
Venue:
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Year:
2009

Citing 4
Cited 0

A framework for opportunistic scheduling in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
J-CAR: an efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile ad hoc networks

IEEE Transactions on Wireless Communications
Joint Scheduling of Rate-Guaranteed and Best-Effort Users over a Wireless Fading Channel

IEEE Transactions on Wireless Communications
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study opportunistic scheduling algorithms in a wireless network with a central base station communicating with multiple users on a single shared channel using time division multiple access. We assume the coexistence of both rate guaranteed (RG) users and best effort (BE) users in the system. A RG user asks for a specific transmission rate and the system should provision the exact amount being asked. In this paper, we present an optimal opportunistic scheduler that maximizes the system throughput. An analytical model is constructed to evaluate its performance in a homogenous system. Closed form solutions for channel access delay, worst case delay and system throughput are derived. Extensive simulations in both homogeneous and heterogeneous systems are conducted to verify the effectiveness of our scheduler.