Abstract: Techniques described herein relate to intelligent migration between personal area networks (PANs) of a wireless mesh network. In one example, a method includes receiving, by a node connected to a first PAN, a packet from a second PAN. Based on the packet, the node determines that a second instability factor related to stability of the second PAN differs by at least a margin from a first instability factor related to stability of the first PAN. The node transmits, to a neighboring node in the first PAN, a migration notification message indicating that the node is migrating and receives, from the neighboring node in the first PAN, a request for the node to remain in the first PAN. The node applies one or more rules to reject the request for the node to remain in the first PAN and, based on rejecting the request, proceeds to complete the migration.

Abstract: A system for optimizing routes for time-critical messages in a mesh network is provided. For example, a child node in a mesh network can communicate with the root node through any of its parent nodes. The child node is configured to transmit regular data to the root node through a primary route associated with its primary parent. When there is a time-critical message to be transmitted to the root node, the child node estimates a round trip time (RTT) for each route between the child node and the root node. The child node selects, among its parent nodes, a parent node whose associated route has the lowest RTT and transmits the time-critical message to the root node through the selected parent node. After the transmission of the time-critical message, the child node switches back to the primary route to transmit additional regular data to the root node.

Abstract: In some implementations, formation of loops between nodes in an RPL network may be avoided. A node that receives a neighbor-discovery message may determine, based on a parent-child status, whether the neighbor-discovery message was received from a parent of the node. If the neighbor-discovery message was received from the parent, the node may transmit an error code to the parent. In addition, the node may determine, based on a comparison of reliability rankings, whether the neighbor-discovery message was received from a node with relatively high reliability, such as a potential grandparent node. If the neighbor-discovery message was received from a high-reliability node, the node may transmit an error code to the high-reliability node. Furthermore, the node may reduce network traffic by withholding a neighbor-detection message from a child node. The node may transmit a response to neighbor-detection messages received from the child node.

Abstract: A system for optimizing routes for time-critical messages in a mesh network is provided. For example, a child node in a mesh network can communicate with the root node through any of its parent nodes. The child node is configured to transmit regular data to the root node through a primary route associated with its primary parent. When there is a time-critical message to be transmitted to the root node, the child node estimates a round trip time (RTT) for each route between the child node and the root node. The child node selects, among its parent nodes, a parent node whose associated route has the lowest RTT and transmits the time-critical message to the root node through the selected parent node. After the transmission of the time-critical message, the child node switches back to the primary route to transmit additional regular data to the root node.

Abstract: In some implementations, formation of loops between nodes in an RPL network may be avoided. A node that receives a neighbor-discovery message may determine, based on a parent-child status, whether the neighbor-discovery message was received from a parent of the node. If the neighbor-discovery message was received from the parent, the node may transmit an error code to the parent. In addition, the node may determine, based on a comparison of reliability rankings, whether the neighbor-discovery message was received from a node with relatively high reliability, such as a potential grandparent node. If the neighbor-discovery message was received from a high-reliability node, the node may transmit an error code to the high-reliability node. Furthermore, the node may reduce network traffic by withholding a neighbor-detection message from a child node. The node may transmit a response to neighbor-detection messages received from the child node.

Abstract: This disclosure involves neighboring node discovery in a network. For instance, a neighboring node discovery method includes receiving, at a first node, a neighbor solicitation message. The neighbor solicitation message includes an indication that a second node is a low power device and a first scheduled response time. The method also includes transmitting at the scheduled response time, by the first node, a first neighbor advertisement message. The first neighbor advertisement message includes an indication of no availability in a neighbor cache of the first node and a second scheduled respond time. Further, the method includes removing one or more nodes from the neighbor cache, and receiving, at the first node at the second scheduled response time, a second neighbor solicitation message from the second node indicating availability in the neighbor cache. Additionally, the method includes linking the first node and the second node.

Abstract: This disclosure involves neighboring node discovery in a network. For instance, a neighboring node discovery method includes receiving, at a first node, a neighbor solicitation message. The neighbor solicitation message includes an indication that a second node is a low power device and a first scheduled response time. The method also includes transmitting at the scheduled response time, by the first node, a first neighbor advertisement message. The first neighbor advertisement message includes an indication of no availability in a neighbor cache of the first node and a second scheduled respond time. Further, the method includes removing one or more nodes from the neighbor cache, and receiving, at the first node at the second scheduled response time, a second neighbor solicitation message from the second node indicating availability in the neighbor cache. Additionally, the method includes linking the first node and the second node.

Abstract: A network using a routing protocol for low-power and lossy networks (“RPL”) can provide timing information for a next destination oriented directed acyclic graph (“DODAG”) information object (“DIO”) packet by including DIO timing information in an RPL packet or a beacon. When a low energy node receives the RPL packet, it may use the DIO timing information to determine a wake time which corresponds to the timing of the next DIO packet. The low energy node may enter a sleep state after determining the wake time and remain in the sleep state until the wake time when it enters an active state and listens for the next DIO packet. Alternatively, DIO slots in a DIO slot frame may be allocated for communicating DIO packets.

Abstract: A network using a routing protocol for low-power and lossy networks (“RPL”) can provide timing information for a next destination oriented directed acyclic graph (“DODAG”) information object (“DIO”) packet by including DIO timing information in an RPL packet or a beacon. When a low energy node receives the RPL packet, it may use the DIO timing information to determine a wake time which corresponds to the timing of the next DIO packet. The low energy node may enter a sleep state after determining the wake time and remain in the sleep state until the wake time when it enters an active state and listens for the next DIO packet. Alternatively, DIO slots in a DIO slot frame may be allocated for communicating DIO packets.

Abstract: A coordinator node may dynamically allocate links for communication in a network and communicate the link allocations via beacons. The beacons include a dynamic allocation change detection IE, which the coordinator node adjusts each time it modifies the link allocations. A receiving node receives the beacon and uses the value of the dynamic allocation change detection IE to determine whether the link allocations have been modified. The coordinator node may transmit the beacons during scheduled beacon slots or shared links. If the coordinator node transmits a beacon during a shared link, it may also initiate communication of the beacon early during the slot. A receiving node may in turn transmit its data early in its newly allocated link, if it fails to transmit previously in this link due to a CCA failure.

Abstract: A coordinator node may dynamically allocate links for communication in a network and communicate the link allocations via beacons. The beacons include a dynamic allocation change detection IE, which the coordinator node adjusts each time it modifies the link allocations. A receiving node receives the beacon and uses the value of the dynamic allocation change detection IE to determine whether the link allocations have been modified. The coordinator node may transmit the beacons during scheduled beacon slots or shared links. If the coordinator node transmits a beacon during a shared link, it may also initiate communication of the beacon early during the slot. A receiving node may in turn transmit its data early in its newly allocated link, if it fails to transmit previously in this link due to a CCA failure.

Abstract: Disclosed are various embodiments for assigning a short address to a node in a network. A first node receives an association request that is a request from a second node to join the network. The first node transmits an association response to the second node, whereby the association response permits the second node to conditionally join the network and enter a low-power state. Data from the association request is transmitted to a coordinator node for the network on behalf of the second node. The first node receives a proxy response from the coordinator node in response to the data from the association request. When the second node is active, a notification is transmitted to the second node based on the response to the request. The notification includes an assignment of a short address when the response indicates the second node has joined the network.

Abstract: Disclosed are various embodiments for assigning a short address to a node in a network. A first node receives an association request that is a request from a second node to join the network. The first node transmits an association response to the second node, whereby the association response permits the second node to conditionally join the network and enter a low-power state. Data from the association request is transmitted to a coordinator node for the network on behalf of the second node. The first node receives a proxy response from the coordinator node in response to the data from the association request. When the second node is active, a notification is transmitted to the second node based on the response to the request. The notification includes an assignment of a short address when the response indicates the second node has joined the network.