The design of Medium Access Control (MAC) protocol for Wireless Sensor Networks (WSNs) with both limited energy consumption and data delivery time is crucial for industrial and control applications. Since Time Division Multiple Access (TDMA) MAC eliminates the collision occurrence and seeks the minimization of the number of time-slots assigned to each node, the energy consumption of the nodes is reduced. Furthermore, with the proper allocation of the time-slots to the nodes, the transmission delay can be significantly reduced. In this article, we propose TDMA scheduling algorithm for Cluster-tree topology WSNs that meets the timeliness and the energy demands. The algorithm adopts an elegant approach that expresses the timing constraints of the data transmissions as an integer multiple of the length of the schedule period. Moreover, since the distributed algorithm is well-suited to the scarce resources of the WSNs, we focus on the distributed methods that allow each cluster to come up with its allocated time-slots. The algorithm is based on graph theory, such as distributed shortest path, distributed topological ordering, and distributed graph coloring algorithms. The efficiency of the algorithm, regarding the elapsed time to construct the schedule and the energy consumption, is evaluated over benchmark instances up to several thousands of nodes.

中文翻译：

---

一种用于类 ZigBee 簇树 WSN 的节能分布式 TDMA 调度算法

具有有限能耗和数据传输时间的无线传感器网络 (WSN) 媒体访问控制 (MAC) 协议的设计对于工业和控制应用至关重要。由于时分多址 (TDMA) MAC 消除了冲突发生并寻求分配给每个节点的时隙数量的最小化，因此降低了节点的能量消耗。此外，通过将时隙适当地分配给节点，可以显着减少传输延迟。在本文中，我们提出了满足时效性和能量需求的集群树拓扑 WSN 的 TDMA 调度算法。该算法采用了一种优雅的方法，将数据传输的时序约束表示为调度周期长度的整数倍。而且，由于分布式算法非常适合 WSN 的稀缺资源，因此我们专注于允许每个集群提出其分配的时隙的分布式方法。该算法基于图论，如分布式最短路径、分布式拓扑排序、分布式图着色算法等。在多达数千个节点的基准实例上评估算法的效率，涉及构建调度的经过时间和能源消耗。