By Topic

A Deterministic Distributed TDMA Scheduling Algorithm for Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yu Wang ; Dept. of Electron. Syst. Eng., Essex Univ., Colchester ; Henning, I.

Efficient scheduling of time slots in a time division multiple access scheme (TDMA) is important for low power wireless sensor networks. Existing algorithms are either centralized with poor scalability, or distributed but with high complexity. In this paper, we explain how TDMA could be more energy efficient by careful slot scheduling in wireless sensor networks. Then we propose a deterministic distributed TDMA scheduling algorithm (DD-TDMA). In DD-TDMA, each sensor node schedules its own TDMA slot based on its neighborhood information, and packet collisions are gracefully avoided during scheduling. The experimental results show that compared to other centralized and distributed scheduling algorithms, DD-TDMA achieves better performance in terms of schedule length, running time and message complexity.

Published in:

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference:

21-25 Sept. 2007