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.
[1]
Shahrokh Valaee,et al.
Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks
,
2009,
IEEE/ACM Transactions on Networking.
[2]
Myung J. Lee,et al.
Scheduling multi-channel and multi-timeslot in time constrained wireless sensor networks via simulated annealing and particle swarm optimization
,
2014,
IEEE Communications Magazine.
[3]
Shahrokh Valaee,et al.
Delay aware link scheduling for multi-hop TDMA wireless networks
,
2009,
TNET.
[4]
Abhay Karandikar,et al.
Link Scheduling Algorithms for Wireless Mesh Networks
,
2011,
IEEE Communications Surveys & Tutorials.