DocumentCode
512619
Title
A distributed multiple-slot assignment algorithm for wireless sensor networks
Author
Sinha, Arnab ; Das, Nabanita
Author_Institution
Adv. Comput. & Microelectron. Unit, Indian Stat. Inst., Kolkata, India
fYear
2009
fDate
14-16 Dec. 2009
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
scheduling; time division multiple access; wireless sensor networks; TDMA scheduling; conflict-free slot; distributed scheduling algorithm; frame length; message overhead; multiple slot assignment algorithm; wireless sensor networks; Access protocols; Broadcasting; Computer networks; Distributed algorithms; Microelectronics; Network topology; Processor scheduling; Scheduling algorithm; Time division multiple access; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Devices for Communication, 2009. CODEC 2009. 4th International Conference on
Conference_Location
Kolkata
Print_ISBN
978-1-4244-5073-2
Type
conf
Filename
5407182
Link To Document