METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR HOP COUNT USAGE IN CLUSTER SELECTION

• US 20150036540A1
• Filed: 07/31/2014
• Published: 02/05/2015
• Est. Priority Date: 08/05/2013
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Corporation
• Inventors: KASSLIN, Mika, MARIN, Janne
• Granted Patent: US 9,432,925 B2
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: H04B 7/2678 Time synchronisation
• CPC Class Codes: H04L 45/123 Evaluation of link metrics techniques for monitoring network metrics H04L43/08
• CPC Class Codes: H04W 4/80 Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
• CPC Class Codes: H04W 48/16 Discovering, processing access restriction or access information
• CPC Class Codes: H04W 48/18 Selecting a network or a communication service
• CPC Class Codes: H04W 56/0015 one node acting as a reference for the others
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Embodiments enable access to a wireless communications medium. In example embodiments, a method comprises receiving first synchronization messages from a wireless device transmitting synchronization messages in a first neighbor awareness network cluster, the first synchronization messages including a first hop count value to a first anchor master in the first cluster and information describing a first master rank value of the first anchor master; receiving second synchronization messages from a wireless device transmitting synchronization messages in a second neighbor awareness network cluster, the second synchronization messages including a second hop count value to a second anchor master in the second cluster and information describing a second master rank value of the second anchor master; and selecting the first neighbor awareness network cluster or the second neighbor awareness network cluster, based on at least one of the first and second hop count values and the first and second master rank values.

Claims

1. A method, comprising:

receiving, by an apparatus, one or more first synchronization messages from a wireless device transmitting synchronization messages in a first neighbor awareness network cluster, the first synchronization message including a first hop count value to a first anchor master in the first cluster and information describing a first master rank value of the first anchor master;

receiving, by the apparatus, one or more second synchronization messages from a wireless device transmitting synchronization messages in a second neighbor awareness network cluster, the second synchronization message including a second hop count value to a second anchor master in the second cluster and information describing a second master rank value of the second anchor master; and

selecting, by the apparatus, the first neighbor awareness network cluster or the second neighbor awareness network cluster, based on at least one of the first and second hop count values and the first and second master rank values.

2. The method of claim 1, further comprising:

comparing, by the apparatus, the first and second hop count values and selecting the neighbor awareness network cluster corresponding to the synchronization message having the lower hop count value.

3. The method of claim 1, further comprising:

comparing, by the apparatus, the first and second master rank values and selecting the neighbor awareness network cluster corresponding to the synchronization message having the greater master rank value.

4. The method of claim 1, further comprising:

comparing, by the apparatus, the first and second hop count values and hop count values in synchronization messages received from one or more other neighbor awareness network cluster and selecting the neighbor awareness network cluster corresponding to the synchronization message having the lowest hop count value.

5. The method of claim 1, further comprising:

comparing, by the apparatus, the first and second master rank values and master rank values in synchronization messages received from one or more other neighbor awareness network cluster and selecting the neighbor awareness network cluster corresponding to the synchronization messages having the highest master rank value.

6. The method of claim 1, further comprising:

comparing, by the apparatus, the first and second hop count values and operating in the neighbor awareness network cluster corresponding to the synchronization message having the lower hop count value.

7. The method of claim 1, further comprising:

comparing, by the apparatus, the first and second master rank values and operating in the neighbor awareness network cluster corresponding to the synchronization message having the greater master rank value.

8. The method of claim 1, further comprising:

performing, by the apparatus, passive scanning of the synchronization messages.

9. An apparatus, comprising:

at least one processor;

at least one memory including computer program code;

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

receive one or more first synchronization messages from a wireless device transmitting synchronization messages in a first neighbor awareness network cluster, the first synchronization message including a first hop count value to a first anchor master in the first cluster and information describing a first master rank value of the first anchor master;

receive one or more second synchronization messages from a wireless device transmitting synchronization messages in a second neighbor awareness network cluster, the second synchronization message including a second hop count value to a second anchor master in the second cluster and information describing a second master rank value of the second anchor master; and

select the first neighbor awareness network cluster or the second neighbor awareness network cluster, based on at least one of the first and second hop count values and the first and second master rank values.

10. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

compare the first and second hop count values and selecting the neighbor awareness network cluster corresponding to the synchronization message having the lower hop count value.

11. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

compare the first and second master rank values and selecting the neighbor awareness network cluster corresponding to the synchronization message having the greater master rank value.

12. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

compare the first and second hop count values and hop count values in synchronization messages received from one or more other neighbor awareness network cluster and selecting the neighbor awareness network cluster corresponding to the synchronization message having the lowest hop count value.

13. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

compare the first and second master rank values and master rank values in synchronization messages received from one or more other neighbor awareness network cluster and selecting the neighbor awareness network cluster corresponding to the synchronization messages having the highest master rank value.

14. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

compare the first and second hop count values and operating in the neighbor awareness network cluster corresponding to the synchronization message having the lower hop count value.

15. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

compare the first and second master rank values and operating in the neighbor awareness network cluster corresponding to the synchronization message having the greater master rank value.

16. The apparatus of claim 9, further comprising:

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to;

perform, by the apparatus, passive scanning of the synchronization messages.

17. A computer program product comprising computer executable program code recorded on a computer readable non-transitory storage medium, the computer executable program code comprising:

code for receiving, by an apparatus, one or more first synchronization messages from a wireless device transmitting synchronization messages in a first neighbor awareness network cluster, the first synchronization message including a first hop count value to a first anchor master in the first cluster and information describing a first master rank value of the first anchor master;

code for receiving, by the apparatus, one or more second synchronization messages from a wireless device transmitting synchronization messages in a second neighbor awareness network cluster, the second synchronization message including a second hop count value to a second anchor master in the second cluster and information describing a second master rank value of the second anchor master; and

code for selecting, by the apparatus, the first neighbor awareness network cluster or the second neighbor awareness network cluster, based on at least one of the first and second hop count values and the first and second master rank values.

18. The computer program product of claim 17, further comprising:

code for comparing, by the apparatus, the first and second hop count values and selecting the neighbor awareness network cluster corresponding to the synchronization message having the lower hop count value.

19. The computer program product of claim 17, further comprising:

code for comparing, by the apparatus, the first and second master rank values and selecting the neighbor awareness network cluster corresponding to the synchronization message having the greater master rank value.

20. The computer program product of claim 17, further comprising:

code for performing, by the apparatus, passive scanning of the synchronization messages.