Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
