TDMA-based scheduling for multi-hop wireless sensor networks with 3-egress gateway linear topology

TL;DR

This paper proposes a TDMA-based scheduling framework for multi-hop wireless sensor networks with a 3-egress gateway linear topology, optimizing static time-slot allocation to maximize packet delivery success within one cycle.

Contribution

It introduces a novel static time-slot allocation method tailored for 3-egress gateway linear topologies, including three general path models for comprehensive coverage.

Findings

Derived global static time-slot allocations for all path models

Maximized the probability of successful packet delivery within one cycle

Provided a framework to reduce packet loss and recover lost packets

Abstract

Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We focus on centrally-managed Time Division Multiple Access (TDMA)-based slot allocations and provide the design of a packet transmission scheduling framework with static time-slot allocation and basic redundant transmission to reduce and recover packet losses. We proposed three general path models, which would represent all possible variations of this topology, and derived a global static time-slot allocation on each of models to maximize the theoretical probability that all packets are successfully delivered to one of the gateways within one cycle period.