SYSTEM AND METHOD FOR ROUTE LEARNING AND AUTO-CONFIGURATION

• US 20130163466A1
• Filed: 12/21/2011
• Published: 06/27/2013
• Est. Priority Date: 12/21/2011
• Status: Active Grant

• Current Assignee: Itron Networked Solutions, Inc. (Itron, Inc.)
• Original Assignee: Jana van Greunen, Peter Hunt, Sterling Hughes
• Inventors: HUGHES, Sterling, HUNT, Peter, VAN GREUNEN, Jana
• Granted Patent: US 9,226,219 B2
• Time in Patent Office: Days
• US Class Current: 370/254
• 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 network, the method comprising:

configuring a first node to join a first network;

receiving routing advertisements;

transmitting the received routing advertisements to a plurality of nodes neighboring the first node;

receiving an indication of interest from one or more of the plurality of neighboring nodes;

accumulating a count of the received indications of interest;

inserting the routing advertisement in a beacon packet when the count exceeds a predetermined threshold.

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

3. The method of claim 1, wherein the 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 network comprises a wired network.

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

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

8. The method of claim 1, further comprising transmitting the beacon packet to neighboring nodes and non-neighboring nodes.

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

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

11. A computer-readable medium including instructions that, when executed by a processing unit, cause the processing unit to manage a network, by performing the steps of:

configuring a first node to join a first network;

receiving routing advertisements;

transmitting the received routing advertisements to a plurality of nodes neighboring the first node;

receiving an indication of interest from one or more of the plurality of neighboring nodes;

accumulating a count of the received indications of interest;

inserting the routing advertisement in a beacon packet when the count exceeds a predetermined threshold.

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

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

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

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

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

17. The computer-readable medium of claim 16, wherein the addresses comprise either an IPv4 address or an IPv6 address.

18. The computer-readable medium of claim 11, further comprising transmitting the beacon packet to neighboring nodes and non-neighboring nodes.

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

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

21. A wireless network device, comprising:

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

a signal processing unit that is coupled to the transceiver circuit and configured to;

configure the device to join a first network;

receive routing advertisements;

transmit the received routing advertisements to a plurality of neighboring nodes;

receive an indication of interest from one or more of the plurality of neighboring nodes;

accumulate a count of the received indication of interest;

insert the routing advertisement in a beacon packet when the count exceeds a predetermined threshold.

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

23. The wireless network device of claim 21, wherein the network is a multi-channel frequency hopping spread spectrum network.

24. The wireless network device of claim 21, wherein the first node is node is a utility meter capable of measuring a metered quantity.