Finding missing wireless nodes

• US 10,080,225 B2
• Filed: 06/08/2016
• Issued: 09/18/2018
• Est. Priority Date: 06/08/2016
• Status: Active Grant

• Current Assignee: Simmonds Precision Products, Inc. (Raytheon Technologies Corporation d/b/a RTX)
• Original Assignee: Simmonds Precision Products, Inc. (Raytheon Technologies Corporation d/b/a RTX)
• Inventors: Rittenhouse, Garret Edward
• Primary Examiner(s): Kassim, Khaled
• Application Number:
  US15/176,410
• Publication Number:
  US 20170359818A1
• Time in Patent Office: 832 Days
• CPC Class Codes: H04W 24/04 Arrangements for maintaining operational condition
• CPC Class Codes: H04W 72/0446 Resources in time domain, e.g. slots or frames
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 8/22 Processing or transfer of terminal data, e.g. status or physical capabilities
• CPC Class Codes: H04W 84/20 Master-slave selection or change arrangements

Abstract

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.

Claims

1. A method for finding missing wireless nodes, comprising:

creating a repeating schedule of communication between a data concentrator and one or more nodes wherein the data concentrator attempts to communicate with each of the one or more nodes at a discrete time slot for each node, wherein the schedule of communication further includes at least one dead time slot wherein the data concentrator does not attempt to communicate with any of the one or more nodes;

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;

attempting to communicate with each missing node during the at least one dead time slot; and

modifying the schedule to include dead time slots for each missing node, wherein if communications with a missing node has been reestablished, reestablishing the schedule to include the found node.

2. The method of claim 1, wherein the predetermined amount of discrete time slots is one.

3. The method of claim 1, wherein the predetermined amount of time slots is more than one.

4. The method of claim 1, wherein the at least one dead time slot is at the end of the repeating schedule.

5. The method of claim 1, wherein the at least one dead time slot is between discrete time slots for two or more of the nodes.

6. A non-transitory computer readable medium, comprising computer executable instructions that cause a processor to perform a method for finding missing wireless nodes, the method comprising:

creating a repeating schedule of communication between a data concentrator and one or more nodes wherein the data concentrator attempts to communicate with each of the one or more nodes at a discrete time slot for each node, wherein the schedule of communication further includes at least one dead time slot wherein the data concentrator does not attempt to communicate with any of the one or more nodes;

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;

attempting to communicate with each missing node during the at least one dead time slot; and

modifying the schedule to include dead time slots for each missing node, wherein if communications with a missing node has been reestablished, reestablishing the schedule to include the found node.

7. The non-transitory computer readable medium of claim 6 wherein the predetermined amount of discrete time slots is one.

8. The non-transitory computer readable medium of claim 6 wherein the predetermined amount of time slots is more than one.

9. The non-transitory computer readable medium of claim 6, wherein the at least one dead time slot is at the end of the repeating schedule.

10. The non-transitory computer readable medium of claim 6, wherein the at least one dead time slot is between discrete time slots for two or more of the nodes.