Bit-Indexed Multicast Forwarding for Low-Power Lossy Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low-Power and Lossy Networks (LLNs) face challenges in reliable multicasting due to lossy links, low bandwidth, and limited resources, making it difficult to ensure that multicast messages reach all destinations, especially in environments with high interference and congestion.
Innovation Solution
The implementation of a bit-indexed mechanism that uses a bitmap to identify destinations and aggregates acknowledgments, allowing intermediate nodes to store only temporary acknowledgement information, reducing network overhead and avoiding the need for retransmission state storage, enabling efficient and reliable multicast messaging.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional multicast retransmission mechanisms are used in LLNs, then message delivery reliability can be improved, but network overhead and device resource consumption increase significantly
Solution Approach 1:
The patent segments the multicast group management by introducing bit-indexed forwarding tables that divide the network into manageable segments. Each intermediate node maintains a compact bitmap representing only the subset of destinations in its segment, rather than tracking all multicast group members. This segmentation reduces memory requirements and processing overhead while maintaining reliable delivery through targeted retransmissions.
Solution Approach 2:
The patent changes the representation parameter from traditional list-based or matrix-based routing tables to compact bitmap representations. This parameter change transforms the storage requirement from O(n) or O(n²) to O(n/8) bytes, significantly reducing memory consumption. The bitmap parameters allow efficient tracking of acknowledged and unacknowledged destinations, enabling reliable retransmission with minimal resource usage.
2Reliability
If intermediate nodes store complete retransmission state for all multicast destinations, then retransmission reliability improves, but memory requirements exceed LLN device capabilities
Solution Approach 1:
The patent divides the multicast group tracking responsibility among intermediate nodes using bit-indexed forwarding tables. Each node maintains bitmaps only for the destinations in its local segment or subtree, rather than storing state for all destinations. This segmentation enables reliable retransmission tracking while keeping individual node memory requirements within LLN device capabilities.
Solution Approach 2:
The patent introduces a hierarchical dimension to the routing state management. Instead of flat storage of all destination states at each node, the system organizes state information in a tree-like hierarchy where intermediate nodes store condensed bitmap representations. This dimensional organization allows complete retransmission state to be distributed across multiple nodes with reduced individual memory footprints.
3Reliability
If multicast messages are retransmitted to all destinations, then delivery reliability improves, but network bandwidth consumption increases in lossy links
Solution Approach 1:
The patent implements feedback mechanisms where intermediate nodes send acknowledgments upstream indicating which destinations have received the multicast message. The source node uses this feedback information to determine which specific destinations require retransmission, rather than blindly retransmitting to all destinations. This feedback-driven approach minimizes unnecessary bandwidth consumption on lossy links.
Solution Approach 2:
The patent extracts only the necessary retransmission information from the complete multicast group, using bit-indexed forwarding tables to identify specifically which destinations need retransmission. Instead of retransmitting to the entire multicast group, the system extracts and targets only the unacknowledged destinations, reducing bandwidth consumption while maintaining delivery reliability.
4Manufacturing precision
If complex routing tables are used for multicast forwarding, then forwarding precision improves, but device processing capability requirements exceed LLN constraints
Solution Approach 1:
The patent fundamentally changes the data structure parameter from complex routing tables to simple bitmaps. This parameter change reduces the computational complexity of forwarding decisions from O(n) or O(n²) to O(n/64) or better, making precise multicast forwarding achievable on LLN devices with limited processing capability.
Solution Approach 2:
The patent uses lightweight bitmap representations that are computationally inexpensive to manipulate and update. These simple bitmap structures act as disposable, easy-to-compute alternatives to complex routing tables, enabling precise forwarding decisions without requiring significant processing power or memory resources.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
In one embodiment, a device in a network sends a first multicast message to a plurality of destinations in the network. The first multicast message includes a first bitmap that identifies the destinations. The device receives one or more acknowledgements from a subset of the destinations. The device determines a retransmission bitmap that identifies those of the plurality of destinations that did not acknowledge the first multicast message, based on the received one or more acknowledgements. The device sends a retransmission multicast message to those of the plurality of destinations that did not acknowledge the first multicast message. The retransmission multicast message includes the retransmission bitmap.