NAN Service Scheduling With Priority-Based Resource Blocks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless local area network (WLAN) technologies do not prioritize services based on their characteristics, leading to inefficient resource allocation and unsuitable scheduling for services with different requirements such as low latency, high reliability, and high throughput.
Innovation Solution
A method for service scheduling in Neighbor Awareness Networks (NAN) that determines Common Resource Blocks (CRBs) based on service type and priority, ensuring differentiated scheduling by prioritizing services according to their specific needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If services are scheduled without priority differentiation, then the scheduling process is simple, but service performance cannot be optimized for different service types
Solution Approach 1:
The patent applies local quality by differentiating scheduling parameters for different service types. Each service type (e.g., voice, video, data) is assigned specific priority levels and scheduling weights, allowing the scheduling system to treat different services differently based on their local requirements rather than applying a uniform scheduling approach.
Solution Approach 2:
The patent changes scheduling parameters dynamically based on service type characteristics. By adjusting priority weights, time slots, and resource allocation parameters according to service requirements (low latency for voice, high throughput for data), the system optimizes performance without requiring complete system redesign.
2Device complexity
If all services share the same resource blocks, then resource allocation is simple, but services with different latency requirements cannot be served
Solution Approach 1:
The patent segments resource blocks into different categories or time slots based on service requirements. By dividing the shared resources into prioritized segments (e.g., high-priority slots for latency-sensitive services, standard slots for best-effort services), the system ensures that services with different latency requirements can be served simultaneously without interference.
Solution Approach 2:
The patent implements dynamic resource allocation where the assignment of resource blocks to services changes based on real-time priority levels and service requirements. The scheduling system dynamically adjusts which services receive which resources based on current network conditions and service characteristics, ensuring reliable quality of service for different types of traffic.
3Productivity
If priority-based scheduling is implemented, then service performance is optimized, but the scheduling decision process becomes more complex
Solution Approach 1:
The patent applies preliminary action by pre-configuring priority levels and scheduling parameters for different service types before actual data transmission occurs. Service characteristics (latency, throughput, reliability requirements) are established in advance, allowing the scheduling system to make decisions based on predefined rules rather than complex real-time calculations, thus reducing decision-making complexity.
Solution Approach 2:
The patent implements feedback mechanisms where the scheduling system monitors service performance and adjusts priority assignments accordingly. By collecting feedback on service quality metrics and using this information to refine future scheduling decisions, the system optimizes performance while using learnable patterns to simplify the decision-making process over time.
Data Source
Figure 1~2
Figure 3
Figure 4~5
AI summary
Provided in the embodiments of the present application are a service scheduling method, and a device and a storage medium. The method comprises: according to a service type of a first service and/or a first priority of the first service and a second priority of each CRB among CRBs in a first NDC, a first NAN device determining at least one first CRB corresponding to the first service, wherein the first service is scheduled in the at least one first CRB, and the first NAN belongs to the first NDC. Therefore, differentiated scheduling of a service is realized.