A novel joint problem of routing, scheduling, and variable-width channel allocation in WMNs.

Chun-Cheng Lin,Der-Jiunn Deng,Chun-Hung Chou,Wan-Yu Liu

doi:10.1155/2014/754749

Abstract

This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems.

Highlights

Wireless mesh networks (WMNs) are able to achieve a higher network coverage rate and a larger transmission range through massive deployment of nodes and data exchange between nodes
The main contributions of this paper are stated as follows: (i) the simulated annealing (SA) algorithm with a novel encoding mechanism is designed and implemented to solve a novel joint RSC problem with variable-width channel allocation scheme; (ii) we establish a linear programming model for the novel joint RSC problem, in which in order to be more realistic than the previous works in [11, 12], we consider that the channel capacity is influenced by the allocated channel width, transmission range, and signal interference; (iii) we propose an innovative solution encoding design in which the configurations of multiple time slots are devised to characterize the dynamic data transmission process in WMNs
Since our joint RSC problem is new, we first compare our experimental results for a smallscale problem with the optimal solutions generated by the column generation algorithm

Summary

Introduction

Wireless mesh networks (WMNs) are able to achieve a higher network coverage rate and a larger transmission range through massive deployment of nodes and data exchange between nodes. Most of the previous joint problems for WMNs were associated with only two of the three concerns, and this paper further investigates the joint problem of routing, scheduling, and channel allocation (RSC for short) to address the network scenario more realistically Another important issue on WMNs is the influence of signal interference on network performance, which can be lessened by using multiple radios and multiple orthogonal channels; for example, see [8, 9]. (ii) we establish a linear programming model for the novel joint RSC problem, in which in order to be more realistic than the previous works in [11, 12], we consider that the channel capacity is influenced by the allocated channel width, transmission range, and signal interference;.

Preliminaries

Session 3

Our SA Approach to the RSC Problem

Experimental Results and Analysis

40 MHz fixed-width Time slot t 1 2 3 4 5 6 Total activation time

Conclusion and Future Work