2010/03/06 by Javad Ghaderi, Ghaderi, Javad, R. Srikant +1
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Networking and Internet Architecture (cs.NI) #Probability (math.PR) #cs.NI #math.PR
paper · pdf · doi:10.48550/arxiv.1003.1364
arxiv created 2010/03/06 · openalex publication_date 2010/03/06 · arxiv updated 2010/03/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.