Efficient Rate-Guaranteed Opportunistic Scheduling for Wireless Networks
Efficient Rate-Guaranteed Opportunistic Scheduling for Wireless Networks
复制标题
无线网络的高效速率保证机会调度
DOI：
10.1109/tvt.2007.905338
复制
发表时间：
2008
影响因子：
6.8
通讯作者：
G. Feng
中科院分区：
文献类型：
--
作者：
Fei Long;G. Feng
本文提出了一种有效的速率保证机会调度（ROS）方案，该方案利用时变信道状态来优化系统的吞吐量性能，同时满足资源分配的公平性约束。我们通过数学分析证明了该调度算法的最优性，并表明与现有的机会调度算法相比，它具有较低的计算复杂度。在具有损耗模型的服务曲线的基础上，提出了具有损耗的保证率节点的概念，分析了ROS的性能边界，如统计端到端数据包延迟边界。我们验证了数学分析，并在ns-2仿真的基础上证明了吞吐量性能的改进和延迟界。
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.