INCREASED COMMUNICATION OPPORTUNITIES WITH LOW-CONTACT NODES IN A COMPUTER NETWORK

摘要

In one embodiment, a particular node (e.g., root node) in a directed acyclic graph (DAG) in a computer network may identify a low-contact (e.g., wireless) node in the DAG that is at risk of having an invalid path when attempts are made to reach the low-contact node. In response, the particular node may identify neighbors of the low-contact node, and may establish a multicast tree from the particular node to the low-contact node through a plurality of the neighbors to reach the low-contact node. When sending traffic to the low-contact node, the particular node sends the traffic on the multicast tree, wherein each of the plurality of neighbors attempts to forward the traffic to the low-contact node. In another embodiment, the low- contact node itself indicates its status to the particular/root node, along with its list of neighbors in order to receive the multicast traffic.