An Efficient and Interference-Aware Centralized Routing Tree Algorithm for the Routing and Packet Scheduling Problem in IEEE 802.16 Mesh Networks

IEEE 802.16 mesh network allows a subscriber station (SS) to use the hop-by-hop method to transmit packets to the base station. However, there exist interferences among the transmissions of SSs. Therefore, the routing and packet scheduling problem becomes an important research issues in IEEE 802.16 mesh net-work. In this paper, we design an efficient and interference-aware centralized routing tree algorithm which takes the number of interferences associated with a SS into consideration in an IEEE 802.16 mesh network. Our routing tree algorithm enables more SSs to con-duct simultaneous transmissions, which efficiently shortens the scheduling length, and increases both the channel utilization ratio and the system throughput. In other words, our routing tree algorithm is capable of enhancing the overall network performance. Simulation results show that our routing tree algorithm out-performs the IEEE 802.16 standard and the two routing tree algorithms proposed by Hemyari et al.