Wireless Data Networking

• US 20080291855A1
• Filed: 11/14/2007
• Published: 11/27/2008
• Est. Priority Date: 11/14/2006
• Status: Active Grant

• Current Assignee: Raytheon Company (Rtx Corporation)
• Original Assignee: Phase IV Engineering, Inc.
• Inventors: Kramer, David, Engle, Randy Lyle, Crismon, Kenneth Ray, Bata, Anthony Paul
• Granted Patent: US 8,149,748 B2
• Time in Patent Office: Days
• US Class Current: 370/311
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 56/00 Synchronisation arrangements
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A meshing network comprising one full function controller (WDC) and a plurality of nodes (WDN, WSN), that is RF quiet capable with very low power consumption and the ability to quickly heal itself and create new network paths. The network uses an addressing scheme that allows for each node to not have a network map but still be able to route messages. A piping scheme allows a mesh to become a high throughput network. A sensor rail protocol definition allows sensor devices to connect to nodes and route messages through the network.

Claims

1. In a wireless network comprising a network controller (NC) and a plurality of network nodes (NN) arranged hierarchically, from a first group (GR1) which is closest to the NC to a last group (GRn) which is farthest from the NC, a method of operating the network comprising:

providing a Sleep/RF Quiet mode of operation, wherein the NC does not send out sync messages; and

providing a Network Running mode of operation, wherein the NC sends out sync messages.

2. The method of claim 1, further comprising:

providing a Pipeline mode of operation, wherein the WDC and one of the network nodes set up a pipeline, from the NN to the NC, through any intermediate NNs.

3. The method of claim 1, wherein:

in the Network Running mode, providing a slow sync mode when all devices that should have reported in have reported in, otherwise entering a fast sync mode.

4. The method of claim 1, wherein a data frame comprises:

a sync period followed by at least one data period; and

a first portion of the sync period is divided into a plurality of sub-periods for downstream synchronization, and a second portion of the sync period is divided into a plurality of sub-periods for upstream requests.

5. The method of claim 1, wherein:

in the Sleep/RF Quiet mode, a NN listens periodically, such as every 5 minutes for 5 seconds, for a synchronization message from the NC and, if there is no sync message, goes back to sleep.

6. The method of claim 5, wherein:

as time goes by, and no sync messages are detected, the NN backs off, such as in 15 second increments) until it is sleeping most of the time.

7. The method of claim 6, wherein:

the backing off is adjusted dynamically, either by the NC or by the NN itself.

8. The method of claim 1, further comprising:

(a) the sync message sent by the NC specifies that it is a parent in Group 0;

(b) when the sync message is received by a NN in the first group, which is a child of the NC, the NN modifies the sync message to indicate that it is parent in the first group, and resends the modified sync message;

(c) when the modified sync message is received by a NN in a next group, which is child to a parent in the previous group, the NN in the next group modifies the sync message to indicate that it is parent in the following group, and resends the modified sync message;

(d) repeating the step (c) until the sync message is modified and sent by a next to the last group; and

(e) when the sync message is received by a NN in the last group, an upstream request portion of the sync period opens up for NNs to send requests to send data to the NC.

9. The method of claim 1, wherein:

sync messages are send out in a sync period;

the network is set up to accommodate a number G of groups;

the sync period comprises at least 2×

G sub-periods (SPs);

a first portion of the SPs are allocated for downstream synchronization; and

a second portion of the SPs are allocated for upstream requests.

10. The method of claim 9, wherein:

(a) the NC is designated as Group 0 (Gr0)

(b) in a first SP of the first portion of the SPs, the NN device in GR0 transmits, and the NN devices in Gr1 listen;

(c) in a next SP of the first portion of the SPs, the NN devices in GR1 transmit, and the NN devices in GR2 listen; and

(d) repeating the step (c) until the last group GRn is reached.

11. The method of claim 10, further comprising:

(e) in a first SP of the second portion of the SPs, the NN devices in the last group GRn transmit, and the NN devices in the next group (GRn−

1) closer to GR0 listen;

(g) repeating the step (e) until the NC (GR0) is reached.

12. The method of claim 1, wherein:

data messages are send out in a data period;

the network is set up to accommodate a number G of groups;

the data period comprises at least 2×

G sub-periods (SPs);

the NNs are arranged in EVEN-numbered and ODD-numbered groups;

the NNs in the ODD-numbered groups listen for transmissions from the NNs in the EVEN-numbered groups in two consecutive SPs; and

the NNs in the EVEN-numbered groups listen for transmissions from the NNs in the ODD-numbered groups in two consecutive SPs.

13. The method of claim 12, wherein:

a SP before and after the two consecutive SPs is allocated for the NNs in the respective ODD-numbered or EVEN-numbered group to prepare and continue to listen to the NNs in the respective EVEN-numbered or ODD-numbered group

14. The method of claim 1, further comprising:

providing sensors associated with at least some of the NNs; and

formatting data packets in a markup language which allows for the ability to dynamically change or update messages.

15. The method of claim 14, further comprising:

using a protocol to discover sensors, control those sensors, configure those sensors and report addressing and sensor events back to the NC.

16. The method of claim 1, wherein:

the network comprises a meshing network.

17. The method of claim 1, wherein:

the network is based on IEEE 802.15.4.

18. The method of claim 1, wherein:

the devices (NN and NC) are synced in a manner that their radios dos not have to be up very often.

19. In a wireless network comprising a network controller (NC) and a plurality of network nodes (NN) arranged hierarchically, from a first group (GR1) which is closest to the NC to a last group (GRn) which is farthest from the NC, a method of operating the network comprising:

providing a pipeline mode of operation wherein when the NC requests a pipe to the NN, and it is built from the NN to the NC on the next frame.

20. A wireless network comprising a single network controller (NC) and a plurality of network nodes (NNs) comprising:

an addressing scheme that permits network nodes (NNs) to route messages without a network map;

wherein network timing information is sent out on a sync message.