Method and system for providing a network protocol for utility services

• US 7,996,031 B2
• Filed: 08/09/2010
• Issued: 08/09/2011
• Est. Priority Date: 11/17/2005
• Status: Active Grant

• Current Assignee: Itron Networked Solutions, Inc. (Itron, Inc.)
• Original Assignee: Silver Spring Networks, Inc. (Itron, Inc.)
• Inventors: San Filippo, William III, Kiiskila, Marko, Rayala, Padmasheela
• Primary Examiner(s): Tran; Tuan A
• Application Number:
  US12/852,552
• Publication Number:
  US 20100302062A1
• Time in Patent Office: 365 Days
• Field of Search: 455/445, 455/41.2, 455/500, 455/502, 455/507, 455/514, 455/556.1, 455/556.2, 455/557, 455/509, 455/512, 455/513, 455/515, 455/517, 455/518, 455/519, 34087001-87003, 709220-222, 709238-244, 370/229, 370/230, 370/230.1, 370/231, 370/235, 370/236, 370/237
• US Class Current: 455/519
• CPC Class Codes: G01D 4/002 Remote reading of utility meters
• CPC Class Codes: G01D 5/00 Mechanical means for transferring the output of a sensing member; Means for converting the output of a sensing member to another variable where the form or nature of the sensing member does not constrain the means for converting; Transducers not specially adapted for a specific variable G01D3/00 takes precedence; specially adapted for apparatus giving results other than momentary value of variable G01D1/00
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04W 40/08 based on transmission power
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: Y02B 90/20 Smart grids as enabling technology in buildings sector smart grids supporting the management or operation of end-user stationary applications in general, or like technologies with no associated climate change mitigation effect Y04S20/00
• CPC Class Codes: Y04S 20/30 Smart metering, e.g. specially adapted for remote reading

Abstract

A method and system for providing a network protocol for utility services are disclosed are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a constant powered meter sends network discovery messages to find the utility network. Neighboring meters are discovered, wherein the constant powered meter sends hello messages periodically. The constant powered meter is registered with the utility network. Further, the battery powered meter finds and associates itself with a constant powered meter. The constant powered meter also registers its associate battery powered meter with the utility network. The constant powered meter sends a node registration message to the gateway of the utility network. The constant powered meter can sense outage problems with the gateway and the neighbors of its network, and search and migrate to an alternate network.

Claims

1. A method of connecting a node to a wireless network, comprising:

(i) transmitting a first type of broadcast message from a first node over each of a plurality of channels, seeking a response from any other node that communicates on at least one of said channels;

(ii) upon receiving a response from another node communicating on one of the channels, transmitting a second type of broadcast message from the first node on said one channel, seeking responses from multiple other nodes communicating on said one channel; and

(iii) processing responses received at the first node to said second type of broadcast message, to select one of the other nodes communicating on said one channel, from which a response is received, as a neighbor link in a path for communications over a network associated with said one channel.

2. The method of claim 1, further comprising repeating steps (ii)-(iii) for each of said plurality of channels, and selecting one channel based upon the responses received to said second type of broadcast message.

3. The method of claim 1, wherein said first type of broadcast message has a first response time, and said second type of broadcast message has a second response time that is longer than said first response time.

4. The method of claim 1 further comprising receiving a third type of message that is periodically broadcast by other nodes on network, and updating status and quality of link information for other nodes from which said third type of message is received, based upon information associated with said third type of messages.

5. The method of claim 1 further comprising periodically broadcasting a third type of message from said first node, to update status and quality of link information pertaining to said first node.

6. The method of claim 1 further comprising transmitting a registration message, via the selected other node, to a gateway associated with the network to register the first node as a member of the network.

7. The method of claim 6 wherein said registration message includes an identification of a network protocol that is used by said first node to communicate messages via said network.

8. The method of claim 7, wherein said network protocol is IPv6.

9. The method of claim 6 wherein said registration message includes information about other nodes from which responses to said second type of message were received.

10. The method of claim 9 wherein said gateway computes and maintains routes for communications with said gateway, based upon the information that is provided by nodes in said registration messages.

11. The method of claim 10, further comprising transmitting said routes from the gateway to the nodes.

12. The method of claim 6 wherein, in response to receipt of a registration message, the gateway returns a message to the node that includes a network prefix, which the first node uses to generate a network address.

13. The method of claim 6 further comprising receiving a third type of message that is periodically broadcast by other nodes on network, which message includes information regarding the quality of a path to the gateway via the node transmitting the third type of message.

14. The method of claim 13, wherein a node is selected by the first node as a neighbor link on the basis of the quality information contained in the third type of message.

15. The method of claim 14, wherein said quality information includes the number of hops to the gateway from the other node that is transmitting the third type of message.

16. The method of claim 14 wherein the selection of a node as a neighbor node is also based on the quality of the link to the first node from the node transmitting the third type of message.

17. The method of claim 13, wherein the third type of message also includes information regarding the traffic density of the path to the gateway.

18. The method of claim 17, wherein a node is selected by the first node as a neighbor link on the basis of the quality information and the traffic information contained in the third type of message.

19. A method of registering a node in a wireless network, comprising:

transmitting a first type of broadcast message to discover the existence of a network;

upon discovering a network, transmitting a second, different type of broadcast message to identify neighboring nodes on said network; and

transmitting a registration message, via at least one of said neighboring nodes, to a gateway on the network, said registration message including an identification of the node being registered and information regarding the neighboring nodes that have been identified.

20. The method of claim 19, wherein said first type of broadcast message has a first response time, and said second type of broadcast message has a second response time that is longer than said first response time.

21. The method of claim 19 further comprising periodically broadcasting a third type of message, to update status and quality of link information pertaining to the node from which the third type of message is broadcast.

22. The method of claim 19 wherein said registration message includes an identification of a network protocol that is used to communicate messages via said network.

23. The method of claim 22, wherein said network protocol is IPv6.

24. The method of claim 19 wherein said gateway computes and maintains routes for communications with said gateway, based upon the information that is provided by nodes in said registration messages.

25. The method of claim 24, further comprising transmitting said routes from the gateway to the nodes.

26. The method of claim 19 wherein, in response to receipt of a registration message from a node, the gateway returns a message to the node that includes a network prefix, which the node uses to generate a network address.

27. A method of registering a node in a wireless network, comprising:

transmitting, from a first node, a broadcast message to discover the existence of a network;

upon discovering a network, transmitting a second broadcast message from the first node to identify neighboring nodes on said network;

selecting one of the identified neighbor nodes on the network as a master node, and sending a message from the first node to the selected node requesting the selected node to function as the first node'"'"'s master; and

upon accepting the request to function as a master at the selected node, transmitting a registration message to a gateway on the network from the master node to register the first node with the gateway.

28. The method of claim 27, wherein the first node is a battery powered device and the master node is a constant powered device.

29. The method of claim 28, wherein at least one of the first node and the master node includes a utility meter.

30. The method of claim 27 wherein, when the master node registers with a new gateway, and/or re-registers with its current gateway, it also registers all nodes for which it s functioning as a master node.

31. A method of registering a node in a wireless network, comprising:

transmitting, from a first node, a broadcast message to discover the existence of a network;

upon discovering a network, transmitting a second broadcast message from the first node to identify neighboring nodes on said network;

sending a third message from the first node to one of the identified neighbor nodes that is capable of functioning as an intermediary node; and

upon receiving the third message at the intermediary node, transmitting a registration message to a gateway on the network from the intermediary node to register the first node with the gateway.

32. The method of claim 31, wherein the first node is a battery powered device and the intermediary node is a constant powered device.

33. The method of claim 32, wherein at least one of the first node and the intermediary node includes a utility meter.

34. The method of claim 31 wherein, when the intermediary node registers with a new gateway, and/or re-registers with its current gateway, it also registers all nodes for which it s functioning as an intermediary node.