DOMINO: relative scheduling in enterprise wireless LANs

  • Authors:

  • Wenjie Zhou;Dong Li;Kannan Srinivasan;Prasun Sinha

  • Affiliations:

  • The Ohio State University, Columbus, OH, USA;The Ohio State University, Columbus, OH, USA;The Ohio State University, Columbus, OH, USA;The Ohio State University, Columbus, OH, USA

  • Venue:
  • Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Large-scale Enterprise WLANs are amenable to centralized control and coordination through the wired backbone for improved performance. Distributed scheduling algorithms either fail to achieve high performance in real deployments due to their myopic view of interference characteristics, or take significant time to converge to a globally optimal solution. Thus, they are not reactive to current network conditions. Centralized packet scheduling algorithms do not suffer from the performance limitations of distributed approaches, but are non-trivial to implement. Tight time synchronization requirements make proposed centralized schemes difficult to use in practice. This paper proposes Relative Scheduling: a technique for triggering wireless transmissions through other wireless transmissions in a domino-like fashion, thus making tight time synchronization unnecessary. Through USRP experiments and trace-driven simulations, we show that our approach can achieve up to 1.96× the throughput of Distributed Coordination Function (DCF).