Wireless Node Recovery via Dead Time Slots

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods for wireless networks struggle to effectively locate and reestablish communication with intermittent or faulty nodes, particularly those powered by battery or energy harvesting technologies, which can lose connectivity due to power failures or environmental changes, without disrupting operational node communication schedules.

Innovation Solution

A method involving a data concentrator that creates a repeating communication schedule with 'dead' time slots to identify missing nodes by attempting communication during discrete and dead time slots, allowing for reestablishment of connections without interrupting operational communications.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the data concentrator continuously attempts to communicate with all nodes during scheduled time slots, then communication reliability is improved, but network complexity and energy consumption increase

Engineering Contradiction:
Improvecommunication reliabilityVSAvoidnetwork complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The communication schedule is segmented into discrete time slots, with specific slots allocated for communicating with individual nodes. This segmentation allows the system to systematically track which nodes are present and which are missing, improving reliability without requiring complex continuous monitoring mechanisms.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system uses periodic communication attempts at scheduled intervals rather than continuous monitoring. By establishing repeating schedules with dead time slots, the system can detect missing nodes efficiently while reducing overall network complexity and energy requirements.

Inventive Principle:
Principle #19Periodic action

2Ease of repair

If the data concentrator implements a repeating communication schedule with dead time slots to identify missing nodes, then node recovery capability is improved, but communication time efficiency deteriorates

Engineering Contradiction:
Improvenode recovery capabilityVSAvoidcommunication time efficiency
Core Design Contradiction:
Ease of repairVSLoss of time

Solution Approach 1:

Dead time slots are pre-planned and built into the communication schedule in advance. This preliminary structuring allows the system to efficiently identify and attempt recovery of missing nodes during predetermined intervals without disrupting the overall communication flow, balancing recovery capability with time efficiency.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If the data concentrator attempts to communicate with missing nodes during dead time slots, then network robustness is improved, but energy consumption increases

Engineering Contradiction:
Improvenetwork robustnessVSAvoidenergy consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The communication schedule maintains continuous useful action by allocating dead time slots specifically for recovery attempts. This ensures that the data concentrator can continuously monitor and recover missing nodes without interrupting the operational communication schedule, maintaining network robustness while managing energy consumption through structured, non-random attempts.

Inventive Principle:
Principle #20Continuity of useful action

Data Source

PatentEP3255944B1Finding missing wireless nodes
Publication Date: 2019.09.04 SIMMONDS PRECISION PRODUCTS INC
  • EP3255944B1 patent drawingFigure 1

AI summary

A method for finding missing wireless nodes includes creating a repeating schedule of communication between a data concentrator and one or more nodes such that the data concentrator attempts to communicate with each of the one or more nodes at a discrete time slot for each node. The schedule of communication further includes at least one dead time slot such that the data concentrator does not attempt to communicate with any of the one or more nodes. The method also includes determining if each node has communicated with the data concentrator during a predetermined amount of discrete time slots, identifying each node that does not communicate with the data concentrator during the predetermined amount of discrete time slot as a missing node, and attempting to communicate with each missing node during the at least one dead time slot.