Routing Loops in DAG-Based Low Power and Lossy Networks

Free registration required

Executive Summary

Directed Acyclic Graphs (DAGs), rooted at popular/ default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low power and lossy networks that include wireless sensor networks and those based on power line communication. A DAG maintains its acyclic nature by requiring that each DAG node must have a higher 'rank' than any of its DAG parents. While a node may decrease its DAG rank safely, increasing its DAG rank to add a new parent may result in a routing loop if the new parent is also a descendant in the DAG.

  • Format: PDF
  • Size: 377.78 KB