Comparative evaluation of heuristics for time slot assignment in IEEE 802.16j relay networks

In this paper, we propose two heuristic algorithms for time slot assignment in IEEE 802.16j relay networks. In the proposed methods, we calculate an appropriate group of time slots for each link in the network or calculate an appropriate group of links for each time slot. We show that the latter algorithm is better in terms of the balance between the calculation time and network performance.