A Deterministic Distributed TDMA Scheduling Algorithm for Wireless Sensor Networks

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...

Full description

Saved in:
Bibliographic Details
Published in2007 International Conference on Wireless Communications, Networking and Mobile Computing pp. 2759 - 2762
Main Authors Yu Wang, Henning, I.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2007
Subjects
Energy consumption
Energy efficiency
Power engineering and energy
Protocols
Scalability
Scheduling algorithm
Switches
Time division multiple access
Transceivers
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1424413117
9781424413119
ISSN:2161-9646
DOI:10.1109/WICOM.2007.685