On fair sharing of spectrum via CSMA

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 477-482

  Alanyali, Murat ^a   Dashouk, Maxim ^a  

^a Boston University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ALGORITHM; FAIR SHARING; HIDDEN TERMINAL; INTERFERENCE MODELS; MEDIUM ACCESS; PACKET COLLISIONS; PERIODIC BURSTS; PROPAGATION DELAYS; RANDOM ACCESS; TRANSMISSION RATES;

TIME DIVISION MULTIPLE ACCESS;

CARRIER SENSE MULTIPLE ACCESS;

EID: 77949591187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394768     Document Type: Conference Paper

References (8)

1. M.M. Halldorsson and G. Koltsarz, Multicoloring planar graphs and partial k-trees, in Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, vol. 1671, pp. 73-84, Elsevier, 2004.
2. G. Hauksson and M. Alanyali, Wireless medium access via adaptive backoff: Delay and loss minimization. Proceedings of Infocom 2008.
3. L. Jiang and J. Walrand. A distributed CSMA algorithm for throughput and utility maximization in wireless networks, Allerton 2008.
4. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H.V. Poor, Convergence and tradeoff of utility-optimal CSMA. arXiv:0902.1996v1.
5. S.P. Meyn and R.L. Tweedie, Markov chains and stochastic stability, Springer-Verlag, 1993.
6. J. Ni and R. Srikant. Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks. arXiv:0901.2333v1.
7. S. Rajagopalan, D. Shah, and J. Shin. ALOHA that works, Preprint.
8. Y. Wu, Y.J. Zhang, and Z. Niu, Non-preemptive constrained link scheduling in wireless mesh networks, Globecom 2008.