and can have multiple destination nodes, the DODAG strategy is directed and has only one destination node. The connection is always upward from the end node to the destination node. Thus, there are multiple end nodes connected to a destination node. In the DODAG method, the routes are determined using the Distance Vector Algorithm (DVA). The routes are determined according to defined rules and targets, which are based on energy consumption, latency, connection quality or other parameters.
Directed Acyclic Graph (DODAG) is one of two routing strategies supported by the Routing Protocol for Low Power and Lossy Networks (RPL). The other strategy used in routing of Low Power and Lossy Networks (NNL) is Directed Acyclic Graph (DAG). While the DAG strategy is a direct link without loops
Informationen zum Artikel
|Englisch:||destination oriented directed acyclic graph - DODAG|