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.

No abstract

Abstract-We consider the point-to-point link scheduling problem in Spatial Time Division Multiple Access (STDMA) wireless ad hoc networks, motivate the use of spatial reuse as performance metric and provide an explicit characterization of spatial reuse. We assume uniform transmission power at all nodes and propose an algorithm based on a graph model of the network as well as Signal to Interference and Noise Ratio (SINR) computations. Our algorithm achieves higher spatial reuse than existing algorithms, without compromising on computational complexity.

Abstract-We consider random access in wireless networks under a physical interference model, wherein a receiver is capable of power-based capture, i.e., a packet can be correctly decoded in the presence of multiple transmissions if the received signalto-interference-plus-noise ratio (SINR) exceeds a threshold. We propose a splitting algorithm that varies the transmission power of users on the basis of quaternary channel feedback (idle, success, capture, and collision). We show that our algorithm achieves a maximum stable throughput of 0.5518. Simulation results demonstrate that our algorithm achieves higher throughput and lower delay than those of first-come-first-serve and residual-energybased splitting algorithms with uniform transmission power.Index Terms-Collision resolution, Markov chain, random access, tree algorithm, wireless medium access control (MAC).

No abstract