Distributed scheduling schemes for wireless mesh networks: A survey

  • Authors:
  • Kanthaiah Sivapragasam Vijayalayan;Aaron Harwood;Shanika Karunasekera

  • Affiliations:
  • The University of Melbourne, National ICT Australia (NICTA), Victoria, Australia;The University of Melbourne, National ICT Australia (NICTA), Victoria, Australia;The University of Melbourne, National ICT Australia (NICTA), Victoria, Australia

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient scheduling scheme is a crucial part of Wireless Mesh Networks (WMNs)—an emerging communication infrastructure solution for autonomy, scalability, higher throughput, lower delay metrics, energy efficiency, and other service-level guarantees. Distributed schedulers are preferred due to better scalability, smaller setup delays, smaller management overheads, no single point of failure, and for avoiding bottlenecks. Based on the sequence in which nodes access the shared medium, repetitiveness, and determinism, distributed schedulers that are supported by wireless mesh standards can be classified as either random, pseudo-random, or cyclic schemes. We performed qualitative and quantitative studies that show the strengths and weaknesses of each category, and how the schemes complement each other. We discuss how wireless standards with mesh definitions have evolved by incorporating and enhancing one or more of these schemes. Emerging trends and research problems remaining for future research also have been identified.