Abstract: Techniques are directed to determining, based at least in part on link quality metric data associated with communication over a link between the first node and a second node, to send an information message to the second node preceded by sending a corresponding polling message to the second node or to send the information message to the second node not preceded by sending the corresponding polling message to the second node. Based at least in part on the determining, a node may send the information message to the second node preceded by sending the corresponding polling message to the second node or sending the information message to the second node not preceded by sending the corresponding polling message to the second node. Overhead associated with polling messages may be reduced.

Abstract: Techniques for allocating event offsets within a period of transmission are described. A mains-powered device (MPD) may act as a “parent” to one or more battery-powered devices (BPDs). The MPD may assign “event offsets” to each BPD. The event offset is a time by which the BPD's timeslot is “offset” from the start of a periodic cycle of transmissions by the MPD. Thus, each event offset indicates a time that the BPD must be “awake,” i.e., operating its radio receiver and/or performing other functionality. A BPD may spend a substantial fraction of its time in a “sleep” mode, wherein less power is used and fewer functions are performed than during a period of that BPD's event offset. Another BPD may have a different event offset. Communications by the MPD with each child BPD may be substantially uniformly distributed over the period. To increase efficiency, groups of BPDs may receive multicasts.

Abstract: A first node operates in a network. The first node sends a polling message to a second node over a link at a first data rate, receiving an acknowledgement message from the second node. Based at least in part on receiving the acknowledgement message, the first node determines the second node is available to receive an information message. Based at least in part on the determining the second node is available to receive the information message, the first node sends the information message to the second node over the link at a second data rate. The second data rate is based at least on an indication of observed behavior of the link and the first data rate is based at least on the second data rate. For example, the first node may determine the first data rate to be a next slowest available data rate than the second data rate.

Abstract: One embodiment of the present invention sets forth a technique for establishing communications within a multicast group of nodes included in a mesh network. The technique includes detecting that a first message related to the member node joining the multicast group has not been received from a multicast group leader included in the multicast group. The technique also includes in response, generating a first broadcast message for the member node that includes a multicast join request. The technique further includes forwarding the first broadcast message to one or more nodes included in the mesh network that are direct neighbors of the member node, wherein at least one node included in the one or more nodes further forwards the first broadcast message based on a first maximum hop limit.

Abstract: One embodiment of the present invention sets forth a technique for establishing communications within a multicast group of nodes included in a mesh network. The technique includes receiving a first unicast message that includes a multicast join request from a member node included in the multicast group, wherein the multicast join request specifies a first shortest path from the member node to a multicast group leader also included in the multicast group. The technique also includes forwarding the first unicast message to the multicast group leader along the first shortest path, and forwarding a second unicast message from the multicast group leader to the member node along a second shortest path, wherein the second unicast message includes a multicast join acknowledgment. The technique further includes declaring a first node as a multicast forwarder in the multicast group, wherein the first node is responsible for forwarding the second unicast message.

Abstract: Techniques for managing multi-mode communications between nodes in a network include initiating, by a first node in a mesh network, a carrier sense multiple access with collision avoidance (CSMA/CA) session while the first node is in a first mode. The CSMA/CA session is associated with a request to transmit a data message to a second node in the mesh network. Initiating the CSMA/CA session includes determining availability of a channel associated with a channel schedule of the second node associated with the first mode.

Abstract: Techniques are directed to determining a rank value associated with a first network node. An example method includes determining a second network node indicated as being a preferred parent network node for the first network node. A first rank value is processed to determine a second rank value, the first rank value corresponding to a path from the second network node to a destination network node, including rounding up the first rank value in a predetermined manner to at least a second next higher integral rank value than the first rank value, to determine the second rank value. The second rank value is processed with at least a third rank value to determine the rank value associated with the first network node, the third rank value associated with a path from one of a plurality of candidate parent network nodes, for the first network node, to the destination network node.

Abstract: Techniques are directed to using communication metric data associated with multiple modulation schemes to achieve a link quality metric that is representative of the link as a whole, across the multiple modulation schemes that may be employed on the link. A calculation of a link quality metric may be triggered by a network layer transmission attempt, with communication metrics accumulated at the link layer of the link. A filter used to calculate the link quality metric may be updated based on network layer transmission attempts, based on successful and/or unsuccessful transmissions at a Media Access Control (MAC) layer of the link. More generally, a calculation of link quality may be triggered by a higher layer transmission attempt while being calculated based on transmission attempts at a lower layer of the link.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Various embodiments disclose a computer-implemented method for managing multi-mode communications between node devices in a network comprising initiating a carrier sense multiple access with collision avoidance (CSMA/CA) session at a first node while in a first mode, where the CSMA/CA session is associated with a request to transmit a data message to a second node, switching from the first mode to a second mode, in response to switching to the second mode, suspending the CSMA/CA session at the first node, switching back to the first mode, and in response to switching back to the first mode, resuming the CSMA/CA session at the first node.

Abstract: Techniques are directed to using communication metric data associated with multiple modulation schemes to achieve a link quality metric that is representative of the link as a whole, across the multiple modulation schemes that may be employed on the link. A calculation of a link quality metric may be triggered by a network layer transmission attempt, with communication metrics accumulated at the link layer of the link. A filter used to calculate the link quality metric may be updated based on network layer transmission attempts, based on successful and/or unsuccessful transmissions at a Media Access Control (MAC) layer of the link. More generally, a calculation of link quality may be triggered by a higher layer transmission attempt while being calculated based on transmission attempts at a lower layer of the link.

Abstract: Various embodiments disclose a computer-implemented method for managing multi-mode communications between node devices in a network comprising initiating a carrier sense multiple access with collision avoidance (CSMA/CA) session at a first node while in a first mode, where the CSMA/CA session is associated with a request to transmit a data message to a second node, switching from the first mode to a second mode, in response to switching to the second mode, suspending the CSMA/CA session at the first node, switching back to the first mode, and in response to switching back to the first mode, resuming the CSMA/CA session at the first node.

Abstract: Techniques are directed to using communication metric data associated with multiple modulation schemes to achieve a link quality metric that is representative of the link as a whole, across the multiple modulation schemes that may be employed on the link. A calculation of a link quality metric may be triggered by a network layer transmission attempt, with communication metrics accumulated at the link layer of the link. A filter used to calculate the link quality metric may be updated based on network layer transmission attempts, based on successful and/or unsuccessful transmissions at a Media Access Control (MAC) layer of the link. More generally, a calculation of link quality may be triggered by a higher layer transmission attempt while being calculated based on transmission attempts at a lower layer of the link.

Abstract: A first node operates in a network. The first node sends a polling message to a second node over a link at a first data rate, receiving an acknowledgement message from the second node. Based at least in part on receiving the acknowledgement message, the first node determines the second node is available to receive an information message. Based at least in part on the determining the second node is available to receive the information message, the first node sends the information message to the second node over the link at a second data rate. The second data rate is based at least on an indication of observed behavior of the link and the first data rate is based at least on the second data rate. For example, the first node may determine the first data rate to be a next slowest available data rate than the second data rate.

Abstract: Techniques are directed to determining, based at least in part on link quality metric data associated with communication over a link between the first node and a second node, to send an information message to the second node preceded by sending a corresponding polling message to the second node or to send the information message to the second node not preceded by sending the corresponding polling message to the second node. Based at least in part on the determining, a node may send the information message to the second node preceded by sending the corresponding polling message to the second node or sending the information message to the second node not preceded by sending the corresponding polling message to the second node. Overhead associated with polling messages may be reduced.

Abstract: Techniques are directed to determining a rank value associated with a first network node. An example method includes determining a second network node indicated as being a preferred parent network node for the first network node. A first rank value is processed to determine a second rank value, the first rank value corresponding to a path from the second network node to a destination network node, including rounding up the first rank value in a predetermined manner to at least a second next higher integral rank value than the first rank value, to determine the second rank value. The second rank value is processed with at least a third rank value to determine the rank value associated with the first network node, the third rank value associated with a path from one of a plurality of candidate parent network nodes, for the first network node, to the destination network node.

Abstract: Techniques for discovering a device in a wireless network are described herein. For example, a first device may send a network discovery solicitation message to a second device to solicit a communication relationship (e.g., request connection to a parent). The network discovery solicitation may include one or more information elements that indicate a channel function associated with the first device and a listening window during which the first device will be listening for communications. The second device may use the channel function to frequency hop and send a network discovery message to the first device during the listening window. The network discovery message may include one or more information elements to establish a sampled schedule for the first device moving forward.

Abstract: Techniques are directed to using communication metric data associated with multiple modulation schemes to achieve a link quality metric that is representative of the link as a whole, across the multiple modulation schemes that may be employed on the link. A calculation of a link quality metric may be triggered by a network layer transmission attempt, with communication metrics accumulated at the link layer of the link. A filter used to calculate the link quality metric may be updated based on network layer transmission attempts, based on successful and/or unsuccessful transmissions at a Media Access Control (MAC) layer of the link. More generally, a calculation of link quality may be triggered by a higher layer transmission attempt while being calculated based on transmission attempts at a lower layer of the link.

Abstract: Disclosed are techniques to provide data at listening event offsets, using a buffering scheme having a common buffer. Received data, to be transmitted at the listening event offsets, is stored into the common buffer without classification to listening event offsets. Data to be transmitted at an upcoming listening event offset is identified in the common buffer prior to the listening event offset. Example techniques provide for simpler reconfigurability of listening events offsets, as well as transmitting data at each listening event offset that is responsive to a state of the system prior to the listening event offset.

Abstract: Disclosed are techniques to provide data at listening event offsets, using a buffering scheme having a common buffer. Received data, to be transmitted at the listening event offsets, is stored into the common buffer without classification to listening event offsets. Data to be transmitted at an upcoming listening event offset is identified in the common buffer prior to the listening event offset. Example techniques provide for simpler reconfigurability of listening events offsets, as well as transmitting data at each listening event offset that is responsive to a state of the system prior to the listening event offset.