On the design of efficient CSMA algorithms for wireless networks
On the design of efficient CSMA algorithms for wireless networks
复制标题
无线网络高效CSMA算法设计
DOI：
10.1109/cdc.2010.5717965
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
R. Srikant
中科院分区：
文献类型：
--
作者：
Javad Ghaderi;R. Srikant
最近的研究表明，使用基于队列长度的链路权重的CSMA算法可以在无线网络中实现吞吐量最优。具体地说，Rajagopalan，Shah和Shin(2009)的一个关键结果表明，如果链路权重被选择为log(Q)(其中q是队列长度)的形式，则实现吞吐量最优。在这篇文章中，我们加强了他们的结果，证明了即使在具有形式log(Q)/g(Q)的权函数的情况下，吞吐量最优性仍然保持，其中g(Q)可以是任意缓慢增长的函数。这一结果的意义在于，形式为log(Q)/g(Q)的权函数在实践中似乎获得了最好的延迟性能。
Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Rajagopalan, Shah, and Shin (2009) shows that, if the link weights are chosen to be of the form log log(q) (where q is the queue-length), then throughput optimality is achieved. In this paper, we tighten their result by showing that throughput optimality is preserved even with weight functions of the form log(q)/g(q), where g(q) can be a function that increases arbitrarily slowly. The significance of the result is due to the fact that weight functions of the form log(q)/g(q) seem to achieve the best delay performance in practice.