Landis+gyr Innovations, Inc.

Ankush Sabharwal

Shobhit Kumar Singh

Saurabh Jain

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.

Efficient message transmission and loop avoidance in an RPL network

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.

Systems and methods for neighboring node discovery in a network

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.

System and method for improved propagation of dynamic link information in a time synchronized channel hopping network

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.

Growing community of inventors

New Delhi, India

Ankush Sabharwal