Abstract: A method and system for providing a network and routing protocol for utility services are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a utility device (for example, a constant powered meter) sends network discovery messages to find the utility network. Neighboring meters are discovered and the device listens for advertised routes for one or more networks from the neighbors. The device is then registered with one or more utility networks, receiving a unique address for each network registration. Also illustrated in this invention disclosure is how each device of a class of devices (for example, battery powered meter) finds and associates itself with another device (for example, constant powered meter). The constant powered meter also registers its associate battery powered meter with the utility networks. The constant powered meter registers itself with the access points and the upstream nodes in the path out of each network.

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: A wireless communication apparatus adapted to be mounted on an elevated surface having an electrical socket thereon. The apparatus includes a housing, a photocell and a transceiver. The housing at least partially defines an interior space and has a portion which is translucent. The photocell is supported by the housing in the interior space so that ambient light exterior to the housing passes through the translucent portion to the photocell. The transceiver is also supported by the housing and is positioned within the interior space of the housing.

Abstract: Meter nodes in a power line carrier (PLC) network may reliably communicate with an access point by alternate routes using additional media where available. A utility network may include one or more subnetworks. Each subnetwork may include one or more meter nodes and an access point configured to communicate with the meter nodes using PLC. Meter nodes operate as relays for other meter nodes to communicate with the access point. Some or all meter nodes may be configured to communicate using a power line carrier communications link and another communications link. The network may also include a node external to the subnetwork, e.g., a utility server. The access point may be configured to communicate with the node external to the subnetwork in addition to the meter nodes.

Abstract: Communications among multiple nodes via a shared power line medium are carried out by dividing the available frequency spectrum in the shared power line medium into plural non-overlapping channels. A first channel is assigned to a first group of nodes, and a second channel, different from the first channel, is assigned to a second group of nodes. Communications between the first group of nodes can occur simultaneously with communications between the second group of nodes via the shared power line medium. Time slots may be assigned for the communications between the first group of nodes that occurs simultaneously with the communications between the second group of nodes via the shared power line medium. The simultaneous communications between different groups of nodes via a shared power line medium may be implemented using a frequency-hopping spread spectrum technique.

Abstract: A meshed networking of access points in a utility network provides a more efficient and cost effective arrangement for communicating data between meters and the utility by linking the access points of multiple subnetworks for purposes of communicating with the utility. As a result, each individual subnetwork is not required to directly communicate with the utility. For those access points that are relieved of the need to directly communicate with the utility, the communication mechanism, e.g., cellular modem, can be eliminated, or deactivated, to thereby reduce capital expenditures and/or operational costs. Additionally, links to a WAN can be selectively activated or disabled to provision bandwidth, for example, on demand, to react to changing conditions in the subnetworks.

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: Rather than using a large number of transceivers (transmitter/receiver pairs) operating in parallel, Access Points with multiple channels are used to aggregate, or stack, transmitted response communications, e.g., transmitting multiple acknowledgements (ACKs) in a single packet to one or more sources of received packets. The method includes sending on a plurality of channels, by each of a plurality of respective first nodes, a communication to a second node, receiving on the plurality of channels, by the second node, the communication from each of the plurality of first nodes and sending, by the second node, a transmission that contains a response to each communication that was successfully received from each of the plurality of first nodes. The response to each of the plurality of first nodes is part of a single message sent by the second node.

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: A system that provides a cryptographic unit that generates secret keys that are not directly accessible to software executed by a controller. The cryptographic unit can include a restrictor device, a finite state machine, a random number generator communicatively and a memory. The memory stores values generated by the random number generator. The restrictor device and the finite state machine include hardware logic that restricts access or changes to the contents of the memory.

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: The functionality of a C12.22 application layer is overlaid on an IP-based infrastructure, by employing an IP DNS server as the registration host for both IP- and C12.22-based communications. Communication can occur at either the IP layer or the C12.22 application layer. At the IP layer, a host application can interrogate network nodes. To extend this service to C12.22 communications, C12.22 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 C12.22 host can utilize a C12.22 resolution request against the C12.22-enabled DNS server for C12.

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.