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: 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: One embodiment of the present disclosure sets forth a technique for convergence and automatic disabling of access points in a wireless mesh network. Specifically, an access point within a wireless mesh network computes one or more network metrics to determine whether the metrics are unfavorable or favorable. If the network metrics are favorable, then the access point disables the access point's network connection. An access point turns the network connection back on based on whether a routing was lost for at least a preset amount of time, utilization of one or more neighboring access points is above a preset value, or one or more network metrics have degraded by a certain percentage value. One advantage of this approach is that cost savings may be achieved when the number of access points dynamically changes to accommodate varying communications conditions.

Abstract: One embodiment of the present invention implements a FHSS system using single transmitter/multiple receiver transceivers. Such transceivers are configured to receive multiple FHSS channels (e.g., five channels) but only transmit on one channel. In an embodiment, one channel is dedicated to high priority traffic and the other four channels are dedicated to standard traffic. In receiving a high priority message, the transceiver is configured to address the high priority traffic first. For example, because the single transmitter/multiple receiver transceivers only has one transmitter, such transceiver may immediately dedicate it transmitting resources to addressing the received high priority data. Other embodiments are disclosed that implement multiple priorities among a plurality of communication channels.

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: Systems and methods for detecting device failures in a network having nodes coupled to a central controller, in which a first of the nodes communicates with the central controller via a second of the nodes. When the second node determines that the first node has not transmitted a predetermined number of messages over a predefined number of time periods, the second node provides a failure alert to the central controller. The central controller records a failure alert received from the second node in a log. Based on a set of failure alerts received from a number of nodes recorded in the log, the central controller determines whether the first node has failed.

Abstract: A commodity delivery system. The system includes a plurality of commodity delivery devices. The plurality of commodity delivery devices are configured to at least one of transport the commodity, modify the commodity, and monitor the commodity. A subset of the plurality of commodity delivery devices is further configured to receive a beacon from a network device, designate a plurality of transmission time slots based on the beacon, the transmission time slots synchronized for all of the plurality of commodity delivery devices, detect an error condition, select a transmission time slot following the detection of the error condition, and transmit a last gasp message during the selected transmission time slot.

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: 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.

Abstract: Systems and methods for detecting device failures in a network having nodes coupled to a central controller, in which a first of the nodes communicates with the central controller via a second of the nodes. When the second node determines that the first node has not transmitted a predetermined number of messages over a predefined number of time periods, the second node provides a failure alert to the central controller. The central controller records a failure alert received from the second node in a log. Based on a set of failure alerts received from a number of nodes recorded in the log, the central controller determines whether the first node has failed.

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: 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: 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: 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: 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.