IP Library Granted Patent US 10,849,067
Granted Patent B2
US 10,849,067 · App. 16/364,032 · Granted Nov 24, 2020

Networked evacuation system

Inventors: Chris Snyder (Blanchardville, WI); Kurt Joseph Wedig (Mount Horeb, WI); Daniel Ralph Parent (Mount Horeb, WI); Anton Vermaak (Mount Horeb, WI); Scott Holmstrom (Mount Horeb, WI)
Assignee: OneEvent Technologies, Inc.
H04W52/0216H04W52/0277Y02D70/00Y02D70/164Y02D70/22
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,849,067
App. No.
16/364,032
Granted
Nov 24, 2020
Kind
B2
Abstract

A method includes determining, by a first node in a communication network, a listening schedule to be used by the first node. The listening schedule is based at least in part on a battery life of the first node. The method also includes transmitting, by the first node, the listening schedule to a second node in the communication network such that the second node is able to communicate with the first node in accordance with the listening schedule.

Claims (29)

1. A method comprising:

determining, by a first node in a communication network, a listening schedule to be used by the first node, wherein the listening schedule is based upon timing information received from a plurality of nodes in the communication network and an expected battery life of the first node, and wherein the first node combines the timing information received from the plurality of nodes to adjust the timing information of the first node, wherein determining the listening schedule comprises weighting the timing information received from the plurality of nodes; and

transmitting, by the first node, the listening schedule to a second node in the communication network such that the second node is able to communicate with the first node in accordance with the listening schedule.

2. The method of claim 1 , wherein the listening schedule is transmitted in an acknowledgement message.

3. The method of claim 1 , wherein the listening schedule is further based on a battery life of the first node, and wherein the battery life comprises an actual battery life.

4. The method of claim 1 , wherein the listening schedule is further based on a battery life of the first node, and wherein the battery life comprises a desired battery life.

5. The method of claim 1 , wherein the listening schedule is further based on a battery life of the first node, and wherein the method further comprises adjusting, by the first node, the listening schedule based on an updated battery life information for the first node.

6. The method of claim 1 , further comprising defining, by the first node, a number of slots that constitute a frame, and wherein the listening schedule comprises one or more slots within each frame.

7. The method of claim 6 , wherein each of the plurality of nodes in the communication network defines its own frame length such that different nodes can have different frame lengths.

8. The method of claim 1 , further comprising assigning an absolute slot number to each slot in the communication network.

9. The method of claim 1 , further comprising forcing, by the first node, the second node to at least temporarily use a dedicated schedule, wherein the dedicated schedule comprises the listening schedule of the first node.

10. The method of claim 9 , wherein the dedicated schedule expires after a predetermined number of slots.

11. The method of claim 1 , wherein the first node combines the timing information received from the plurality of nodes by

averaging the timing information received from the plurality of nodes, and wherein the first node adjusts the timing information of the first node based on the averaged timing information.

12. The method of claim 11 , further comprising weighting, by the first node, the timing information received from a third node based at least in part on a distance between the first node and the third node.

13. The method of claim 11 , further comprising weighting, by the first node, the timing information received from a third node based at least in part on a hardware type of the third node.

14. The method of claim 11 , further comprising weighting, by the first node, the timing information received from a third node based at least in part on a reliability of the third node.

15. A first node in a communication network comprising: a memory;

a processor operatively coupled to the memory, wherein the processor is configured to determine a listening schedule to be used by the first node, wherein the listening schedule is based upon timing information received from a plurality of nodes in the communication network and an expected battery life of the first node, and wherein the first node combines the timing information received from the plurality of nodes to adjust the timing information of the first node, wherein determining the listening schedule comprises weighting the timing information received from the plurality of nodes; and

a transmitter operatively coupled to the processor, wherein the transmitter is configured to transmit the listening schedule to a second node in the communication network such that the second node is able to communicate with the first node in accordance with the listening schedule.

16. The first node of claim 15 , wherein the processor is configured to define a number of slots that constitute a frame, and wherein the listening schedule comprises one or more slots within each frame.

17. The first node of claim 16 , wherein each node in the communication network defines its own frame length such that different nodes can have different frame lengths.

18. The first node of claim 15 , wherein the processor is further configured to adjust the listening schedule of the first node based on a battery life of the first node.

19. A non-transitory computer-readable medium having computer-readable instructions stored thereon for execution by a first node in a communication network, the instructions comprising:

instructions to determine a listening schedule to be used by the first node, wherein the listening schedule is based upon a timing information received from a plurality of nodes in the communication network and an expected battery life of the first node, and wherein the first node combines the timing information received from the plurality of nodes to adjust the timing information of the first node at least in part on a battery life of the first node, wherein determining the listening schedule comprises weighting the timing information received from the plurality of nodes; and

instructions to transmit the listening schedule to a second node in the communication network such that the second node is able to communicate with the first node in accordance with the listening schedule.

20. The non-transitory computer-readable medium of claim 19 , wherein the first node combines the timing information received from the plurality of nodes by

averaging the received timing information; and

wherein the first node adjusts the timing information of the first node based on the averaged timing information.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2022
From: WEDIG, KURT JOSEPH; PARENT, DANIEL RALPH; VERMAAK, ANTON; HOLMSTROM, SCOTT; SNYDER, CHRIS
To: ONEEVENT TECHNOLOGIES, INC.
Reel/Frame 059470/0211 →
Continuity (4)
Continuation 15468532 · Mar 24, 2017
Continuation 14209472 · Mar 13, 2014
Provisional Application 61789084 · Mar 15, 2013
Related Publication 20190223099A1 · Jul 18, 2019
Cited By (1)
US 12,614,434