A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
T. Herman, S. Tixeuil
Abstract
Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule transmission in slots to avoid collision, however these methods often lack scalability when implemented in ad hoc networks subject to node failures and dynamic topology. This paper reports a distributed algorithm for TDMA slot assignment that is self-stabilizing to transient faults and dynamic topology change. The expected local convergence time is O(1) for any size network satisfying a constant bound on the size of a node neighborhood.
Create a lesson
Related papers
flash-comm: Self-Synchronizing Collective Communication for LLM Decoding
Carrie Wang, Jack Li, Jason Zhao
AtomicFaaS: Offloading Side-Effect Compensation to the Serverless Platform
Jonas Heisterberg, Sebastian Koch, Trever Schirmer et al.
Optimal Subcubic Byzantine Agreement with Plain PKI
Marc Dufay, Roger Wattenhofer
Weaver: Unlocking Blockchain Transaction Parallelism through State-Decoupled Symbolic Execution
Ru Cheng, Maofan Yin, Liangrong Chen et al.
Performance Portability of Out-of-Kernel Optimizations on GPUs: A Molecular Docking Case Study
Gianmarco Accordi, Leonardo Beltrame, Theresa Pollinger et al.
Chiron: Cache Management Empowered by LLM Intelligence for AI Workloads
Bohan Zhang, Renshu Ge, Tianze Wang et al.