Dynamic Segment Reformatting for Wireless Mesh Link Adaptation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless telecommunications networks with mesh topology and intermittent links face challenges in maintaining stable end-to-end paths and efficient data transmission due to rapid fluctuations in connectivity, leading to inefficient use of communication resources and potential packet loss.
Innovation Solution
A method where nodes in a wireless telecommunications network dynamically adjust segment sizes for data transmission based on real-time link conditions, using a routing table to select optimal neighbor nodes and reformat segments for efficient transfer, minimizing resource consumption and packet loss by adapting to changes in link states and routing table modifications.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If nodes use traditional IP architecture with stable end-to-end path requirements, then routing stability is improved, but adaptability to rapid connectivity fluctuations deteriorates
Solution Approach 1:
The patent implements dynamic routing by allowing nodes to detect link state modifications and routing table changes in real-time, then dynamically switch between different neighbor nodes for data transmission. This enables the network to adapt to rapid connectivity fluctuations while maintaining stable data delivery through proactive route adjustments.
Solution Approach 2:
The patent maintains multiple routing paths in advance and proactively detects link state changes before complete link failure occurs. When a link degradation is detected, nodes switch to alternative pre-established paths, preventing packet loss and avoiding the need for reactive retransmissions.
2Adaptability or versatility
If nodes switch neighbor nodes in response to link state changes, then adaptability to connectivity fluctuations is improved, but transmission efficiency deteriorates due to reformatting overhead
Solution Approach 1:
The patent dynamically adjusts segment size parameters based on the characteristics of the target neighbor node and link conditions. When switching between neighbor nodes, nodes reformat data segments to optimal sizes for the new link, balancing the overhead of reformatting with the benefits of improved transmission efficiency on the new link.
Solution Approach 2:
The patent performs reformatting operations selectively - only when necessary during neighbor node switching - rather than continuously. This partial action approach minimizes the overhead impact on transmission efficiency while still providing the adaptability benefits of dynamic routing adjustments.
3Loss of time
If nodes maintain multiple routing paths for rapid switching, then response time to link failures is improved, but resource consumption deteriorates due to additional signaling and memory
Solution Approach 1:
The patent segments the routing information into multiple independent paths stored in node memory. When a link failure occurs, nodes can immediately switch to alternative segments (paths) without requiring complete route recalculation, reducing response time while maintaining manageable memory requirements through structured organization of routing data.
Solution Approach 2:
The patent implements link state detection mechanisms that provide feedback to nodes about connectivity conditions. This feedback enables nodes to proactively switch paths before complete failure occurs, reducing the frequency of reactive switching operations and thereby reducing the overall resource consumption associated with maintaining multiple paths.
Data Source
Figure 1~3
Figure 4~5
Figure 6~7
AI summary
Communication method comprising, when transmitting a block of data from a source node (50) to a destination node (52), the following steps: - a node (51), having stored a set of segments of said block selects a first neighbor node, determines a segment size appropriate for a transfer to the first neighbor node, reformats at least one segment of the set of segment(s) in accordance with said size and transmits at least said reformatted segment to said first neighbor node;said process being characterized in that the node detects a change in the links between said node and its neighboring nodes, and following said detection, selects a second neighboring node, stops the transmission to the first neighboring node of said set of segments stored before said detection, determines an updated segment size appropriate for transfer to the second neighboring node, reformats at least one segment of the set of segment(s) not yet transmitted to the first neighboring node in accordance with the updated size and transmits to said second neighboring node the at least one reformatted segment.