Neighbor Awareness Network CRB Scheduling by Service Priority
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 specific requirements such as low latency.
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 needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If services are scheduled without priority differentiation, then resource allocation is simple, but service performance cannot be optimized for specific requirements like low latency
Solution Approach 1:
The patent applies local quality by differentiating scheduling treatment based on service type and priority levels. Different services (e.g., real-time vs. non-real-time) are allocated different priority levels and scheduling parameters, allowing optimized resource allocation for specific service requirements while maintaining overall system simplicity.
Solution Approach 2:
The scheduling mechanism segments services into different priority levels (e.g., high priority for real-time services, low priority for non-real-time services). This segmentation allows independent scheduling control for each priority level, improving productivity for critical services without unnecessarily complicating the overall scheduling system.
2Reliability
If all services share the same resource block, then resource allocation is simple, but services with specific latency requirements cannot receive preferred scheduling
Solution Approach 1:
The patent implements local quality by assigning different quality attributes to different service types. High-priority services receive guaranteed resource allocation and preferred scheduling, while low-priority services share remaining resources. This ensures reliability for services with latency requirements without requiring complete redesign of the resource allocation system.
Solution Approach 2:
The scheduling system dynamically adjusts resource allocation based on service priority levels and current network conditions. The mechanism can flexibly reassign resources between priority levels as needed, ensuring that services with latency requirements receive appropriate resources while adapting to changing network conditions without rigid complex structures.
3Productivity
If priority-based scheduling is implemented, then service performance is optimized, but scheduling decision complexity increases
Solution Approach 1:
The patent segments the scheduling decision process into discrete priority levels and service type categories. By pre-defining priority levels and their corresponding scheduling behaviors, the system reduces the complexity of real-time scheduling decisions while maintaining efficient resource allocation for different service requirements.
Solution Approach 2:
The system manages scheduling complexity by changing key parameters such as priority levels, time slots, and resource allocation ratios rather than requiring complex real-time calculations. These parameter changes allow efficient resource allocation while keeping scheduling decisions simple and manageable.
Data Source
AI summary
A service scheduling method, and a device and a storage medium are provided. The method includes: according to a service type of at least one of the first service or first priority of the first service, and a second priority of each CRB among CRBs in a first NDC, the first NAN device determines at least one first CRB corresponding to the first service. The first service is scheduled in the at least one first CRB, and the first NAN belongs to the first NDC.