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.

[1]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[2]  Andrea J. Goldsmith,et al.  Adaptive coded modulation for fading channels , 1997, Proceedings of ICC'97 - International Conference on Communications.

[3]  Abd-Elhamid M. Taha,et al.  IEEE 802.16 Mesh Schedulers: Issues and Design Challenges , 2008, IEEE Network.

[4]  Shahrokh Valaee,et al.  Link Scheduling for Minimum Delay in Spatial Re-Use TDMA , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Xiang-Yang Li,et al.  Gateway Placement for Throughput Optimization in Wireless Mesh Networks , 2007, 2007 IEEE International Conference on Communications.