1. A method, comprising: receiving, at a particular node in a computer network, an indication of a number of child nodes of one or more potential parent nodes to the particular node in a directed acyclic graph (DAG); selecting a particular potential parent node with the highest number of child nodes as a DAG parent for the particular node; and joining the DAG by the particular node at the selected DAG parent.