Channel Allocation for IEEE 802.16 Mesh Networks
Till Kleisli · 2006
In this thesis, we investigate the problem of channel allocation in a static multi-hop wireless mesh network employed for telephony in public safety scenarios. We assume that each mesh router is equipped with two IEEE 802.16-2004 radio in-terfaces. These interfaces can be switched to one of 12 orthogonal channels. The objective is to find a set of channel allocations for the interfaces in the network that minimize the network interference and fairly distribute capacity. We evaluate three classes of algorithms for channel allocation: Random allocation, greedy allocation and merge allocation with numeric calculations on graphs as well as with simulations in QualNet. We study the following scenarios for distribution of mesh routers: Random place-ment of nodes with four different numbers of nodes and grid placements of nodes also with four different number of nodes. The numeric calculations approach reveals that all greedy algorithms perform well and limitations in capacity are mainly due to a suboptimal topology construction.