skip to main content
short-paper

Comparing slotted and continuous CSMA: throughputs and fairness

Published:15 September 2011Publication History
Skip Abstract Section

Abstract

Carrier-Sense Multiple-Access (CSMA) protocols form a popular class of random-access schemes for regulating node activity in wireless networks. We compare the continuous and the time-slotted versions of this protocol in the saturated regime, and show that continuous CSMA has higher aggregate throughput than the slotted protocol, but this comes at the cost of fairness, i.e., the throughput is not evenly distributed across all nodes. We then release the saturation assumption and consider a multi-hop scenario where packets are forwarded through the network and nodes may occasionally empty. We study end-to-end throughput of both continuous and slotted CSMA, and show that slotted CSMA has a higher throughput than the continuous protocol.

References

  1. M. Durvy, O. Dousse, and P. Thiran. Modeling the 802.11 protocol under different capture and sensing capabilities. In Proc. Infocom, pages 2356--2360, Anchorage AK, May 6-12 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Durvy, O. Dousse, and P. Thiran. Self-organization properties of CSMA/CA systems and their consequences on fairness. IEEE Trans. Inform. Theory, 55(3):931--943, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Durvy and P. Thiran. A packing approach to compare slotted and non-slotted medium access control. In Proc. Infocom, Barcelona, Spain, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  4. L. Kleinrock and F. Tobagi. Packet switching in radio channels: part I - carrier sense multiple-access modes and their throughput-delay characteristics. IEEE Trans. Comm., 23(12):1400--1416, 1975.Google ScholarGoogle ScholarCross RefCross Ref
  5. E. Pinsky and Y. Yemini. The asymptotic analysis of some packet radio networks. IEEE J. Sel. Areas Commun., 4(6):938--945, 1986.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. van de Ven, J. van Leeuwaarden, D. Denteneer, and A. Janssen. Spatial fairness in linear random-access networks. Performance Evaluation (to appear), 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. X. Wang and K. Kar. Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks. In Proc. Infocom, pages 23--34, 2005.Google ScholarGoogle Scholar

Index Terms

  1. Comparing slotted and continuous CSMA: throughputs and fairness

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader