# US 2019/0357053 A1 · Neighbor Awareness Networking Time Slot Allocation > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0357053 A1 - Document ID: US20190357053A1 - Status: Published application - Kind: A1 - Application number: 16/412,248 - Filed: 2019-05-14 - Published: 2019-11-21 - Earliest claimed: 2018-05-15 - Assignees: Apple Inc. - Applicants: Apple Inc. - Inventors: Lawrie Kurian; Yong Liu; Tashbeeb Haque - Web page: https://patentgrep.com/patent/US20190357053A1 ## CPC - H04W 16/10: Dynamic resource partitioning - H04W 16/04: Traffic adaptive resource partitioning - H04W 24/10: Scheduling measurement reports {; Arrangements for measurement reports} - H04W 28/20: Negotiating bandwidth - H04W 48/16: Discovering, processing access restriction or access information - H04W 72/02: Selection of wireless resources by user or terminal - H04W 72/0453: Resources in frequency domain, e.g. a carrier in FDMA - H04W 74/0808: using carrier sensing, e.g. carrier sense multiple access [CSMA] - H04W 76/10: Connection setup - H04W 76/14: Direct-mode setup - H04W 76/23: Manipulation of direct-mode connections - H04W 24/08: Testing, {supervising or monitoring} using real traffic - H04W 84/12: WLAN [Wireless Local Area Networks] - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract One or more wireless stations may operate to configure direct communication with neighboring mobile stations, e.g., direct communication between the wireless stations without utilizing an intermediate access point. A mechanism for wireless stations to learn preferred channels of neighboring wireless stations and to schedule channel sequences within a time period based on the learned channels may include advertisement of preferred channels and adaptation of channel sequences, based on the preferred channels, to maximize bandwidth utilization. ## Claims ### Claim 1 A wireless station, comprising: at least one antenna; at least one radio in communication with the at least one antenna and configured to perform communications via a Wi-Fi interface; and at least one processor in communication with the at least one radio; wherein the at least one processor is configured to cause the wireless station to: initiate a negotiation of a peer-to-peer data session with a neighboring wireless station, wherein the peer-to-peer data session uses a first bandwidth allocation; upon establishment of the peer-to-peer data session with the neighboring wireless station, transition to a second bandwidth allocation for the peer-to-peer data session, wherein the second bandwidth allocation is based on a type of traffic of the peer-to-peer data session; monitor, for one or more time periods, data traffic metrics associated with the peer-to-peer data session; and transition, in response to at least two data traffic metrics satisfying first criteria, the peer-to-peer data session to a third bandwidth allocation, wherein the third bandwidth allocation allocates less bandwidth than the second bandwidth allocation. ### Claim 2 (depends on 1) The wireless station of claim 1, wherein the at least one processor is further configured to cause the wireless station to: transition, in response to at least one data traffic metric satisfying second criteria, the peer-to-peer data session to a fourth bandwidth allocation, wherein the fourth bandwidth allocation allocates bandwidth greater than or equal to the bandwidth allocated based on the second bandwidth allocation. ### Claim 3 (depends on 1) The wireless station of claim 1, wherein the type of traffic comprises one of low latency data traffic or non-low latency data traffic. ### Claim 4 (depends on 1) The wireless station of claim 1, wherein the data traffic metrics comprise one or more of: packet error rate; clear channel assessment; a number of received data packets; or a number of transmitted data packets. ### Claim 5 (depends on 1) The wireless station of claim 1, wherein a time period comprises a time interval between discovery windows. ### Claim 6 (depends on 1) The wireless station of claim 1, wherein the first criteria comprises the at least two data traffic metrics remaining at or below associated thresholds for more than one time period. ### Claim 7 (depends on 1) The wireless station of claim 1, wherein when the type of traffic comprises low latency data traffic, the second bandwidth allocation comprises a one hundred percent bandwidth allocation. ### Claim 8 (depends on 1) The wireless station of claim 1, wherein when the type of traffic comprises non-low latency data traffic, the second bandwidth allocation comprises a fifty percent bandwidth allocation. ### Claim 9 (depends on 1) The wireless station of claim 1, wherein the first bandwidth allocation comprises a twenty five percent bandwidth allocation. ### Claim 10 An apparatus, comprising: a memory; and at least one processor in communication with the memory, wherein the at least one processor is configured to: transition a peer-to-peer data session established with a neighboring wireless station from a first bandwidth allocation to a second bandwidth allocation, wherein the second bandwidth allocation is based on a type of traffic of the peer-to-peer data session; monitor, for one or more time periods, data traffic metrics associated with the peer-to-peer data session; and wherein, when at least two data traffic metrics satisfy first criteria, the at least one processor is configured to transition the peer-to-peer data session to a third bandwidth allocation, wherein the third bandwidth allocation allocates less bandwidth than the second bandwidth allocation; and wherein, when at least one data traffic metric satisfies second criteria, the at least one processor is configured to transition the peer-to-peer data session to a fourth bandwidth allocation, wherein the fourth bandwidth allocation allocates bandwidth greater than or equal to the bandwidth allocated based on the second bandwidth allocation. ### Claim 11 (depends on 10) The apparatus of claim 10, wherein the first criteria comprises the at least two data traffic metrics remaining at or below associated thresholds for more than one time period, and wherein the second criteria comprises the at least one data traffic metric remaining at or above an associated threshold for one time period. ### Claim 12 (depends on 10) The apparatus of claim 10, wherein the first, second, and third bandwidth allocation specify time slots within a time period that are allocated for the peer-to-peer data session and time slots within the time period that are not allocated for the peer-to-peer data session. ### Claim 13 (depends on 12) The apparatus of claim 12, wherein the time period comprises a plurality of time blocks, wherein a time block comprises eight time slots, and wherein a time slot comprises sixteen time units. ### Claim 14 (depends on 13) The apparatus of claim 13, wherein the peer-to-peer data session is a Neighbor Awareness Networking (NAN) datapath, wherein the time period comprises four time blocks, and wherein a time unit comprises 1024 microseconds. ### Claim 15 (depends on 10) The apparatus of claim 10, wherein when the type of traffic comprises low latency data traffic, the second bandwidth allocation comprises a one hundred percent bandwidth allocation; and wherein when the type of traffic comprises non-low latency data traffic, the second bandwidth allocation comprises a fifty percent bandwidth allocation. ### Claim 16 A non-transitory computer readable memory medium storing program instructions executable by processing circuitry to cause a wireless station to: transition a peer-to-peer data session established with a neighboring wireless station from a first bandwidth allocation to a second bandwidth allocation, wherein the second bandwidth allocation is based on a type of traffic of the peer-to-peer data session; monitor, for one or more time periods, data traffic metrics associated with the peer-to-peer data session; and transition, in response to at least one data traffic metric satisfying second criteria, the peer-to-peer data session to a fourth bandwidth allocation, wherein the fourth bandwidth allocation allocates bandwidth greater than or equal to the bandwidth allocated based on the second bandwidth allocation. ### Claim 17 (depends on 16) The non-transitory computer readable memory medium of claim 16, wherein the program instructions are further executable to cause the wireless station to: transition, in response to at least two data traffic metrics satisfying first criteria, the peer-to-peer data session to a third bandwidth allocation, wherein the third bandwidth allocation allocates less bandwidth than the second bandwidth allocation, wherein the first criteria comprises the at least two data traffic metrics remaining at or below associated thresholds for more than one time period. ### Claim 18 (depends on 16) The non-transitory computer readable memory medium of claim 16, wherein the second criteria comprises the at least one data traffic metric remaining at or above an associated threshold for one time period. ### Claim 19 (depends on 16) The non-transitory computer readable memory medium of claim 16, wherein when the type of traffic comprises low latency data traffic, the second bandwidth allocation comprises a one hundred percent bandwidth allocation; and wherein when the type of traffic comprises non-low latency data traffic, the second bandwidth allocation comprises a fifty percent bandwidth allocation. ### Claim 20 (depends on 16) The non-transitory computer readable memory medium of claim 16, wherein the first, second, and third bandwidth allocation specify time slots within a time period that are allocated for the peer-to-peer data session and time slots within the time period that are not allocated for the peer-to-peer data session.