NC-DSF Delay Control for IIoT Network Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional technologies for network coding in IIoT environments face challenges such as increased network interference, inefficient resource utilization, and high computing complexity, particularly in multi-hop and large IIoT settings where delay-sensitive data transmission is critical.
Innovation Solution
A delay control system utilizing a fully distributed routing scheme called Network Coding-Aware Delayed Store and Forward (NC-DSF) that calculates and sets optimal deadlines for packet transmission, allowing for efficient network coding and minimizing end-to-end routing delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If a transmission path is routed focusing on delay and transmission waiting time to meet requirements in the IIOT environment, then delay is reduced, but network interference greatly increases and available wireless resources saturate
Solution Approach 1:
The patent implements dynamic routing that adapts to changing network conditions by calculating deadlines and selecting paths based on real-time link states. The system dynamically adjusts routing decisions to balance delay requirements with interference avoidance, rather than using static delay-optimized paths that cause resource saturation.
Solution Approach 2:
The system changes routing parameters by introducing deadline-based path selection and network coding opportunities identification. By modifying the routing metric to include deadline constraints and interference considerations, the system finds optimal paths that satisfy delay requirements without causing network saturation.
2Object-affected harmful factors
If conventional interference avoidance technology is used, then network interference is reduced, but inefficient resources are increased and computing complexity increases as the number of IIoT nodes increases
Solution Approach 1:
The patent extracts and utilizes existing packet copies in the network rather than requiring new complex interference avoidance computations. By identifying network coding opportunities with existing packets at intermediate nodes, the system reduces interference without adding significant computing complexity.
Solution Approach 2:
The system leverages packet copying through network coding, where intermediate nodes create coded combinations of existing packets. This approach reduces the need for retransmissions and interference avoidance computations while efficiently utilizing available wireless resources.
3Productivity
If network coding is used to improve resource reuse and network throughput, then resource efficiency increases, but problems arise with network coding-aware routing, packet encoding and decoding, signal synchronization, information caching, error correction, and resource allocation
Solution Approach 1:
The patent implements partial network coding by identifying specific coding opportunities based on deadline constraints and link states. Rather than applying network coding universally, the system selectively applies it where beneficial, reducing the complexity of encoding/decoding, synchronization, and resource allocation while still improving throughput.
Solution Approach 2:
The system enables intermediate nodes to autonomously identify network coding opportunities and make routing decisions based on local link state information and deadline requirements. This distributed approach reduces the complexity of centralized resource allocation and synchronization while maintaining network coding benefits.
Data Source
AI summary
Embodiments relate to a delay control system for improving network coding of bidirectional traffic, and more particularly to a delay control system for improving network coding of bidirectional traffic that sets a path with a constraint on time in an IIOT network and controls new network coding-aware routing capable of efficiently utilizing opportunities for network coding, and the delay control system for improving network coding of bidirectional traffic includes an intermediate node request collector configured to receive a route request (RREQ) packet transmitted from a source node, an intermediate node calculator configured to calculate a deadline between the source node and a destination node based on the RREQ packet received by the intermediate node request collector, and an intermediate node request transmitter configured to transmit the RREQ packet through an optimal path between the source node and the destination node based on the deadline.