On the achievable throughput of CSMA under imperfect carrier sensing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1674-1682

  Kim, Tae Hyun ^a   Ni, Jian ^b   Srikant, R ^a   Vaidya, Nitin H ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LINKS; CAPACITY REGIONS; CARRIER SENSING; OPTIMALITY; PERTURBATION THEORY;

ALGORITHMS; MARKOV PROCESSES; PERTURBATION TECHNIQUES; THROUGHPUT;

CARRIER SENSE MULTIPLE ACCESS;

EID: 79960884680     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934962     Document Type: Conference Paper

References (19)

1. L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," in Proc. 46th Annual Allerton Conference on Comm., Control and Comp., Sept. 2008.
2. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor, "Maximizing utility via random access without message passing: Throughput, fairness and tradeoffs," Microsoft Research Technical Report, Tech. Rep., Sept. 2008.
3. J. Ni, B. Tan, and R. Srikant, "Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks," in Proc. IEEE INFOCOM Mini-Conference, Mar. 2010.
4. S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: an efficient randomized protocol for contention resolution," in Proc. the 11th ACM Int. Joint Conf. Measurement and Modeling of Computer System (ACM Sigmetric), 2009, pp. 133-144.
5. R. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin, "Throughput analysis in multihop csma packet radio networks," IEEE Trans. Comm., vol. 35, no. 3, pp. 267-274, Mar. 1987.
6. E. Vigoda, "A note on the Glauber dynamics for sampling independnet sets," The Electronic Journal of Combinatorics, vol. 8, 2001.
7. L. Jiang and J. Walrand, "Approaching throughput-optimality in a distributed CSMA algorithm: Collisions and stability," in Proc. ACM Mobihoc'09 S3 Workshop, May 2009.
8. D. Shah and J. Shin, "Efficient queue-based CSMA with collisions," ArXiv e-prints, Mar. 2010. [Online]. Available: http://adsabs.harvard.edu/abs/2010arXiv1003.2749S
9. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automatic Control, vol. 37, no. 12, pp. 1396-1948, Dec. 1992.
10. C. Joo, X. Lin, and N. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks," IEEE/ACM Trans. Networking, vol. 17, no. 4, pp. 1132-1145, Aug. 2009.
11. M. Leconte, J. Ni, and R. Srikant, "Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks," in Proc. ACM MobiHoc, May 2009.
12. J. Ghaderi and R. Srikant, "On the design of efficient CSMA algorithms for wireless networks," in Proc. IEEE Conf. Decision and Control, Dec. 2010.
13. X. Lin, N. B. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," IEEE Jr. Sel. Ar. Comm., vol. 24, no. 8, pp. 1452-1463, Aug. 2006.
14. IEEE 802.11n, Part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications: Enhancement for Higher Throughput, Standard Specifications, Std., Oct. 2009.
15. T. H. Kim, J. Ni, and N. H. Vaidya, "A distributed throughput-optimal CSMA with data packet collisions," in Proc. the 5th IEEE Workshop on Wireless Mesh Networks (WiMESH), June 2010.
16. T. H. Kim, J. Ni, N. H. Vaidya, and R. Srikant, "On the achievable throughput of CSMA with imperfect carrier sensing," UIUC, Tech. Rep., July 2010. [Online]. Available: http://users.crhc.illinois.edu/thkim/pub/csf.pdf
17. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Networking, pp. 411-424, Apr. 2005.
18. G. E. Cho and C. D. Meyer, "Comparison of perturbation bounds for the stationary distribution of a Markov chain," Linear Algebra and its Applications, vol. 335, pp. 137-150, 2001.
19. E. Solan and N. Vieille, "Perturbed Markov chains," Journal of Applied Probability, vol. 40, no. 1, pp. 107-122, 2003.