一种分布式确定性冲突全写模型的TDMA算法
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
摘要：
提出了几种传感器网络自稳定时分多址（TDMA）算法。除了提供无冲突的通信服务之外，这样的算法使得能够将在分布式计算文献中考虑的抽象模型中编写的程序转换成与传感器网络一致的模型，即，写所有与碰撞（WAC）模型。现有的TDMA时隙分配算法具有以下特性中的一个或多个：（i）使用随机算法计算时隙，（ii）假设拓扑是预先已知的，和/或（iii）顺序地分配时隙。如果这些算法被用来将抽象程序转换成WAC模型中的程序，那么转换后的程序在概率上是正确的，不允许添加新的节点，和/或以顺序的方式收敛。在本文中，我们提出了一个自稳定的确定性TDMA算法的传感器只知道它的邻居。我们表明，插槽被分配给传感器在一个并发的方式，并从任意的初始状态开始，算法收敛到传感器之间的无冲突通信恢复的状态。此外，该算法有利于将抽象程序转换为WAC模型中确定性正确的程序。
英文摘要：
Several self-stabilizing time division multiple access (TDMA) algorithms are proposed for sensor networks. In addition to providing a collision-free communication service, such algorithms enable the transformation of programs written in abstract models considered in distributed computing literature into a model consistent with sensor networks, i.e., write all with collision (WAC) model. Existing TDMA slot assignment algorithms have one or more of the following properties: (i) compute slots using a randomized algorithm, (ii) assume that the topology is known upfront, and/or (iii) assign slots sequentially. If these algorithms are used to transform abstract programs into programs in WAC model then the transformed programs are probabilistically correct, do not allow the addition of new nodes, and/or converge in a sequential fashion. In this paper, we propose a self-stabilizing deterministic TDMA algorithm where a sensor is aware of only its neighbors. We show that the slots are assigned to the sensors in a concurrent fashion and starting from arbitrary initial states, the algorithm converges to states where collision-free communication among the sensors is restored. Moreover, this algorithm facilitates the transformation of abstract programs into programs in WAC model that are deterministically correct.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
