WO2017052213A1 - Method for scheduling neighbor awareness network and device using method - Google Patents

Abstract

A method for scheduling a neighbor awareness network (NAN) executed by a first device according to one embodiment of the present specification comprises the steps of: receiving, from a second device, a data request frame including request bitmap information; determining whether any one time block, from among a plurality of time blocks, is an overlapping black on the basis of the request bitmap information and cluster bitmap information which indicates one or more second time blocks, from among a plurality of time blocks, allocated for a cluster; updating the cluster bitmap information in accordance with whether the determined time block is an overlapping block; and transmitting, to the second device, a data response frame comprising the updated cluster bitmap information.

Description

Scheduling method of neighbor aware network and device

The present disclosure relates to wireless communication, and more particularly, to a scheduling method of a neighbor awareness network (NAN) using a synchronization technique and a device using the same.

Recently, with the development of information and communication technology, various wireless communication technologies have been developed. In particular, a wireless local area network (WLAN) is a technology that enables wireless access to the Internet in a home, business, or specific service providing area using a portable terminal based on radio frequency technology.

For example, the portable terminal may be a personal digital assistant (PDA), a laptop, a portable multimedia player (PMP). In general, communication between terminals in a WLAN system is performed through a management entity such as a base station or an access point. The management medium is responsible for scheduling for data communication.

In order to secure the flexibility of the communication between terminals in a WLAN system, various protocols for direct communication between terminals without a management medium have been proposed. NAN is a standard established by the Wi-Fi Alliance (WFA) based on the Wi-Fi standard. The NAN specification provides for synchronization and discovery procedures between devices in the 2.5 GHz or 5 GHz frequency band.

An object of the present specification is to provide a scheduling method of a neighbor aware network with improved performance and a device using the same.

This specification relates to a scheduling method for a cluster of a neighbor aware network (NAN). According to an embodiment of the present invention, a scheduling method includes transmitting, by a discovery window, information indicating a scheduling scheme for data to be transmitted to a second device by a first device in a cluster, wherein the first device is a second device. Receive a data request frame containing request bitmap information from the request bitmap information, the request bitmap information indicating one or more first time blocks allocated for data among a plurality of time blocks corresponding to a time interval defined between each search window; The first device overlaps any one of the plurality of time blocks based on the cluster bitmap information and the request bitmap information indicating the one or more second time blocks allocated for the cluster among the plurality of time blocks. Determining whether the block is a block, wherein the first device determines whether the determined time block is an overlapping block And sending a response data frame to the second device including the step and the first device is updated cluster bitmap information to update the cluster bitmap information.

According to one embodiment of the present specification, there is provided a scheduling method of a neighbor aware network using a synchronization technique with improved performance and a device using the same.

1 and 2 illustrate a NAN cluster.

3 is a block diagram of a structure of a NAN terminal according to an embodiment of the present disclosure.

4 is a diagram illustrating a relationship between NAN components.

5 shows an operation of a NAN terminal in a search window and a search window interval.

6 is a diagram associated with possible time unit units for representing a search window and a search window interval.

7 shows a NAN data communication structure for transmitting and receiving data between NAN terminals.

8 illustrates a synchronous NDL technique as a scheduling technique for a scheduling method according to an embodiment of the present invention.

9 shows a scheduling method of the S-NDL scheme of the NAN terminal according to an embodiment of the present disclosure.

FIG. 10 is a diagram illustrating the inside of one NAN data cluster according to an embodiment of the present specification.

11 shows an exemplary bitmap according to an embodiment of the present disclosure.

12 illustrates a bitmap used for negotiation of a common section between a subscriber and a publisher according to an embodiment of the present specification.

13 is a flowchart illustrating a negotiation process for a common period between NAN terminals according to an embodiment of the present specification.

14 is a flowchart illustrating a negotiation process for a common section between NAN terminals according to another embodiment of the present specification.

15 is a flowchart illustrating a negotiation process for a common interval between NAN terminals according to another embodiment of the present specification.

FIG. 16 is a diagram illustrating response bitmap information generated according to an embodiment of the present specification. FIG.

17 is a diagram illustrating a device in which an embodiment of the present specification can be implemented.

The above-described features and the following detailed description are all exemplary for ease of description and understanding of the present specification. That is, the present specification is not limited to this embodiment and may be embodied in other forms. The following embodiments are merely examples to fully disclose the present specification, and are descriptions to convey the present specification to those skilled in the art. Thus, where there are several methods for implementing the components of the present disclosure, it is necessary to clarify that any of these methods may be implemented in any of the specific or equivalent thereof.

In the present specification, when there is a statement that a configuration includes specific elements, or when a process includes specific steps, it means that other elements or other steps may be further included. That is, the terms used in the present specification are only for describing specific embodiments and are not intended to limit the concept of the present specification. Furthermore, the described examples to aid the understanding of the invention also include their complementary embodiments.

The terminology used herein has the meaning commonly understood by one of ordinary skill in the art to which this specification belongs. Terms commonly used should be interpreted in a consistent sense in the context of the present specification. In addition, terms used in the present specification should not be interpreted in an idealistic or formal sense unless the meaning is clearly defined. Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. 1 and 2 illustrate a NAN cluster. The NAN cluster may consist of NAN terminals using the same set of NAN parameters. For example, the NAN parameter may include interval information between consecutive discovery windows (“DW”), beacon interval information, or NAN channel information.

Referring to FIG. 1, the NAN cluster 110 may include a plurality of NAN terminals 120_1, 120_2, 120_3, and 120_4. NAN cluster 110 uses the same set of NAN parameters. The NAN cluster 110 may be a collection of a plurality of NAN terminals 120_1, 120_2, 120_3, and 120_4 synchronized to a schedule of the same search window DW.

Any one of the NAN terminals 120_1, 120_2, 120_3, and 120_4 of the NAN cluster 110 may include a NAN service discovery frame of a multicast or unicast scheme within a range of a discovery window (DW), Hereinafter, 'SDF') may be directly transmitted to another NAN terminal.

Referring to FIG. 2, the NAN cluster 210 may include at least one NAN master 220_1 and 220_2, and the NAN master is at least one other NAN terminal in the same NAN cluster 210 through a series of processes. Can be changed to For example, the NAN master of the NAN cluster 210 of FIG. 2 may be changed to at least one other NAN terminal 220_2 or 220_4.

In addition, at least one NAN master may transmit all of a synchronization beacon frame, a discovery beacon frame, and a NAN service discovery frame. The sync beacon frame, the discovery beacon frame, and the NAN service discovery frame are described in more detail with reference to the following drawings.

3 is a block diagram of a structure of a NAN terminal according to an embodiment of the present disclosure. Referring to FIG. 3, the NAN terminal 300 may operate based on the physical layer 310 of 802.11. The NAN terminal 300 includes NAN medium access control (MAC) 320, a NAN engine 330, a plurality of applications (App_1, App_2, ..., App_n) and a plurality of applications (App_1, App_2, It may include a plurality of NAN application programming interfaces (NAN application programming interfaces, 341, 342, ..., 34n) connected to the ..., App_n, respectively.

For the discovery operation of the NAN terminal and data communication with the counterpart NAN terminal, the NAN engine 330 is based on a primitive received from a plurality of applications (App_1, App_2, ..., App_n) of the NAN terminal. The operation of the MAC 320 may be controlled. In addition, the NAN engine 330 may provide a search operation for searching for another terminal in the NAN cluster and a general operation for scheduling operation for data communication with another terminal in the NAN cluster.

4 is a diagram illustrating a relationship between NAN components. Referring to FIG. 4, the NAN MACs 420_1 and 420_2 may process NAN beacon frames and NAN service discovery frames.

The NAN engines 430_1 and 430_2 may process service requests (Queries) and responses. In addition, the NAN engines 430_1 and 430_2 may provide various functions for scheduling for the synchronization scheme of the neighbor aware network according to an embodiment of the present specification.

5 shows an operation of a NAN terminal in a search window and a search window interval. Referring to FIG. 5, the discovery window DW may be referred to as a time and channel at which NAN terminals converge in a NAN cluster. 5 represents a time axis t, and a unit of the time axis is a time unit (TU). Although the vertical axis of FIG. 5 is not separately indicated, it will be understood that the presence of a frame transmitted by the NAN terminals in the NAN cluster exists.

The interval from the start point DWStart_1 of the first time window DW_1 to the end point DWEnd_1 may be 16 TU, and the second time window DW_2 of the next cycle from the end point DWEnd_1 of the first time window DW_1. The search window interval (DW interval) pointing between the start points DWStart_2 may be 496 TUs.

In addition, it will be appreciated that the sync beacon frame (SBF), discovery beacon frame (DBF) and service discovery frame (SDF) transmitted by the NAN terminal of FIG. 5 may be transmitted through the same channel or through different channels. .

A synchronization beacon frame (hereinafter referred to as 'SBF') is used for synchronization of NAN terminals in a NAN cluster. A discovery beacon frame (hereinafter, referred to as 'DBF') is used to advertise the NAN terminal so as to discover the NAN cluster to a NAN terminal not joined to the NAN cluster. The service discovery frame (hereinafter referred to as "SDF") is used for exchanging information about available services between NAN terminals.

At least one NAN terminal may transmit all of the NAN terminals in the NAN cluster by transmitting a synchronization beacon frame SBF during the discovery window DW. One NAN terminal may transmit one sync beacon frame SBF during one discovery window DW.

The at least one NAN terminal may transmit at least one discovery beacon frame DBF in the discovery window interval DW_interval. Accordingly, the NAN terminals belonging to other NAN clusters can discover the NAN cluster to which the NAN terminal which transmitted the discovery beacon frame (DBF) belongs. In addition, the NAN terminals not belonging to the NAN cluster may discover the NAN cluster to which the NAN terminal which transmitted the discovery beacon frame (DBF) belongs.

The NAN terminal may transmit a service discovery frame SDF on a contention basis during the discovery window DW. The NAN terminal may start a backoff timer set to an arbitrary value and transmit a service discovery frame (SDF) when the value of the backoff timer becomes zero.

The service discovery frame (SDF) may include any one of two NAN service discovery protocol messages.

For example, the NAN Service Discovery Protocol message may be a subscribe message to actively confirm the availability of a particular service. Alternatively, the NAN service discovery protocol message may be a publish message transmitted when response criteria of the NAN terminal that receives the subscribe message are satisfied.

However, a publish message may be used to enable other NAN devices operating in the same NAN cluster to discover available services of the NAN terminal that transmits a publish message.

 For the sake of brevity, hereinafter, a service discovery frame (SDF) containing a subscribe message is referred to as a subscription frame, and a service discovery frame (SDF) containing a publish message is referred to as a publish frame. Is mentioned.

6 is a diagram associated with possible time unit units for representing a search window and a search window interval.

5 and 6, when the basic unit of the time block (hereinafter, 'TB') is 16TU as in the first option, the search window interval DW_interval may include 31 time blocks TB. In addition, four bytes are required to represent bits allocated to 31 time blocks of the search window interval DW_interval.

When the basic unit of the TB configured as the time unit (TU) as the second option is 8 TU, the search window interval DW_interval may include 62 time blocks TB. In addition, 8 bytes are required to represent bits allocated to 62 time blocks TB of the search window interval DW_interval.

When the basic unit of the time block TB configured as the time unit TU is 4TU as in the third option, the search window interval DW_interval may include 124 time blocks TB. In addition, 16 bytes are required to represent bits allocated to the 124 time blocks TB of the search window interval DW_interval.

When the basic unit of the time block TB configured as the time unit TU, as in the fourth option, is 2TU, the search window interval DW_interval may include 248 time blocks TB. In addition, 31 bytes are required to represent the bits allocated to the 248 time blocks TB of the search window interval DW_interval.

When the basic unit of the time block TB configured as the time unit TU is 1TU as in the fifth option, the search window interval DW_interval may include 496 time blocks TB. Then, 62 bytes are required to represent the bits allocated to the 496 time blocks TB of the search window interval DW_interval.

5 and 6, the following description will be described with reference to the case where the first option is selected in the present specification (TB unit is 16TU). In detail, the section from the start point DWStart_1 to the end point DWEnd_1 of the first time window DW_1 may include one time block TB. The search window interval DW interval between the end point DWEnd_1 of the first time window DW_1 and the start point DWStart_2 of the second time window DW_2 of the next cycle may include 31 time blocks TB. have. Similarly, the interval from the start point DWStart_2 to the end point DWEnd_2 of the second time window DW_2 of the next cycle may include one time block TB.

7 shows a NAN data communication structure for transmitting and receiving data between NAN terminals. Referring to FIG. 7, a NAN Data Cluster (hereinafter referred to as 'NDC') 700 may include at least two NAN terminals 701, 702, and 703 sharing a common NDC schedule in the same NAN cluster 710. , 704).

Each NAN terminal in the NDC 700 has at least one NAN data link (hereinafter, 'NDL') with another terminal belonging to the same NDC. In this case, NDL may mean a common resource block (hereinafter, referred to as 'CRB') negotiated between NAN terminals. The NAN terminal may establish an NDL with another NAN terminal to share a resource block (CRB) for data transmission and reception. Each NDL may have its own NDL schedule. The scheduling method for the NDL schedule is described based on the drawings to be described later.

A NAN Data Path (hereinafter, referred to as 'NDP') may mean a data connection established for service between NAN terminals. NDP may be set to request a service between NAN terminals.

For example, the first NAN terminal 701 has an NDL with the second to fourth NAN terminals 702, 703, and 704. The second NAN terminal 702 has an NDL with the first NAN terminal 701 and the third NAN terminal 703. The third NAN terminal 703 has an NDL with the first NAN terminal 701 and the second NAN terminal 702. The fourth NAN terminal 704 has an NDL with the first NAN terminal 701.

The remaining NAN terminals 705 to 717 of the NAN cluster 710 except for the NAN terminals 701, 702, 703, and 704 included in the NDC 700 may transmit and receive control information associated with the NAN parameter. Substantial data such as payload cannot be transmitted or received.

8 illustrates a synchronization NDL (S-NDL) scheme that is a scheduling technique for a scheduling method according to an embodiment of the present invention. Referring to FIGS. 5 and 8, the first sections T0 to T1 of FIG. 8 correspond to the first search window DW_1 or the second search window DW_2 of FIG. 5, and the second section T0 of FIG. 8. T1 to T3 may correspond to a search window interval (DW interval) of FIG. 5.

In step S810, NAN_2 transmits a subscribe frame to NAN_1. The subscription frame may include information about a supportable service of NAN_2 and a supportable scheduling scheme of NAN_2. In step S820, NAN_1 transmits a publish frame to NAN_2. The publish frame may include information about a supportable scheduling scheme of NAN_1.

Through the above steps S810 and S820, NAN_1 and NAN_2 can recognize a service that can be supported and a scheduling scheme that can be supported. Steps S810 and S820 are referred to herein as capability exchange steps.

This specification is described assuming that the S-NDL scheme is selected through the capability exchange phase of NAN_1 and NAN_2.

In operation S830, the NAN_2 may transmit a data request frame for requesting data to be transmitted to the NAN_2 to the NAN_1. In step S840, NAN_1 may transmit a data response frame to NAN_2 in response to a data request frame. In FIG. 8, the data request frame is shown to be transmitted within the first periods T0 to T1, but the present invention is not limited thereto.

Through the above steps S830 and S840, NAN_1 and NAN_2 can negotiate a common resource block (hereinafter, referred to as a 'CRB') that can transmit and receive data with each other. A detailed operation for CRB negotiation between NAN_1 and NAN_2 will be described based on the drawings to be described below.

In step S850, NAN_1 may transmit data for NAN_2 to NAN_2. In detail, the NAN_1 and the NAN_2 may enter the common sections T2_1 to T2_2 at the synchronized timing T2_1 to transmit or receive data. In FIG. 8, only one common section (T2_1 also ~ T2_2) is illustrated, but is not limited thereto. A plurality of common sections CRB may exist in the second sections T1 to T3 according to a CRB negotiation result between NAN_1 and NAN_2. It will be understood.

8 described above is described as operating based on a 2-way scheme for setting up a data path between NAN_1 and NAN_2, but the present disclosure is not limited to the exemplary embodiment. As another embodiment, it will be appreciated that a 3-way scheme in which NAN_2 sends a data confirm frame to NAN_1 after receiving a data response frame may be used.

For reference, another scheduling scheme other than S-NDL is a P-NDL scheme. The P-NDL is a technique in which the first device transmits a paging frame to the second device for receiving data from the second device when a predetermined offset time elapses after the search window DW ends. However, it will be understood that the present specification is described on the assumption of S-NDL.

9 shows a scheduling method of the S-NDL scheme of the NAN terminal according to an embodiment of the present disclosure. 5 and 9, the first sections T0 ˜ T1 of FIG. 9 correspond to the first search window DW_1 or the second search window DW_2 of FIG. 5, and the second section T0 of FIG. 9. T1 to T3 may correspond to a search window interval (DW interval) of FIG. 5.

In addition, it is assumed that NAN_1 and NAN_2 belong to the same NAN data cluster (NDC). Further, it is assumed that both the first time axis t1 corresponding to NAN_1 and the second time axis t2 corresponding to NAN_2 have the same time unit TU. For example, the first option of FIG. 6 may be selected for a concise description of FIG. 9.

Accordingly, the basic unit of the time block (hereinafter, referred to as 'TB') is 16 TU, the first section T0 to T1 includes one time block TB, and the second section T1 to T3 includes 31 times. It may include a block TB.

For example, the first section T0 to T1 may be represented by one bit, and the second section T1 to T3 may be represented by a set of 31 bits. For example, the first intervals T0 to T1 may be always occupied with one time block TB. One or more time blocks TB may be allocated for data transfer between NAN terminals among 31 time blocks TB. For example, the allocated time block TB may be represented as '1' on the bitmap.

On the contrary, among the 31 time blocks TB, time blocks TB which are not scheduled for data transfer between NAN terminals are unused. For example, the unallocated time block TB may be represented as '0' on the bitmap.

When data to be transmitted between NAN_1 and NAN_2 exists, one or more bit values corresponding to one or more time blocks TB allocated for data transmission among the bit values corresponding to 31 time blocks TB may be displayed. Can be.

In the present specification, a set of binary numbers representing a plurality of time blocks TB included in the second sections T1 to T3 as '0' (not allocated for data transmission) or '1' (allocated for data transmission), respectively. May be referred to as a bitmap.

One NAN terminal includes NDC bitmap information and first device bitmap information associated with one or more NDL bitmaps indicating one or more common intervals (CRBs) allocated for data transmission with other NAN terminals belonging to the same NDC. NDC bitmap information can be managed.

For example, if one NAN terminal has two NDLs for data transfer with two other NAN terminals belonging to the same NDC, the first device bitmap information may be logical operation (eg, an OR operation) of the two NDL information. It may be information obtained by performing.

For example, the first device bitmap information may be information obtained by performing a logical operation based on one or more NDL information between one or more NAN terminals belonging to the same NDC.

NAN terminals belonging to the same NDC may share NDC bitmap information. Detailed descriptions of the device bitmap information and the NDC bitmap information will be described in more detail with reference to the accompanying drawings.

1 through 9, the capability exchanging steps (steps S910 and S920) of the pair of NAN terminals NAN_1 and NAN_2 may be replaced by the description of steps S810 and S820 of FIG. 8 described above. It can be understood that.

In step S930, NAN_2 may transmit a data request frame to NAN_1. The data request frame may be a frame for requesting data to be delivered from NAN_1 to NAN_2.

The data request frame may include request bitmap information associated with a time block TB for transferring data. For example, the request bitmap information may indicate one or more unallocated time blocks TB of time blocks TB of the second periods T1 to T3 of NAN_2. It may include.

In operation S940, the NAN_1 may logically operate the request bitmap information of the received data request frame and the time block information of the NAN_1 (hereinafter, 'first device information'). Through this, NAN_1 may determine whether an overlapping block, which is an overlapping time block TB, exists among the plurality of time blocks TB in the second period T1 to T3.

For example, primitives for generating a data request frame according to an embodiment are shown in Table 1 below.

DataRequest (handle, configuration_parameters, upper_layer_info) * With this Method a service / application in a subscriber requests the NAN Data Engine to transmit a Data Request message to a publisher. Parameters of the method are as follows:-handleA subscribe_id which has been originally returned by an instance of the Subscribe function associated with the data communication. configuration_parametersPublisher's NAN Interface Address.Publisher's MAC interface address for general NAN operations. Requestor Instance ID; Identifier of the instance of the Publish function in the publisher, which the data communication setup operation targets at. NAN Data Security; Need Security (1) or No Security (0); Security Policies · Data Schedule; NDC base Schedule bitmap which is 4 byte (8,16, 31 or 62 byte) length; Current NDL Schedule bitmap which is 4 byte (8,16, 31 or 62 byte) length; Request NDL Schedule bitmap which is 4 byte (8,16, 31 or 62 byte) length-upper_layer_infoSequence of values which are to be transmitted in the frame body; Such as session ID

In step S950, NAN_1 may transmit a data response frame to NAN_2 in response to a data request frame. The data response frame may include updated time block (TB) information based on the request bitmap information. The description of the updated time block (TB) information is described in more detail with reference to the following drawings.

For example, primitives for generating a data response frame according to the present embodiment are shown in Table 2 below.

DataResponse (handle, configuration_parameters, upper_layer_info) * With this Method a service / application in a publisher requests the NAN Data Engine to transmit a Data Response message to a subscriber. Parameters of the method are as follows:-handleA publish_id which has been originally returned by an instance of the Publish function associated with the data communication-configuration_parametersSubscriber's NAN Interface Address; Subscriber's MAC interface address for general NAN operationsRequestor Instance ID ; Identifier of the instance of the Subscriber function in the subscriber, which the data communication setup operation originated from Subscriber's Data Interface Address; Subscriber's MAC interface address for dataNAN Data Security; Need Security or No Security; Security Policies · Data Schedule ; NDC base Schedule bitmap which is 4 byte (8,16, 31 or 62 byte) length; Current NDL Schedule bitmap which is 4 byte (8,16, 31 or 62 byte) length; Accepted NDL Schedule bitmap which is 4 byte (8 , 16, 31 or 62 byte) length. · Data Setup Status; Accepted or Reason Code - upper_layer_info · Sequence of values which are to be transmitted in the frame body; Such as session ID, protocol, port number etc.

Through the above steps S930 to S950, the NAN_1 and the NAN_2 may negotiate for a common resource block (CRB) in which data can be transmitted and received to each other.

In operation S960, the NAN_1 may transmit data to be transmitted to the NAN_2 during the common period CRB (T2_1 to T2_2 of FIG. 9). NAN_1 and NAN_2 may transmit or receive data during common periods T2_1 to T2_2.

In FIG. 9, only one common section T2_1 to T2_2 is illustrated, but it is not limited thereto, and it will be understood that one or more common sections CRB may exist in the second section T1 to T3.

For reference, the data request frame and the data response frame referred to in FIGS. 8 and 9 may be one of subtypes of a NAN management frame (hereinafter, referred to as 'NMF'). Table 3 below relates to the OUI subtype of the NAN management frame (NMF).

OUI subtype		Contents
0	NAN2 management
One	NAN ranging report
2	NAN data request
3	NAN data response
4	NAN scheduling request
5	NAN scheduling response
6-255	Reserved

As described above, the OUI subtype of the NAN management frame (NMF) may be expressed using 0 to 255. For example, when '2' is allocated as the OUI subtype of the NAN management frame NMF, a data request frame according to an embodiment of the present specification may be indicated. For example, when '3' is allocated as the OUI subtype of the NAN management frame NMF, a data response frame according to an embodiment of the present specification may be indicated.

10 is a diagram illustrating the inside of one NAN data cluster (NDC) according to an embodiment of the present disclosure. For brevity of description herein, logical operators for logical operations may be understood as 'OR' operators. However, the present disclosure is not limited thereto, and it may be understood that other logical operators (for example, 'NOR' operator, etc.) may be used.

1 to 10, the NAN data cluster (NDC) 1000 of FIG. 10 may include at least two NAN terminals 1001, 1002, 1003, and 1004 sharing NDC bitmap information for an NDC. Can be. The NDC bitmap information may be information obtained by logically calculating all the NDC information in the NDC or information obtained by adding NDL scheduling information of all NAN terminals in the NDC.

The first to fourth NAN terminals 1001 to 1004 may manage NDL scheduling information obtained by logically calculating NDL information for NDL associated with each terminal.

For example, the first NAN terminal 1001 is associated with the second to fourth NAN terminals 1002, 1003, and 1004 through the first to third NDLs (NDL_1 to NDL_3). The third NAN terminal 1003 is associated with the fourth NAN terminal 1004 through the fourth NDL (NDL_4).

For example, the first NDL (NDL_1) may be expressed through the first NDL information. For example, the first NDL information indicates whether data is transmitted using a bitmap (for example, 31 bits) representing a search window interval DW_interval as a basic unit of a time block TB. Similarly, the second to fourth NDLs (NDL_2 to NDL_4) may be expressed through the first to fourth NDL information.

For example, the first device information managed by the first NAN terminal 1001 is obtained by performing a logical operation based on first to third NDL (NDL_1 to NDL_3) information associated with the first NAN terminal 1001. May be information. The second device information managed by the second terminal 1002 may be first NDL information indicating a first NDL (NDL_1) associated with the second NAN terminal 1002.

The third device information managed by the third terminal 1003 performs logical operations based on the second and fourth NDL information indicating the second and fourth NDLs (NDL_2, NDL_4) associated with the third NAN terminal 1003. It may be information obtained by performing. The fourth device information managed by the fourth NAN terminal 1004 is based on the third and fourth NDL information indicating the third and fourth NDLs (NDL_3, NDL_4) associated with the fourth NAN terminal 1004. It may be information obtained by performing.

11 shows an exemplary bitmap according to an embodiment of the present disclosure.

1 to 11, it is assumed that a basic unit of a time block (hereinafter, 'TB') is 16 TU according to the first option of FIG. 6. Accordingly, the search window interval DW_interval may include 31 time blocks TB. 31 bit values corresponding to 31 time blocks TB of the search window interval DW_interval may be expressed as '0' or '1' to indicate whether data is allocated.

11 represents 31 time blocks TB from a start point to an end point of a search window interval DW_interval. The 31 time blocks TB may be represented as first to thirty-first blocks TB_1 to TB_31 according to time after time. That is, the plurality of time blocks TB may correspond to time intervals defined between each search window DW.

10 and 11, the NDC bitmap information NDC_I corresponding to the seventh block TB_7 and the twenty-ninth blocks to the thirty-first blocks TB_29 to TB_31 is '1', and corresponds to the remaining blocks. One NDC bitmap information NDC_I is '0'.

The first NDL information NDL_I1 corresponding to the thirtieth block TB_30 is '1', and the first NDL information NDL_I1 corresponding to the remaining blocks is '0'. That is, data between the first NAN terminal 1001 and the second NAN terminal 1002 of FIG. 10 may be transmitted or received during the common section CRB corresponding to the thirtieth block TB_30.

The second NDL information NDL_I2 corresponding to the seventh block TB_7 is '1', and the second NDL information NDL_I2 corresponding to the remaining blocks is '0'. That is, data between the first NAN terminal 1001 and the third NAN terminal 1003 may be transmitted or received during the common section CRB corresponding to the seventh block TB_7.

The third NDL information NDL_I3 corresponding to the 29th block TB_29 is '1', and the third NDL information NDL_I3 corresponding to the remaining blocks is '0'. That is, data between the first NAN terminal 1001 and the fourth NAN terminal 1004 may be transmitted or received during the common section CRB corresponding to the twenty-ninth block TB_29.

The fourth NDL information NDL_I4 corresponding to the thirty-first block TB_31 is '1', and the fourth NDL information NDL_I4 corresponding to the remaining blocks is '0'. That is, data between the third NAN terminal 1003 and the fourth NAN terminal 1004 may be transmitted or received during the common section CRB corresponding to the thirty-first block TB_31.

12 illustrates a bitmap used for negotiation of a common section between a subscriber and a publisher according to an embodiment of the present specification.

9 to 12, the second NAN terminal 1002 of FIG. 10 is a subscriber (NAN_2 of FIG. 9), and the third NAN terminal 1003 is a publisher (NAN_1 of FIG. 9). The case is described.

Like FIG. 11 described above, FIG. 12 expresses 31 time blocks TB from a start point to an end point of a search window interval DW_interval. The 31 time blocks TB may be represented as first to thirty-first blocks TB_1 to TB_31 according to time after time. NAN terminals belonging to the same NDC share NDC bitmap information (NDC_I), and each NAN terminal belonging to the same NDC may manage device information associated with one or more NDLs associated with the terminal.

For example, as illustrated in FIG. 10, the first to fourth NAN terminals 1001 to 1004 belonging to the same NDC may share NDC bitmap information NDC_I. Specifically, the NDC bitmap information NDC_I corresponding to the seventh block TB_7 and the twenty-ninth to thirty-first blocks TB_29 to TB_31 is '1', and the NDC bitmap information corresponding to the remaining blocks ( NDC_I) is '0'.

The subscriber bitmap information NDL_SI of FIG. 12 may be information managed by a NAN terminal transmitting a subscription frame. In more detail, the subscriber bitmap information NDL_SI may include information obtained by performing a logical operation based on at least one NDL information associated with the subscriber ('1002' of FIG. 10). Although not shown in FIG. 12, the subscriber bitmap information NDL_SI may further include channel information indicating a channel to which data is to be transmitted.

For example, the second NAN terminal 1002 of FIG. 10 may be a subscriber that transmits the subscription frame of FIG. 9 (corresponding to S910 of FIG. 9). The NDL associated with the second NAN terminal 1002 of FIG. 10 is the first NDL (NDL_1). Accordingly, the subscriber bitmap information NDL_SI becomes the first NDL information NDL_I1 of FIG. 11. Accordingly, the subscriber bitmap information NDL_SI corresponding to the thirtieth block TB_30 is '1', and the subscriber bitmap information NDL_SI corresponding to the remaining blocks is '0'.

The request bitmap information RQI is information indicating a time block TB allocated by the subscriber (1002 in FIG. 10) for data to be delivered from the publisher (1003 in FIG. 10). For example, the second NAN terminal 1002 of FIG. 10 may generate request bitmap information RQI for receiving data to be transmitted from the third NAN terminal 1003. For example, the request bitmap information RQI may be set not to overlap the time block TB indicated by '1' by the subscriber bitmap information NDL_SI.

For example, the request bitmap information RQI corresponding to the fourteenth block TB_14 and the twenty-ninth block TB_29 generated by the subscriber ('1002' of FIG. 10) is set to '1'. The request bitmap information RQI corresponding to the remaining blocks may be set to '0'. That is, the request bitmap information (RQI) generated by the subscriber ('1002' of FIG. 10) may be delivered to the publisher ('1003' of FIG. 10) through the subscription frame.

The publisher scheduling information NDL_PI of FIG. 12 may be information managed by a NAN terminal, which is a publication that transmits a publish frame. In more detail, the publisher scheduling information NDL_PI may be information obtained by performing a logical operation based on at least one NDL information associated with a publisher. Although not shown in FIG. 12, the publisher scheduling information NDL_PI may further include channel information indicating a channel to which data is to be delivered.

For example, the third NAN terminal 1003 of FIG. 10 may be a publisher transmitting the publish frame of FIG. 9 (S920). The NDL associated with the third NAN terminal 1003 of FIG. 10 is the second NDL (NDL_2) and the fourth NDL (NDL_4). Accordingly, the publisher scheduling information NDL_PI may include information obtained by performing a logical operation based on the second NDL information NDL_I2 and the fourth NDL information NDL_I4 of FIG. 11. Therefore, the publisher scheduling information NDL_PI corresponding to the seventh block TB_7 and the thirty-first block TB_31 is '1', and the publisher scheduling information NDL_PI corresponding to the remaining blocks is '0'.

12 illustrates an embodiment for negotiation of a common section (CRB) of NAN terminals belonging to the same NDC, and each NAN terminal may manage scheduling information according to a role (publisher or subscriber) of the NAN terminal in the NDC cluster. Can be. In addition, it will be appreciated that the role of the NAN terminal in the NDC cluster may vary between NAN terminals.

13 is a flowchart illustrating a negotiation process for a common period between NAN terminals according to an embodiment of the present specification.

9 to 13, in operation S1310, the subscriber ('1002' in FIG. 10) moves the data request frame (step S930) including the request bitmap information to the publisher ('1003' in FIG. 10). I can deliver it.

For example, the subscriber ('1002' in FIG. 10) is a common interval (CRB) allocated for data to be delivered from the publisher ('1003' in FIG. 10). TB_29) may be requested. In this case, the bit value of the request bitmap information RQI corresponding to the fourteenth block TB_14 and the twenty-ninth block TB_29 of FIG. 12 is set to '1', and the request bitmap information corresponding to the remaining blocks is set to '1'. Bit values of (RQI) are set to '0'.

In step S1320, the publisher ('1003' of FIG. 10) is based on the received request bitmap information (RQI of FIG. 12) and the NDC bitmap information (NDC_I of FIG. 12) to which the publisher ('1003' of FIG. 10) belongs. By performing a logical operation, it is possible to determine whether or not an overlapping block exists.

A logical operation (for example, based on request bitmap information RQI corresponding to time block TB requesting data and NDC bitmap information (NDC_I in FIG. 12) corresponding to time block TB requesting data. When the result of performing the OR operation becomes '0', the corresponding time block TB may be determined to be an overlapping block.

For example, a value obtained by ORing the request bitmap information RQI and the NDC bitmap information NDC_I corresponding to the fourteenth block TB_14 of FIG. 12 is '1'. Therefore, the fourteenth block TB_14 of FIG. 12 does not correspond to the overlapping block.

For example, a value obtained by ORing the request bitmap information RQI corresponding to the twenty-ninth block TB_29 and the NDC bitmap information NDC_I corresponding to the twenty-ninth block TB_29 is '0'. . Therefore, the 29th block TB_29 of FIG. 12 corresponds to the overlapping block.

In operation S1330, the publisher (1003 of FIG. 10) may generate response bitmap information based on the request bitmap information RQI. In this case, the data response frame S950 of FIG. 9 includes the generated response bitmap information, and is transmitted to the subscriber ('1002' of FIG. 10).

Specifically, referring to FIG. 16 described below for detailed description of the response bitmap information, the allocated NDC information (Accepted NDC_I) corresponding to the fourteenth block TB_14 determined not to correspond to the overlapping block is set to '0'. It may be updated to '1' to signal to the subscriber that data transmission is possible during the fourteenth block TB_14. The allocated NDC information (Accepted NDC_I) corresponding to the twenty-ninth block TB_29 determined as the overlapping block maintains '1'.

14 is a flowchart illustrating a negotiation process for a common section between NAN terminals according to another embodiment of the present specification.

It will be appreciated that step S1410 of FIG. 14 corresponds to step S1310 of FIG. 13 and step S1420 corresponds to step S1320 of FIG.

Referring to FIG. 14, step S1430 may be performed regardless of whether the overlapping block is a step S1420.

In operation S1430, the publisher ('1003' of FIG. 10) performs a logical operation (eg, an OR operation) based on the request bitmap information (RQI of FIG. 12) and the NDC bitmap information (NDC_I of FIG. 12). You can store the result value including the bits.

Subsequently, the publisher ('1003' of FIG. 10) performs a logical operation based on the above result value and the publisher bitmap information (NDL_PI) managed by the publisher of FIG. 12, so that the overlapping block corresponds to an available block. Can be further determined.

When step S1430 is performed, the twenty-ninth block TB_29 determined as the overlapping block in step S1420 does not overlap with the above result value, and thus may be determined as an available block that can be allocated for data transmission.

In operation S1440, the publisher (1003 in FIG. 10) may generate response bitmap information based on the request bitmap information RQI. Specifically, referring to FIG. 16 described below for generating response bitmap information, the allocated NDL information (Accepted NDL_I) corresponding to the twenty-ninth block TB_29 determined as an available block is '0' to '1'. It is updated to, and may signal to the subscriber that data transmission is possible during the 29th block TB_29.

15 is a flowchart illustrating a negotiation process for a common interval between NAN terminals according to another embodiment of the present specification.

9 to 15, in operation S1510, the subscriber ('1002' in FIG. 10) moves the data request frame (step S930) including the request bitmap information to the publisher ('1003' in FIG. 10). I can deliver it.

For example, the subscriber ('1002' in FIG. 10) is a common interval (CRB) allocated for data to be delivered from the publisher ('1003' in FIG. 10). TB_29) may be requested. In this case, the bit values of the request bitmap information RQI corresponding to the fourteenth block TB_14 and the twenty-ninth block TB_29 are set to '1', and the request bitmap information RQI corresponding to the remaining blocks is set to '1'. Bit values are set to '0'.

For example, the subscriber (1002 in FIG. 10) may generate the request bitmap information RQI in consideration of the subscriber bitmap information NDL_SI. For example, the subscriber ('1002' of FIG. 10) may request bitmap information (RQI) so as not to overlap the time block TB indicated by '1' of the subscriber bitmap information NDL_SI of FIG. 12. Bit values of can be set.

As another example, the subscriber 10010 may generate the request bitmap information RQI based on the subscriber bitmap information NDL_SI and the NDC bitmap information NDC_I. For example, the subscriber ('1002' of FIG. 10) is a time block TB indicated by '1' of the subscriber bitmap information NDL_SI and the NDC bitmap information NDC_I. The request bitmap information RQI may be generated so as not to overlap the time block TB indicated by 1 '.

In step S1520, the publisher ('1003' of FIG. 10) performs a logical operation based on the received request bitmap information (RQI) and the NDC bitmap information (NDC_I of FIG. 12) to which the publisher ('1003' of FIG. 10) belongs. It may be determined whether the overlapping block exists by performing the operation.

Specifically, the publisher ('1003' of FIG. 10) may determine NDC bitmap information (NDC_I of FIG. 12) corresponding to the first to thirty-first blocks TB_1 to TB_31 in order to determine whether an overlapping block exists. And based on the request bitmap information RQI corresponding to the first to thirty-first blocks TB_1 to TB_31, logical operations may be performed in the order of the time blocks TB.

A logical operation (for example, based on request bitmap information RQI corresponding to time block TB requesting data and NDC bitmap information (NDC_I in FIG. 12) corresponding to time block TB requesting data. When the result of performing the OR operation becomes '0', the corresponding time block TB may be determined to be an overlapping block.

For example, a value obtained by ORing the request bitmap information RQI and the NDC bitmap information NDC_I corresponding to the fourteenth block TB_14 of FIG. 12 is '1'. Therefore, the fourteenth block TB_14 of FIG. 12 does not correspond to the overlapping block.

For example, a value obtained by ORing the request bitmap information RQI corresponding to the twenty-ninth block TB_29 and the NDC bitmap information NDC_I corresponding to the twenty-ninth block TB_29 is '0'. . Therefore, the 29th block TB_29 of FIG. 12 corresponds to the overlapping block.

In addition, the data request frame (step S930) of FIG. 9 includes an NDC to which the subscriber bitmap information NDL_SI of the subscriber ('1002' of FIG. 10) and the subscriber ('1002' of FIG. 10) belong. It may include associated NDC bitmap information (NDC_I). If it is determined that the time block TB is not an overlapping block, the procedure proceeds to step S1540.

In operation S1530, if it is determined that the time block TB is an overlapping block, it may be determined whether the corresponding time block TB is an available block. That is, the publisher ('1003' of FIG. 10) may further determine whether the request bitmap information RQI corresponding to the time block TB overlaps the publisher scheduling information NDL_PI corresponding to the time block TB. Can be. If the time block TB overlaps in relation to the publisher scheduling information NDL_PI (if it is determined not to be an available block), the procedure ends.

In step S1540, it is determined that the time block TB is not an overlapping block in step S1520, or in step S1530, that the time block TB does not overlap in relation to the publisher scheduling information NDL_PI, that is, it is determined as an available block. Can be performed if so.

 For example, the publisher ('1003' of FIG. 10) may generate response bitmap information based on the request bitmap information (RQI). In this case, the data response frame S950 of FIG. 9 may include generated response bitmap information. A description of the generated response bitmap information is described in more detail with reference to FIG. 16 described below. 11 to 15 is only an embodiment of the present specification, it will be understood that the present specification is not limited thereto.

FIG. 16 is a diagram illustrating response bitmap information generated according to an embodiment of the present specification. FIG.

9 to 16, the response bitmap information of FIG. 16 may be represented as a bitmap including allocated NDC information (Accepted NDC_I) and allocated NDL information (Accepted NDL_I).

In detail, the allocated NDC information (Accepted NDC_I) of FIG. 16 may be generated based on the NDC bitmap information NDC_I included in the data request frame transmitted in step S930 of FIG. 9. The publisher ('1003' of FIG. 10) may generate and manage allocated NDC information (Accepted NDC_I) of FIG. 16 based on the NDC bitmap information NDC_I updated in operation S1540 of FIG. 15.

For example, the publisher ('1003' of FIG. 10) may generate allocated NDC information (Accepted NDC_I) based on the NDC bitmap information NDC_I through the following process.

The publisher ('1003' of FIG. 10) performs logical operation (eg, 'OR' operation) on the NDC bitmap information (NDC_I of FIG. 12) and the request bitmap information (RQI) of FIG. 12 according to the order of the time block TB. ) Can be performed.

For example, '0' indicated by the NDC bitmap information (NDC_I of FIG. 12) corresponding to the fourteenth block TB_14 of FIG. 12 and request bitmap information RQI corresponding to the fourteenth block TB_14 of FIG. 12. The logical operation (eg, an OR operation) may be performed based on '1' indicated by). Based on the above, the result of the logical operation that performed step S1520 of FIG. 15 is '1'.

Since the result value '1' of the logical operation is the same as the bit value '1' of the request bitmap information RQI corresponding to the fourteenth block TB_14 of FIG. 12, the publisher ('1003' of FIG. 10). ) May determine that the fourteenth block TB_14 of FIG. 12 is not an overlapping block. Accordingly, the bit value '0' of the NDC bitmap information NDC_I corresponding to the fourteenth block TB_14 of FIG. 12 is the requested bitmap information RQI corresponding to the fourteenth block TB_14 of FIG. 12. It can be updated to the bit value of '1'.

However, the bit values of the NDC bitmap information NDC_I corresponding to the remaining time blocks except for the bit value of the NDC bitmap information NDC_I corresponding to the fourteenth time block TB_14 of FIG. 12 remain the same.

For example, '1' indicated by the NDC bitmap information NDC_I corresponding to the 29th block TB_29 of FIG. 12 and request bitmap information RQI corresponding to the 29th block TB_29 of FIG. 12 are indicated. A first logical operation (eg, an OR operation) may be performed based on '1'. The result value of the logical operation performing step S1520 of FIG. 15 is '0'.

Since the result value '0' of the logical operation is different from the bit value '1' of the request NDL scheduling information corresponding to the twenty-ninth block TB_29, the publisher ('1003' of FIG. 10) is determined as shown in FIG. 29 blocks TB_29 may be determined to be an overlapping block. Subsequently, step S1530 of FIG. 15 is performed.

Referring to the twenty-ninth block TB_29 of FIG. 12, whether an available block is determined according to step S1530 of FIG. 15 may be determined. Specifically, the bit value '1' of the request bitmap information RQI corresponding to the twenty-ninth block TB_29 and the bit value '0' of the publisher scheduling information NDL_PI corresponding to the twenty-ninth block TB_29. ), A second logical operation (eg, an OR operation) may be performed.

Since the result value '1' of the logical operation according to step S1530 is the same as the bit value '1' of the request bitmap information RQI corresponding to the twenty-ninth block TB_29 of FIG. 12, the publisher ( Referring to '1003' of FIG. 10, it may be determined that the 29th block TB_29 of FIG. 12 is an available block capable of data transmission in relation to the publisher scheduling information NDL_PI.

 Subsequently, step S1540 of FIG. 15 is performed. Accordingly, the bit value of the allocated NDC information (Accepted NDC_I) corresponding to the twenty-ninth block TB_29 of FIG. 16 is maintained as the existing bit value '1', and corresponds to the twenty-ninth block TB_29 of FIG. 16. The bit value of one assigned NDL information (Accepted NDL_I) is updated with the bit value '1'.

That is, the publisher ('1003' of FIG. 10) may first determine whether the overlapping block exists by comparing the request bitmap information and the NDC bitmap information NDC_I according to the order of the time blocks TB. However, considering that one NDC may include at least one or more NDLs, the publisher ('1003' of FIG. 10) may secondly determine whether the NDC is an available block.

For example, the NDC bitmap information NDC_I corresponding to the twenty-ninth block TB_29 of FIG. 12 is represented by '1', which is formed between the first NAN terminal 1001 and the third NAN terminal 1003. It will be appreciated that it is used to indicate the third NDL (NDL_3).

In other words, the NDC bitmap information NDC_I corresponding to the twenty-ninth block TB_29 of FIG. 12 includes a second NAN terminal 1002 and a third NAN terminal 1003 for establishing an NDL for transferring data of FIG. 10. ) Is not related.

According to an example of the present specification, the publisher ('1003' of FIG. 10) compares the request bitmap information (RQI) with the NDC bitmap information (NDC_I) to determine whether the overlapping block, and then additionally includes the publisher scheduling information (NDL_PI). In comparison, it may be further determined whether the corresponding time block TB is an available block.

In this case, the publisher ('1003' in FIG. 10) is associated with the second NDL (NDL_2) and the fourth NDL (NDL_4). The publisher ('1003' of FIG. 10) of FIG. 10 is a publisher scheduling information (NDL_PI) generated by performing a logical operation (eg, an OR operation) based on the second NDL information NDL_I2 and the fourth NDL information NDL_I4. Can manage.

For reference, a data link attribute (“DLA”) that may be used by each NAN terminal in negotiation for a common section (CRB) of each NAN terminal is described.

For example, the data link characteristics (DLA) may be included in a data request frame that the subscriber delivers to the publisher. As another example, the data link characteristic (DLA) may be included in a data request frame that the publisher delivers to the subscriber. Furthermore, the data link characteristic DLA may be included in various management frames or may be included in the NAN service discovery frame SDF transmitted within the range of the discovery window DW.

Table 4 below shows an example of data link characteristics (DLA) in more detail.

Field	Size (octets)	Value	Description
Attribute ID	One	0xXX (TBD)	Identifies the type of NAN attribute.
Length	2	Variable	Length of the following fields in the attribute.
MAC Address	6	Variable	Device MAC address for execution of ranging protocol
DATA MAC address	6	Variable	NAN Data Interface Address
NDC Info Length	2	Variable	length of Current NDC Info List
NDC Info List	NDC Schedule Info Descriptor	Variable	NAN Data Cluster base schedule of NAN publisher or subscriber. This field may consist with multiple NDC Schedule Info Descriptors when the device is part of multiple NDC
NDL Info Length	2	Variable	length of Current NDL Info List
NDL Info List	NDLSchedule Info Descriptor	Variable	NAN Data Link schedule of NAN publisher or subscriberThis field may consist with multiple NDL schedule info descriptor for each NDL

If the NAN terminal belongs to two or more NDCs, the field of the NDC Info List may include two or more NDC Schedule Info Descriptors in a list manner. In addition, if the NAN terminal has two or more NDL, the field of the NDL Info List may include two or more NDL Schedule Info Descriptor in a list manner.

Table 5 below shows another example of the data link characteristics (DLA) in more detail.

Field	Size (octets)	Value	Description
Attribute ID	One	0xXX (TBD)	Identifies the type of NAN attribute.
Length	2	Variable	Length of the following fields in the attribute.
MAC Address	6	Variable	Device MAC address for execution of ranging protocol
Data MAC address	6	Variable	NAN Data Interface Address
Status	One	Variable	0 Success1 Reject due to conflict time block2 Reject by user3 Fail: not enough time block 4 Fail: unknown
NDC Info Length	2	Variable	length of request or response NDC Info List
NDC Info List	NDC Schedule Info Descriptor	Variable	Assigned NAN Data Cluster base schedule of NAN publisher or subscriber. This field shall include one NDC Schedule Info Descriptor
NDL Info Length	2	Variable	length of Current NDL Info List
NDL Info List	NDLSchedule Info	Variable	NAN Data Link schedule of NAN publisher or subscriber. This field shall include one NDLSchedule Info Descriptor

Similarly, if the NAN terminal belongs to two or more NDCs, the field of the NDC Info List may include two or more NDC Schedule Info Descriptors in a list manner. In addition, if the NAN terminal has two or more NDL, the field of the NDL Info List may include two or more NDL Schedule Info Descriptor in a list manner.

Table 6 below shows the NDC Schedule Info Descriptor of the NDC Info List field of FIGS. 4 and 5 in more detail.

Field name	Size (octets)	Value	Description
NAN Cluster ID	6	Variable	NAN Cluster ID
NAN Data Cluster ID	6	Variable	Current NDC ID
Channel Info	2	Variable	Assigned Channel info
Time Block Bitmap	4 (or 8, 16, 31, 62)	Variable	Occupied time block information for current NAN Data cluster

The NDC Schedule Info Descriptor of Table 6 may include time block information associated with the NDC to which the current NAN terminal belongs. For example, NDC bitmap information NDC_I shared by NAN_1 and NAN_2 may be stored in a field of Time Block Bitmap of Table 6.

Table 7 below shows the NDL Schedule Info Descriptor of the NDL Info List field of FIGS. 4 and 5 above in more detail.

Field name	Size (octets)	Value	Description
NAN Cluster ID	6	Variable	NAN Cluster ID
NAN Data Cluster ID	6	Variable	Current NDC ID
Peer NAN Data Interface address	6	Variable	NAN data interface address of peer device
Channel Info	2	Variable	Assigned Channel info
Instance ID	One	Variable	Publish ID or Subscribe ID
service ID	6	Variable	the hash of the Service Name
Time Block Bitmap	4 (or 8, 16, 31, 62)	Variable	Occupied time block information for current NAN Data cluster

The NDL Schedule Info Descriptor of Table 7 may include time block information associated with an NDL used by a NAN terminal. For example, when the NAN terminal is a subscriber, the subscriber bitmap information NDL_SI may be stored in a field of the Time Block Bitmap of Table 7. As another example, when the NAN terminal is a publisher, the publisher scheduling information NDL_PI may be stored in a field of the Time Block Bitmap of Table 7.

However, the above data link characteristics (DLA) are not limited to the forms of Tables 4 to 7, and may be understood to include various forms.

The allocated NDL information (Accepted NDL_I) of FIG. 16 may be generated based on the publisher scheduling information NDL_PI managed by the publisher ('1003' of FIG. 10). The remaining time blocks of the allocated NDC information (Accepted NDC_I) except for the time blocks TB_14 and TB_29 where the request bitmap information RQI is indicated as '1' remain the same as the existing NDC bitmap information NDC_I.

In detail, in step S1530 of FIG. 15, when the request bitmap information RQI corresponding to the specific time block TB does not overlap with the publisher scheduling information NDL_PI corresponding to the specific time block TB (usable block). ), The publisher ('1003' of FIG. 10) may perform step S1540. Accordingly, the publisher ('1003' of FIG. 10) may generate the allocated NDL information (Accepted NDL_I) in which the request bitmap information RQI is reflected.

For example, the bit values of the allocated NDL information (Accepted NDL_I) corresponding to the fourteenth block TB_14 and the twenty-ninth block TB_29 may be updated to '1'.

Bit values of the allocated NDL information (Accepted NDL_I) corresponding to the remaining blocks may maintain a previous value. The allocated NDC information (Accepted NDC_I) and the allocated NDL information (Accepted NDL_I) referred to in FIG. 16 may be included in the publish frame S920 of FIG. 9 and transferred to the subscription ('1002' of FIG. 10).

17 is a block diagram illustrating a device in which an embodiment of the present specification can be implemented. The device 2000 may include a processor 2100, a memory 2200, and a transceiver 2300. The device 1000 may be a NAN terminal according to an embodiment of the present disclosure described above.

The processor 2100 implements the functions, processes, and / or methods proposed herein. The operation of the device 1000 according to an embodiment of the present disclosure described above may be implemented by the processor 2100.

       The memory 2200 may be connected to the processor 2100 to store an instruction for implementing an operation of the processor 2100. The processor 2100 may include an application-specific integrated circuit (ASIC), another chipset, a logic circuit, and / or a data processing device. The memory 2200 may include read-only memory (ROM), random access memory (RAM), flash memory, memory card, storage medium, and / or other storage device. The RF unit may include a baseband circuit for processing a radio signal.

The transceiver 2300 may be connected to the processor 2100 to transmit and / or receive a radio signal. When an embodiment of the present specification is implemented in software, the above-described technique may be implemented as a module (process, function, etc.) that performs the above-described function. The module may be stored in memory and executed by a processor. The memory may be internal or external to the processor and may be coupled to the processor by various well known means.

In the detailed description of the present specification, specific embodiments have been described, but various modifications are possible without departing from the scope of the present specification. Therefore, the scope of the present specification should not be limited to the above-described embodiments, but should be determined not only by the claims below but also by the equivalents of the claims of the present invention.

Claims (14)

1. In the scheduling method for a cluster of a neighbor aware network (NAN):

   Transmitting, by a discovery window, information indicating a scheduling scheme for data to be transmitted to a second device by a first device belonging to the cluster;

   The first device receives a data request frame including request bitmap information from the second device, wherein the request bitmap information includes the data among a plurality of time blocks corresponding to a time interval defined between each search window. Indicating at least one first time block allocated for;

   The first device is based on any one of the plurality of time blocks based on the cluster bitmap information and the request bitmap information indicating one or more second time blocks allocated for the cluster among the plurality of time blocks. Determining whether the time block is an overlapping block;

   Updating, by the first device, the cluster bitmap information according to whether the determined time block is the overlapping block; And

   And sending, by the first device, a data response frame including the updated cluster bitmap information to the second device.
2. The method of claim 1,

   The scheduling scheme is a synchronization scheme in which the first device transmits the data in a section synchronized with the second device after the search window.
3. The method of claim 1,

   The synchronized period includes one or more time blocks of the plurality of time blocks.
4. The method of claim 1,

   The overlapping block is a time block in which the one or more first time blocks overlap with the one or more second time blocks.
5. The method of claim 1,

   The scheduling scheme further includes a paging scheme,

   The paging technique is a technique in which the second device transmits a paging message to the first device for receiving the data when a predetermined offset time elapses after the search window.
6. The method of claim 1,

   And the first device shares the cluster bitmap information with the second device.
7. The method of claim 1,

   The plurality of time blocks is a search window interval (DW interval) for transmitting the data after the search window (DW interval) is expressed based on a time block unit of a constant size.
8. The method of claim 1,

   The updating of the cluster bitmap information may include: if the determined time block is not the overlapping block, the first device determines the cluster bitmap information based on the request bitmap information corresponding to the determined time block. Updating the method.
9. The method of claim 1,

   And updating the cluster bitmap information, if the determined time block is the overlapping block, maintaining the cluster bitmap information corresponding to the determined time block by the first device.
10. The method of claim 1,

    If the determined time block is the overlapping block, the first device is determined based on the first device bitmap information corresponding to the determined time block and the request bitmap information corresponding to the determined time block. Determining whether a time block is available, wherein the first device bitmap information indicates one or more third time blocks allocated for the first device of the plurality of time blocks;

    And if the determined time block is available, updating the first device bitmap information based on the requested bitmap information corresponding to the determined time block.
11. The method of claim 1,

    And determining whether any one of the plurality of time blocks is an overlapping lock comprises performing a logical operation based on the request bitmap information and the cluster bitmap information.
12. The method of claim 11,

    Said logical operation being performed based on an OR operator.
13. The method of claim 1,

    And the cluster bitmap information is a set of binary representations in which bits corresponding to one or more time blocks allocated for the cluster are at a high level and bits corresponding to the remaining time blocks are at a low level.
14. In a device using a scheduling method for a cluster of a neighbor aware network (NAN),

    A transceiver for transmitting and receiving a radio signal; And

    A processor coupled to the transceiver, wherein the processor includes:

    Is configured to transmit information indicating a scheduling scheme for data to be transmitted to the second device in a discovery window,

    Whether any one of the plurality of time blocks is an overlapping block based on the cluster bitmap information indicating the one or more second time blocks allocated for the cluster among the plurality of time blocks and the request bitmap information. Is implemented to determine

    The cluster bitmap information is updated according to whether the determined time block is the overlapping block.

    And transmit a data response frame including the updated cluster bitmap information to the second device.

Images