Adaptive routing tree construction for achieving optimal throughput in WiMAX mesh networks

This paper explores the trade-off relationship between a spatial diversity gain and a control overhead with regard to the number of hop count of the routing tree in WiMAX mesh networks. The effective gain or overhead with the number of hop count is influenced by the density of SSs and traffic load. So this paper proposes the algorithm adjusting the depth of routing tree according to the time varying number of SSs and traffic load for achieving optimal throughput performance. The simulation results show the proposed algorithm can have throughput performance enhancement in the time varying traffic load environment.