A distributed throughput-optimal CSMA with data packet collisions

2010 5th IEEE Workshop on Wireless Mesh Networks, WiMesh 2010

Volumn , Issue , 2010, Pages 55-60

  Kim, Tae Hyun ^a   Ni, Jian ^a   Vaidya, Nitin H ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACK-OFF; DATA PACKET; OPTIMALITY;

CARRIER SENSE MULTIPLE ACCESS; OPTIMIZATION; THROUGHPUT; WIRELESS MESH NETWORKS (WMN);

MESH NETWORKING;

EID: 77955112129     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIMESH.2010.5507899     Document Type: Conference Paper

References (10)

1. 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.
2. 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.
3. 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.
4. J. Ni, B. R. Tan, and R. Srikant, "Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks," Proc. IEEE Infocom Mini-Conference, Jan. 2010.
5. 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.
6. 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.
7. L. Jiang and J. Walrand, "Approaching throughput-optimality in a distributed CSMA algorithm with contention resolution," EECS Department, University of California, Berkeley, URL: http://www.eecs.berkeley.edu/Pubs/ TechRpts/2009/EECS-2009-37.html, Technical Report UCB/EECS-2009-37, Mar. 2009.
8. E. Vigoda, "A note on the Glauber dynamics for sampling independnet sets," The Electronic Journal of Combinatorics, vol. 8, 2001.
9. S. Boyd, P. Diaconis, J. Sun, and L. Xiao, "Fastest mixing Markov chain on a path," The American Mathematical Monthly, vol. 113(1), pp. 70-74, Jan. 2006.
10. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Networking, pp. 411-424, Apr. 2005.