基于反向平衡聚合树的无线传感器网络分布式TDMA调度算法

Reverse-balanced aggregation tree-based TDMA scheduling algorithms for wireless sensor networks

讨论了已有的TDMA算法在端到端延时上的弊端,在优化时隙数的基础上引入链路的使用顺序与数据流向的相关性,提出了分布式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.