TDMA Timeslot Scheduling for Multihop Wireless Sensor Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Duty-cycled MAC protocols in multihop wireless sensor networks experience significant latency due to the need for intermediate nodes to wait and forward packets, which can delay transmission by multiple wake-up periods, especially in resource-limited devices that require detailed network topology information.
Innovation Solution
A simple TDMA timeslot scheduling algorithm that assigns higher hop count nodes to earlier timeslots for uplink transmissions and lower hop count nodes to earlier timeslots for downlink transmissions, based solely on hop count, to minimize latency while reducing resource requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Use of energy by moving object
If duty-cycled MAC protocols are used to reduce power consumption, then power consumption is reduced, but latency increases significantly
Solution Approach 1:
The patent applies preliminary action by having intermediate nodes forward packets to the sink node in advance during their wake-up periods, even before the source node has completed transmission. This allows the sink node to have packets ready when the source node wakes up, significantly reducing the end-to-end latency while maintaining duty-cycled operation for power savings
Solution Approach 2:
The patent uses intermediate nodes as mediators that receive, store, and forward packets between the source and sink nodes. These intermediary nodes enable asynchronous communication by decoupling the transmission timing of source and sink nodes, allowing both to operate in duty-cycled mode while maintaining packet delivery
2Loss of time
If existing scheduling algorithms are used to minimize latency, then latency is reduced, but device complexity increases due to detailed topology information requirements
Solution Approach 1:
The patent extracts only the essential information needed for scheduling - specifically the hop count of each node - while discarding complex topology details such as neighbor lists and multi-hop delivery paths. This simplified information set enables effective latency reduction without burdening resource-constrained sensor devices with excessive data storage and processing requirements
Solution Approach 2:
The patent changes the scheduling parameter from complex topology information to a simple scalar value (hop count). This parameter transformation allows nodes to be scheduled based on their distance from the sink, providing effective latency optimization while maintaining compatibility with resource-limited sensor devices that cannot handle complex topology data
Data Source
AI summary
Various techniques are disclosed for assigning timeslots in a multihop wireless network. One such method includes, for each node for uplink timeslot assignments, assigning a higher hop count node to a timeslot that is to occur before all time slots assigned to lower hop count nodes. The method further includes, for each node for downlink timeslot assignments, assigning a lower hop count node to a timeslot that is to occur before all time slots assigned to higher hop count nodes.