TY - GEN
T1 - Effect of access probabilities on the delay performance of Q-CSMA algorithms
AU - Ghaderi, Javad
AU - Srikant, R.
PY - 2012
Y1 - 2012
N2 - It has been recently shown that queue-based CSMA algorithms can be throughput optimal. In these algorithms, each link of the wireless network has two parameters: a transmission probability and an access probability. The transmission probability of each link is chosen as an appropriate function of its queue-length, however, the access probabilities are simply regarded as some random numbers since they do not play any role in establishing the network stability. In this paper, we show that the access probabilities control the mixing time of the CSMA Markov chain and, as a result, affect the delay performance of the CSMA. In particular, we derive formulas that relate the mixing time to access probabilities and use these to develop the following guideline for choosing access probabilities: each link i should choose its access probability equal to 1=(d i + 1), where d i is the number of links which interfere with link i. Simulation results show that this choice of access probabilities results in good delay performance.
AB - It has been recently shown that queue-based CSMA algorithms can be throughput optimal. In these algorithms, each link of the wireless network has two parameters: a transmission probability and an access probability. The transmission probability of each link is chosen as an appropriate function of its queue-length, however, the access probabilities are simply regarded as some random numbers since they do not play any role in establishing the network stability. In this paper, we show that the access probabilities control the mixing time of the CSMA Markov chain and, as a result, affect the delay performance of the CSMA. In particular, we derive formulas that relate the mixing time to access probabilities and use these to develop the following guideline for choosing access probabilities: each link i should choose its access probability equal to 1=(d i + 1), where d i is the number of links which interfere with link i. Simulation results show that this choice of access probabilities results in good delay performance.
UR - http://www.scopus.com/inward/record.url?scp=84861648474&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861648474&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2012.6195588
DO - 10.1109/INFCOM.2012.6195588
M3 - Conference contribution
AN - SCOPUS:84861648474
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 2068
EP - 2076
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -