DECENTRALIZED TDMA SCHEDULING FOR WIRELESS SENSOR NETWORK

Abstract

Energy conservation is a major issue in Wireless Sensor Network (WSN). In order to obtain energy conservation, Time Division Multiple Access (TDMA) has been discussed as one of the potential solution. Many researchers proposed TDMA as a Media Access Control (MAC) in order to conserve energy. The main advantage to using TDMA MAC is avoidance of collision of data packets during transmission and the added facility to use sleep modes. The use of sleep mode enables switching off the radio antennas thus reducing the energy conservation.

Prior to usage of TDMA MAC, scheduling of the sensor nodes, i.e. providing time slot to the sensor nodes must be performed. Efficient scheduling of transmitting time slot in a TDMA is important for low power Wireless Sensor Network. This thesis deals with the issue of scheduling.

In this thesis, two decentralized scheduling algorithms “Distributed Randomized TDMA (DRAND)” and “Deterministic Distributed TDMA (DDTDMA)” are compared. In these algorithms, flowing the messages among the sensor nodes the scheduling is performed by assigning transmitting time slot to each node. So, their efficiency is analyzed based on schedule length, message complexity and convergence time to obtain scheduling. It is shown that DDTDMA is efficient algorithm than DRAND in terms of schedule length, message complexity and convergence time.