Thumbnail
Access Restriction
Subscribed

Author Vijayalayan, Kanthaiah Sivapragasam ♦ Harwood, Aaron ♦ Karunasekera, Shanika
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2013
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Wireless mesh networks ♦ Ad hoc networks ♦ Cyclic access ♦ Distributed scheduling schemes ♦ Pseudo-random access ♦ Random access
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.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2013-07-11
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 46
Issue Number 1
Page Count 34
Starting Page 1
Ending Page 34


Open content in new tab

   Open content in new tab
Source: ACM Digital Library