Mobility

From Glauber Dynamics to Metropolis Algorithm: Smaller Delay in Optimal CSMA

Download Now Free registration required

Executive Summary

Since the seminal work by Tassiulas and Ephremides on throughput-optimal scheduling, referred to as Max-Weight, a huge array of research has been made to develop distributed MAC scheduling with high performance guarantee and low complexity. The tradeoff between complexity and efficiency has been, however, observed in many cases, or even throughput-optimal algorithms with polynomial complexity have turned out to require heavy message passing. A breakthrough has been recently made, where just locally controlling the classical CSMA parameters, which is modeled by Glauber dynamics, is enough to achieve throughput-optimality.

  • Format: PDF
  • Size: 787.89 KB