Channel allocation and interface binding in wireless mesh networks
29 April 2016
UAntwerp - Campus Groenenborger, V0.08 - Groenenborgerlaan 171 - 2020 Antwerpen
PhD defence Jeroen Avonts - Department of Mathematics and Computer Science
The contributions in this thesis relate to optimisations in two important research fields of multi-radio wireless mesh networks. By allowing each wireless mesh node in the network to have multiple wireless interfaces, the challenge of choosing the channels or frequencies on which to operate these interfaces, is introduced. In the thesis we describe the problem of the channel allocation and provide a distributed greedy algorithm to find a suboptimal channel allocation. This proposed algorithm is evaluated for a set of generic wireless mesh networks and the results are discussed.
Another challenge is the interface to interface binding. Each wireless mesh node can potentially communicate with every other single wireless mesh node in its communication range. However, when using the wireless medium to communicate, ongoing communications can be disturbed or interfered with. This interference can be reduced by only communicating with a small set of neighbours. Selecting this set by an algorithm is called a binding algorithm. We propose a framework to measure different metrics of the resulting network of such a binding algorithm. These metrics are data flow and network structure related. Using this framework, prior-art algorithms are evaluated and compared to each other in different use cases.