NAN Discovery Window Subset Allocation for Responsiveness
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The current Neighbor Awareness Networking (NAN) protocol lacks flexibility in discovery window intervals, leading to delayed responsiveness and inefficiencies in device synchronization, particularly due to the long interval between discovery windows and random selection of windows, which can result in missed advertisements and degraded application performance.
Innovation Solution
Introducing discovery window subset allocation mechanisms that allow NAN devices to select from predefined sets of windows based on set inclusion relationships and responsiveness levels, reducing the number of messages required for connection establishment and improving MAC efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If discovery windows are spaced at fixed intervals (e.g., every 8.3 seconds), then the protocol maintains simple timing structure, but the responsiveness is too slow for applications requiring faster discovery
Solution Approach 1:
The discovery window opportunity set is segmented into multiple discovery windows (DW0, DW1, DW2, ..., DW15) within each opportunity set. Devices can select from multiple windows rather than waiting for a single periodic window, reducing the effective discovery interval while maintaining protocol simplicity.
Solution Approach 2:
The system transitions from static periodic discovery windows to dynamic selection where devices can choose from multiple discovery windows based on their responsiveness requirements. The MAC layer can dynamically select which discovery window to use, adapting to different application needs.
2Adaptability or versatility
If discovery windows are randomly selected by devices, then devices can operate independently, but two STAs may not have common windows until DW0 repeats, reducing MAC efficiency
Solution Approach 1:
Different parts of the system (different STAs) can have different discovery window selections based on their local requirements. Each STA can independently select discovery windows from the opportunity set that match its specific needs, while still ensuring common windows exist for communication.
Solution Approach 2:
The discovery window opportunity set acts as an intermediary structure that coordinates independent device operations. By defining a common set of available windows, the system enables independent device operation while guaranteeing that common windows exist for successful communication.
3Reliability
If devices transmit at every discovery window until correlation is achieved, then connection establishment is guaranteed, but unnecessary message transmissions increase power consumption and network traffic
Solution Approach 1:
Devices perform preliminary selection of discovery windows from the opportunity set before actual transmission. By pre-selecting appropriate discovery windows based on responsiveness requirements and common window availability, devices avoid unnecessary transmissions while ensuring connection establishment.
Solution Approach 2:
The system changes the parameter of discovery window selection from random or exhaustive to optimized selection based on responsiveness levels. By adjusting which discovery windows are used based on application requirements, the system reduces unnecessary transmissions while maintaining reliable connection establishment.
Data Source
AI summary
Techniques for presenting discovery window selection in a NAN environment are provided. Specifically, methods that when taken alone or together, provide a device or group of devices with an efficient way of synchronizing and communicating with other devices is presented. The present disclosure includes a method that provides a device with the capability of locally selecting a discovery window subset that meets the current device power and application constraints. The discovery window subset is created based on a uniform distribution of discovery window selection within the set. The method describes the generation of the subsets such that set inclusion exits between any two sets.