Reverse-balanced aggregation tree-based TDMA scheduling algorithms for wireless sensor networks
基于反向平衡聚合树的无线传感器网络分布式TDMA调度算法*

This paper discussed the end-to-end delay problem of the existing TDMA scheduling algorithms, introduced the correlation between the link order and the data traffic direction besides the smallest length conflict-free assignment of slots. Proposed a distributed TDMA scheduling algorithm, using the formation of RBAT(reverse-balanced aggregation tree) to allocate time slot. The delay and conflict were optimized by controlling the coloring order of the link distributed. The simulation results show that the algorithm outperforms the traditional TDMA algorithm in terms of the end-to-end delay and the communication overhead.