Adaptive Sliding Window Retransmission for Wireless Packet Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless data communication systems, data packets may not be received due to interference or obstruction, leading to errors and the need for retransmission, with existing acknowledgment mechanisms being inefficient in managing packet retransmissions based on data importance and latency considerations.
Innovation Solution
The implementation of a sliding window mechanism where each data unit is associated with a maximum number of retransmissions based on its type, with acknowledgment mechanisms using a bit mask to identify received packets and adjust the sliding window size dynamically, allowing for adaptive retransmission strategies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data packets are retransmitted to ensure reliable delivery, then communication reliability is improved, but transmission latency increases
Solution Approach 1:
The patent applies different maximum retransmission counts to different data units based on their importance. Critical data units (e.g., voice information) have lower maximum retransmission counts (e.g., 2) to minimize latency, while non-critical data units have higher maximum retransmission counts (e.g., 26) to ensure reliability. This local differentiation resolves the contradiction by optimizing the reliability-latency tradeoff for each data unit individually.
2Measurement precision
If acknowledgment mechanisms track each packet individually, then delivery accuracy is improved, but system complexity increases
Solution Approach 1:
The patent combines multiple acknowledgment bits into a single bit mask that represents the acknowledgment status of multiple packets simultaneously. Instead of sending separate acknowledgment messages for each packet, the receiver consolidates acknowledgment information into a compact bit mask format, reducing communication overhead and system complexity while maintaining precise tracking of individual packet delivery status.
Solution Approach 2:
The patent introduces a bit mask dimension where each bit represents the acknowledgment status of a corresponding packet. This dimensional transformation allows the system to track multiple packets' delivery status in a single data structure, improving measurement precision for delivery accuracy while avoiding the complexity of multiple separate tracking mechanisms.
3Productivity
If sliding window size is increased to improve throughput, then productivity is improved, but device complexity increases
Solution Approach 1:
The patent implements a dynamic sliding window mechanism where the window size and position are adjusted based on acknowledgment feedback from the receiver. The sending window advances as packets are acknowledged, allowing the system to adaptively optimize throughput by maintaining an appropriate window size without requiring complex fixed-size window management. This dynamic adjustment resolves the contradiction by linking window complexity directly to actual delivery status.
Data Source
AI summary
In general, the subject matter described in this specification can be embodied in methods, systems, and program products for adaptive data unit transmission. A sliding window is filled with data units and designates a sliding window start position and a sliding window end position. A value for each of the data units in the sliding window is stored, the value representing a maximum number of times that each data unit is to be transmitted. The stored value is different among at least two of the data units. Data units are selected from the sliding window to be assembled into a packet. An assembled packet is transmitted to a receiving computerized device. A determination that the data unit positioned at the sliding window start position has been transmitted a maximum number of time is performed, and in response a different data unit is positioned at the sliding window start position.