WO2017086764A1

WO2017086764A1 - Method for performing scheduling of neighbor awareness network through paging technique, and device using same

Info

Publication number: WO2017086764A1
Application number: PCT/KR2016/013442
Authority: WO
Inventors: 임태성; 박기원; 김동철; 이병주; 조영준
Original assignee: 엘지전자 주식회사
Priority date: 2015-11-22
Filing date: 2016-11-22
Publication date: 2017-05-26

Abstract

According to one embodiment of the present specification, a method by which a first device performs scheduling of a neighbor awareness network (NAN) through a paging technique comprises the steps of: maintaining an active state in a first paging window, and receiving, from a second device, a first paging frame including first identification information indicating a receiving device of buffered traffic; determining whether the first identification information indicates the first device; setting the length of a second paging window according to the determination result; entering an inactive state after the first paging window; maintaining the active state in the set second paging window; and receiving, from the second device, a second paging frame in the second paging window.

Description

A method for performing scheduling of a neighbor aware network through a paging scheme and an apparatus using the same

The present disclosure relates to wireless communication, and more particularly, to a method for performing scheduling of a neighbor awareness network (NAN) through a paging scheme, and an apparatus 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 method for performing scheduling of a neighbor aware network (NAN) with improved performance through a paging technique of dynamically adjusting a time length of a paging window, and an apparatus using the same.

The present disclosure relates to a method for performing scheduling of a neighbor aware network (NAN) through a paging scheme by a first apparatus. According to an embodiment of the present disclosure, a second device includes a first paging frame that maintains an active state in a first paging window and includes first identification information indicating an apparatus for receiving buffered traffic. Receiving from, determining whether the first identification information indicates the first device, setting the length of the second paging window according to the determination result, entering into an inactive state after the first paging window, Maintaining an active state in the set second paging window and receiving a second paging frame from the second device in the second paging window.

According to an embodiment of the present disclosure, a method and an apparatus using the same are provided for performing scheduling of a neighbor aware network having improved performance through a paging technique of dynamically adjusting a time length of a paging window.

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 according to an embodiment of the present specification.

5 is a diagram illustrating a relationship between NAN components according to another exemplary embodiment of the present specification.

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

7 illustrates an operation of a NAN terminal in a search window and a search window interval.

8 illustrates a paging NDL (P-NDL) technique among NDL scheduling techniques of a NAN terminal.

9 is a diagram illustrating a paging window and a transmission window of the P-NDL.

10 shows an example of a scheduling method of a neighbor aware network through a paging scheme according to an embodiment of the present disclosure.

11 shows an example of an extension of a scheduling method of a neighbor aware network through a paging scheme according to an embodiment of the present disclosure.

12 illustrates an example of a scheduling method of a neighbor aware network through a paging scheme according to another embodiment of the present specification.

FIG. 13 is a view illustrating an extension example of a scheduling method of a neighbor aware network through a paging scheme according to another embodiment of the present specification.

14 is a flowchart illustrating a scheduling method of a neighbor aware network through a paging scheme according to an embodiment of the present disclosure.

FIG. 15 is a timing diagram for adjusting a length of a paging window through a paging scheme according to an embodiment of the present disclosure.

FIG. 16 illustrates a case in which a paging frame through a paging scheme is received in a transmission window according to an embodiment of the present specification.

FIG. 17 is a diagram illustrating a timing point and a limit number of adjusting a length of a paging window through a paging scheme according to the present embodiment.

18 and 19 are diagrams illustrating a method of controlling the length of a paging window according to another embodiment of the present specification.

20 is a diagram illustrating a field area of a paging frame according to another embodiment of the present specification.

21 is a block diagram illustrating a wireless terminal to which an embodiment can be applied.

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.

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 successive discovery windows (hereinafter, referred to as 'DW'), information about a beacon interval, information about the NAN channel, and the like.

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.

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 discovery engine 330, a plurality of applications (App_1, App_2, ..., App_n) and a plurality of applications as main components. And a plurality of NAN application programming interfaces (NAN

application programming interfaces

341, 342, ..., 34n) connected to (App_1, App_2, ..., App_n), respectively.

For the discovery operation of the NAN terminal and data communication with the counterpart NAN terminal, the NAN discovery engine 330 is based on primitives received from a plurality of applications (App_1, App_2, ..., App_n) of the NAN terminal. The operation of the NAN MAC 320 may be controlled. In addition, the NAN discovery engine 330 may perform a discovery operation for discovering another terminal in the NAN cluster, a further discovery operation for completing the discovery operation, and data communication with another terminal in the NAN cluster. Various operations for the scheduling operation may be provided.

4 is a diagram illustrating a relationship between NAN components according to an embodiment of the present specification. 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.

Referring to FIG. 5, the NAN MAC 520 may process a NAN Beacon frame and a NAN Service Discovery frame. The NAN search engine 530 may process service requests (Queries) and responses (Responses). The NAN search engine 530 may provide the functionality of a subscription 531, follow-up 532, and publish 533. In addition, the NAN search engine 530 may provide various functions for a further discovery operation according to an embodiment of the present specification.

The publish / subscribe

functions

531 and 533 operate based on the service interface provided from the service / application 540. When instructions of the publish / subscribe 531, 533 are executed, an instance of the publish / subscribe 531, 533 function is created.

Each instance runs independently, and depending on the implementation, multiple instances can run simultaneously. The follow-up 532 function may send and receive service specific information for the service / application 540.

6 shows a NAN data communication structure for transmitting and receiving data between NAN terminals. 1 to 6, a NAN data cluster (hereinafter, referred to as 'NDC') 620 may include at least two NAN terminals sharing a common NDC schedule in the same NAN cluster 110 of FIG. 1. (601, 602, 603, 604).

Each NAN terminal in the NDC 620 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.

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 601 has an NDL with the second to

fourth NAN terminals

602, 603, and 604. The second NAN terminal 602 has an NDL with the first NAN terminal 601 and the third NAN terminal 603. The third NAN terminal 603 has an NDL with the first NAN terminal 601 and the second NAN terminal 602. The fourth NAN terminal 604 has an NDL with the first NAN terminal 601.

Except for the

NAN terminals

601, 602, 603, and 604 included in the NDC 600, the remaining NAN terminals 605 ˜ 618 in the NDC 620 may transmit and receive control information associated with the NAN parameter. Substantial data such as payload cannot be transmitted or received.

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

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

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

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 be 16 TU.

A synchronization beacon frame (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 a NAN terminal that is not joined to the NAN cluster so that the NAN cluster can be found. A service discovery frame (SDF) is used to exchange 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.

8 illustrates a paging NDL (P-NDL) technique among NDL scheduling techniques of a NAN terminal. 7 and 8, the first sections T0 to T1 correspond to the first search window DW_1 or the second search window DW_2, and the second sections T1 to T3 correspond to the search window intervals ( DW interval).

In step S810, NAN_2 transmits a subscription 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 service of NAN_1 and a supportable scheduling scheme of NAN_1.

Through the above steps S810 and S820, NAN_1 and NAN_2 can recognize a mutually supportable service. Steps S810 and S820 are referred to herein as capability exchange steps.

In step S830, to request data to be transmitted to NAN_2, NAN_2 may transmit a data request frame to 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 (CRB) that can transmit and receive data with each other.

The common resource blocks T2_1 to T2_3 of FIG. 8 include a first paging window (T2_1 to T2_2, paging window, PW) for paging transmission and a first transmission window (T2_2 to T2_3, transmission window, for data transmission). TxW). NAN_1 and NAN_2 enter common resource blocks T2_1 to T2_3 at the same timing T2_1.

In operation S850, when a predetermined offset time T1 to T2_1 elapses from the end time T1 of the search window DW, the first paging windows T2_1 to T2_2 may be started. In the first paging window PW, NAN_2 may transmit a paging frame (“PF”) to NAN_1. The paging window PW will be described in more detail with reference to the accompanying drawings.

In operation S860, the NAN_1 receiving the paging frame PF may transmit data for NAN_2 to the NAN_2 during the transmission windows T2_2 to T2_3 and TxW. The transmission window TxW will be described in more detail with reference to the drawings below.

Although only one common resource block T2_1 to T2_3 is illustrated in FIG. 8, it is not limited thereto and it will be understood that a plurality of common resource blocks CRB may exist in the second section T1 to T3.

8 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 this 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.

8 and 9, the paging windows T2_1 to T2_2 of FIG. 9 correspond to the paging windows T2_1 to T2_2 of FIG. 8, and the transmission windows T2_2 to T2_3 of FIG. 9 correspond to FIGS. 8 and 9. It may correspond to the transmission window (T2_2 ~ T2_3) of.

The publisher having the data of FIG. 9 (ie, NAN_2 of FIG. 8) means a frame (ie, a paging frame of step S850) that includes a list of destinations of buffered data at the publisher. Is transmitted from the paging windows T2_1 to T2_2 of FIG. 9.

The frame transmitted from the publisher (ie, NAN_2 of FIG. 8) (ie, the paging frame of step S850) may be transmitted to a plurality of subscribers. In this case, each subscriber may determine whether it is a subscriber to receive data based on the frame transmitted from the publisher (ie, NAN_2 of FIG. 8) (ie, the paging frame of step S850).

For the sake of brevity of FIG. 9, the subscriber (NAN_1 in FIG. 8) is checked in the list included in the frame (that is, the paging frame in step S850) to receive data from the subscriber (NAN_1 in FIG. 8). Assume a case where it is determined to be a subscriber to do.

In this case, the subscriber (NAN_1 of FIG. 8) may maintain an awake state during the transmission window TxW. The subscriber (NAN_1 of FIG. 8) triggers to the publisher (NAN_2 of FIG. 8) to indicate that it can receive data to be sent for the subscriber (NAN_1 of FIG. 8) from the publisher (NAN_2 of FIG. 8). You can send a frame. For example, the trigger frame transmitted by the subscriber (NAN_1 of FIG. 8) may be a QoS null type frame.

The page attribute of the present specification may include a list of destinations of data buffered by the publisher (NAN_2 of FIG. 8). The paging frame PF is transmitted in a paging window PW between NAN terminals. An exemplary format of the page attribute may be shown in Table 1 below.

Table 1

Referring to Table 1, the page attributes include an attribute ID field for identifying a type of a NAN attribute, a length field indicating a length of an attribute, and an NDL group ID for a data link group identifier. Field, a Page Control field indicating which field is currently present, and a list of one or more NAN terminals (corresponding to the aforementioned list of destinations of buffered data) to receive buffered data by the publisher. It may include a PDL Sequence of PDLs field.

For example, a list of destinations of data buffered by the publisher (NAN_2 in FIG. 8) may be included in the PDL Sequence of PDLs field. In this case, a list of destinations of buffered data includes at least one medium access control (MAC) address corresponding to at least one subscriber. can do.

The page control field of Table 1 will be described in more detail with reference to the following drawings.

1 through 10, horizontal axes t1 and t2 of the subscriber NAN_S and the publisher NAN_P represent windows (eg, a search window, a paging window, and a transmission window) according to time intervals.

In FIG. 10, the first cycles T0 to T3, the second cycles T3 to T6, and the third cycles T6 to T9 are shown, and each cycle may include 512 TUs. As another example, the time interval of each cycle may be a time interval based on microseconds (μs).

For the sake of clarity and simplicity, it is assumed that the subscriber NAN_S and the publisher NAN_P of FIG. 10 are included in the same cluster NDC. In addition, it will be understood that the description of the sections T0 to T3 having the same reference numerals as FIGS. 8 and 9 described above among the time sections of FIG. 10 may be replaced with the above description.

In the first cycles T0 to T3, it is assumed that the publisher NAN_P buffers traffic for a device (not shown) other than the subscriber NAN_S. Similarly, it is assumed that in the second cycles T3 to T6 and the third cycles T6 to T9, the publisher NAN_P buffers traffic for a device (not shown) other than the subscriber NAN_S. In addition, it is assumed that a scheduling scheme of a paging scheme is selected in all of the first to third search windows T0 to T1, T3 to T4, and T6 to T7.

In the first search window T0 to T1 of FIG. 10, the publisher NAN_P and the subscriber NAN_S select a paging scheme among scheduling schemes through capability exchange with each other according to the foregoing assumption, and paging. You can select the paging offset associated with the start of the window.

In the first offset period T1 ˜ T2_1, the publisher NAN_P and the subscriber NAN_S may maintain the inactive mode according to the paging offset determined by the first search window T0 ˜ T1.

In the first paging windows T2_1 to T2_2, the subscriber NAN_S may receive the first paging frame PF1 from the publisher NAN_P. For example, in the first paging windows T2_1 to T2_2, the publisher NAN_P and the subscriber NAN_S may maintain an active mode.

The subscriber NAN_S of FIG. 10 may determine whether the identifier information indicating the subscriber NAN_S is included in the first paging frame PF1 during the first paging windows T2_1 to T2_2. For example, according to the above assumption, the subscriber NAN_S may determine that the identifier information indicating the subscriber NAN_S is not included in the received first paging frame PF1.

The subscriber NAN_S determines the length of the second paging windows T3 to T4 of the second cycles T3 to T6, which are the next cycles, of the first paging windows T2_1 to T2_1 of the first cycles T0 to T3. It can be set to have a length shorter than the length.

Since the publisher NAN_P is a NAN terminal transmitting a paging frame, the lengths of the first paging windows T2_1 to T2_2 may be equally applied to the second paging windows T5_1 to T5_3 of the second cycles T3 to T6. have.

In the first transmission period T2_2 to T2_3, the subscriber NAN_S may be switched to the inactive mode during the first transmission period T2_2 to T2_3 because there is no traffic to be received. The publisher NAN_P may maintain an active mode for the first transmission period T2_2 to T2_3 for transmission of buffered traffic for another device.

In the first waiting period T2_3 to T3, since there is no traffic to be transmitted or received, the subscriber NAN_S and the publisher NAN_P may maintain an inactive mode.

In the second cycles T3 to T6, as described above, the lengths of the second paging windows T5_1 to T5_2 for the subscriber NAN_S and the second paging windows T5_1 to T5_3 for the publisher NAN_P are determined. It can be set differently.

In the second paging windows T5_1 to T5_2 for the subscriber NAN_S, the subscriber NAN_S may receive the second paging frame PF2 from the publisher NAN_P.

The subscriber NAN_S may determine whether the identifier information indicating the subscriber NAN_S is included in the second paging frame PF2 during the second paging windows T5_1 to T5_2. For example, according to the foregoing assumption, the subscriber NAN_S may determine that the second paging frame PF2 does not include identifier information indicating the subscriber NAN_S.

The subscriber NAN_S determines the length of the third paging window T6 ˜ T7 of the third cycle T6 ˜ T9, which is the next cycle, of the second paging window T5_1 ˜ T5_2 of the second cycle T3 ˜ T6. It can be set to have a length shorter than the length.

Since the publisher NAN_P is a NAN terminal that transmits a paging frame, the lengths of the first paging windows T2_1 to T2_2 may be equally applied to the third paging windows T6 to T7 of the third cycles T6 to T9. have.

In the third cycles T6 to T9, the lengths of the third paging windows T8_1 to T8_2 for the subscriber NAN_S and the third paging windows T8_1 to T8_3 for the publisher NAN_P are as described above. It can be set differently.

In the third paging windows T8_1 to T8_2 for the subscriber NAN_S, the subscriber NAN_S may receive the third paging frame PF3 from the publisher NAN_P.

The subscriber NAN_S determines whether the identifier information indicating the subscriber NAN_S is included in the third paging frame PF3 during the third paging windows T8_1 to T8_2 for the subscriber NAN_S. can do. For example, according to the above assumption, the subscriber NAN_S may determine that the identifier information indicating the subscriber NAN_S is not included in the third paging frame PF3.

The subscriber NAN_S may set the length of the paging window (not shown) of the next cycle (not shown) to have a length shorter than the length of the third paging windows T8_1 to T8_2 of the third cycle T6 to T9. have. Subsequently, fourth search windows T9 to T10 of the fourth cycle may be started.

In the case of Figure 10, whether or not to receive the paging frame is described as being determined during the paging window of the current cycle of the terminal, it will be understood that it is not limited thereto. As another example, whether or not to receive a paging frame may be determined at a specific point in time of the transmission window of the current cycle that is started after the end of the paging window of the current cycle.

According to this embodiment, by dynamically adjusting the length of time of the paging window, it is possible to prevent the NAN terminal without traffic to be received unnecessarily maintains the active mode in the remaining paging window period. Accordingly, power consumed by the NAN terminal can be effectively reduced.

Referring to FIG. 11, the horizontal axis t of the subscriber NAN_S and the horizontal axes t1, t2,..., Tn of the first to n-th publishers NAN_P1 to NAN_Pn are windows along a time interval (eg, , Search window, paging window, transmission window).

For clarity and concise description of FIG. 11, it is assumed that the subscriber NAN_S and the first to n th publishers NAN_P1 to NAN_Pn of FIG. 11 are included in the same cluster NDC. It is assumed that a scheduling scheme of a paging scheme is selected in all of the first to third search windows T0 to T1, T3 to T4, and T6 to T7.

In addition, it will be understood that the description of the time intervals T0 to T10 having the same reference numerals as FIG. 10 described above among the time intervals of FIG. 11 may be replaced with the above description.

It is assumed that the first to n th publishers NAN_P1 to NAN_Pn of the first cycles T0 to T3 of FIG. 11 buffer traffic for a device other than the subscriber NAN_S.

Similarly, the first through n-th publishers NAN_P1 through NAN_Pn of the second cycles T3 through T6 and the third cycles T6 through T9 of FIG. 11 may use devices other than the subscribers NAN_S (not shown). Suppose you buffer traffic for.

According to the assumption for FIG. 11, the first to nth paging frames PF1_1 to PF1_n transmitted to the subscriber NAN_S in the first paging windows T2_1 to T2_2 of the first cycles T0 to T3 of FIG. 11. The identifier information included in) may not indicate the subscriber NAN_S.

The identifier information included in the first to n-th paging frames PF2_1 to PF2_n transmitted to the subscriber NAN_S in the second paging windows T5_1 to T5_2 of the second cycles T3 to T6 of FIG. The scriber NAN_S may not be indicated.

The identifier information of the first to nth paging frames PF3_1 to PF3_n transmitted to the subscriber NAN_S in the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 of FIG. It may not indicate (NAN_S).

The time lengths of the paging windows of the plurality of publishers NAN_P1 to NAN_Pn of FIG. 11 may be kept constant. In contrast, since the subscriber NAN_S of FIG. 11 receives a paging frame that does not include identifier information corresponding to the device, the time length of the paging window of the next cycle may be set to be shorter than the length of the paging window of the current cycle. .

10 and 11, since FIG. 11 is a scheduling method through a paging technique between a subscriber and a plurality of publishers, it will be understood that the contents of FIG. 10 may be extended and applied.

Referring to FIG. 12, the horizontal axes t1 and t2 of the subscriber NAN_S and the publisher NAN_P represent windows (eg, a search window, a paging window, and a transmission window) according to time intervals.

In FIG. 12, the first cycles T0 to T3, the second cycles T3 to T6, and the third cycles T6 to T9 are illustrated, and the time period of each cycle may include 512 TUs. As another example, the time interval of each cycle may be a time interval based on microseconds (μs).

For the sake of clarity and simplicity, it is assumed that the subscriber NAN_S and the publisher NAN_P of FIG. 12 are included in the same cluster NDC. It is assumed that a scheduling scheme of a paging scheme is selected in all of the first to third search windows T0 to T1, T3 to T4, and T6 to T7.

In addition, it will be understood that the description of the sections T0 to T10 having the same reference numerals as FIG. 10 described above among the time sections of FIG. 12 may be replaced with the above description.

It is assumed that the publisher NAN_P buffers traffic for a device other than the subscriber NAN_S in the first cycles T0 to T3 and the third cycles T6 to T9 of FIG. 12. However, unlike FIG. 10, it is assumed that the publisher NAN_P buffers the traffic for the subscriber NAN_S in the second cycles T3 to T6 of FIG. 12.

Hereinafter, FIG. 12 will be described based on characteristics generated according to a difference between an assumption used in FIG. 10 and an assumption used in FIG. 12.

The subscriber NAN_S of FIG. 12 may receive the first paging frame PF1 in the first paging windows T2_1 to T2_2 of the first cycles T0 to T3. According to the assumption of FIG. 12, the identifier information included in the first paging frame PF1 does not indicate the subscriber NAN_S.

Accordingly, the subscriber NAN_S may set the length of the second paging windows T5_1 to T5_2 of the second cycles T3 to T6 to be shorter than the length of the first paging windows T2_1 to T2_2.

Thereafter, the subscriber NAN_S may receive the second paging frame PF2 from the second paging windows T2_1 to T2_2. According to the assumption of FIG. 12, the second paging frame PF2 may include identifier information indicating the subscriber NAN_S.

Accordingly, the subscriber NAN_S may transmit a trigger frame (hereinafter referred to as 'TF') to the publisher NAN_P in the second paging windows T2_1 to T2_2 in response to the second paging frame PF2. have. The trigger frame TF of FIG. 12 is generally transmitted in the paging window of the current cycle, but is not necessarily limited thereto. For example, a trigger frame may be transmitted in the second transmission windows T5_2 to T5_4 which are started after the second paging windows T5_1 to T5_2 of FIG. 12 are terminated.

The subscriber NAN_S may set the length of the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 to be longer than the length of the second paging windows T5_1 to T5_2. For example, the subscriber NAN_S may set the length of the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 to be equal to the length of the first paging windows T2_1 to T2_2.

Subsequently, the subscriber NAN_S may receive the third paging frame PF3 from the third paging windows T8_1 to T8_2. According to the assumption of FIG. 12, the third paging frame PF3 does not include identifier information indicating the subscriber NAN_S.

Accordingly, the subscriber NAN_S may set the length of the fourth paging window (not shown) of the fourth cycle (not shown) to be shorter than the length of the third paging windows T8_1 to T8_2. For example, the subscriber NAN_S may set the length of the fourth paging window (not shown) of the fourth cycle (not shown) to be equal to the length of the second paging windows T5_1 to T5_2.

Referring to FIG. 13, the horizontal axis t of the subscriber NAN_S and the horizontal axes t1, t2,..., Tn of the first to n-th publishers NAN_P1 to NAN_Pn correspond to windows (eg, a time interval). , Search window, paging window, transmission window).

For clarity and concise description of FIG. 13, it is assumed that the subscriber NAN_S and the first to n th publishers NAN_P1 to NAN_Pn of FIG. 13 are included in the same cluster NDC.

It is assumed that a scheduling scheme of a paging scheme is selected in all of the first to third search windows T0 to T1, T3 to T4, and T6 to T7 of FIG. 13. In addition, it will be understood that the description of the time intervals T0 to T10 having the same reference numerals as FIG. 12 described above among the time intervals of FIG. 13 may be replaced with the above description.

In the first cycles T0 to T3 of FIG. 13, it is assumed that the first to nth publishers NAN_P1 to NAN_Pn buffer traffic for a device other than the subscriber NAN_S.

However, it is assumed that the first publisher NAN_P1 among the first to nth publishers NAN_P1 to NAN_Pn buffers the traffic for the subscriber NAN_S in the second cycles T3 to T6 of FIG. 13. In addition, it is assumed that the n th publisher NAN_Pn among the first to n th publishers NAN_P1 to NAN_Pn buffers the traffic for the subscriber NAN_S in the third cycles T6 to T9 of FIG. 13.

According to the assumption of FIG. 13, the plurality of paging frames PF1_1 to PF1_n transmitted to the subscriber NAN_S in the first paging windows T2_1 to T2_2 of the first cycles T0 to T3 are assigned to It may include identification information not indicating the driver NAN_S.

However, the first paging frame PF2_1 of the plurality of paging frames PF2_1 to PF2_n transmitted to the subscriber NAN_S in the second paging windows T5_1 to T5_2 of the second cycles T3 to T6 of FIG. 13. May include identification information indicating the subscriber NAN_S. The nth paging frame PF3_n of the plurality of paging frames PF3_1 to PF3_n transmitted to the subscribers NAN_S in the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 of FIG. It may include identification information indicating the scriber (NAN_S).

Accordingly, the subscriber NAN_S may transmit the first trigger frame TF_1 to the first publisher NAN_P1 in response to the first paging frame PF2_1 from the second paging windows T5_1 to T5_2. The subscriber NAN_S may transmit the second trigger frame TF_2 to the nth publisher NAN_Pn in response to the nth paging frame PF3_n in the third paging windows T8_1 to T8_2.

The lengths of the paging windows of the plurality of publishers NAN_P1 to NAN_Pn of FIG. 13 may be kept constant.

In contrast, the subscriber NAN_S of FIG. 13 may not include identifier information corresponding to the subscriber NAN_S in the first paging windows T2_1 to T2_2 of the first cycles T0 to T3. The frames PF1_1 to PF1_n may be received.

Subsequently, the subscriber NAN_S may receive the paging frame PF2_1 including identifier information corresponding to the subscriber NAN_S in the second paging windows T5_1 to T5_2 of the second cycles T3 to T6. Can be. Accordingly, the subscriber NAN_S may set the length of the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 to be longer than the length of the second paging windows T5_1 to T5_2.

Subsequently, the subscriber NAN_S may receive the paging frame PF3_n including the identifier information corresponding to the subscriber NAN_S in the third paging windows T8_1 to T8_2 of the third cycles T6 to T9. Can be. Accordingly, the subscriber NAN_S may set the length of the fourth paging window of the fourth cycle (not shown) to be longer than the length of the third paging window.

12 and 13, since FIG. 13 is a scheduling method through a paging scheme between a subscriber and a plurality of publishers, it will be understood that the contents of FIG. 12 may be extended and applied.

11 and 14, in step S1410, a paging scheme as a scheduling technique for traffic transmission through capability exchange between a subscriber (NAN terminal) and at least one publisher (NAN terminal) in a discovery window (DW). Is selected.

In step S1420, the subscriber in the paging window according to the paging scheme may receive a paging frame from at least one publisher. In this case, the paging frame may include identifier information indicating a receiver to receive traffic buffered at each publisher.

In operation S1430, the subscriber may determine whether the identifier information received in the paging frame indicates itself. In this case, the identifier information may include a medium access control (MAC) address.

If the identifier information included in the paging frame does not indicate a subscriber, step S1440 may be performed. In operation S1440, the subscriber may set the paging window of the next cycle to have a length reduced by a predetermined interval. This corresponds to FIGS. 10 and 11 described above and may be referred to herein as a negative paging technique.

If the identifier information included in the paging frame indicates the subscriber, step S1450 may be performed. In operation S1450, the subscriber may set the paging window of the next cycle to have a length increased by a predetermined interval. This corresponds to FIGS. 12 and 13 described above, and may be referred to herein as a positive paging technique.

As described above, the NAN terminal of the present specification may dynamically adjust a paging window according to a positive paging scheme or a negative paging scheme based on whether identification information indicating a subscriber terminal is included in a paging frame. Accordingly, since the NAN terminal can be prevented from maintaining an activated state in an unnecessary section, power consumed by the terminal can be reduced.

For clarity and concise description of FIG. 15, it is assumed that the subscriber NAN_S of FIG. 15 and the first to n th publishers NAN_P1 to NAN_Pn are included in the same cluster NDC. It is assumed that a scheduling scheme of a paging scheme is selected in all of the first to third search windows T0 to T1, T3 to T4, and T6 to T7.

In addition, it will be understood that the description of the time intervals T0 to T10 having the same reference numerals as FIGS. 11 and 13 described above among the time intervals of FIG. 15 may be replaced with the above description. In the first cycles T0 to T3 of FIG. 15, it is assumed that the first to n th publishers NAN_P1 to NAN_Pn buffer traffic for a device other than the subscriber NAN_S.

Similarly, in the second cycles T3 to T6 of FIG. 15, it is assumed that the first to n th publishers NAN_P1 to NAN_Pn buffer traffic for a device other than the subscriber NAN_S.

However, it is assumed that the n th publisher NAN_Pn among the first to n th publishers NAN_P1 to NAN_Pn buffers the traffic for the subscriber NAN_S in the third cycles T6 to T9 of FIG. 15.

According to the assumption for the description of FIG. 15, the first paging windows T2_1 to T2_2 of the first cycles T0 to T3 and the second paging windows T5_1 to T5_2 of the second cycles T3 to T6 are displayed. The identifier information included in the plurality of paging frames PF1_1 to PF1_n and PF2_1 to PF2_n transmitted to the driver NAN_S may not indicate the subscriber NAN_S.

However, it is included in the nth paging frame PF3_n of the paging frames PF3_1 to PF3_n transmitted to the subscribers NAN_S in the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 of FIG. 15. The identifier information may indicate the subscriber NAN_S.

When the nth paging frame PF3_n indicating the subscriber NAN_S is received, the subscriber NAN_S of FIG. 15 may reset the lengths of the third paging windows T8_1 to T8_2. For example, the lengths of the reset third paging windows T8_1 to T8_2 may be set to be equal to the lengths of the second paging windows T5_1 to T5_2.

In addition, the subscriber NAN_S of FIG. 15 may transmit the trigger frame TF to the n-th device NAN_n in response to the n-th paging frame PF3_n from the third paging windows T8_1 to T8_2.

11 to 14 described above, the subscriber NAN_S determines whether the identifier information indicating the subscriber NAN_S is included in the paging frame received in the paging window of the current cycle. Subsequently, the subscriber NAN_S of FIGS. 11 to 14 sets the length of the paging window of the next cycle according to the determination result.

In contrast, according to the embodiment of FIG. 15, when a paging frame including identifier information indicating the subscriber NAN_S is received in the current paging window, the subscriber NAN_S of FIG. 15 may have a length of the current paging window. Can be increased.

Referring to FIG. 16, the horizontal axis t of the subscriber NAN_S and the horizontal axes t1, t2,..., Tn of the first to n-th publishers NAN_P1 to NAN_Pn correspond to a window according to a time interval. For example, a search window, a paging window, a transmission window).

For clarity and concise description of FIG. 16, it is assumed that the subscriber NAN_S of FIG. 16 and the first to n th publishers NAN_P1 to NAN_Pn are included in the same cluster NDC. It is assumed that a scheduling scheme of a paging scheme is selected in all of the first to third search windows T0 to T1, T3 to T4, and T6 to T7.

In addition, it will be understood that the description of the time intervals T0 to T10 having the same reference numerals as FIGS. 11 and 13 described above among the time intervals of FIG. 15 may be replaced with the above description.

It is assumed that the first to n th publishers NAN_P1 to NAN_Pn of the first cycles T0 to T3 of FIG. 16 buffer traffic for a device (not shown) other than the subscriber NAN_S.

However, in the second cycles T3 to T6 of FIG. 16, the first publisher NAN_P1 and the n-th publisher NAN_Pn among the first to n-th publishers NAN_P1 to NAN_Pn receive traffic for the subscriber NAN_S. Suppose you are buffering.

In addition, it is assumed that the n th publisher NAN_Pn among the first to n th publishers NAN_P1 to NAN_Pn buffers the traffic for the subscriber NAN_S in the third cycles T6 to T9 of FIG. 16.

16, identification information of the plurality of paging frames PF1_1 to PF1_n transmitted to the subscriber NAN_S in the first paging windows T2_1 to T2_2 of the first cycles T0 to T3. Does not indicate the subscriber NAN_S.

However, among the paging frames PF2_1 to PF2_n transmitted to the subscribers NAN_S in the second cycles T3 to T6 of FIG. 16, the first paging frame PF2_1 and the nth paging frame PF2_n are subscribers. It may include identification information indicating (NAN_S).

Accordingly, the subscriber NAN_S may transmit the first trigger frame TF_1 to the first publisher NAN_P1 in response to the first paging frame PF2_1 from the second paging windows T5_1 to T5_2. The subscriber NAN_S may transmit the first trigger frame TF_2 to the nth publisher NAN_Pn in response to the nth paging frame PF2_n in the second paging windows T5_1 ˜ T5_2.

In addition, the subscriber NAN_S may transmit the third trigger frame TF_3 to the n-th publisher NAN_Pn in response to the n-th paging frame PF3_n from the third paging windows T8_1 to T8_2.

However, in the second cycles T3 to T6 of FIG. 16, the subscriber NAN_S is in an inactive mode immediately after the end of the second paging windows T5_1 to T5_2 to receive buffered traffic from the first publisher NAN_P1. It can be kept in the active mode without being switched to.

Subsequently, the subscriber NAN_S maintaining the active mode in the second transmission windows T5_1 to T5_2 of the second cycles T3 to T6 may receive the nth paging frame PF2_n from the nth publisher NAN_Pn. Can be. Accordingly, the subscriber NAN_S may transmit the second trigger frame TF_2 to the first publisher NAN_P1 in response to the nth paging frame PF2_n in the second transmission windows T5_2 to T5_4.

Subsequently, the terminal may set the length of the third paging windows T8_1 to T8_2 of the third cycles T6 to T9 longer than the lengths of the second paging windows T5_1 to T5_2.

17 is a diagram illustrating a timing and a limit number of controlling a length of a paging window through a paging scheme according to the present embodiment.

For clarity and concise description of FIG. 17, it is assumed that the subscriber NAN_S of FIG. 17 and the first to n th publishers NAN_P1 to NAN_Pn are included in the same cluster NDC. It is assumed that a scheduling scheme of a paging scheme is selected in all of the first to fourth search windows T0 to T1, T3 to T4, T6 to T7, and T11 to T12.

In addition, it will be understood that the description of the time intervals T0 to T10 having the same reference numerals as FIGS. 15 and 16 described above among the time intervals of FIG. 17 may be replaced with the above description.

In the first cycles T0 to T3 to third cycles T0 to T3 of FIG. 17, the first to n th publishers NAN_P1 to NAN_Pn are traffic for devices (not shown) other than the subscriber NAN_S. Suppose we buffer

According to the assumption of FIG. 17, the first to third paging windows T2_1 to T2_2, T5_1 to T5_2, and T8_1 to T8_2 of the first to third cycles T0 to T3 to T6 to T9. The identification information of the plurality of paging frames PF_1 to PF_n transmitted to the subscriber NAN_S does not indicate the subscriber NAN_S.

As shown in FIG. 17, when the subscriber NAN_S receives the paging frames PF_1 to PF_n that do not instruct the subscriber NAN_S as many times as the number of limits in succession, the subscriber NAN_S continues to display the paging window. Without reducing the length, the length of the paging window started after the limit number (eg N times) can be returned to the original length.

E.g. If the limit number N of FIG. 17 is three, the subscriber NAN_S may have the first to third paging windows T2_1 to T2_2 in the first cycle T0 to T3 to the third cycle T6 to T9. , T5_1 to T5_2, T8_1 to T8_2) can be reduced continuously.

However, the subscriber NAN_S may return the length of the fourth paging windows T13_1 to T13_2 to the lengths of the original first paging windows T2_1 to T2_2 in the fourth cycles T11 to T14.

17 illustrates an aspect of reducing power consumption that can be obtained by reducing the length of a paging window in terms of tradeoff and reducing the possibility of successful reception of a paging frame according to a reduced paging window length. Yes.

For clarity and concise description of FIG. 18, it is assumed that the subscriber NAN_S and the publisher NAN_P of FIG. 18 are included in the same cluster NDC. 1 to 18, in the discovery windows T0 to T1, the publisher NAN_P and the subscriber NAN_S may select a paging scheme as a scheduling technique for traffic transmission through capability exchange between them.

In the offset periods T1 to T2_1 of FIG. 18, the publisher NAN_P and the subscriber NAN_S may maintain the inactive mode for a time period according to the paging offset determined by the search windows T0 to T1. In the paging windows T2_1 to T2_2, the subscriber NAN_S may receive a paging frame PF from the publisher NAN_P.

For example, the identifier information included in the paging frame PF may indicate the subscriber NAN_S. The subscriber NAN_S may transmit the trigger frame TF to the publisher NAN_P in response to the paging frame PF.

In the paging windows T2_1 to T2_2 of FIG. 18, the subscribers NAN_S and the publisher NAN_P maintain the active mode. In the transmission periods T2_2 to T2_3, the subscriber NAN_S may maintain the active mode until it receives traffic from the publisher NAN_P. The subscriber NAN_S receiving the traffic from the publisher NAN_P may maintain the inactive mode for the remaining transmission sections of the transmission sections T2_2 to T2_3.

Referring to FIG. 19, the horizontal axis t of the publisher NAN_P and the horizontal axes t1, t2, t3 of the first to third subscribers NAN_S1 to NAN_S3 are windows (eg, a search window, Paging window, transmission window).

In the paging windows T2_1 to T2_2 of FIG. 19, the publisher NAN_P may transmit a paging frame PF to the first to third subscribers NAN_S1 to NAN_S3.

The paging frame PF of FIG. 19 may include identifier information indicating the first to third subscriber stations NAN_S1 to NAN_S3. For example, the identifier information may include a medium access control (MAC) address corresponding to the first to third subscribers NAN_S1 to NAN_S3.

Subsequently, the first to third subscribers NAN_S1 to NAN_S3 may transmit the first to third trigger frames TF_1, TF_2, and TF_3 to the publisher NAN_P in response to the paging frame PF.

The length of the paging window of FIG. 19 needs to be longer than that of the paging window of FIG. 18 in order to receive a trigger frame from a plurality of subscribers.

The publisher NAN_P of FIG. 19 may adjust the length of the paging window in consideration of the number of subscriber stations to receive buffered traffic. In other words, the publisher NAN_P may adjust the length of the paging window based on the number of receivers indicated by the identification information included in the paging frame PF.

For example, considering that there is one subscriber in FIG. 18 and three subscribers in FIG. 19, the publisher NAN_P may select the time interval of the paging window of FIG. 19 from the time interval of the paging window of FIG. 18. You can allocate longer.

As illustrated in FIGS. 18 and 19, the power consumed by the terminal may be reduced by adjusting the number of paging windows according to the number of receiving apparatuses associated with buffered traffic.

Referring to Table 1 described above and FIGS. 18 to 20, the page control field of FIG. 20 may be configured with 16 bits (2 octets). The page control field may include a broadcast / multicast field, a paging device count field, a dynamic paging window field, and a reserved field.

Specifically, in the broadcast / multicast field, a transmission method of a paging frame may be expressed based on 1 bit (broadcast method or multicast method). In the number of PDLs field, the number of paging devices activated for the reception of buffered traffic according to the paging frame may be expressed based on 3 bits.

In the dynamic paging window field, as described in FIGS. 18 and 19, time information set based on the number of receiving apparatuses indicated by identification information included in the paging frame PF is represented by 8 bits. Can be. The reserved field may be represented by 4 bits.

The Paged Device List (PDL) field of FIG. 20 corresponds to the PDL Sequence of PDLs field of Table 1. FIG. The length of the paging device list (PDL) field is variable depending on the number of NAN terminals activated by the paging frame.

The PDL field of FIG. 20 may include a PDL control field and a List of Devices field. The PDL control field includes two octets, an 8-bit length subfield, a 2-bit QoS category subfield, and a type subfield. It may include a Number of Octets per Address subfield and a reserved subfield.

Referring to FIG. 21, a wireless terminal may be an STA capable of implementing the above-described embodiment and may be an AP or a non-AP STA. The wireless terminal may correspond to the above-described user or may correspond to a transmitting terminal for transmitting a signal to the user.

The AP 2100 includes a processor 2110, a memory 2120, and an RF unit 2130.

The RF unit 2130 may be connected to the processor 2110 to transmit / receive a radio signal.

The processor 2110 may implement the functions, processes, and / or methods proposed herein. For example, the processor 2110 may perform an operation according to the present embodiment described above. The processor 2110 may perform an operation of the AP disclosed in the present embodiment of FIGS. 1 to 20.

The non-AP STA 2150 includes a processor 2160, a memory 2170, and an RF unit 2180.

The RF unit 2180 may be connected to the processor 2160 to transmit / receive a radio signal.

The processor 2160 may implement the functions, processes, and / or methods proposed in the present embodiment. For example, the processor 2160 may be implemented to perform the non-AP STA operation according to the present embodiment described above. The processor 2160 may perform an operation of the non-AP STA disclosed in the present embodiment of FIGS. 1 to 20.

Processors

2110 and 2160 may include application-specific integrated circuits (ASICs), other chipsets, logic circuits, data processing devices, and / or converters that convert baseband signals and wireless signals to and from each other. The

memories

2120 and 2170 may include read-only memory (ROM), random access memory (RAM), flash memory, memory cards, storage media, and / or other storage devices. The

RF unit

2130 and 2180 may include one or more antennas for transmitting and / or receiving a radio signal.

When the present embodiment is implemented in software, the above-described technique may be implemented as a module (process, function, etc.) for performing the above-described function. The module may be stored in the

memories

2120 and 2170 and executed by the

processors

2110 and 2160. The

memories

2120 and 2170 may be inside or outside the

processors

2110 and 2160, and may be connected to the

processors

2110 and 2160 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

In the method for performing the scheduling of the neighbor awareness network (Neighbor Awareness Network) by the first apparatus,

Receiving a first paging frame from the second device, the first paging frame being kept active in a first paging window and including first identification information indicating the receiving device of the buffered traffic;

Determining whether the first identification information indicates the first device;

Setting a length of a second paging window according to the determination result;

Entering an inactive state after the first paging window;

Maintaining the active state in the set second paging window; And

Receiving a second paging frame from the second device in the second paging window.
The method of claim 1,

The length of the first paging window is set according to the number of receiving devices indicated by the first identification information.
The method of claim 1,

The setting of the length of the second paging window according to the determination result may include: if the first identification information does not indicate the first device, make the length of the second paging window shorter than the length of the first paging window. The method further comprises the step of setting.
The method of claim 3, wherein

If the second identification information included in the second paging frame indicates the first device, setting a length of a third paging window longer than the length of the second paging window; And

Receiving a third paging frame in the third paging window.
The method of claim 4, wherein

And the first paging window and the third paging window have the same length of time.
The method of claim 3, wherein

If the second identification information included in the second paging frame does not indicate the first device, setting the length of the third paging window to be shorter than the length of the second paging window;

Receiving a third paging frame from the second device in the third paging window; And

And resetting the length of the third paging window in the third paging window if third identification information included in the third paging frame indicates the first device.
The method of claim 1,

If a paging frame including identification information not indicating the first device is received by the first device a number of times according to a limit value, resetting the length of a paging window for the paging frame transmitted after the number of times; How to include more.
The method of claim 1,

The setting of the length of the second paging window according to the determination result may include: when the first identification information does not indicate the first device and the length of the first paging window is a preset limit duration. And the first device maintains the length of the second paging window at the limit.
The method of claim 1,

The setting of the length of the second paging window according to the determination result may include setting the length of the second paging window longer than the length of the first paging window when the first identification information indicates the first device. Method comprising the steps of:
The method of claim 1,

If the first identification indicates the first device, sending a trigger frame to the second device in response to the first paging frame.
According to claim 1,

The first identification information includes at least one medium access control (MAC) address corresponding to at least one receiving device.
The method of claim 1,

If the first identification indicates the first device, receiving the buffered traffic from the second device in a first transmission window that is initiated after the termination of the first paging window.
A first apparatus using a method of performing scheduling of a neighbor aware network through a paging technique,

A transceiver for transmitting and receiving a radio signal; And

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

Is implemented to remain active in a first paging window, and is configured to receive a first paging frame from a second device, the first paging frame including first identification information indicating a device for receiving buffered traffic; ,

And determine whether the first identification information indicates the first device,

It is implemented to set the length of the second paging window according to the determination result,

It is implemented to enter an inactive state after the first paging window,

It is implemented to maintain the active state in the set second paging window,

And receive a second paging frame from the second device in the second paging window.