Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

Technology Used: Java 2011

Download Projects 2011 Basepaper

ABSTRACT

It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain is “almost” time-reversible. Second, we propose transmission-length control algorithms to approach throughput-optimality in this case. Sufficient conditions are given to ensure the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.

5 thoughts on “Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

  • October 19, 2011 at 12:57 pm
    Permalink

    if we do these projects now ,will it be useful in applying for universities in usa in the future for ,masters

    Reply
  • July 15, 2012 at 9:12 am
    Permalink

    sir,please send me this paper.

    Reply
  • September 7, 2012 at 2:11 pm
    Permalink

    please send me this paper.

    Reply
  • September 28, 2012 at 4:55 am
    Permalink

    i am intersted in this paper.plz send softcopy

    Reply
  • April 19, 2013 at 5:20 pm
    Permalink

    sir can u send the literature review for this paper…to my mail id?

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *