A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks

Details A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks

2004-05-12

arxiv.org/abs/cs/0405042v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536454