An analytic model for Throughput Optimal Distributed Coordination Function (TO-DCF)

TO-DCF, a new backoff scheme for 802.11, has the potential to significantly increase throughput in dense wireless LANs while also opportunistically favouring nodes with heavier traffic loads and/or better channel conditions. In this paper we present an analytical model to investigate the behaviour and performance of the TO-DCF protocol with regards to operating parameters such as the number of nodes, the contention window size and the backoff countdown probabilities. We then compare numerical results from an implementation of our model with simulations. Our model shows a high level of accuracy, even when the model assumptions are relaxed, and provides guidance for network operators to correctly configure the weight functions for nodes running TO-DCF given the network’s operating conditions.

• Publication year

  2017

• Venue

  Telecommunications Systems

• Publication date

  2017-02-03

• Fields of study

  Medicine, Computer Science

• Identifiers
  DOI 10.1007/s11235-017-0275-6PMID 28932096PMCID 5575083
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Making 802.11 DCF Near-Optimal: Design, Implementation, and Evaluation

  2016influential reference
• History-Based Backoff Algorithms for Mobile Ad Hoc Networks

  2016influential reference
• Probabilistic Medium Access Control for Full-Duplex Networks With Half-Duplex Clients

  2016cited by this paper
• Approaching Optimal Centralized Scheduling With CSMA-Based Random Access Over Fading Channels

  2016influential reference
• Achieving Optimal Throughput Utility and Low Delay With CSMA-Like Algorithms: A Virtual Multichannel Approach

  2015cited by this paper
• An Opportunistic Backoff Scheme for Dense IEEE 802.11 WLANs

  2015cited by this paper
• Covert single-hop communication in a wireless network with distributed artificial noise generation

  2014cited by this paper
• Performance analysis of CSMA-based opportunistic medium access protocol in cognitive radio sensor networks

  2014cited by this paper
• Optimal Distributed Scheduling under Time-Varying Conditions: A Fast-CSMA Algorithm with Applications

  2013cited by this paper
• Recent Developments in Nanoparticle-Based siRNA Delivery for Cancer Therapy

  2013cited by this paper
• Proportional fairness in MAC layer channel access of IEEE 802.11s EDCA based wireless mesh networks

  2013cited by this paper
• Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels

  2013cited by this paper
• Token-DCF: An opportunistic MAC protocol for wireless networks

  2012cited by this paper
• History Based Probabilistic Backoff Algorithm

  2012influential reference
• Probabilistic polling for multi-hop energy harvesting wireless sensor networks

  2012cited by this paper
• Medium Access Using Queues

  2011cited by this paper
• Modeling and Analysis of K-Tier Downlink Heterogeneous Cellular Networks

  2011cited by this paper
• Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

  2010cited by this paper
• Resource Allocation over Network Dynamics without Timescale Separation

  2010cited by this paper
• A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

  2010cited by this paper
• Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

  2009cited by this paper
• Stochastic geometry and random graphs for the analysis and design of wireless networks

  2009cited by this paper
• Network adiabatic theorem: an efficient randomized protocol for contention resolution

  2009cited by this paper
• Randomized Scheduling Algorithm for Queueing Networks

  2009cited by this paper
• Cross-Layer Analysis of the End-to-End Delay Distribution in Wireless Sensor Networks

  2009cited by this paper
• Performance Analysis of Cooperative Diversity Wireless Networks over Nakagami-m Fading Channel

  2007cited by this paper
• Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function

  2005influential reference
• The capacity of wireless networks

  2000cited by this paper
• Self-similarity in World Wide Web traffic: evidence and possible causes

  1997cited by this paper
• Self-similarity in World Wide Web traffic: evidence and possible causes

  1996cited by this paper
• Wide area traffic: the failure of Poisson modeling

  1995cited by this paper
• Wide-area traffic: the failure of Poisson modeling

  1994cited by this paper
• On the self-similar nature of Ethernet traffic

  1993cited by this paper
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

  1990cited by this paper
• Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics

  1975cited by this paper
• Queueing Systems: Volume I-Theory

  1975cited by this paper
• THE ALOHA SYSTEM: another alternative for computer communications

  1899cited by this paper

• High priority space protection (HPP): countdown space-based MAC protocol with enhanced lockdown effect

  2024cites this paper
• Refinement Method of Evaluation and Ranking of Innovation and Entrepreneurship Ability of Colleges and Universities Based on Optimal Weight Model

  2022cites this paper
• Performance Modeling of IEEE 802.11 WLANs

  2019cites this paper
• Conflict graph-based model for IEEE 802.11 networks: A Divide-and-Conquer approach

  2019cites this paper
• Throughput Analysis of IEEE 802.11 Multi-Hop Wireless Networks With Routing Consideration: A General Framework

  2018cites this paper
• Reanalyzing a simplified Markov model for the low-density P2P wireless sensor and actuator networks

  2018cites this paper
• Conflict graph-based model for IEEE 802.11 networks: A Divide-and-Conquer approach

  year unknowncites this paper