Wireless Network Unit Semi-Persistent Scheduling for Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless channel access mechanisms, such as ALOHA and CSMA, face limitations in maximizing normalized overall system throughput, especially in scenarios where feedback information and complex receiver chains are not feasible, leading to inefficient resource utilization and high collision probabilities.
Innovation Solution
A semi-persistent scheduling mechanism that determines segments of data entities and selects candidate radio resources for transmission, allowing for collision-tolerant distributed scheduling, which increases bandwidth efficiency and avoids the need for feedback information, thereby enhancing channel efficiency and reducing collision probabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If CSMA is used to improve throughput, then normalized overall system throughput increases to approach 36%, but device complexity increases due to requirement for complete receiver chain with feedback capability
Solution Approach 1:
The patent segments the data entity into multiple segments that can be transmitted across multiple radio resources. This segmentation allows the system to achieve higher throughput by transmitting multiple segments in sequence without requiring complex feedback mechanisms, as each segment can be independently transmitted and received.
Solution Approach 2:
The patent employs preliminary action by pre-determining multiple candidate radio resources for transmission before actual data transmission occurs. The wireless network unit selects transmission resources in advance based on monitored channel conditions, eliminating the need for complex real-time feedback and receiver chain operations during transmission.
2Device complexity
If pure ALOHA is used without CSMA, then device complexity is reduced with no receiver chain required, but normalized overall system throughput is limited to 18% due to random collisions
Solution Approach 1:
The patent applies preliminary action by having the wireless network unit monitor the channel and pre-determine candidate radio resources before transmission. This advance preparation allows nodes to select optimal transmission times without requiring complex receiver chains or feedback mechanisms, thereby maintaining simplicity while improving throughput beyond the 18% limit of pure ALOHA.
Solution Approach 2:
The patent implements self-service by enabling each wireless network unit to autonomously monitor channel conditions and select transmission resources independently. This self-based channel access mechanism eliminates the need for complex receiver chains or centralized coordination, allowing nodes to achieve higher throughput through distributed decision-making.
3Productivity
If slotted ALOHA is used to reduce collision probability, then normalized overall throughput increases to 36%, but resource utilization efficiency remains suboptimal with fixed transmission duration requirements
Solution Approach 1:
The patent applies dynamics by allowing transmission duration to be flexible rather than fixed. The wireless network unit can select from multiple candidate radio resources and transmit segments across varying numbers of resources based on actual channel conditions and data size, enabling adaptive transmission duration that optimizes both throughput and resource utilization efficiency.
Solution Approach 2:
The patent uses preliminary action by pre-identifying multiple candidate radio resources and determining optimal transmission patterns before actual transmission occurs. This advance planning enables dynamic adaptation of transmission duration and resource allocation without requiring complex real-time adjustments or feedback mechanisms.
Data Source
AI summary
A method to operate a first wireless network unit (A) is provided, wherein the method comprises: determining (102) a data entity (DE) intended to be transmitted via a physical shared radio channel (PSCH); determining (104) a plurality of segments of the determined data entity (DE); determining (106) at least one first radio resource window (rw(n−1)) of the physical shared radio channel (PSCH); monitoring (108) the at least one first radio resource window (rw(n−1)); determining (110) a plurality of candidate resources (rr12, rr22) in a second resource window (rw(n)) of the physical shared radio channel (PSCH) in dependence on monitored radio resources (rr11, rr21) of the at least one first radio resource window (rw(n−1)), wherein each candidate resource (rr12, rr22) of the plurality of candidate resources (rr12, rr22) is part of a resource chain (RC1, RC2) of the physical shared radio channel (PSCH); selecting (112) one of the plurality of candidate resources (rr12, rr22) as a transmission start resource (rr12); and transmitting (114, 116, 118) the plurality of the determined segments of the data entity (DE) via radio resources (rr12, rr13, rr14) along the resource chain (RC1) to which the selected transmission start resource (rr12) belongs to, wherein a single one of the segments is transmitted via a single one of the radio resources (rr12, rr13, rr14) of the resource chain (RC1).