Distributed Opportunistic Scheduling: A control theoretic approach
Distributed Opportunistic Scheduling: A control theoretic approach
复制标题
DOI：
10.1109/infcom.2012.6195795
复制
发表时间：
2012-03
期刊：
影响因子：
--
通讯作者：
A. Garcia-Saavedra;A. Banchs;P. Serrano;J. Widmer
中科院分区：
文献类型：
--
作者：
A. Garcia-Saavedra;A. Banchs;P. Serrano;J. Widmer
分布式机会调度（DOS）技术最近被提出用于提高无线网络的吞吐量性能。在DOS中，每个站都以一定的访问概率争夺信道。如果竞争成功，电台测量信道条件，并在信道质量超过一定阈值的情况下发送。否则，该电台不利用传输机会，允许所有电台重复竞争。DOS的一个关键挑战是设计一种分布式算法，以最佳地调整每个站点的访问概率和阈值。为了应对这一挑战，在本文中，我们首先计算了这两个参数的配置，它们根据比例公平性共同优化吞吐量性能。然后，我们提出了一种基于控制理论的自适应算法，该算法收敛到期望的运行点。最后，我们对算法进行了控制理论分析，以找到在稳定性和收敛速度之间提供良好权衡的参数设置。仿真结果验证了所提算法的设计，并证实了其相对于以往算法的优越性。
Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention is successful, the station measures the channel conditions and transmits in case the channel quality is above a certain threshold. Otherwise, the station does not use the transmission opportunity, allowing all stations to recontend. A key challenge with DOS is to design a distributed algorithm that optimally adjusts the access probability and the threshold of each station. To address this challenge, in this paper we first compute the configuration of these two parameters that jointly optimizes throughput performance in terms of proportional fairness. Then, we propose an adaptive algorithm based on control theory that converges to the desired point of operation. Finally, we conduct a control theoretic analysis of the algorithm to find a setting for its parameters that provides a good tradeoff between stability and speed of convergence. Simulation results validate the design of the proposed algorithm and confirm its advantages over previous proposals.