A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks

Simple item page
dc.creatorHerman, T.
dc.creatorTixeuil, S.
dc.date2004-05-12
dc.date2004-05-19
dc.date.accessioned2026-07-07T03:21:15Z
dc.date.available2026-07-07T03:21:15Z
dc.descriptionWireless 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.
dc.identifierhttps://arxiv.org/abs/cs/0405042
dc.identifierhttp://arxiv.org/abs/cs/0405042
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32123
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectNetworking and Internet Architecture
dc.subjectC.2.1; C.2.5; H.3.4
dc.titleA Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
dc.typetext

Files

Collections

arXiv