DSLR: A Distributed Schedule Length Reduction Algorithm for WSNs

Bhatia, Ashutosh and Hansdah, RC (2015) DSLR: A Distributed Schedule Length Reduction Algorithm for WSNs. In: 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS), MAY 25-29, 2015, Hyderabad, INDIA, pp. 365-374.

PDF IEEE_IPDPS_365_2015.pdf - Published Version Restricted to Registered users only Download (341kB) | Request a copy

Abstract

Wireless sensor networks (WSNs) benefit from the MAC protocols that reduce power consumption by avoiding frame collisions. Time Division Multiple Access (TDMA) method provides collision free channel access by employing a pre-defined schedule so that the nodes can transmit at their allotted time slots. Most of the existing distributed TDMA-scheduling techniques for WSNs either try to improve the channel utilization by generating a compact schedule which usually takes longer time, or generate a schedule quickly, that may not be very efficient in terms of the schedule length. In this paper, we present a new approach to TDMA-scheduling for WSNs, that bridges the gap between these two extreme types of TDMA-scheduling techniques, by providing the flexibility to trade-off the schedule length with the time required to generate the schedule, as per the requirements of the underlying applications and channel conditions. The idea is to generate a TDMA-schedule quickly using any of the existing algorithms, and then progressively reduce the TDMA-schedule length. In this context, we provide a distributed schedule length reduction (DSLR) algorithm which can be terminated after the execution of arbitrary number of iterations, and still be left with a valid schedule. Additionally, unlike other TDMA-scheduling algorithms which use contention-based channel access, the DSLR algorithm uses TDMA-based channel access to perform the schedule reduction. 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 confirm the effectiveness of the approach, and show that the proposed algorithm generates a compact schedule in much less time in comparison to existing approaches.

Item Type:	Conference Proceedings
Series.:	International Parallel and Distributed Processing Symposium IPDPS
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	22 Oct 2016 08:59
Last Modified:	22 Oct 2016 08:59
URI:	http://eprints.iisc.ac.in/id/eprint/54961

Actions (login required)

View Item