Opportunistic Downward Path Caching in RPL LLN Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Low-power and Lossy Networks (LLNs), existing routing protocols require persistent reachability and large source-route headers, which are inefficient for devices with constrained resources and sporadic communication needs, leading to high network traffic and processing requirements.
Innovation Solution
Implementing opportunistic caching of downward paths in RPL nodes, allowing them to temporarily store reachability information without relying on persistent route table entries, enabling data packets to be forwarded independently of routing protocols and reducing the need for source-route headers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If RPL nodes use persistent route table entries for downward routing, then routing reliability is improved, but memory consumption and device complexity increase
Solution Approach 1:
The patent applies dynamics by making the routing table persistent only when needed. The system dynamically transitions between storing full route tables and using opportunistic caching based on communication patterns. When a target device transmits data upward, the parent node opportunistically caches the downward path temporarily, avoiding the need for persistent storage while maintaining routing capability during active communication phases.
Solution Approach 2:
The patent uses cheap short-living objects by implementing temporary cached downward paths that are discarded after use or when communication ends. Instead of maintaining expensive persistent route table entries in constrained RPL nodes, the system creates lightweight cache entries that exist only transiently during sporadic communication events, reducing overall memory consumption and device complexity.
2Reliability
If RPL nodes maintain large source-route headers for persistent reachability, then routing reliability is improved, but processing power and energy consumption increase
Solution Approach 1:
The patent extracts the routing information storage burden from individual RPL nodes and concentrates it in the DAG root node. The DAG root maintains the complete routing state and inserts source-route headers only when necessary, while child nodes simply forward packets using their parent's address. This extraction eliminates the need for each node to maintain large routing tables or process complex routing decisions, dramatically reducing processing power and energy consumption across the network.
Solution Approach 2:
The patent introduces the DAG root as an intermediary that handles all routing decision-making and source-route header insertion. Child RPL nodes act as intermediaries for packet forwarding but delegate routing intelligence to the DAG root. This intermediary approach allows constrained nodes to avoid complex routing processing while maintaining reliable delivery through the DAG root's centralized routing control.
3Quantity of substance
If RPL nodes use non-storing mode with source routing, then memory consumption is reduced, but network traffic and processing requirements increase
Solution Approach 1:
The patent applies preliminary action by having the DAG root pre-calculate and insert complete source-route headers into packets before transmission. This preliminary routing decision eliminates the need for intermediate nodes to perform routing lookups or generate routing information during packet forwarding. The source-route header is prepared in advance by the DAG root based on the cached downward path, reducing real-time processing requirements and network traffic overhead during active communication.
4Productivity
If RPL nodes cache downward paths opportunistically, then scalability and efficiency are improved, but routing table management complexity increases
Solution Approach 1:
The patent inverts the traditional routing approach by having child nodes cache paths to their parents rather than parents caching paths to children. When a target device transmits data upward to the DAG root, parent nodes observe this transmission and opportunistically cache the reverse (downward) path. This inversion leverages the natural upward traffic flow in LLNs to generate downward routing information without requiring complex parent-to-child path computation or maintenance.
Data Source
Figure 1
Figure 2
Figure 3A
AI summary
In one embodiment, a method comprises: receiving, by a parent network device in a directed acyclic graph (DAG) network topology, a data packet destined toward a DAG root and having been output by a target device in the network topology; identifying, by the parent network device based on the received data packet, an identifiable condition for caching a downward path enabling the parent network device to reach the target device independent of any route table entry in the parent network device; and caching, in the parent network device, the downward path enabling the parent network device to reach the target device independent of any route table entry in the parent network device.