Link Scheduling Algorithms for Wireless Mesh Networks

Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) 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 communication graph and verifying Signal to Interference and Noise Ratio (SINR) threshold conditions at receivers and those based on an SINR graph model of the network. We outline a framework for modeling STDMA networks. We review representative research works from each of these classes. Finally, we describe the relative merits and demerits of each class of algorithms.

• Type: Journal
• Year: 2011
• Where: COMSUR
• Authors: Ashutosh Deepak Gore, Abhay Karandikar
• Keywords: Communication Graph, COMSUR 2011, Graph Model, Hardware, Threshold Conditions