Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks

摘要

Recently, it has been shown that CSMA-type algorithms can achieve the maximum possible throughput in wireless ad hoc networks. Central to these results is a distributed randomized algorithm which selects schedules according to a product-form distribution. The product-form distribution is achieved by considering a continuous-time Markov model of an idealized CSMA protocol (continuous backoff times, zero propagation/sensing delay, no hidden terminals) under which collisions cannot occur.