Efficient network data dissemination

• US 9,197,510 B2
• Filed: 09/30/2013
• Issued: 11/24/2015
• Est. Priority Date: 09/30/2013
• Status: Active Grant

• Current Assignee: Silicon Laboratories Incorporated
• Original Assignee: Silicon Laboratories Incorporated
• Inventors: Kelsey, Richard, Paris, Matteo
• Primary Examiner(s): WILSON, ROBERT W
• Application Number:
  US14/041,066
• Publication Number:
  US 20150092606A1
• Time in Patent Office: 785 Days
• US Class Current: 1/1
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update

Abstract

A method of efficiently disseminating various types of information throughout a mesh network is disclosed. Information is typically propagated through the network using a variety of protocols and messages. However, in one embodiment, a single message, communicates all of this information at once. The message includes data originating at the leader, which does not change as the messages are propagated through the network, as well as topology and link information that is created by the forwarding nodes. The data originating at the leader includes the identity of the leader node and a sequence number. Additionally, a version number is included by the leader which represents the state of the quasi-static information. Quasi-static information may include, for example, the identity of a node that has access to a central control system or the internet. This compact message format allows improved efficiency and use of the network.

Claims

1. A method of disseminating information throughout a mesh network, said mesh network comprising a plurality of nodes and a leader node which maintains a list of routers, said method comprising:

creating a beacon message at said leader node, said beacon message comprising;

an identity of said leader node;

a sequence number;

a version number associated with quasi-static network information;

a first network topology portion, said first network topology portion comprising entries for each of said routers in said network, a cost of reaching each of said routers from said leader node, and a next hop to be used when communicating from said leader node with each of said routers; and

first link information indicating link quality and protocol state of each of said routers that is a neighbor of said leader node;

transmitting said beacon message from said leader node;

receiving said beacon message by a first router disposed within a listening range of said leader node;

creating a first routing table in a memory device within said first router using said first network topology and first link information from said received beacon message, and using link information learned about neighbors of said first router;

transmitting a second beacon message from said first router, said second beacon message comprising;

said identity of said leader node;

said sequence number;

said version number associated with quasi-static network information;

a second network topology portion; and

second link information;

wherein information from said first routing table is incorporated in said second network topology portion and said second link information.

2. The method of claim 1, wherein said beacon message comprises a single message.

3. The method of claim 1, wherein an identity of each router is determined implicitly based on a location within said beacon message.

4. The method of claim 1, further comprising:

receiving a beacon message with said sequence number at a router after said router has already transmitted a beacon message with said sequence number; and

updating a routing table located in said router without transmitting a second beacon message with said sequence number.

5. The method of claim 1, further comprising:

receiving a beacon message with said sequence number at said leader node after said leader node has already transmitted a beacon message with said sequence number;

updating a routing table in a memory located in said leader node, without transmitting a second beacon message with said sequence number; and

sending a beacon message from said leader node with information from said updated routing table using a sequence number different than said sequence number.

6. The method of claim 1, wherein said quasi-static network information comprises information related to services available within said mesh network.

7. The method of claim 1, further comprising:

receiving a beacon message with said version number at a router;

comparing said received version number to a previously stored version number; and

requesting said quasi-static network information from the node from which said beacon was sent if said received version number differs from said stored version number; and

storing said received version number.

8. A method of disseminating information in a mesh network comprising a plurality of routers, comprising:

transmitting from a first router, a single beacon message, said beacon message comprising;

a sequence number;

a version number associated with quasi-static network information;

a first network topology portion, said first network topology portion comprising entries for each of said routers in said network, a cost of reaching each of said routers from said first router, and a next hop to be used when communicating from said first router with each of said routers; and

first link information indicating link quality and protocol state of each of said routers that is a neighbor of said first router.

9. The method of claim 8, wherein said quasi-static network information comprises information related to services available within said mesh network.

10. The method of claim 8, further comprising:

receiving at a second router, said beacon message from said first router; and

updating, in a memory located within said second router, a routing table, said routing table having entries comprising a cost of reaching each of said routers from said second router, a next hop to be used when communicating from said second router with each of said routers, based on said received beacon message.

11. The method of claim 10, further comprising:

creating, at said second router, a second beacon message, said second beacon message comprising;

said sequence number;

said version number associated with quasi-static network information;

a second network topology portion, said updated network topology portion comprising entries for each of said routers in said network, a cost of reaching each of said routers from said second router, and a next hop to be used when communicating from said second router with each of said routers; and

second link information indicating link quality and protocol state of each of said routers that is a neighbor of said second router.

12. The method of claim 11, wherein said second network topology portion is created based on said routing table.

13. The method of claim 11, wherein said second link information is created based on communications between said second router and each of said routers that is a neighbor of said second router.

14. The method of claim 8, further comprising saving in a memory located within said second router, said received sequence number if said received sequence number is greater than one previously stored in said memory.

15. The method of claim 8, wherein an identity of each router is determined implicitly based on a location within said beacon message.

16. The method of claim 8, wherein said first link information is created based on communications between said first router and each of said routers that is a neighbor of said first router.