BIER Bitmap Routing for LLN Memory and Energy Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low-Power and Lossy Networks (LLNs) face challenges such as lossy links, low bandwidth, limited resources, and dynamic environmental conditions, which affect packet delivery rates and require efficient routing protocols that minimize state creation and conserve energy.
Innovation Solution
The implementation of Bit Index Explicit Replication (BIER) in LLNs, which assigns unique bit positions to nodes in a directed acyclic graph (DAG), allowing for efficient message forwarding by using bitmaps to identify destinations and reduce state information, enabling unicast and multicast operations with minimal resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional routing protocols are used in LLNs, then packet delivery can be maintained, but memory requirements and state information increase
Solution Approach 1:
The patent segments the routing state information into bitmap representations where each bit corresponds to a destination node. This segmentation allows routers to maintain routing state in a compact format, reducing memory requirements while preserving packet delivery capability through efficient bitmap-based forwarding decisions
Solution Approach 2:
The patent changes the parameter representation from traditional routing table entries to bitmap parameters. By encoding destination information as bit positions in bitmaps rather than full routing entries, the system reduces state information storage requirements while maintaining the ability to make forwarding decisions for packet delivery
2Reliability
If comprehensive routing state is maintained for all destinations, then packet delivery reliability improves, but energy consumption increases
Solution Approach 1:
The patent implements partial action by maintaining routing state only for destinations that are actually reachable through the current router. The bitmap representation allows routers to track only relevant destinations rather than maintaining comprehensive routing state for all possible network nodes, reducing energy consumption while preserving packet delivery reliability for actual destinations
3Adaptability or versatility
If traditional multicast routing is used, then group communication is supported, but state information and processing overhead increase
Solution Approach 1:
The patent merges unicast and multicast routing state representations by using the same bitmap structure for both. Destination bitmaps can represent single destinations (unicast) or multiple destinations (multicast) uniformly, eliminating the need for separate state maintenance mechanisms and reducing overall device complexity while supporting both communication modes
Data Source
Figure 1
Figure 2
Figure 3
AI summary
In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG) as used by RPL, the IPv6 Routing Protocol for Low-power and lossy networks (LLNs). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node. Aggregating node bitmaps by OR operation with the bitmaps of their children allows to spare resources in nodes of LLNs; forwarding to the destination can be easily performed via AND operation on bitmaps. Deciding unicast or broadcast forwarding based on the density of interested children saves energy by optimally avoiding awaking of nodes.