NAN Schedule Update Mechanism for Wireless Stations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems, particularly those based on the IEEE 802.11 standard, face inefficiencies in setup and coordination for direct communication between wireless stations without an intermediate access point, leading to processing delays and inefficiencies in updating data link schedules.
Innovation Solution
Implementing a peer-to-peer communication protocol, such as Neighbor Awareness Networking (NAN), which allows wireless stations to configure direct communication, propose and confirm schedule updates, and maintain data link schedules across multiple levels (host and firmware layers) to optimize data link management and reduce processing delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If wireless stations use traditional IEEE 802.11 communication through an intermediate access point, then network coverage and connectivity are improved, but setup coordination complexity and processing delays increase
Solution Approach 1:
The patent extracts the access point intermediary function and replaces it with direct peer-to-peer communication between wireless stations. Stations independently perform service discovery and coordinate data link schedule updates without requiring access point mediation, thereby reducing setup coordination complexity while maintaining network connectivity through direct links.
Solution Approach 2:
Wireless stations autonomously perform service discovery, negotiate data link schedules, and manage peer-to-peer connections without external coordination. Each station independently maintains its own data link schedule and sequence numbers, enabling self-service operation that reduces overall system complexity while preserving reliable connectivity.
2Productivity
If wireless stations perform aggressive probing and scanning for service discovery, then service discovery speed is improved, but energy consumption and communication overhead increase
Solution Approach 1:
The patent implements periodic data link schedule updates and sequence number increments at defined intervals (e.g., every discovery window or after a threshold number of service discoveries). This periodic action maintains accelerated service discovery capability while preventing continuous aggressive probing, thereby reducing energy consumption and communication overhead compared to constant scanning.
3Adaptability or versatility
If wireless stations maintain data link schedules at multiple levels (host and firmware), then schedule management flexibility is improved, but data structure complexity increases
Solution Approach 1:
The patent segments the data link schedule management into distinct hierarchical levels: host-level data structures for high-level schedule coordination and firmware-level data structures for low-level execution details. Each level maintains relevant sequence numbers and schedule parameters independently, providing management flexibility while organizing complexity into manageable segments rather than monolithic structures.
Data Source
AI summary
In some embodiments, one or more wireless stations operate to configure direct communication with neighboring mobile stations, e.g., direct communication between the wireless stations without utilizing an intermediate access point. Embodiments of the disclosure relate to NAN datapath scheduling and NAN pre-datapath operation setup and scheduling. The NAN datapath embodiments described herein provide a mechanism through which devices can communicate and provide services. In particular, embodiments described herein relate to techniques for devices (e.g., NAN devices) to propose and confirm schedule updates. The datapath model, and in particular the techniques described herein, may be implemented for unicast and multicast communication between wireless stations.