Emulating round-robin in wireless networks

Bin Li, Atilla Eryilmaz, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Round robin and its variants are well known scheduling policies that are popular in wireline networks due to their throughput optimality, delay insensitivity to file size distributions and short-term fairness. The latter two properties are also extremely important for emerging wireless applications, such as Internet of Things and cyber-physical systems. However, there is no direct wireless analog of round robin with all the desirable properties in wireless networks, where wireless interference and channel fading are predominant. The main reason is due to the fact that it is very difficult to even define what round robin means in wireless networks. This motivates us to develop a round-robin-like algorithm in wireless networks that has nice properties as round robin in wireline networks. To that end, we utilize a counter called the Time-Since-Last-Service (TSLS) that keeps track of the time of each file since its last service, and observe that scheduling a file with maximum TSLS in a single server is equivalent to serving files in a round robin fashion. Based on this key observation, we develop a TSLS-based algorithm that balances the tradeoff between the TSLS value and the channel rate for each link and show that the proposed algorithm achieves maximum system throughput, which demands a nontraditional approach due to the abrupt dynamics of the TSLS metrics. Numerous simulations are provided to validate its desired properties such as delay insensitivity and excellent short-term fairness performance as in the case of round robin algorithms of wireline networks.

Original languageEnglish (US)
Title of host publicationMobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450349123
DOIs
StatePublished - Jul 10 2017
Event18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017 - Chennai, India
Duration: Jul 10 2017 → …

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
VolumePart F129153

Other

Other18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017
CountryIndia
CityChennai
Period7/10/17 → …

Keywords

  • Mean delay
  • Round robin
  • Service regularity
  • Throughput
  • Wireless scheduling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'Emulating round-robin in wireless networks'. Together they form a unique fingerprint.

  • Cite this

    Li, B., Eryilmaz, A., & Srikant, R. (2017). Emulating round-robin in wireless networks. In MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing [a21] (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc); Vol. Part F129153). Association for Computing Machinery. https://doi.org/10.1145/3084041.3084052