Performance comparisons of the routing tree construction algorithms for IEEE 802.16 centralized scheduling mesh networks

In the IEEE 802.16 centralized scheduling mesh network, the Base Station (BS) allocates minislots to each Subscriber Station (SS) for packet transmissions along a pre-constructed routing tree. Existing researches have shown that the network performance is highly dependent on the routing tree, which gives rise to a number of promising routing tree construction algorithms. In this paper we first compare the performance of different routing tree construction algorithms and find that none of the algorithms could always outperform others for various network topologies. We then aim to figure out which algorithm to apply to which type of topologies. Simulation Results show that Hemyari's 2
^nd
algorithm is best for the topologies with low node density, while Hung's is best on the large scale topologies with high node density, and Sheu's algorithm outperforms others on the topologies with medium node density and the small scale topologies with high node density.