Dynamic self-configuring metering network

• US 20050024235A1
• Filed: 08/27/2004
• Published: 02/03/2005
• Est. Priority Date: 06/27/2002
• Status: Active Grant

• Current Assignee: Elster Electricity LLC (Honeywell International Inc.)
• Original Assignee: Elster Electricity LLC (Honeywell International Inc.)
• Inventors: Hodges, Eugene W., Shuey, Kenneth C., Hemminger, Rodney C., Mason, Robert T. Jr.
• Granted Patent: US 7,301,476 B2
• Time in Patent Office: Days
• US Class Current: 340/870.30
• CPC Class Codes: H04Q 2209/60 for transmitting utility meters data, i.e. transmission of data from the reader of the utility meter
• CPC Class Codes: H04Q 9/00 Arrangements in telecontrol or telemetry systems for selectively calling a substation from a main station, in which substation desired apparatus is selected for applying a control signal thereto or for obtaining measured values therefrom

Abstract

A dynamic self-configuring system for collecting metering data comprises a collector meter. The collector meter scans for meters that are operable to directly communicate with the collector and registers such meters as level one meters. The collector transmits instructions to the level one meters to scan for meters that are operable to directly communicate with the level one meters. The collector registers meters that respond as level two meters.

Claims

1-52. -52. (canceled).

53. In a network having a collector that receives data from nodes and communicates the data to a communication server, a method of registering said nodes to communicate with said collector, comprising:

initiating a node scan to establish communication between said collector and said nodes;

determining a reliability of a data communication path between said collector and a node that responds to said node scan; and

registering said node if said node has a reliability above a first predetermined threshold.

54. The method of claim 53, further comprising:

maintaining a database of nodes that have a reliability below said first predetermined threshold.

55. The method of claim 53, further comprising:

initiating said node scan on a predetermined subset of said nodes.

56. The method of claim 53, further comprising:

determining said reliability in accordance with a received signal strength value for said nodes that respond to said node scan.

57. The method of claim 56, wherein said first predetermined threshold is a received signal strength value of −

60 dBm.

58. The method of claim 53, wherein registering a node that has a reliability above a predetermined threshold further comprises:

updating a list of registered nodes at said collector to include said node being registered; and

transmitting registration information to said node.

59. The method of claim 58, wherein updating said list comprises updating at least one of a unique identifier of said node, said data communication path to said node, and a level of said node in a subnet that communicates to said collector.

60. The method of claim 58, wherein transmitting registration information to said node comprises transmitting at least one of a unique identifier of said collector, said data communication path to said collector, a level of said node in a subnet that communicates to said collector, and a second meter with which said meter should communicate.

61. The method of claim 53, further comprising:

repeating said node scan at said collector multiple times to insure all first level nodes that are capable of receiving said node scan have responded by comparing the number of nodes scans performed to a predetermined number of scans.

62. The method of claim 61, further comprising:

performing said node scan at successively higher level nodes beginning with said first level nodes through nth-1 level nodes to register second level nodes through nth level nodes;

updating a list of registered nodes in accordance with responses that are received from said second level nodes through said nth level nodes; and

transmitting registration information to said second level nodes through said nth level nodes.

63. The method of claim 62, wherein said collector requests said successively higher level nodes to perform said node scan, and wherein said request comprises at least one of a number of timeslots available for responding nodes, a unique address of said collector, a level within said subnet of the node sending the request, and said reliability of said data communication path.

64. The method of claim 62, wherein updating said list comprises updating at least one of a unique identifier of said second level nodes through said nth level nodes, said data communication path to said second level nodes through said nth level nodes, and a level of said second level nodes through said nth level nodes in a subnet that communicates to said collector.

65. The method of claim 62, wherein transmitting registration information to said second level nodes through said nth level nodes comprises transmitting at least one of a unique identifier of said collector, said data communication path to said collector, a level of said second level nodes through said nth level nodes in a subnet that communicates to said collector, and a second meter with which said meter should communicate.

66. The method of claim 53, further comprising:

determining a level of success in communicating with said node; and

if said level of success is below a second predetermined threshold, instructing said node to respond to subsequent node scans.

67. The method of claim 66, further comprising:

changing a collector to which said node communicates to a second collector in response to a subsequent node scan;

qualifying said node wherein said second collector makes plural attempts to communicate to said node; and

registering said node to said second collector if a predetermined number of said plural attempts to communicate are successful.

68. A network communication system comprising collectors that receive data from nodes registered with said collectors, and said collectors communicating the received data to a communication server, a method of qualifying communication between said nodes and said collectors, comprising:

maintaining a list of nodes registered with a first collector;

determining a level of success of communication between a first node and said first collector; and

if said level of success is below a predetermined threshold, instructing said first node to respond to subsequent node scans,

wherein node scans are initiated by each collector to register nodes that are in communication with said each collector.

69. The method of claim 68, further comprising:

changing a collector to which said first node communicates to a second collector in response to a subsequent node scan;

qualifying said node wherein said second collector makes plural attempts to communicate to said node; and

registering said node to said second collector if a predetermined number of said plural attempts to communicate are successful.

70. The method of claim 69, further comprising:

organizing said nodes into levels beginning with a first level that communicate directly with said collectors through nth level that communicate directly to an nth-1 level;

performing said subsequent node scans at successively higher levels beginning with first level nodes through nth-1 level nodes to register second level nodes through nth level nodes;

updating a list of registered nodes in accordance with responses that are received from said second level nodes through said nth level nodes.

71. The method of claim 70, wherein said first node comprises any node among nodes organized in said first level through nth level.