Neighbor awareness networking datapath—base scheduling, scheduler rank, and further service discovery

• US 10,212,574 B2
• Filed: 03/18/2016
• Issued: 02/19/2019
• Est. Priority Date: 03/20/2015
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Liu, Yong, Hartman, Christiaan A., Borges, Daniel R., Heerboth, Peter, Kurian, Lawrie, Yong, Su Khiong, Rajagopalan, Anand, Balasubramaniyan, Saravanan, Haque, Tashbeeb, Wolf, Andreas, Li, Guoqing, Zukerman, Lilach, Shani, Oren
• Primary Examiner(s): Nawaz, Asad M
• Assistant Examiner(s): Belete, Berhanu D
• Application Number:
  US15/074,848
• Publication Number:
  US 20160278112A1
• Time in Patent Office: 1,068 Days
• CPC Class Codes: H04W 28/18 Negotiating wireless communication parameters
• CPC Class Codes: H04W 72/20 Control channels or signalling for resource management
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]
• CPC Class Codes: H04W 92/18 between terminal devices

Abstract

In some embodiments, one or more wireless stations operate to configure Neighbor Awareness Networking (NAN)—direct communication between neighboring wireless stations, e.g., without utilizing an intermediate access point. Embodiments of the disclosure relate to NAN datapath configuration. 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, scheduler rank management, and further NAN discovery. The datapath model may be implemented for unicast and multicast communication between wireless stations.

Claims

1. A wireless device, comprising:

at least one antenna;

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

at least one processor in communications with the at least one radio;

wherein the at least one processor is configured to cause the wireless device to;

determine a first scheduler rank associated with the wireless device, wherein the first scheduler rank is based, at least in part, on a number of active datapaths;

detect a neighboring wireless device that is configured to perform peer-to-peer Wi-Fi communication;

determine to establish a datapath with the neighboring wireless device, wherein in response to determining to establish the datapath, the at least one processor is further configured to cause the wireless device to;

exchange, via peer-to-peer Wi-Fi communications, scheduling preferences and limitations with the neighboring wireless device, including receiving a second scheduler rank associated with the neighboring wireless device, wherein the second scheduler rank is based, at least in part, on a number of active datapaths of the neighboring wireless device; and

determine, based, at least in part, on a comparison of the first scheduler rank to the second scheduler rank, a scheduler for the datapath with the neighboring wireless device, wherein when the first scheduler rank is greater than the second scheduler rank, the wireless device is determined to be the scheduler;

wherein when the wireless device is the scheduler, the at least one processor is further configured to cause the wireless device to;

determine a base schedule for the datapath, wherein the base schedule is based, at least in part, on the scheduling preferences and limitations exchanged with the neighboring wireless device; and

send the base schedule to the neighboring wireless device.

2. The wireless device of claim 1,

wherein when the wireless device is not the scheduler, the at least one processor is further configured to cause the wireless device to receive the base schedule from the neighboring wireless device.

3. The wireless device of claim 1,

wherein the base schedule comprises time and channel information for one or more discovery windows, one or more inter discovery windows, and one or more post discovery windows.

4. The wireless device of claim 1,

wherein the at least one processor is further configured to cause the wireless device to maintain the first scheduler rank of the wireless device, wherein to maintain the first scheduler rank, the at least one processor is further configured to cause the wireless device to:

increase the first scheduler rank by a value based at least in part on a quality of service of an added datapath.

5. The wireless device of claim 1,

wherein the first scheduler rank comprises a schedule priority field and a tie break field.

6. The wireless device of claim 5,

wherein a value associated with the tie break field is a combination of a random number and a medium access control (MAC) address of the wireless device.

7. The wireless device of claim 1,

wherein the first scheduler rank comprises a schedule priority field, wherein the at least one processor is further configured to cause the wireless device to:

increase a value of the schedule priority field when the wireless device adds a datapath; and

decrease the value of the schedule priority field when the wireless device discontinues a datapath.

8. An apparatus, comprising:

a memory; and

at least one processor in communications with the memory, wherein the at least one processor is configured to;

determine a first scheduler rank associated with the apparatus, wherein the first scheduler rank is based, at least in part, on a number of active datapaths;

exchange, via peer-to-peer Wi-Fi communications and in response to determining to establish a datapath with a peer wireless station, scheduling preferences and limitations with the peer wireless station, including receiving a second scheduler rank associated with the peer wireless station, wherein the second scheduler rank is based, at least in part, on a number of active datapaths of the peer wireless station; and

determine, based, at least in part, on a comparison of the first scheduler rank to the second scheduler rank, a scheduler for the datapath with the peer wireless station, wherein when the first scheduler rank is greater than the second scheduler rank, the apparatus is determined to be the scheduler, and wherein when the apparatus is the scheduler, the at least one processor is further configured to;

determine a base schedule for the datapath, wherein the base schedule is based, at least in part, on the scheduling preferences and limitations exchanged with the peer wireless station; and

cause the base schedule to be transmitted to the peer wireless station.

9. The apparatus of claim 8,

wherein when the apparatus is not the scheduler, the at least one processor is further configured to receive the base schedule from the peer wireless station.

10. The apparatus of claim 8,

wherein the base schedule comprises time and channel information for one or more discovery windows, one or more inter discovery windows, and one or more post discovery windows.

11. The apparatus of claim 8,

wherein the at least one processor is further configured to maintain the first scheduler rank, wherein to maintain the first scheduler rank, the at least one processor is further configured to:

increase the first scheduler rank by a value based at least in part on a quality of service of an added datapath.

12. The apparatus of claim 8,

wherein the first scheduler rank comprises a schedule priority field, wherein the at least one processor is further configured to:

increase a value of the schedule priority field when a datapath is added; and

decrease the value of the schedule priority field when a datapath is discontinued.

13. The apparatus of claim 8,

wherein the first scheduler rank comprises a schedule priority field and-a tie break field.

14. The apparatus of claim 13,

wherein a value associated with the tie break field is a combination of a random number and a medium access control (MAC) address of the apparatus.

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

determine a first scheduler rank associated with the wireless station, wherein the first scheduler rank is based, at least in part, on a number of active datapaths;

exchange, via peer-to-peer Wi-Fi communications and in response to determining to establish a datapath with a peer wireless station, scheduling preferences and limitations with the peer wireless station, including receiving a second scheduler rank associated with the peer wireless station, wherein the second scheduler rank is based, at least in part, on a number of active datapaths of the peer wireless station; and

determine, based, at least in part, on a comparison of the first scheduler rank to the second scheduler rank, a scheduler for the datapath with the peer wireless station, wherein when the first scheduler rank is greater than the second scheduler rank, the wireless station is determined to be the scheduler, and wherein when the wireless station is the scheduler, the program instructions are further executable to;

determine a base schedule for the datapath, wherein the base schedule is based, at least in part, on the scheduling preferences and limitations exchanged with the peer wireless station; and

cause the base schedule to be transmitted to the peer wireless station.

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

wherein when the wireless station is not the scheduler, the program instructions are further executable to receive the base schedule from the peer wireless station.

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

wherein the base schedule comprises time and channel information for one or more discovery windows, one or more inter discovery windows, and one or more post discovery windows.

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

wherein the program instructions are further executable to maintain the first scheduler rank, wherein to maintain the first scheduler rank, the program instructions are further executable to:

increase the first scheduler rank by a value based at least in part on a quality of service of an added datapath.

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

wherein the first scheduler rank comprises a schedule priority field, wherein the program instructions are further executable to:

increase a value of the schedule priority field when a datapath is added; and

decrease the value of the schedule priority field when a datapath is discontinued.

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

wherein the first scheduler rank comprises a schedule priority field and a tie break field.