Wi-Fi Data Frame Scheduling Under Limited-Channel Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Communication delays of large amounts of service data cannot be ensured in a Wi-Fi network system due to limited communication channels or interference, leading to inefficiencies in data transmission.
Innovation Solution
A service scheduling method that determines a target frame for preferential transmission based on waiting delay, preset delay, and service priority, ensuring that data frames meeting both requirements are fully scheduled.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data frames are sent in order of service priorities only, then high priority data is transmitted first, but communication delays of large amounts of service data cannot be ensured
Solution Approach 1:
The patent changes the scheduling parameter from service priority alone to a composite parameter that includes both service priority and waiting delay. This allows the system to dynamically adjust scheduling decisions based on current queue conditions, ensuring that high-priority data with long waiting times is transmitted promptly while maintaining overall transmission efficiency
Solution Approach 2:
The patent introduces dynamic scheduling where the selection of data frames for transmission is not fixed but adapts based on real-time conditions. The sending node dynamically evaluates both service priority and waiting delay parameters, allowing the scheduling policy to flexibly respond to changing network conditions and data frame characteristics
2Quantity of substance
If multiple data frames are queued for transmission, then more data can be sent, but communication channel limitations cause increased delays
Solution Approach 1:
Each data frame essentially 'self-advocates' by having its waiting delay and service priority parameters evaluated independently in the scheduling decision process. This allows the system to automatically identify and transmit data frames that need urgent handling without external intervention, ensuring timely transmission even when large quantities of data are queued
Solution Approach 2:
The patent performs preliminary evaluation of data frames by calculating and comparing their waiting delays against service priorities before transmission decisions are made. This preliminary assessment allows the system to proactively identify data frames that require immediate transmission, preventing excessive queue buildup and associated delays
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
A service scheduling method and apparatus are provided, which relate to the field of communication technologies and are applied to a Wi-Fi network system, to resolve a problem that communication delays of a large amount of service data cannot be ensured when a communication channel in the Wi-Fi network system is limited. A specific solution includes: A sending node obtains a waiting delay and a category of each data frame in a plurality of data frames at a current moment, determines a service priority of each data frame based on the category of each data frame, and determines, from the plurality of data frames, a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame; and then the sending node sends the target frame to a receiving node at the current moment. The waiting delay of the data frame is duration in which the data frame waits for being scheduled by the sending node, the preset delay of the data frame is a preset upper limit value of a waiting delay, and the preset upper limit value of the waiting delay is less than a communication delay of the data frame.