Abstract: Techniques are disclosed by which RF mesh networks can identify utility distribution topologies by using power line communication combined with wireless networking to identify the mapping of transformers and other distribution equipment at a back office system server. At a specified time, an item of distribution equipment signals a unique identifier by introducing a phase shift in the electric power being delivered by that equipment. A meter node detects and decodes these temporal shifts to obtain an identifier of equipment supplying the power to it. Upon ascertaining this identification, the meter node sends an acknowledgment to thereby register with that equipment. The association of the particular customer's premises with the equipment is also sent to a back office system, to enable a map of the correspondence between meter and the equipment to be generated.

Abstract: A utility network interface device is provided for operation with a utility network. The utility network interface device includes a detector configured to produce a state signal upon occurrence of a prescribed state that interferes with the ability of a utility meter, with which the utility network interface device is associated, to measure consumption of a commodity and/or report consumption of the commodity. The utility network interface device also includes a control unit configured to detect a tampering with the utility meter in accordance with the state signal produced by the detector. The control unit automatically controls a notification unit to output, external to the utility meter, notification of the tampering detected by the control unit, in response to the detection of the tampering.

Abstract: A utility network interface device is provided for operation with a utility network. The utility network interface device includes a control unit configured to detect a tampering with a software component of a utility meter with which the utility network interface device is associated. The utility network interface device also includes a notification unit configured to output, external to the utility meter, a visual indication constituting notification of the tampering detected by the control unit. The control unit is configured to automatically control the notification unit to output the external notification of the tampering in response to the detection of the tampering. Also provided are a utility network including the utility network interface device, a method of operating a utility network interface device, and a computer-readable recording medium having a computer program recorded thereon for operating a utility network interface device.

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Abstract: Methods and devices are disclosed for dynamically fragmenting packets transmitted in a communications network. Fragments are generated by splitting a packet based on a value of a fragment size parameter. A first fragment is sent to a receiving node. As the sending node, a transmission success parameter is determined that indicates whether the first fragment was successfully received. Based on the value of the transmission success parameter, a link quality parameter value representing a chance a second fragment having the same size as the first fragment will be successfully received by the receiving node is updated. The sending node compares the value of the link quality parameter and a value of a quality threshold parameter and changes the value of the fragment size parameter based on a result of the comparison.

Abstract: The functionality of communications standards and protocols that are application-layer specific are overlaid on an IP-based infrastructure, by employing an IP DNS server as the registration host for IP and other communications standards based and protocol based communications. Communication can occur at either the IP layer or the communications standards or protocol application layer. At the IP layer, a host application can interrogate network nodes. To extend this service to other communications standards or protocol communications, device registration and resolve services are implemented on the DNS server. Similar to the manner in which an IP-based service uses a native, IP-based DNS resolve request, a host can utilize a resolution request against the communications standards and protocol-enabled DNS server for standards and protocol application-layer interrogation of endpoints.

Abstract: A method of updating routing information in a network where reboot information of other nodes in the network is used to determine whether a given node has recent route updates. If the reboot information indicates the given node has not recently rebooted, then routing information from that given node is used to update the routing information of the comparing node. The reboot information may be a reboot counter which is incremented by a node in response to the node going through a reboot process. When a node reboots, it may request the reboot counter from neighboring nodes. The received reboot counter is compared to the stored reboot counter for at least one node. The rebooting node may choose to receive routing information from a node which has not had its reboot counter changed from the stored reboot counter.

Abstract: Methods and devices are disclosed for dynamically fragmenting packets transmitted in a communications network. Fragments are generated by splitting a packet based on a value of a fragment size parameter. A first fragment is sent to a receiving node. As the sending node, a transmission success parameter is determined that indicates whether the first fragment was successfully received. Based on the value of the transmission success parameter, a link quality parameter value representing a chance a second fragment having the same size as the first fragment will be successfully received by the receiving node is updated. The sending node compares the value of the link quality parameter and a value of a quality threshold parameter and changes the value of the fragment size parameter based on a result of the comparison.

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Abstract: A method of routing in a network includes dividing a time corresponding to a predetermined maximum registration age of a first node registered with a second node into a number of first time intervals and second time intervals. The first time intervals each have a predetermined duration and the second time intervals each have a duration greater than the predetermined duration of the first time intervals. Each of the first and second time intervals are assigned a metric designating a cost associated with a path between the first node and the second node. The metric increases in value for each of the first and second time intervals as registration age increases. The second node sends a message including the metric associated with the time interval during which it is transmitted.

Abstract: Bulk information is transferred to nodes in a communication network having a plurality of widely dispersed nodes. The information can be an image, content, or configuration information. The information is uni-cast to a selection of nodes by a central node or server, to seed the information at certain nodes in the network. The information is then distributed by these seed nodes to every other node in the network. A first algorithm selects which nodes should be seeded with information by the central node. A second algorithm distributes information in the network on a query basis.

Abstract: The service phase of the electrical connection to a customer endpoint device located within a power distribution system is determined by various techniques. At the feeder level, the system may be programmed to induce momentary power interruptions, thereby causing missed zero crossings at the customer endpoint devices. The pattern of these interruptions is a controlled one, designed specifically to avoid causing noticeable disruption even to sensitive devices, but to be unusual enough that it is statistically unlikely to be naturally occurring. The monitoring of the zero crossing information is used to determine the phase of the service line to the customer endpoint devices.

Abstract: Methods include those by which nodes in a Frequency Hopping Spread Spectrum (FHSS) wireless network may be flexibly configured for beacon transmission and reception. The method may allow for any node to synchronize to any other node's given frequency to receive one or more beacon (broadcast) packets from that node at the designated period. The method may include sending, by a first node, a message to one or more neighbor nodes and responding, by the one or more neighbor nodes, with a message to the first node, the response message including a beacon frequency, a beacon transmit time and information about the current hopping sequence. The first node periodically programs its receiver to the beacon frequency at the beacon transmit time and uses the hopping sequence to receive information including at least one of routing information and timing updates for hopping channel synchronization from the one or more neighbor nodes.

Abstract: Methods are disclosed for generating a data packet at a sending node of the network that conforms to a media access control (MAC) layer protocol for network communications. The data packet includes a MAC header and a data segment, wherein data in said data segment is encoded as a type-length-value element identifying a value for an operating parameter of the network. The data packet is transmitted from the sending node to a receiving node. At the receiving node, the data packet is processed at the MAC sublayer of network protocols to retrieve said element and determine the value for the operating parameter. Operating parameters within the receiving node are adjusted to conform to the determined value of the operating parameter.

Abstract: After power is restored to a node in a utility network, that node employs one or more of its neighboring nodes as proxies to route a message to a central control facility of the utility. The message contains information about the restored node, and possibly one or more of its neighbor nodes. This information may include reboot counters, the amount of time that the node was down, momentary outages or power fluctuations, and/or the time of power restoration. The node that creates and initially sends the message can be the restored node itself, or another node that recognizes when a restored node has recently come back online.

Abstract: A method of updating routing information in a network where reboot information of other nodes in the network is used to determine whether a given node has recent route updates. If the reboot information indicates the given node has not recently rebooted, then routing information from that given node is used to update the routing information of the comparing node. The reboot information may be a reboot counter which is incremented by a node in response to the node going through a reboot process. When a node reboots, it may request the reboot counter from neighboring nodes. The received reboot counter is compared to the stored reboot counter for at least one node. The rebooting node may choose to receive routing information from a node which has not had its reboot counter changed from the stored reboot counter.

Abstract: A method for generating and using frequency-hopping sequences in frequency-hopping spread spectrum (FHSS) networks, such that no additional network overhead is required to convey a device's hopping sequence to another device, is disclosed. Furthermore, a method to maximize the number of unique hopping sequences, without increasing the random access memory (RAM) requirements on the network devices, is disclosed.

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.