ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs

Bhatia, Ashutosh and Hansdah, RC (2014) A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs. In: 9th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), MAY 26-28, 2014, Marina Del Rey, CA, pp. 294-301.

[img] PDF
2014-IEEE_Int_Con_on_Dis_Com_in_Sen_Sys_294_2014.pdf - Published Version
Restricted to Registered users only

Download (248kB) | Request a copy
Official URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?...


The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.

Item Type: Conference Proceedings
Series.: IEEE International Conference on Distributed Computing in Sensor Systems
Publisher: IEEE
Additional Information: Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Keywords: Wireless Sensor Networks; Media Access Control; TDMA scheduling
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 09 Oct 2015 05:55
Last Modified: 09 Oct 2015 05:55
URI: http://eprints.iisc.ac.in/id/eprint/52529

Actions (login required)

View Item View Item