Multi-channel TDMA link scheduling for wireless multi-hop sensor networks

In this paper, we propose the conflict-free TDMA link scheduling algorithm to minimize slot length in multi-channel operation wireless multi-hop sensor networks. We exploit conflict graph model to schedule conflict-free transmissions for all links in the network. The min-max optimization is used to find minimum slot length including all link transmissions. Our proposed algorithm also minimizes the end-to-end delay by ordering of link transmissions. We evaluate the performance of our proposed algorithm in terms of required slot length and energy consumption in IEEE802.15.4e multi-superframe structure. Our numerical results show that the improvement of performance is noticeable compare with previous works while consumes least energy to deliver the frame on the multi-hop communication in large networks.