System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Efficient Rate-Guaranteed Opportunistic Scheduling for Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fei Long ; Sch. of Electr. & Electron. Eng., Corp. Technol., Beijing ; Gang Feng

In this paper, we present an efficient rate-guaranteed opportunistic scheduling (ROS) scheme, which optimizes the system throughput performance while satisfying the ldquofairnessrdquo constraint for resource allocation by exploiting time-varying channel states. We prove the optimality of the proposed scheduler via mathematical analysis and show that it has lower computational complexity compared with existing opportunistic scheduling algorithms. We define a new concept of guaranteed-rate node with loss, which is extended from the service curve with a loss model, to analyze the performance bounds of ROS, such as the statistic end-to-end packet delay bound. We validate the mathematical analysis and demonstrate the throughput performance improvement and a delay bound based on ns-2 simulations.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:57 ,  Issue: 2 )