On-line joint QoS routing and channel assignment in multi-channel multi-radio wireless mesh networks

  • Authors:

  • Bahador Bakhshi;Siavash Khorsandi;Antonio Capone

  • Affiliations:

  • Computer Engineering and Information Technology Department, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran;Computer Engineering and Information Technology Department, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran;Department of Electronics and Information, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milan, Italy

  • Venue:
  • Computer Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.24

Visualization

Abstract

We study the problem of on-line joint QoS routing and channel assignment for performance optimization in multi-channel multi-radio wireless mesh networks, which is a fundamental issue in supporting quality of service for emerging multimedia applications. To our best knowledge, this is the first time that the problem is addressed. Our proposed solution is composed of a routing algorithm that finds up to k but not necessarily feasible paths for each demand and an on-demand channel (re)assignment algorithm that adapts network resources to maintain feasibility of one of the paths. We also study the problem of obtaining an upper bound on the network performance. First, we consider an artificial version of the problem, in which all demands arrive at the same time, and formulate it as a mixed integer linear programming model. To tackle the complexity of the model, it is relaxed that provides a tight upper bound while improves solution time up to 3.0e+5 times. Then, we model the original problem by extending the relaxed model to consider dynamic demands, it leads to a huge model; thus, we develop another model, which is equivalent to the first one and is decomposable. It is broken down by a decomposition algorithm into subproblems, which are solved sequentially. Our extensive simulations show that the proposed solution has comparable performance to the bound obtained from the decomposition algorithm; it efficiently exploits available channels, and needs very few radios per node to achieve high network performance.