Presented herein is a recursive method to find a common ancestor to a source node (source), a destination node (destination), and intermediate nodes in a constrained network, as well as to compute shortcut route(s) in order to offload the root of mundane routing computations. The techniques presented herein provide methods to filter neighbor information that is provided to a common ancestor node in order to enable these operation in a constrained network.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.