Comparative evaluation of heuristic algorithms of time slot assignment for IEEE 802.16j relay networks

摘要

In IEEE 802.16j relay networks, the network performance is improved by decreasing the total number of different time slots assigned to all links in the network. In the time slot assignment, we should consider the effect of various factors such as interference strength, the traffic load on the links, and the degree of spatial reuse of the wireless network resource. In this report, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively.