A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks

TL;DR

This paper introduces a distributed, self-stabilizing TDMA slot assignment algorithm for wireless sensor networks that efficiently adapts to topology changes and node failures, ensuring collision-free communication.

Contribution

It presents a novel distributed algorithm that guarantees quick local convergence and robustness in dynamic wireless sensor network environments.

Findings

Expected local convergence time is O(1) for networks with bounded neighborhood size.

The algorithm is self-stabilizing to transient faults and topology changes.

Improves scalability and reliability of TDMA scheduling in ad hoc networks.

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 \emph{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.