Neighbor awareness networking datapath

• US 10,098,168 B2
• Filed: 12/07/2015
• Issued: 10/09/2018
• Est. Priority Date: 12/08/2014
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Liu, Yong, Hartman, Christiaan A., Borges, Daniel R., Heerboth, Peter N., Kurian, Lawrie, Yong, Su Khiong, Rajagopalan, Anand, Balasubramaniyan, Saravanan, Haque, Tashbeeb, Wolf, Andreas, Li, Guoqing, Zukerman, Lilach, Shani, Oren
• Primary Examiner(s): Nawaz, Asad
• Assistant Examiner(s): BELETE, BERHANU D
• Application Number:
  US14/960,488
• Publication Number:
  US 20160165653A1
• Time in Patent Office: 1,037 Days
• Field of Search: 370329
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests
• CPC Class Codes: H04W 72/12 Wireless traffic scheduling
• CPC Class Codes: H04W 76/14 Direct-mode setup
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals

Abstract

In one set of embodiments, one or more client stations operate to configure Neighbor Awareness Networking (NAN)—direct communication with neighboring client stations, i.e., direct communication between the client 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. Aspects of the datapath development include datapath scheduling, including datapath setup and scheduling attributes, as well as pre-datapath operation triggering and scheduling. Scheduling may include determination of a type of datapath, including paging and synchronized datapaths. NAN data cluster base schedules may be scheduled as equal-sets or subsets of datapath schedules. The datapath model may be implemented for unicast and multicast communication between client stations.

Claims

1. A client station, comprising:

at least one antenna;

at least one radio coupled to the at least one antenna and configured to perform Wi-Fi communication with a Wi-Fi access point;

at least one processor coupled to the at least one radio, wherein the client station is configured to perform voice and/or data communications;

wherein the at least one processor is configured to cause the client station to;

detect, during a first discovery window, a first neighboring client station that is configured to perform Wi-Fi communication;

establish, via first negotiation after the first discovery window, a first datapath and a first datapath schedule with the first neighboring client station, wherein the first negotiation includes exchange of first current availability and first potential future availability for one or more discovery window intervals, and wherein the first datapath schedule is determined based on the exchanged first current availability and first potential future availability;

detect, during a second discovery window, a second neighboring client station that is configured to perform Wi-Fi communication; and

establish, via second negotiation after the second discovery window, a second datapath and a second datapath schedule, wherein the second negotiation includes exchange of second current availability and second potential future availability for one or more discovery window intervals, and wherein the second datapath schedule is determined based on the exchanged second current availability and second potential future availability.

2. The client station of claim 1,

wherein the at least one processor is further configured to cause the client station to establish, via the first negotiation, a first base schedule for a data cluster with the first neighboring client station.

3. The client station of claim 2,

wherein the at least one processor is further configured to cause the client station to establish, via the second negotiation, a second base schedule for the data cluster with the second neighboring client station, wherein the second data path schedule is a superset of the second base schedule, and wherein the second base schedule is a subset of the first base schedule.

4. The client station of claim 1,

wherein to establish the first datapath, the at least one processor is further configured to cause the client station to:

exchange one or more service discovery frames with the first neighboring client station, wherein the one or more service discovery frames include the first current availability and first potential future availability.

5. The client station of claim 4,

wherein a service discovery frame comprises one or more of:

service identification list;

service information;

further availability;

capabilities and operations;

security session information;

or

a preferred datapath channel list.

6. The client station of claim 4,

wherein the at least one processor is further configured to cause the client station to:

schedule a future time and channel with the first neighboring client station to exchange at least a portion of the one or more service discovery frames.

7. The client station of claim 1,

wherein the first datapath schedule specifies both times and channels for the client station and the first neighboring client station to meet for peer to peer communications;

and

wherein the second datapath schedule specifies both times and channels for the client station and the second neighboring client station to meet for peer to peer communications.

8. The client station of claim 7,

wherein the first datapath schedule further specifies times for the client station and the first neighboring client station to visit one or more additional channels.

9. The client station of claim 1,

wherein the first datapath schedule specifies times for the client station and the first neighboring client station to visit one or more additional channels not associated with the first datapath.

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;

detect, during a first discovery window, a first neighboring client station that is configured to perform peer-to-peer Wi-Fi communication via a Neighbor Awareness Networking (NAN) protocol;

establish, via first negotiation after the first discovery window, a first datapath and an associated first datapath schedule with the first neighboring client station, wherein the first negotiation includes exchange of first current availability and first potential future availability for one or more discovery window intervals, wherein the associated first datapath schedule is determined based on the exchanged first current availability and first potential future availability, and wherein the associated first datapath schedule specifies times for the apparatus and the first neighboring client station to visit one or more additional channels not associated with the first datapath;

detect, during a second discovery window, a second neighboring client station that is configured to perform peer-to-peer Wi-Fi communication via the NAN protocol; and

establish, via second negotiation after the second discovery window, a second datapath and an associated second datapath schedule, wherein the second negotiation includes exchange of second current availability and second potential future availability for one or more discovery window intervals, and wherein the associated second datapath schedule is determined based on the exchanged second current availability and second potential future availability.

11. The apparatus of claim 10,

wherein the at least one processor is further configured to coordinate resource allocation with the first neighboring client station.

12. The apparatus of claim 10,

wherein the at least one processor is further configured to

coordinate resource allocation with the first neighboring client station and the second neighboring client station.

13. The apparatus of claim 10,

wherein the at least one processor is further configured to arrange a negotiation window with the second neighboring client station, and wherein the negotiation window is scheduled to occur adjacent to the second discovery window.

14. The apparatus of claim 10,

wherein the at least one processor is further configured to arrange a further availability window with the first neighboring client station, wherein the first current availability and the first potential future availability of the apparatus and the first neighboring client station for the one or more discovery window intervals are exchanged during the further availability window.

15. A non-transitory computer readable memory medium storing program instructions executable by a processor of a client station to:

detect, during a first discovery window, a first neighboring client station that is configured to perform peer-to-peer Wi-Fi communication via a Neighbor Awareness Networking (NAN) protocol;

establish, via first negotiation, a first datapath and a first datapath schedule with the first neighboring client station, wherein the first negotiation includes exchange of a further availability attribute indicating a first current availability and first potential future availability for one or more discovery window intervals, wherein the associated first datapath schedule is determined based on the exchanged first current availability and first potential future availability, and wherein the further availability attribute comprises at least a channel switch attribute indicating channel, duration, and periodicity of a channel switch and a channel switch time;

detect, during a second discovery window, a second neighboring client station that is configured to perform peer-to-peer Wi-Fi communication via the NAN protocol; and

establish, via second negotiation after the second discovery window, a second datapath and an associated second datapath schedule, wherein the second negotiation includes exchange of second current availability and second potential future availability for one or more discovery window intervals, and wherein the associated second datapath schedule is determined based on the exchanged second current availability and second potential future availability.

16. The non-transitory computer readable memory medium of claim 15,

wherein, to detect the first neighboring client station, the program instructions are further executable to:

generate instructions to transmit, during the first discovery window, a first message to the neighboring client station requesting one or more services; and

receive, during the first discovery window, a second message from the neighboring client station indicating availability of at least one service of the one or more services, wherein the first datapath supports consumption of the at least one service.

17. The non-transitory computer readable memory medium of claim 16,

wherein the first message comprises one or more attributes indicating the request for the one or more services.

18. The non-transitory computer readable memory medium of claim 16,

wherein the second message comprises one or more attributes that describe the one or more services.

19. The non-transitory computer readable memory medium of claim 15,

wherein the channel switch time is negotiable.

20. The non-transitory computer readable memory medium of claim 15,

wherein when the further availability attribute comprises the channel switch time, the further availability attribute further comprises an indication that the channel switch will occur earlier than the channel switch time to compensate for potential clock drifts.