Routing Trees in WiMAX Mesh


In wireless mesh networks, data is transmitted over a subset of available links. In case of WiMAX, this subset forms a tree rooted in a Base Station. The choice of links that form such a tree has impact on the usage of transmission resources, and so on the network throughput. There are many ways of optimizing the routing tree for a given network load. This thesis however tries to answer the question if there are any measurable topological properties of the routing tree (such as the averages related to node degree, distance to root, link SNR, tree balance, etc.) that are independent on the load, and yet strongly correlated with network efficiency. Finding such descriptors might for example allow improving the routing tree construction algorithms based on various heuristic approaches. To investigate this, a fast, modular WiMAX network simulator has been created, and used to test thousands of scenarios during the research phase.

Title: Routing Tree Construction in WiMAX Mesh Networks
Author: J. Nowiński
Supervisor: P. Gajowniczek
Defended: October 2012