TRASA: TRaffic Aware Slot Assignment Algorithm in Wireless Sensor Networks

TL;DR

This paper introduces TRASA, a traffic-aware slot assignment algorithm for wireless sensor networks that allocates channels based on demand, improving bandwidth efficiency and reducing congestion.

Contribution

The paper proves the NP-completeness of the slot assignment problem and proposes TRASA, a novel algorithm that optimally allocates slots proportionally to sensor demands.

Findings

TRASA improves spatial reuse.

TRASA minimizes cycle length.

Proven NP-completeness of the slot assignment problem.

Abstract

In data gathering applications which is a typical application paradigm in wireless sensor networks, sensor nodes may have different traffic demands. Assigning equal channel access to each node may lead to congestion, inefficient use of the bandwidth and decrease of the application performance. In this paper, we prove that the time slot assignment problem is NP-complete when p-hop nodes are not assigned the same slot, with 1 <= p <= h for any strictly positive integer h. We propose TRASA, a TRaffic Aware time Slot Assignment algorithm able to allocate slots to sensors proportionally to their demand. We evaluate the performance of TRASA for different heuristics and prove that it provides an optimized spatial reuse and a minimized cycle length.