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

A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs

Bhatia, Ashutosh and Hansdah, RC (2013) A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs. In: Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on . pp. 377-384.

[img] PDF
Adv_inf_net_app_wor_377_2013.pdf
Restricted to Registered users only

Download (595kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/WAINA.2013.23

Abstract

In wireless sensor networks (WSNs) the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting at the same time. Such a situation is known as spatially correlated contention. The random access methods to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration and therefore generating an optimal or sub-optimal schedule is not very useful. On the other hand, if the algorithm takes very large time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. To efficiently handle the spatially correlated contention in WSNs, we present a distributed TDMA slot scheduling algorithm, called DTSS algorithm. The DTSS algorithm is designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph. The algorithm uses randomized TDMA channel access as the mechanism to transmit protocol messages, which bounds the message delay and therefore reduces the time required to get a feasible schedule. The DTSS algorithm supports unicast, multicast and broadcast scheduling, simultaneously without any modification in the protocol. The protocol has been simulated using Castalia simulator to evaluate the run time performance. Simulation results show that our protocol is able to considerably reduce the time required to schedule.

Item Type: Journal Article
Publication: Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on
Publisher: IEEE
Additional Information: IEEE 27th International Conference on Advanced Information Networking and Applications Workshops (WAINA), Barcelona, SPAIN, MAR 25-28, 2013
Keywords: TDMA Scheduling; Media Access Control; Wireless Sensor Networks
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 13 Feb 2014 09:52
Last Modified: 13 Feb 2014 09:52
URI: http://eprints.iisc.ac.in/id/eprint/48283

Actions (login required)

View Item View Item