Abstract: In an embodiment of a wireless network, when a node joins the network and receives a routing advertisement, such a node transmits the routing advertisement to all its neighbors. The node then receives transmission from the neighboring nodes indicating interest in joining the advertised network. If more than a threshold number of neighboring nodes are interested in the advertised route, the newly joining node inserts the route advertisement in a beacon transmission. If there is not a threshold level of interest, the node unicasts only to the neighbors who indicated interest in the advertised network. In an embodiment, the node repeats the above steps on a predetermined time basis (e.g., one per day) in order to determine interest in the advertised route that may have newly arisen.

Abstract: A method for controlling a light source associated with an environment includes: receiving, over a wireless mesh network and by a control node corresponding to the light source, a first light intensity value for the environment from a first sensor node; calculating, by the control node, a resulting light intensity (RLI) value based on the first intensity value; determining, by the control node, that the RLI value exceeds a light intensity threshold; and modifying, by the control node and in response to determining the RLI value exceeds the light intensity threshold, an output of the first light source.

Abstract: A method for enabling a scalable public-key infrastructure (PKI) comprises invoking a process of receiving a message for a device, identifying an association ID for the device, retrieving encrypted association keys stored on the server for communicating with the device, the encrypted association keys encrypted using a wrapping key stored on a Hardware Security Module (HSM). The method further comprises sending the message and the encrypted association keys to the HSM, unwrapping, by the HSM, the encrypted association keys to create unwrapped association keys, cryptographically processing the message to generate a processed message, deleting the unwrapped association keys, sending the processed message to the device, and invoking, concurrently and by a second application, the process.

Abstract: A method for transmitting communications by a transmitter includes selecting a non-alternating spreading sequence, receiving bits for transmission, encoding the bits using the non-alternating spreading sequence to obtain encoded bits, and transmitting the encoded bits to a frequency shift key (FSK) receiver. A method for receiving communications by an FSK receiver includes receiving, by the FSK receiver, encoded bits from a transmitter, decoding the encoded bits using a non-alternating spreading sequence to obtain decoded bits, and processing the decoded bits.

Abstract: Systems and methods of optimizing packet flow in a network are disclosed. An internetwork includes plural networks, each network having plural non-router nodes and at least one router node. The non-router node of a first network can be configured to perform congestion control. The non-router node sends a request packet to a node in a second network. The value of a packet-in-flight counter associated with the network is adjusted when the request packet is sent to the second network node and when a response packet is received from the second network node. The non-router node determines whether another request packet can be sent to another network in the internetwork based on a value of the packet-in-flight counter.

Abstract: A network interface device includes a transceiver capable of connecting a utility meter to a wireless network, and a visual indicator capable of displaying a status of a connection between the utility meter and the wireless network. The visual indicator can be an LED, whose display state indicates the status of network connectivity. Alternatively, the visual indicator can be an integrated digital display of the meter that is typically used to indicate a metering parameter, such as total consumption or rate of consumption.

Abstract: Techniques are disclosed in which a parameter used for scrambling packet data is changed. If the initial scrambling of a packet causes a killer packet to be generated, the packet is re-scrambled using a different value for the parameter, so that a killer packet is avoided. In a network that employs frequency-hopping spread spectrum communications, a channel identifier can be employed as an input to the scrambling algorithm. In this implementation, a given packet of data will be transmitted on one channel with a first sequence of bits when it is scrambled, and on another channel with a different sequence of bits. If the scrambled packet for one of these channels results in a killer packet, it is statistically unlikely that it will also be a killer packet when it is re-transmitted on the other channel.