Title :
Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks
Author :
Ni, Jian ; Srikant, R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL
Abstract :
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.
Keywords :
Markov processes; ad hoc networks; carrier sense multiple access; continuous backoff times; continuous-time Markov model; distributed CSMA-CA algorithms; distributed randomized algorithm; idealized CSMA protocol; maximum throughput; product-form distribution; sensing delay; wireless ad hoc networks; zero propagation delay; Broadcasting; Degradation; Mobile ad hoc networks; Multiaccess communication; Processor scheduling; Propagation delay; Protocols; Scheduling algorithm; Throughput; Wireless networks;
Conference_Titel :
Information Theory and Applications Workshop, 2009
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-3990-4
DOI :
10.1109/ITA.2009.5044953
