Distributed joint channel assignment, routing and scheduling for wireless mesh networks

Abstract

We present the JARS (Joint channel Assignment, Routing and Scheduling) scheme for ad hoc wireless networks in which nodes are endowed with multiple radios.JARS is one example of the benefits gained by the integration of routing, scheduling, and channel assignment by using the multiple radios at each node to transmit and receive simultaneously on different orthogonal channels. Instead of choosing the optimal route based on the predetermined transmission scheduling and channel assignment results, JARS incorporates the efficiency of underlying channel assignment and scheduling information into the routing metric calculation so that the route with the maximal joint spatial and frequency reuse is selected. Once a path is established, the channel assignment and link scheduling are also determined at the same time. JARS also adapts different channel assignment and scheduling strate- transmissions. Simulation results show that JARS efficiently exploits the channel diversity and spatial reuse features of a multi-channel multi-radio system.

Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks

“…To the best of our knowledge, this is the first paper that addresses the problem of minimizing end-toend delays in MTR WMNs through joint routing and link scheduling. We remark that our work is different from those that consider multiradio multi-channel (MR-MC), e.g., [14,33,35]. This is because we consider MTR WMNs, where nodes operate on the same frequency.…”

An on-demand routing protocol for improving channel use efficiency in multichannel ad hoc networks

“…There exist only a few heuristic solutions, which have good performance under certain environment. The joint channel assignment, routing and scheduling schemes are proposed in Aceves (2008, 2009), each node needs to get channel usage information of its two-hop neighbors, the channel assignment in Wang and Aceves (2008) needs to find node-disjoint path first, its channel assignment is not based on local information and has more cost. The paper (Lin and Rasool, 2007) presents a distributed joint channel assignment, scheduling and routing algorithm for ad hoc wireless networks, the key contribution is that it proposes an interference model, which defines the interference degree of links, it is defined as the maximum cardinality of subsets of links such that any two links in these subset do not interfere with each other.…”

Indoor Link Quality Comparison of IEEE 802.11a Channels in a Multi-radio Mesh Network Testbed

“…The channel assignment problem has been formulated under a variety of assumptions, by a myriad of experimental [6,11], theoretical [4,5,12] and simulation [3,[7][8][9][13][14][15] studies. All these works use the unstated assumption that the orthogonal channels will perform equally well for any given link in the WMN.…”

“…At the heart of this promise lies an attempt to provide full capacity of WMNs through improved link utilization by reducing the interference within the network. In order to achieve this objective multi-radio multichannel WMNs have been proposed and evaluated by an increasing number of analytical, simulation and experimental studies [3][4][5][6][7][8][9][10][11][12][13][14][15].…”