Abstract: Techniques for secure team-based communication on existing wireless mesh networks are disclosed. In an example, a first network node receives a network encryption key from a headend system. The first network node receives a sub-group encryption key that is unique to a sub-group of nodes, a sub-group identifier, and a sub-group node list that lists the sub-group of nodes associated with the sub-group identifier. The first network node generates an application layer message for a second node of the sub-group of nodes at an application layer. The first network node encrypts the application layer message using the sub-group encryption key. The first network node generates a team packet that is addressed to a selected node and includes the encrypted application layer message and the sub-group identifier. The first network node encrypts the team packet using the network encryption key and transmits the encrypted team packet to the selected node.

Abstract: Techniques for secure team-based communication on existing wireless mesh networks are disclosed. In an example, a first network node receives a network encryption key from a headend system. The first network node receives a sub-group encryption key that is unique to a sub-group of nodes, a sub-group identifier, and a sub-group node list that lists the sub-group of nodes associated with the sub-group identifier. The first network node generates an application layer message for a second node of the sub-group of nodes at an application layer. The first network node encrypts the application layer message using the sub-group encryption key. The first network node generates a team packet that is addressed to a selected node and includes the encrypted application layer message and the sub-group identifier. The first network node encrypts the team packet using the network encryption key and transmits the encrypted team packet to the selected node.

Abstract: Systems and methods for secure team-based communication on existing wireless mesh networks are disclosed. In an example network with multiple network nods, a headend system designates a first network node and a second network node as a sub-group of nodes, generates a sub-group encryption key that is unique to the sub-group of nodes, and transmits the sub-group encryption key and the sub-group node list and to the first node and the second node. The first node encrypts an application layer message with the sub-group encryption key and sends the message to the second node. The second node decrypts the application layer message with the sub-group encryption key and performs an action based on the message.

Abstract: Prior to joining a device to a network, the device is connected to an external system via a local connection. The external system provides the device with a local time stamp that includes a local time value and a local time error value. The device may use the time information to communicate with the external system. After the device is joined to the network, the device may transmit a communication on the network that includes time information. If so, then the communication includes a time value based on the device's time value and a time error value set to a value indicating a maximum error. The network is protected from potentially poor quality time information. Any device that receives the communication rejects the time information since the time error value indicates a maximum error.

Abstract: Prior to joining a device to a network, the device is connected to an external system via a local connection. The external system provides the device with a local time stamp that includes a local time value and a local time error value. The device may use the time information to communicate with the external system. After the device is joined to the network, the device may transmit a communication on the network that includes time information. If so, then the communication includes a time value based on the device's time value and a time error value set to a value indicating a maximum error. The network is protected from potentially poor quality time information. Any device that receives the communication rejects the time information since the time error value indicates a maximum error.

Abstract: This disclosure involves debugging code for resource-constrained intelligent devices contemporaneously with executing object code on the intelligent device. For example, object code is transmitted to a radio device. A program counter entry is provided from the radio device to a computer via a communication link contemporaneously with a pause in execution of the object code at the radio device. A correspondence between the program counter entry and a portion of assembly code, which was used to generate the object code, is identified and is used to generate a list of additional program counter entries for pausing the object code's execution. The list is provided from the computer to the radio device and is used to pause the object code's execution at the radio device. Log data is provided from the radio device to the computer for display after pausing the object code's execution at one of these program counter entries.

Abstract: This disclosure involves debugging code for resource-constrained intelligent devices contemporaneously with executing object code on the intelligent device. For example, object code is transmitted to a radio device. A program counter entry is provided from the radio device to a computer via a communication link contemporaneously with a pause in execution of the object code at the radio device. A correspondence between the program counter entry and a portion of assembly code, which was used to generate the object code, is identified and is used to generate a list of additional program counter entries for pausing the object code's execution. The list is provided from the computer to the radio device and is used to pause the object code's execution at the radio device. Log data is provided from the radio device to the computer for display after pausing the object code's execution at one of these program counter entries.

Abstract: Systems and methods are provided for securing a self-securing device and information that is stored in memory within the device. The self-securing device comprising a processor unit and memory external to the processor unit. The processor unit contains a processor and processor unit memory. Upon initialization of the self-securing device, the processor unit determines whether a secure key is stored in the processor unit memory. If no secure key is stored, then the processor unit generates a secure key and stores it in the processor unit memory. The processor unit uses the secure key to decrypt information read from the memory external to the processor unit and to encrypt information to be stored in memory external to the processor unit.

Abstract: Systems and methods are provided for securing a self-securing device and information that is stored in memory within the device. The self-securing device comprising a processor unit and memory external to the processor unit. The processor unit contains a processor and processor unit memory. Upon initialization of the self-securing device, the processor unit determines whether a secure key is stored in the processor unit memory. If no secure key is stored, then the processor unit generates a secure key and stores it in the processor unit memory. The processor unit uses the secure key to decrypt information read from the memory external to the processor unit and to encrypt information to be stored in memory external to the processor unit.

Abstract: Methods and systems for sending a broadcast message in frequency hopping and other systems. Instead of sending a complete message separately to each device, a relatively small packet or “chirp” is sent. These chirps are either targeted at known devices or sent in a manner to sweep the Radio Frequency (RF) band. Devices that hear the chirps get information about the channel and/or time that the broadcast data will be sent. These devices then listen for the broadcast data as instructed, e.g., at the specified time on the specified channel. A system may alternatively, or in addition, use a scheduled hopping sequence break as a broadcast moment. Such a broadcast moment can be scheduled to periodically interrupt the node hopping sequences so that, at such times, many or all nodes are scheduled to be on the same channel for potential broadcasts.

Abstract: Methods and systems for sending a broadcast message in frequency hopping and other systems. Instead of sending a complete message separately to each device, a relatively small packet or “chirp” is sent. These chirps are either targeted at known devices or sent in a manner to sweep the RF band. Devices that hear the chirps get information about the channel and/or time that the broadcast data will be sent. These devices then listen for the broadcast data as instructed, e.g., at the specified time on the specified channel. A system may alternatively, or in addition, use a scheduled hopping sequence break as a broadcast moment. Such a broadcast moment can be scheduled to periodically interrupt the node hopping sequences so that, at such times, many or all nodes are scheduled to be on the same channel for potential broadcasts.

Abstract: Methods and systems for sending a broadcast message in frequency hopping and other systems. Instead of sending a complete message separately to each device, a relatively small packet or “chirp” is sent. These chirps are either targeted at known devices or sent in a manner to sweep the RF band. Devices that hear the chirps get information about the channel and/or time that the broadcast data will be sent. These devices then listen for the broadcast data as instructed, e.g., at the specified time on the specified channel. A system may alternatively, or in addition, use a scheduled hopping sequence break as a broadcast moment. Such a broadcast moment can be scheduled to periodically interrupt the node hopping sequences so that, at such times, many or all nodes are scheduled to be on the same channel for potential broadcasts.

Abstract: Systems and methods for over-the-air firmware distribution to battery-powered devices are disclosed. Such over-the-air distribution is accomplished, for example, using a non-battery-powered device as a buffer, for example, to reduce or eliminate the delay time of the over-the-air network. The firmware can be sent to and stored on a nearby, non-battery-powered device and then sent from there to the battery-powered endpoint device. The distribution of firmware to battery-powered devices may be implemented in an Advanced Metering Infrastructure (AMI) system, a mesh network, a multi-channel radio network, or any other environment in which firmware distribution is desirable.

Abstract: Methods and systems for providing accurate time-keeping on battery-powered communication devices used in AMI systems, mesh networks, and multi-channel radio networks. One embodiment allows the use of low power (and low cost) crystals in battery-powered endpoints by periodically correcting the poor timing of these crystals using communications with a nearby, non-battery-powered device. Such communications allow the battery-powered devices to align their timing with that of their non-battery neighbors, among other things.

Abstract: Methods and systems for sending a broadcast message in frequency hopping and other systems. Instead of sending a complete message separately to each device, a relatively small packet or “chirp” is sent. These chirps are either targeted at known devices or sent in a manner to sweep the RF band. Devices that hear the chirps get information about the channel and/or time that the broadcast data will be sent. These devices then listen for the broadcast data as instructed, e.g., at the specified time on the specified channel. A system may alternatively, or in addition, use a scheduled hopping sequence break as a broadcast moment. Such a broadcast moment can be scheduled to periodically interrupt the node hopping sequences so that, at such times, many or all nodes are scheduled to be on the same channel for potential broadcasts.

Abstract: A list of nodes is segmented into one or more segments, each segment having a node limit and a segment criteria, attributes associated with a first node are identified, a determination is made whether to add the first node to a particular segment of the node list based on the node limit and the attributes of the first node, nodes are ranked nodes in the particular segment, and a determination is made whether to remove a candidate node from the particular segment based on the node limit.

Abstract: Systems, methods, and devices for consolidating network packetized data are disclosed. Data packets are received by a consolidator. Common content and unique attributes of the packets are identified. A consolidated packet is created and the consolidated packet is transmitted in response to a condition.

Abstract: Systems and methods for over-the-air firmware distribution to battery-powered devices are disclosed. Such over-the-air distribution is accomplished, for example, using a non-battery-powered device as a buffer, for example, to reduce or eliminate the delay time of the over-the-air network. The firmware can be sent to and stored on a nearby, non-battery-powered device and then sent from there to the battery-powered endpoint device. The distribution of firmware to battery-powered devices may be implemented in an AMI system, a mesh network, a multi-channel radio network, or any other environment in which firmware distribution is desirable.

Abstract: A list of nodes is segmented into one or more segments, each segment having a node limit and a segment criteria, attributes associated with a first node are identified, a determination is made whether to add the first node to a particular segment of the node list based on the node limit and the attributes of the first node, nodes are ranked nodes in the particular segment, and a determination is made whether to remove a candidate node from the particular segment based on the node limit.

Abstract: Methods and systems for providing accurate time-keeping on battery-powered communication devices used in AMI systems, mesh networks, and multi-channel radio networks. One embodiment allows the use of low power (and low cost) crystals in battery-powered endpoints by periodically correcting the poor timing of these crystals using communications with a nearby, non-battery-powered device. Such communications allow the battery-powered devices to align their timing with that of their non-battery neighbors, among other things.