• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Throughput modeling of single hop CSMA networks with non-negligible propagation delay

      Thumbnail
      View / Download
      603.9 Kb
      Author
      Koseoglu, M.
      Karasan, E.
      Date
      2013
      Source Title
      IEEE Transactions on Communications
      Print ISSN
      0090-6778
      Publisher
      IEEE
      Volume
      61
      Issue
      7
      Pages
      2911 - 2923
      Language
      English
      Type
      Article
      Item Usage Stats
      130
      views
      76
      downloads
      Abstract
      We analyze the performance of the CSMA protocol under propagation delays that are comparable with packet transmission times. We propose a semi-Markov model for the 2-node CSMA channel. For the 2-node case, the capacity reduces to 40% of the zero-delay capacity when the one-way propagation delay is 10% of the packet transmission time. We then extend this model and obtain the optimum symmetric probing rate that achieves the maximum network throughput as a function of the average propagation delay, d, and the number of nodes sharing the channel, N. The proposed model predicts that the total capacity decreases with d-1 as N goes to infinity when all nodes probe the channel at the optimum rate. The optimum probing rate for each node decreases with 1/N and the total optimum probing rate decreases faster than d-1 as N goes to infinity. We investigate how the short-term unfairness problem in CSMA worsens as the propagation delay increases and propose a back-off mechanism to mitigate this issue. The theoretical results presented in this paper can be used as a benchmark for the performance improvements provided by algorithms that have already been developed.
      Keywords
      Carrier Sense Multiple Access (CSMA)
      Large propagation delay
      Multiaccess communication
      Wireless networks
      Back-off mechanisms
      Carrier sense multiple access (CSMA)
      Large propagation delays
      Multi-access communications
      Packet transmissions
      Performance improvements
      Throughput modeling
      Unfairness problem
      Benchmarking
      Carrier communication
      Markov processes
      Packet networks
      Wireless networks
      Carrier sense multiple access
      Permalink
      http://hdl.handle.net/11693/20965
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TCOMM.2013.050813.130004
      Collections
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy