Reduced topology routing in shared media communication networks

An apparatus, comprising:

• one or more network interfaces to communicate within a shared media communication network;
• a processor coupled to the network interfaces and adapted to execute one or more processes;
• and
• a memory configured to store a process executable by the processor, the process when executed operable to:
• determine a current path cost in a routing topology from the apparatus to a root node of the routing topology via a current parent node;
• determine, for each reachable potential parent node of the apparatus, a respective path cost from the apparatus to the root node via each potential parent and a respective link metric from the apparatus to each potential parent node;
• determine a set of acceptable parent nodes selected from the potential parent nodes, wherein acceptable parent nodes have a respective path cost that is less than the current path cost plus a cost increase, and also have a respective link metric from the apparatus that is within a link metric range;
• determine, for each acceptable parent node of the set, a respective number of child nodes of the corresponding acceptable parent node;
• and
• select a new parent node for the apparatus in the routing topology based on giving preference to acceptable parent nodes having a greater respective number of child nodes.

A tangible, non-transitory, computer-readable media having software encoded thereon, the software, when executed by a processor on a particular node in a shared media communication network, operable to:

• determine a current path cost in a routing topology from the particular node to a root node of the routing topology via a current parent node;
• determine, for each reachable potential parent node of the particular node, a respective path cost from the particular node to the root node via each potential parent and a respective link metric from the particular node to each potential parent node;
• determine a set of acceptable parent nodes selected from the potential parent nodes, wherein acceptable parent nodes have a respective path cost that is less than the current path cost plus a cost increase, and also have a respective link metric from the particular node that is within a link metric range;
• determine, for each acceptable parent node of the set, a respective number of child nodes of the corresponding acceptable parent node;
• and
• select a new parent node for the particular node in the routing topology based on giving preference to acceptable parent nodes having a greater respective number of child nodes.