By Topic

Link Scheduling Algorithms for Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gore, A.D. ; Marvell India Private Ltd., Pune, India ; Karandikar, A.

Wireless Mesh Networks (WMNs) have the potential of being a cost effective solution to provide connectivity and coverage in both urban and rural areas. Typically, a WMN is a backbone network that carries high data rate traffic and employs Time Division Multiple Access (TDMA) like access mechanisms. For a WMN to provide high throughput, the design of an efficient link scheduling algorithm is of paramount importance. Towards this end, we provide an overview of link scheduling algorithms in Spatial TDMA wireless mesh networks. These algorithms can be classified into three categories: those based only on a communication graph model of the network, those based on a communication graph model and Signal to Interference and Noise Ratio (SINR) threshold conditions at receivers and those based on an SINR graph model of the network. We first outline a framework for modeling STDMA networks. We review representative research works and provide the description of an algorithm from each of these classes. We describe the relative merits and demerits of each class of algorithms and compare their performance via simulations. We conclude with a discussion on practical implementation of these algorithms and open research problems.

Published in:

Communications Surveys & Tutorials, IEEE  (Volume:13 ,  Issue: 2 )