Digraph network superframes

• US 20080285582A1
• Filed: 07/25/2008
• Published: 11/20/2008
• Est. Priority Date: 03/27/2004
• Status: Active Grant

• Current Assignee: Analog Devices International Unlimited Company (Analog Devices, Inc.)
• Original Assignee: Dust Networks Incorporated (Analog Devices, Inc.)
• Inventors: Shear, Robert M., Pister, Kristofer S.J.
• Granted Patent: US 7,873,043 B2
• Time in Patent Office: Days
• US Class Current: 370/431
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A method of assigning cells in a superframe using digraph link information in a network of nodes is disclosed. The method comprises determining a total number of desired digraph links in the network of nodes wherein a digraph link is a directional link specifying routing information at each node in the network between said node and a second node, and wherein the network of nodes includes a plurality of nodes each with a plurality of digraph links. The method further comprises selecting a superframe size at least large enough to accommodate the total number of desired digraph links and assigning each desired digraph link to a cell in the superframe wherein each cell in the superframe specifies a synchronized time and frequency communication plan.

Claims

1. A network of nodes comprising:

A plurality of nodes;

wherein each of the plurality of nodes is associated with at least one link;

wherein the at least one link comprises a periodic communication between two or more of the plurality of nodes; and

wherein a characteristic of the periodic communication is varied according to a known sequence.

2. A network as in claim 1, wherein the periodic communication is scheduled according to a superframe.

3. A network as in claim 2, wherein the superframe is one of a plurality of superframes.

4. A network as in claim 3, wherein the plurality of superframes are operating concurrently.

5. A network as in claim 1, wherein the periodic communication comprises transmitting an electromagnetic wave by a first node and receiving the electromagnetic wave by a second node.

6. A network as in claim 1, wherein the characteristic of the periodic communication that is varied comprises a frequency that is varied according to a known sequence.

7. A network as in claim 6, wherein the frequency comprises a frequency in the 902-928 MHz ISM band.

8. A network as in claim 6, wherein the frequency comprises a frequency in the 2.4-2.483 GHz ISM band.

9. A network as in claim 1, wherein the periodic communication occurs as part of a cycle.

10. A network as in claim 1, wherein the periodic communication occurs at a regular interval.

11. A network as in claim 1, wherein the periodic communication occurs at a known irregular interval.

12. A network as in claim 1, wherein the periodic communication includes an acknowledgement of receipt.

13. A network as in claim 1, wherein the at least one link includes a redundant link.

14. A network as in claim 13, wherein the redundant link is not used in the event that there is no data to be sent.

15. A network as in claim 1, wherein a node of the plurality of nodes includes a crystal oscillator.

16. A network as in claim 15, wherein the crystal oscillator comprises a 32 kHz quartz crystal.

17. A network as in claim 15, wherein the node includes a temperature sensor.

18. A network as in claim 15, wherein the node includes a compensation circuit.

19. A network as in claim 1, wherein the two or more of the plurality of nodes that are associated with the periodic communication are synchronized in time.

20. A network as in claim 19, wherein the two or more of the plurality of nodes are synchronized in time at least in part by exchanging timing information.

21. A network as in claim 1, wherein the at least one link is between a transmitting vertex and a receiving vertex.

22. A network as in claim 21, wherein one of the two or more of the plurality of nodes associated with the at least one link comprises the transmitting vertex.

23. A network as in claim 21, wherein one of the two or more of the plurality of nodes associated with the at least one link comprises the receiving vertex.

24. A network as in claim 21, wherein the transmitting vertex is associated with a digraph.

25. A network as in claim 21, wherein the receiving vertex is associated with a digraph vertex.

26. A method of communicating for a network of nodes comprising:

transmitting a communication from a node to one or more of a plurality of network nodes;

wherein each of the plurality of nodes is associated with at least one link;

wherein the at least one link comprises a periodic communication;

wherein a characteristic of the periodic communication is varied according to a known sequence.

27. A method of communicating for a network of nodes comprising:

receiving a communication at one or more nodes from one of a plurality of network nodes;

wherein each of the plurality of nodes is associated with at least one link;

wherein the at least one link comprises a periodic communication;

wherein a characteristic of the periodic communication is varied according to a known sequence.