In this paper, a distributed scheduling algorithm is proposed for multiple slot assignment in wireless sensor networks for TDMA scheduling that attempts to minimize the frame length, ensuring at least one conflict-free slot for each node. Simulation studies have been done to compare the performance of the proposed algorithm with earlier ones that shows improvement in terms of frame length and message overhead indicating that the proposed algorithm will perform better for dense network.
Published in:
Computers and Devices for Communication, 2009. CODEC 2009. 4th International Conference on
Date of Conference: 14-16 Dec. 2009