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.

Posted by on Jun 21st, 2011 and filed under Networking. You can follow any responses to this entry through the RSS 2.0. You can leave a response by filling following comment form or trackback to this entry from your site

5 Responses for “Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions”

  1. syed says:

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

  2. rupali says:

    sir,please send me this paper.

  3. lohitha says:

    please send me this paper.

  4. ROHIT says:

    i am intersted in this paper.plz send softcopy

  5. imran farith says:

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

Leave a Reply