Named Data Routing Protocol for Low-Power Lossy Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional protocols such as OSPF, AODV, and IS-IS are unsuitable for Low Power and Lossy Networks (LLNs) due to challenges like lightweight control overhead, routing table scalability, and the need to enforce routing constraints, which existing technologies fail to address effectively.

Innovation Solution

The adoption of a hierarchical naming scheme, Named Data Networking (NDN) in LLNs, using extended DODAG Information Object (NDIO) and DODAG Destination Advertisement Object (NDAO) messages to identify routers and manage content distribution in both storing and non-storing modes, optimizing message forwarding through the determination of optimal paths based on routing entries.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional routing protocols (OSPF, AODV, IS-IS) are used in LLNs, then routing functionality is provided, but control overhead becomes excessive and routing table scalability deteriorates

Engineering Contradiction:
Improverouting functionalityVSAvoidcontrol overhead
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the routing information by separating name prefix routing from traditional IP address routing. The NDN protocol segments routing updates into specific name prefix advertisements, allowing selective routing table entries rather than comprehensive topology information, thereby reducing control overhead while maintaining routing functionality in LLNs

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimension for routing by using hierarchical name prefixes instead of traditional flat IP addressing. This dimensional change allows routing information to be organized in a tree-like hierarchy, improving scalability and reducing the complexity of routing tables in large LLN deployments

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Productivity

If comprehensive routing information is maintained for optimal path selection, then message forwarding efficiency is improved, but memory consumption and processing capability requirements increase

Engineering Contradiction:
Improvemessage forwarding efficiencyVSAvoidmemory consumption
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent applies local quality by allowing each LLN node to maintain routing information specific to its local context and subscribed name prefixes, rather than maintaining comprehensive global routing tables. Nodes store routing entries only for name prefixes relevant to their function, reducing memory consumption while enabling efficient local message forwarding decisions

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent implements partial action by having nodes maintain routing information for only a subset of name prefixes rather than all possible destinations. This selective maintenance of routing entries reduces memory and processing requirements while still enabling efficient forwarding for the specific content relevant to each node's application needs

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS10530685B2Named data routing protocol for low-power and lossy wide-area networks (NRPL)
Publication Date: 2020.01.07 FUTUREWEI TECHNOLOGIES INC
  • US10530685B2 patent drawing
  • US10530685B2 patent drawing
  • US10530685B2 patent drawing

AI summary

The disclosure relates to technology distributing messages in a low power and lossy network (LLNs). A downstream message including one or more name prefixes hosted at a source node is forwarded along a nodal route of a routing topology. An upstream message is received from one or more nodes along one or more nodal routes in the routing topology based on a routing entry towards a parent node as learned from the downstream message, and an interest message, including one or more of a request for content or rank, is received from the one or more nodes along the one or more nodal routes having an optimal path, the optimal path determined by routing entries stored in the one or more nodes.