System and method for route learning and auto-configuration

• US 9,226,219 B2
• Filed: 12/21/2011
• Issued: 12/29/2015
• Est. Priority Date: 12/21/2011
• Status: Active Grant

• Current Assignee: Itron Networked Solutions, Inc. (Itron, Inc.)
• Original Assignee: Silver Spring Networks, Inc. (Itron, Inc.)
• Inventors: Hughes, Sterling, Hunt, Peter, Van Greunen, Jana
• Primary Examiner(s): Hamza, Faruk
• Assistant Examiner(s): DECKER, CASSANDRA L
• Application Number:
  US13/334,037
• Publication Number:
  US 20130163466A1
• Time in Patent Office: 1,469 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 48/12 using downlink control channel
• CPC Class Codes: H04W 48/14 using user query or user detection

Abstract

In an embodiment of a wireless network, when a node joins the network and receives a routing advertisement, such a node transmits the routing advertisement to all its neighbors. The node then receives transmission from the neighboring nodes indicating interest in joining the advertised network. If more than a threshold number of neighboring nodes are interested in the advertised route, the newly joining node inserts the route advertisement in a beacon transmission. If there is not a threshold level of interest, the node unicasts only to the neighbors who indicated interest in the advertised network. In an embodiment, the node repeats the above steps on a predetermined time basis (e.g., one per day) in order to determine interest in the advertised route that may have newly arisen.

Claims

1. A computer-implemented method for reducing transmission overhead in a first network, the method comprising:

configuring a first node to join the first network;

receiving a plurality of routing advertisements associated with the first network;

transmitting the plurality of routing advertisements to a first plurality of nodes that belong to a second network and are neighbors of the first node;

receiving an indication of interest from one or more nodes included in the first plurality of nodes in response to the plurality of routing advertisements that were transmitted,

wherein the indication of interest indicates a first route included in the plurality of routing advertisements;

accumulating a count of the received indications of interest;

determining whether the count exceeds a predetermined threshold; and

inserting the plurality of routing advertisements in a beacon packet for broadcast transmission when the count exceeds the predetermined threshold;

or

inserting the plurality of routing advertisements in a unicast packet for unicast transmission to a node in the one or more nodes when the count does not exceed the predetermined threshold.

2. The method of claim 1, wherein the first network comprises a distribution automation network.

3. The method of claim 1, wherein the first network comprises a wireless network.

4. The method of claim 3, wherein the wireless network comprises a multi-channel frequency hopping spread spectrum network.

5. The method of claim 1, wherein the first network comprises a wired network.

6. The method of claim 1, wherein the first node and the first plurality of nodes are identifiable by addresses.

7. The method of claim 6, wherein the addresses comprise either respective IPv4 addresses or respective IPv6 addresses.

8. The method of claim 1, wherein the beacon packet comprises a Media Access Control Sub-Layer Management Entity beacon packet.

9. The method of claim 1, wherein the first node comprises a utility meter capable of measuring a metered quantity.

10. The computer-implemented method of claim 1, wherein the first node provides a relay between the first plurality of nodes and the first network, and at least one node in the first plurality of nodes provides a relay between the first node and the second network.

11. A non-transitory computer-readable medium including instructions that, when executed by a processor within a first node, cause the processor to manage a first network, by performing the steps of:

configuring the first node to join the first network;

receiving a plurality of routing advertisements associated with the first network;

transmitting the plurality of routing advertisements to a first plurality of nodes that belong to a second network and are neighbors of the first node;

receiving an indication of interest from one or more nodes included in the first plurality of nodes in response to the plurality of routing advertisements that were transmitted,

wherein the indication of interest indicates a first route included in the plurality of routing advertisements;

accumulating a count of the received indications of interest;

determining whether the count exceeds a predetermined threshold; and

inserting the plurality of routing advertisements in a beacon packet for broadcast transmission when the count exceeds the predetermined threshold;

or

inserting the plurality of routing advertisements in a unicast packet for unicast transmission to a node in the one or more nodes when the count does not exceed the predetermined threshold.

12. The non-transitory computer-readable medium of claim 11, wherein the first network comprises a distribution automation network.

13. The non-transitory computer-readable medium of claim 11, wherein the first network comprises a wireless network.

14. The non-transitory computer-readable medium of claim 13, wherein the wireless network comprises a multi-channel frequency hopping spread spectrum network.

15. The non-transitory computer-readable medium of claim 11, wherein the first network comprises a wired network.

16. The non-transitory computer-readable medium of claim 11, wherein the first node and the first plurality of nodes are identifiable by addresses.

17. The non-transitory computer-readable medium of claim 16, wherein the addresses comprise either respective IPv4 addresses or respective IPv6 addresses.

18. The non-transitory computer-readable medium of claim 11, wherein the beacon packet comprises a Media Access Control Sub-Layer Management Entity beacon packet.

19. The non-transitory computer-readable medium of claim 11, wherein the first node comprises a utility meter capable of measuring a metered quantity.

20. A wireless network device, comprising:

a transceiver circuit configured to generate a radio signal based on a first carrier signal and configured to receive a radio signal based on a second carrier signal; and

a processor that is coupled to the transceiver circuit and configured to;

configure the wireless network device to join a first network,

receive a plurality of routing advertisements associated with the first network,

transmit the plurality of routing advertisements to a first plurality of nodes that belong to a second network and are neighbors of the wireless network device,

receive an indication of interest from one or more nodes included in the first plurality of nodes in response to the plurality of routing advertisements that were tranmitted,

wherein the indication of interest indicates a first route included in the plurality of routing advertisement,

accumulate a count of the received indications of interest,

determine whether the count exceeds a predetermined threshold, and

insert the plurality of routing advertisements in a beacon packet for broadcast transmission when the count exceeds the predetermined threshold, or

insert the plurality of routing advertisements in a unicast packet for unicast transmission to a node in the one or more nodes when the count does not exceed the predetermined threshold.

21. The wireless network device of claim 20, wherein the first network is a distribution automation network.

22. The wireless network device of claim 20, wherein the first network is a multi-channel frequency hopping spread spectrum network.

23. The wireless network device of claim 20, wherein the wireless network device is a utility meter capable of measuring a metered quantity.