Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
