+

WO2017039379A1 - Procédé de planification de liaison de données de réseau de reconnaissance de voisinage et dispositif associé - Google Patents

Procédé de planification de liaison de données de réseau de reconnaissance de voisinage et dispositif associé Download PDF

Info

Publication number
WO2017039379A1
WO2017039379A1 PCT/KR2016/009840 KR2016009840W WO2017039379A1 WO 2017039379 A1 WO2017039379 A1 WO 2017039379A1 KR 2016009840 W KR2016009840 W KR 2016009840W WO 2017039379 A1 WO2017039379 A1 WO 2017039379A1
Authority
WO
WIPO (PCT)
Prior art keywords
nan
traffic
scheduling
scheme
frame
Prior art date
Application number
PCT/KR2016/009840
Other languages
English (en)
Korean (ko)
Inventor
이병주
김동철
박기원
조영준
임태성
Original Assignee
엘지전자 주식회사
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 엘지전자 주식회사 filed Critical 엘지전자 주식회사
Publication of WO2017039379A1 publication Critical patent/WO2017039379A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present disclosure relates to wireless communication, and more particularly, to a scheduling method for a data link of a neighbor awareness network (NAN) and a device using the same.
  • NAN neighbor awareness network
  • WLAN wireless local area network
  • the portable terminal may be a personal digital assistant (PDA), a laptop, a portable multimedia player (PMP).
  • PDA personal digital assistant
  • PMP portable multimedia player
  • 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.
  • NAN is a standard established by the Wi-Fi Alliance (WFA) based on the Wi-Fi standard.
  • WFA Wi-Fi Alliance
  • 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 and a device using the data link for a neighbor aware network with improved performance.
  • This specification relates to a scheduling method for a data link of a NAN.
  • a first discovery frame including first scheduling information indicating a scheduling scheme supported by a first device is transmitted to a second device in a discovery interval, Receiving a second discovery frame from the second device in the discovery period, the second discovery frame including second scheduling information indicating a scheduling scheme supported by the second device and traffic information of traffic to be transmitted from the second device to the first device, 2 If the scheduling information indicates both a synchronization scheme and a paging scheme, the first device includes selecting one of a synchronization scheme and a paging scheme based on the traffic information, wherein the synchronization scheme includes: After the discovery period ends, the first device and the second device enter the data section for traffic at the same time when they are synchronized. And, paging scheme, then the search interval is terminated when a method of pre-defined offset time elapses, the first device transmits a paging message to the second device for receiving the
  • negotiation of an available scheduling scheme may be performed based on capability exchange between NAN terminals.
  • an appropriate scheduling scheme may be selected according to a traffic characteristic to be delivered to another NAN terminal. Accordingly, a scheduling method for a data link of a neighbor aware network having improved performance and a device using the same can be provided.
  • FIG. 1 is a conceptual diagram illustrating a structure of a WLAN system.
  • FIG. 2 is a conceptual diagram of a layer architecture of a WLAN system supported by IEEE 802.11.
  • FIG. 3 is a conceptual diagram illustrating a channel access technique of an STA based on DCF.
  • FIG. 4 is a conceptual diagram illustrating a channel access model according to EDCA.
  • 5 and 6 are diagrams illustrating a NAN cluster.
  • FIG. 7 is a block diagram of a structure of a NAN terminal.
  • FIG. 10 shows a NAN data communication structure for data transmission and reception between NAN terminals.
  • FIG. 11 shows an operation of a NAN terminal in a search window and a search window interval.
  • FIG. 14 and 15 illustrate a conceptual diagram of a scheduling technique of a NAN terminal according to an embodiment of the present disclosure.
  • 16 is a flowchart illustrating a scheduling method of a NAN terminal according to one embodiment of the present specification.
  • 17 is a flowchart illustrating specific steps in a scheduling method of a NAN terminal according to an embodiment of the present specification.
  • FIG. 18 is a diagram illustrating a field of a TSPEC element according to an embodiment of the present specification.
  • FIG. 19 illustrates a subfield of a TSPEC element according to another embodiment of the present specification.
  • 20 is a block diagram illustrating a wireless device in which an embodiment of the present specification can be implemented.
  • FIG. 1 is a conceptual diagram illustrating a structure of a WLAN system.
  • FIG. 1A shows the structure of an infrastructure network of the Institute of Electrical and Electronic Engineers (IEEE) 802.11.
  • IEEE Institute of Electrical and Electronic Engineers
  • the WLAN system 10 of FIG. 1A may include at least one basic service set (hereinafter, referred to as 'BSS', 100, 105).
  • the BSS is a set of access points (APs) and stations (STAs) that can successfully synchronize and communicate with each other, and is not a concept indicating a specific area.
  • APs access points
  • STAs stations
  • the first BSS 100 may include a first AP 110 and one first STA 100-1.
  • the second BSS 105 may include a second AP 130 and one or more STAs 105-1, 105-2.
  • the infrastructure BSS may include at least one STA, AP (110, 130) providing a distribution service (Distribution Service) and a distribution system (DS, 120) connecting a plurality of APs. have.
  • the distributed system 120 may connect the plurality of BSSs 100 and 105 to implement an extended service set 140 which is an extended service set.
  • the ESS 140 may be used as a term indicating one network to which at least one AP 110 or 130 is connected through the distributed system 120.
  • At least one AP included in one ESS 140 may have the same service set identification (hereinafter, referred to as SSID).
  • the portal 150 may serve as a bridge for connecting the WLAN network (IEEE 802.11) with another network (for example, 802.X).
  • a network between APs 110 and 130 and a network between APs 110 and 130 and STAs 100-1, 105-1, and 105-2 may be implemented. Can be.
  • FIG. 1B is a conceptual diagram illustrating an independent BSS.
  • the WLAN system 15 of FIG. 1B performs communication by setting a network between STAs without the APs 110 and 130, unlike FIG. 1A. It may be possible to.
  • a network that performs communication by establishing a network even between STAs without the APs 110 and 130 is defined as an ad-hoc network or an independent basic service set (BSS).
  • BSS basic service set
  • the IBSS 15 is a BSS operating in an ad-hoc mode. Since IBSS does not contain an AP, there is no centralized management entity. Thus, in the IBSS 15, the STAs 150-1, 150-2, 150-3, 155-4, and 155-5 are managed in a distributed manner.
  • All STAs 150-1, 150-2, 150-3, 155-4, and 155-5 of the IBSS may be mobile STAs, and access to a distributed system is not allowed. All STAs of the IBSS form a self-contained network.
  • the STA referred to herein includes a medium access control (MAC) conforming to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard and a physical layer interface to a wireless medium.
  • MAC medium access control
  • IEEE Institute of Electrical and Electronics Engineers 802.11
  • any functional medium it can broadly be used to mean both an AP and a non-AP Non-AP Station (STA).
  • the STA referred to herein includes a mobile terminal, a wireless device, a wireless transmit / receive unit (WTRU), a user equipment (UE), and a mobile station (MS). It may also be called various names such as a mobile subscriber unit or simply a user.
  • WTRU wireless transmit / receive unit
  • UE user equipment
  • MS mobile station
  • a hierarchical architecture of a WLAN system includes a physical medium dependent (PMD) sublayer 200, a physical layer convergence procedure (PLCP) sublayer ( 210 and a medium access control (MAC) sublayer 220.
  • PMD physical medium dependent
  • PLCP physical layer convergence procedure
  • MAC medium access control
  • the PMD sublayer 200 may serve as a transmission interface for transmitting and receiving data between a plurality of STAs.
  • the PLCP sublayer 210 is implemented such that the MAC sublayer 220 can operate with a minimum dependency on the PMD sublayer 200.
  • the PMD sublayer 200, the PLCP sublayer 210, and the MAC sublayer 220 may conceptually include management entities.
  • the management unit of the MAC sublayer 220 is referred to as a MAC Layer Management Entity (MLME) 225.
  • the management unit of the physical layer is referred to as a PHY Layer Management Entity (PLME) 215.
  • Such management units may provide an interface for performing a layer management operation.
  • the PLME 215 may be connected to the MLME 225 to perform management operations of the PLCP sublayer 210 and the PMD sublayer 200.
  • the MLME 225 may be connected to the PLME 215 to perform a management operation of the MAC sublayer 220.
  • a STA management entity (hereinafter, referred to as “SME”, 250) may exist.
  • the SME 250 may operate as an independent component in each layer.
  • the PLME 215, the MLME 225, and the SME 250 may transmit and receive information from each other based on primitives.
  • the PLCP sublayer 110 may include a MAC protocol data unit (MAC protocol data unit) received from the MAC sublayer 220 according to an indication of the MAC layer between the MAC sublayer 220 and the PMD sublayer 200.
  • MAC protocol data unit MAC protocol data unit
  • the MPDU is transmitted to the PMD sublayer 200 or the frame coming from the PMD sublayer 200 is transferred to the MAC sublayer 220.
  • the PMD sublayer 200 may be a PLCP lower layer to perform data transmission and reception between a plurality of STAs over a wireless medium.
  • the MPDU delivered by the MAC sublayer 220 is referred to as a physical service data unit (hereinafter, referred to as a PSDU) in the PLCP sublayer 210.
  • PSDU physical service data unit
  • the MPDU is similar to the PSDU. However, when an aggregated MPDU (AMPDU) that aggregates a plurality of MPDUs is delivered, individual MPDUs and PSDUs may be different from each other.
  • AMPDU aggregated MPDU
  • the PLCP sublayer 210 adds an additional field including information required by the transceiver of the physical layer in the process of receiving the PSDU from the MAC sublayer 220 and transmitting the PSDU to the PMD sublayer 200.
  • the added field may be a PLCP preamble, a PLCP header, tail bits required to return the convolutional encoder to a zero state in the PSDU.
  • the PLCP sublayer 210 adds the above-described fields to the PSDU to generate a PPCP (PLCP Protocol Data Unit), which is then transmitted to the receiving station via the PMD sublayer 200, and the receiving station receives the PPDU to receive the PLCP preamble and PLCP. Obtain and restore information necessary for data restoration from the header.
  • PPCP PLCP Protocol Data Unit
  • FIG. 3 is a conceptual diagram illustrating a channel access method of an STA based on DCF.
  • a plurality of STAs may share a wireless medium using a distributed coordination function (hereinafter, referred to as 'DCF') that is a contention-based function.
  • the DCF may use carrier sense multiple access / collision avoidance (CSMA / CA) as an access protocol to coordinate collisions between STAs.
  • CSMA / CA carrier sense multiple access / collision avoidance
  • the STA may transmit an MPDU that is about to be transmitted. If it is determined that the medium is in use by the carrier sensing mechanism of the STA, the STA determines the size of the contention window (hereinafter referred to as 'CW') by a random backoff algorithm and back. The off procedure can be performed.
  • DIFS DCF inter frame space
  • the STA selects any time slot in the CW to perform the backoff procedure.
  • the selected time slot is called the back off time.
  • a STA that selects a relatively short backoff time among backoff times selected by a plurality of STAs may first obtain a transmission opportunity (hereinafter, referred to as 'TXOP') for accessing a medium.
  • the remaining STAs may stop the remaining backoff time and wait until the transmission of the STA transmitting the frame is completed. After the frame transmission of the STA is completed, the remaining STA again may compete with the remaining backoff time to occupy the wireless medium.
  • the DCF-based transmission method serves to prevent a collision that may occur when a plurality of STAs simultaneously transmit frames.
  • the channel access scheme using DCF has no concept of transmission priority. That is, when DCF is used, the quality of service (QoS) of traffic to be transmitted by the STA cannot be guaranteed.
  • QoS quality of service
  • HCF hybrid coordination function
  • HCCA HCCA controlled channel access
  • EDCA polling-based enhanced distributed channel access
  • Traffic categories ('TC') for transmission priority in EDCA and HCCA may be defined.
  • the priority for performing channel access may be determined based on the above TC.
  • the HCCA technique uses a hybrid coordinator (hereinafter, referred to as 'HC') located in the AP for central management of wireless medium access. Since the HC centrally manages the wireless medium, the competition for wireless medium access between STAs can be reduced. As a result, data frame exchange can be maintained with a short transmission delay time (SIFS), thereby increasing network efficiency.
  • 'HC' hybrid coordinator
  • the HC controls transmission delay and scheduling by defining, as a parameter, QoS characteristics for specific traffic required from an application service for QoS support.
  • the HC Before transmitting the parameterized QoS traffic, the HC first establishes a virtual connection called a traffic stream.
  • the traffic stream may be configured in both the uplink from the STA to the AP, the downlink from the AP to the STA, or the direct link from the STA to the STA.
  • the HC uses TXOP to control the allocation of media access time.
  • the EDCA may perform channel access by defining a plurality of user priorities.
  • AC may be AC_BK, AC_BE, AC_VI or AC_VO.
  • Each transmission queue 411, 412, 413, 414) corresponding to the four ACs (AC_BK, AC_BE, AC_VI, AC_VO) shown in FIG. 4 serve as individual EDCA competition entities for wireless medium access within one STA. Can be performed.
  • One AC may have a unique arbitration inter-frame space (AIFS) value and maintain an independent backoff counter. If there is more than one AC that has been backed off at the same time, collisions between the ACs may be controlled by a virtual collision handler 420.
  • AIFS arbitration inter-frame space
  • EDCA can classify traffic of MAC layer having different user priorities as shown in Table 1 below based on AC.
  • Priority User priority Access category (access caategory, AC) lowness
  • AC_BK 2 AC_BK 0
  • AC_BE 3 AC_BE 4
  • AC_VI 5 AC_VI 6
  • AC_VO height 7
  • Transmission queues and AC parameters can be defined for each AC.
  • EDCA can use AIFS [AC], CWmin [AC] and CWmax [AC] instead of DIFS, CWmin and CWmax, which are used in DCF, when performing the backoff procedure for transmitting traffic belonging to AC. have.
  • Parameters used for the backoff procedure for each AC may be delivered from the AP to each STA in a beacon frame. The smaller the value of AIFS [AC] and CWmin [AC], the higher the priority. Therefore, the shorter the channel access delay, the more bandwidth can be used in a given traffic environment.
  • the backoff procedure of EDCA which generates a new backoff counter, is similar to the backoff procedure of the existing DCF.
  • AC-based differentiated EDCA backoff procedure may be performed based on other EDCA parameters.
  • the EDCA parameter is an important means used to differentiate channel access of STAs having traffic having various user priorities.
  • the NAN cluster may consist of NAN terminals using the same set of NAN parameters.
  • 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.
  • the NAN cluster 510 may include a plurality of NAN terminals 520_1, 520_2, 520_3, and 520_4. NAN cluster 510 uses the same set of NAN parameters.
  • the NAN cluster 510 may be a collection of a plurality of NAN terminals 520_1, 520_2, 520_3, and 520_4 synchronized to a schedule of the same search window DW.
  • Any one of the NAN terminals 520_1, 520_2, 520_3, and 520_4 of the NAN cluster 510 may have a multicast or unicast NAN service discovery frame within a range of a discovery window (DW).
  • DW discovery window
  • 'SDF' may be directly transmitted to another NAN terminal.
  • the NAN cluster 610 may include at least one NAN master 620_1 and 620_2, and the NAN master is at least one other NAN terminal in the same NAN cluster 610 through a series of processes. Can be changed to For example, the NAN master of the NAN cluster 610 of FIG. 6 may be changed to at least one other NAN terminal 620_2 or 620_4.
  • 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.
  • the NAN terminal 700 may operate based on the physical layer 710 of 802.11.
  • the NAN terminal 700 includes NAN medium access control (MAC) 720, a NAN engine 730, a plurality of applications (App_1, App_2, ..., App_n) and a plurality of applications (App_1, App_2, ..., App_n) may include a plurality of NAN APIs 741, 742,..., 74n respectively.
  • MAC medium access control
  • the NAN engine 730 is based on a NAN based on primitives received from a plurality of applications (App_1, App_2, ..., App_n) of the NAN terminal.
  • the operation of the MAC 720 may be controlled.
  • the NAN MACs 820_1, 820_2, and 920 may process NAN beacon frames and NAN service discovery frames.
  • the NAN engines 830_1, 830_2, and 930 may process service requests (Queries) and responses.
  • the NAN engines 830_1, 830_2, and 930 may provide functions of subscribe 931, follow-up 932, and publish 933.
  • the NAN engines 830_1, 830_2, and 930 may provide various functions for scheduling data links according to an embodiment of the present specification.
  • the publish / subscribe 931, 933 functions operate based on the service interface provided from the service / application 940.
  • an instance of the publish / subscribe 931, 933 function is generated.
  • the follow-up 932 function sends and receives service specific information for the service / application 940.
  • a NAN Data Cluster (hereinafter referred to as 'NDC') 1000 may include at least two NAN terminals 1001, which share a common NDC schedule in the same NAN cluster 1100. 1002, 1003, 1004).
  • Each NAN terminal in the NDC 1000 has at least one NAN data link (hereinafter, 'NDL') with another terminal belonging to the same NDC.
  • the NDL may mean a resource block (hereinafter, referred to as 'RB') negotiated between NAN terminals.
  • the NAN terminal may establish an NDL with another NAN terminal to share an RB for data transmission and reception.
  • Each NDL may have its own NDL schedule. The scheduling technique for the NDL schedule is described based on the drawings to be described below.
  • 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.
  • the first NAN terminal 1001 has an NDL with the second to fourth NAN terminals 1002, 1003, and 1004.
  • the second NAN terminal 1002 has an NDL with the first NAN terminal 1001 and the third NAN terminal 1003.
  • the third NAN terminal 1003 has an NDL with the first NAN terminal 1001 and the second NAN terminal 1002.
  • the fourth NAN terminal 1004 has an NDL with the first NAN terminal 1001.
  • the remaining NAN terminals 1005 to 1018 of the NAN cluster 1100 except for the NAN terminals 1001, 1002, 1003, and 1004 included in the NDC 1000 may transmit and receive control information associated with the NAN parameter. Substantial data such as payload cannot be transmitted or received.
  • FIG. 11 shows an operation of a NAN terminal in a search window and a search window interval.
  • the discovery window DW may be referred to as a time and channel where NAN terminals converge in a NAN cluster.
  • the horizontal axis of FIG. 11 represents a time axis t, and a unit of the time axis is a time unit (TU).
  • TU time unit
  • sync beacon frame (SBF), the discovery beacon frame (DBF) and the service discovery frame (SDF) transmitted by the NAN terminal of FIG. 11 may be transmitted through the same channel or through different channels. .
  • 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.
  • 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.
  • DBF discovery beacon frame
  • 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.
  • SDF service discovery frame
  • the service discovery frame may include any one of two NAN service discovery protocol messages.
  • the NAN Service Discovery Protocol message may be a subscribe message to actively confirm the availability of a particular service.
  • 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.
  • 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.
  • a service discovery frame (SDF) containing a subscribe message is referred to as a subscription frame
  • a service discovery frame (SDF) containing a publish message is referred to as a publish frame.
  • 12 and 13 illustrate an NDL scheduling scheme of a NAN terminal.
  • the first NAN terminal hereinafter referred to as 'NAN_1'
  • the second NAN terminal hereinafter referred to as 'NAN_2'
  • 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.
  • FIG. 12 illustrates a synchronization NDL (S-NDL) scheme among NDL scheduling techniques of a NAN terminal.
  • the first intervals T0 to T1 of FIG. May correspond to the first search window DW_1 or the second search window DW_2 of FIG. 11, and the second sections T1 to T3 of FIG. 12 may correspond to the search window interval DW interval of FIG. 11. .
  • 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 technique of NAN_2.
  • NAN_1 transmits a publish frame to NAN_2.
  • the publish frame may include information about supportable services of NAN_1 and supportable scheduling of NAN_1.
  • NAN_1 and NAN_2 may recognize a mutually supportable service and a supporting scheduling technique.
  • Steps S1210 and S1220 are referred to herein as capability exchange steps.
  • NAN_2 may transmit a data request frame for requesting data to be transmitted to NAN_2 to NAN_1.
  • NAN_1 may transmit a data response frame to NAN_2 in response to a data request frame.
  • the data request frame is shown to be transmitted within the first periods T0 to T1, but the present invention is not limited thereto.
  • NAN_1 and NAN_2 can negotiate a common resource block (CRB) that can transmit and receive data with each other.
  • CRB common resource block
  • NAN_1 may transmit data for NAN_2 to NAN_2.
  • the NAN_1 and the NAN_2 may enter the common sections T2_1 to T2_2 at the same timing T2_1 to transmit or receive data.
  • FIG. 12 only one common section T2_1 to T2_2 is illustrated, but it is not limited thereto, and it will be understood that a plurality of common sections CRB may exist in the second section T1 to T3.
  • FIG. 13 illustrates a paging NDL (P-NDL) technique among NDL scheduling techniques of a NAN terminal.
  • the first section T0 to T1 correspond to the first search window DW_1 or the second search window DW_2, and the second section T1 to T3 correspond to the search window interval ( DW interval).
  • 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.
  • 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.
  • Steps S1310 and S1320 are referred to herein as capability exchange steps.
  • NAN_2 may transmit a data request frame to NAN_1.
  • NAN_1 may transmit a data response frame to NAN_2 in response to a data request frame.
  • the data request frame is shown to be transmitted within the first periods T0 to T1, but is not limited thereto.
  • NAN_1 and NAN_2 can negotiate a common resource block (CRB) that can transmit and receive data with each other.
  • CRB common resource block
  • the common periods T2_1 to T2_3 of the paging scheme of FIG. 13 include a paging window T2_1 to T2_2 for paging transmission, a paging window PW, and a transmission window T2_2 to T2_3 for transmission of data, TxW.
  • NAN_1 and NAN_2 enter common sections T2_1 to T2_3 at the same timing T2_1.
  • the NAN_2 may transmit a paging frame to the NAN_1.
  • the NAN_1 receiving the paging frame may transmit data for the NAN_2 to the NAN_2 during the transmission windows T2_2 to T2_3 and TxW.
  • NAN_1 and NAN_2 of FIGS. 12 and 13 may enter a further available window (FAW) at the same timing T0.
  • FAW further available window
  • the additional use window FAW may be maintained for the additional periods T0 to T3.
  • FIGS. 14 and 15 illustrate a conceptual diagram of a scheduling technique of a NAN terminal according to an embodiment of the present disclosure.
  • NAN_1 and NAN_2 in FIGS. 14 and 15 belong to the same NAN cluster.
  • 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.
  • NAN_1 and NAN_2 correspond to the first search window DW_1 or the second search window DW_2 of FIG. 11, and the second sections T1 to T3 of FIGS. 14 and 15. ) May correspond to the search window interval (DW interval) of FIG. 11.
  • DW interval search window interval
  • FIG. 14 shows a case in which NAN_2 selects an S-NDL scheme among supported scheduling schemes of NAN_1. 12 and 14, in step S1410, NAN_2 may transmit a subscribe frame to NAN_1.
  • the subscription frame of FIG. 14 may include a scheduling identifier of NAN_2.
  • the scheduling identifier of NAN_2 may indicate whether the NAN_2 supportable scheduling scheme is S-NDL, P-NDL, or both S-NDL and P-NDL schemes.
  • NAN_2 of FIG. 14 supports both the S-NDL and P-NDL schemes
  • a scheduling identifier indicating that both the S-NDL and P-NDL schemes can be supported may be included in the subscription frame. Accordingly, the NAN_1 receiving the subscription frame can recognize a supportable scheduling scheme of the NAN_2.
  • NAN_1 may transmit a publish frame to NAN_2.
  • the publish frame of FIG. 14 may include a scheduling identifier of NAN_1.
  • the scheduling identifier of NAN_1 may indicate whether the supportable scheduling scheme of NAN_1 is S-NDL, P-NDL, or both S-NDL and P-NDL schemes.
  • NAN_1 may include traffic information of a traffic that NAN_1 intends to transmit to NAN_2 in a publish frame.
  • Traffic information that NAN_1 intends to transmit to NAN_2 may mean a TSPEC element (traffic specification element) disclosed in IEEE 802.11 6.2.26.3.2.
  • step S1410 and step S1420 may be referred to as a capability exchange step.
  • NAN_1 of FIG. 14 is assumed to support both the S-NDL and P-NDL schemes, a scheduling identifier indicating that both the S-NDL and P-NDL schemes can be supported is included in the publish frame. Accordingly, the NAN_2 receiving the publish frame can recognize a supporting scheduling scheme of the NAN_1.
  • the NAN_2 may select a suitable scheduling scheme based on the published frame received from the received NAN_1.
  • a suitable scheduling technique is described in detail based on the drawings to be described below.
  • NAN_2 may transmit a data request frame from NAN_1 to NAN_1 for NAN_2.
  • a data request frame is a frame for requesting data that is currently pending.
  • the data request frame may include information associated with the TSPEC signaled from NAN_1 in step S1420.
  • the data request frame may include information about the scheduling scheme selected in step S1430.
  • primitives for generating a data request frame are shown in Table 2 below.
  • 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_parameters ⁇ Publisher'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 ⁇ Data Scheduling Method Option; S-NDL, P-NDL or Both - upper_layer_info ⁇ Sequence of values which are to be transmitted in the frame body ; Such as session ID
  • NAN_1 may transmit a data response frame for NAN_2 to NAN_2 in response to a data request frame.
  • a data response frame for NAN_2 may be transmitted to NAN_2 in response to a data request frame.
  • primitives for generating a data response frame according to the present embodiment are shown in Table 3 below.
  • 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: - handle ⁇ A publish_id which has been originally returned by an instance of the Publish function associated with the data communication - configuration_parameters ⁇ Subscriber's NAN Interface Address; Subscriber's MAC interface address for general NAN operations ⁇ Requestor 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 data ⁇ NAN 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
  • NAN_1 and NAN_2 can negotiate a common resource block (CRB) that can transmit and receive data with each other.
  • CRB common resource block
  • the NAN_1 may transmit data for the NAN_2 to the NAN_2 during the common periods T2_1 to T2_2.
  • NAN_1 and NAN_2 may transmit or receive data during common periods T2_1 to T2_2.
  • FIG. 14 only one common section T2_1 to T2_2 is illustrated, but it is not limited thereto, and it will be understood that a plurality of common sections CRB may exist in the second section T1 to T3.
  • the subscription frame and the publish frame may be follw-up.
  • the subscribe frame and the publish frame may be a GAS frame method. Further service discovery and GAS frames are described in Appendix I of the Wi-Fi Neighbor Awareness Networking (NAN) Technical Specification Version 5.001.0 r19.
  • NAN Wi-Fi Neighbor Awareness Networking
  • FIG. 15 shows a case in which NAN_2 selects a P-NDL scheme among supported scheduling schemes of NAN_1. 13 and 15, in step S1510, NAN_2 may transmit a subscribe frame to NAN_1.
  • the subscribe frame of FIG. 15 may include a scheduling identifier of NAN_2.
  • the scheduling identifier of NAN_2 may indicate whether the NAN_2 supportable scheduling scheme is S-NDL, P-NDL, or both S-NDL and P-NDL schemes.
  • NAN_2 of FIG. 15 supports both the S-NDL and P-NDL schemes
  • a scheduling identifier indicating that both the S-NDL and P-NDL schemes can be supported is included in the subscription frame.
  • the NAN_1 receiving the subscription frame may recognize a supportable scheduling scheme of NAN_2.
  • NAN_1 may transmit a publish frame to NAN_2.
  • the publish frame of FIG. 15 may include a scheduling identifier of NAN_1.
  • NAN_1 may include traffic information of a traffic to be transmitted to NAN_2 in a publish frame and transmit the same to NAN_2.
  • the traffic information may include a TSPEC element.
  • the scheduling identifier of NAN_1 may indicate whether the supportable scheduling scheme of NAN_1 is S-NDL, P-NDL, or both S-NDL and P-NDL schemes.
  • NAN_1 of FIG. 15 is assumed to support both the S-NDL and P-NDL schemes, a scheduling identifier indicating that both the S-NDL and P-NDL schemes can be supported may be included in the subscription frame.
  • NAN_2 may select a suitable scheduling scheme based on the publish frame received from NAN_1.
  • the contents associated with the selection of the scheduling scheme are described in detail based on the drawings to be described below.
  • NAN_2 may transmit a data request frame to NAN_1.
  • the data request frame may be a frame requesting data to be delivered to NAN_1.
  • the data request frame may include information associated with the TSPEC signaled from NAN_1 in step S1520.
  • the data request frame may include information about the scheduling scheme selected in step S1530.
  • the NAN_1 may transmit a data response frame to the NAN_2 in response to the data request frame.
  • the data request frame is shown to be transmitted within the first periods T0 to T1, but is not limited thereto.
  • NAN_1 and NAN_2 can negotiate a common resource block (CRB) that can transmit and receive data with each other.
  • CRB common resource block
  • the common periods T2_1 to T2_3 of the paging scheme of FIG. 15 may include a paging window T2_1 to T2_2 for paging transmission and a data transmission period T2_2 to T2_3 for data transmission.
  • NAN_1 and NAN_2 enter common sections T2_1 to T2_3 at the same timing T2_1.
  • the NAN_2 may transmit a paging frame to the NAN_1.
  • the NAN_1 receiving the paging frame may transmit data for the NAN_2 to the NAN_2 during the transmission windows T2_2 to T2_3 and TxW.
  • NAN terminals in a NAN cluster may recognize a scheduling scheme that can be supported by each other through a capability exchange process between NAN terminals.
  • the NAN terminals may select one of the recognized scheduling schemes to form an appropriate NDL between the NAN terminals. Accordingly, communication efficiency between NAN terminals can be increased.
  • a pair of NAN terminals may exchange frames including a scheduling identifier associated with an available scheduling scheme of each terminal.
  • a pair of NAN terminals can recognize a scheduling scheme that can be supported by each other through capability exchange between terminals.
  • a NAN terminal eg, NAN_1
  • NAN_1 that wants to transmit traffic to a counterpart NAN terminal among a pair of NAN terminals may transmit a frame including information related to traffic characteristics (eg, TSPEC element) to the counterpart NAN terminal.
  • TSPEC element traffic characteristics
  • the publish frame of FIGS. 14 and 15 may include traffic information (eg, TSPEC element) of traffic for NAN_2.
  • the pair of NAN terminals may determine whether each NAN terminal supports both S-NDL and P-NDL. If a pair of NAN terminals support both S-NDL and P-NDL, the procedure proceeds to step S1630.
  • step S1630 the NAN terminal (for example, NAN_2) of the pair of NAN terminals to receive the traffic information (for example, TSPEC element) received in step S1610 from the NAN terminal (for example, NAN_1) to transmit traffic Based on the scheduling scheme can be selected.
  • the traffic information for example, TSPEC element
  • the TSPEC element may include parameters associated with QoS. For example, if the traffic characteristic is not sensitive to delay, P-NDL may be selected. Conversely, S-NDL may be selected if the traffic characteristics are sensitive to delay.
  • Step S1630 is described in more detail with reference to the drawings below.
  • the NAN terminal NAN_2 that wants to receive traffic may determine whether there is a matching scheme among supportable scheduling schemes of the NAN terminal NAN_1 having the traffic and its own scheduling scheme. If a common scheduling scheme does not exist among a pair of NAN terminals, the procedure ends. On the contrary, if a common scheduling scheme exists among a pair of NAN terminals, the procedure proceeds to step S1650.
  • a common scheduling scheme among the pair of NAN terminals may be selected as a scheduling scheme for data transmission between the pair of NAN terminals. For example, when the scheduling scheme of NAN_1 supports both S-NDL and P-NDL, and the scheduling scheme of NAN_2 supports only S-NDL, S-NDL may be selected as a scheduling scheme for traffic transmission.
  • step S1630 of FIG. 16 for selecting a scheduling scheme of a NAN terminal is disclosed.
  • a pair of NAN terminals may recognize a scheduling scheme that can be supported by each other from the capability exchange in step S1620.
  • NAN_2 may check the traffic information (TSPEC element) of the traffic for NAN_2 based on the publish frame transmitted from NAN_1. For example, NAN_2 may identify a field associated with an access policy among the traffic information. If the access policy is a contention-based EDCA, the procedure proceeds to step S1732.
  • TSPEC element traffic information
  • NAN_2 may identify a field associated with an access policy among the traffic information. If the access policy is a contention-based EDCA, the procedure proceeds to step S1732.
  • NAN_2 may select the P-NDL scheme as the schedule scheme.
  • the reason why the P-NDL scheme is selected is as follows. Because competition-based EDCA has a backoff procedure, a P-NDL technique, which is relatively less sensitive to delay, may be advantageous. The procedure then proceeds to step S1735.
  • NAN_2 may check whether the access policy is HCCA. If the access policy is not a contention based HCCA (meaning mixed mode), the procedure ends. If the access policy is non-competition based HCCA, the procedure proceeds to step S1734.
  • NAN_2 may select the S-NDL scheme as the scheduling scheme.
  • the reason why the S-NDL scheme is selected when communication between NAN terminals is performed is as follows. Since non-competition based HCCA does not have a back off procedure, an S-NDL technique that is relatively sensitive to delay may be advantageous. The procedure then proceeds to step S1735.
  • NAN_2 may generate an NDL type indicator (NTI) according to the scheduling technique selected in step S1732 or S1734.
  • NTI NDL type indicator
  • NAN_2 may generate a request message including an NDL type indicator (NTI).
  • NDL type indicator NTI indicates the S-NDL
  • the request message may be a data request frame of step S1540 of FIG. 15.
  • the request message may be a paging frame transmitted in step S1640 of FIG. 16.
  • NAN_2 may send a request message including traffic information (eg, TSPEC element) to request traffic for NAN_2 from NAN_1.
  • traffic information eg, TSPEC element
  • NAN_2 may allocate an additional area for the NDL type indicator (NTI) to the TSPEC element received from NAN_1.
  • NAN_2 may transmit an NDL type indicator (NTI) using a reserved area of the TSPEC element.
  • FIG. 18 is a diagram illustrating a field of a TSPEC element according to an embodiment of the present specification. 14 to 18, a new field 1800 of 1 bit for the NDL type indicator NTI among the fields of the TSPEC element may be added.
  • FIG. 19 illustrates a subfield of a TSPEC element according to another embodiment of the present specification.
  • FIG. 19 shows a subfield of TS info 1810 among the fields of the TSPEC element. 14 to 19, information on an NDL type indicator (NTI) may be signaled using 1 bit of the reserved subfield 1900.
  • NDL type indicator NTI
  • the value of the new field 1900 may be '0'.
  • the value of the new field 1900 may be '1'.
  • the value of the new field 1900 may be '0'.
  • NAN data communication is performed using the P-NDL
  • the value of the new field 1900 may be '1'.
  • 20 is a block diagram illustrating a wireless device in which an embodiment of the present specification can be implemented.
  • the wireless device 2000 includes a processor 2010, a memory 2020, and a transceiver 2030.
  • the wireless device may be a NAN terminal in the above embodiment.
  • the transceiver 2030 is connected to the processor 2010 to transmit and / or receive a radio signal.
  • the processor 2010 implements the functions, processes, and / or methods proposed herein. According to the above-described embodiment, the operation of the NAN terminal may be implemented by the processor 2010.
  • the memory 2020 may be connected to the processor 2010 to store an instruction for implementing an operation of the processor 2010.
  • the processor may include application-specific integrated circuits (ASICs), other chipsets, logic circuits, and / or data processing devices.
  • the memory 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 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne, selon un mode de réalisation, un procédé de planification d'une liaison de données pour réseau de reconnaissance de voisinage (NAN) qui comprend les étapes suivantes : une première trame de découverte est transmise dans un intervalle de découverte à un second dispositif, la première trame de découverte comprenant les premières informations de planification indiquant une technique de programmation pouvant être prise en charge par un premier dispositif ; une seconde trame de découverte est reçue dans l'intervalle de découverte en provenance du second dispositif, la seconde trame de découverte comprenant les secondes informations de planification et des informations de trafic, les secondes informations de planification indiquant une technique de planification pouvant être prise en charge par le second dispositif, et les informations de trafic portant sur le trafic à transmettre du second dispositif au premier dispositif ; si les secondes informations de planification indiquent à la fois une technique de synchronisation et une technique de radiomessagerie, le premier dispositif sélectionne la technique de synchronisation ou la technique de radiomessagerie en fonction des informations de trafic.
PCT/KR2016/009840 2015-09-03 2016-09-02 Procédé de planification de liaison de données de réseau de reconnaissance de voisinage et dispositif associé WO2017039379A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201562213628P 2015-09-03 2015-09-03
US62/213,628 2015-09-03
US201562222177P 2015-09-22 2015-09-22
US62/222,177 2015-09-22

Publications (1)

Publication Number Publication Date
WO2017039379A1 true WO2017039379A1 (fr) 2017-03-09

Family

ID=58188013

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2016/009840 WO2017039379A1 (fr) 2015-09-03 2016-09-02 Procédé de planification de liaison de données de réseau de reconnaissance de voisinage et dispositif associé

Country Status (1)

Country Link
WO (1) WO2017039379A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140328168A1 (en) * 2013-05-06 2014-11-06 Minyoung Park Apparatus, system and method of adjusting transmission intervals for discovery frames
US20150139217A1 (en) * 2013-04-09 2015-05-21 Emily H. Qi Systems, apparatus and methods using sync beacons in neighbor awareness networking (nan)
WO2015115829A1 (fr) * 2014-01-29 2015-08-06 엘지전자 주식회사 Procédé et dispositif au moyen desquels un terminal nan transmet une trame de recherche de service nan dans un système de communication sans fil
US20150223047A1 (en) * 2014-02-03 2015-08-06 Qualcomm Incorporated Discovery of a neighbor awareness network (nan) using a wake up message

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150139217A1 (en) * 2013-04-09 2015-05-21 Emily H. Qi Systems, apparatus and methods using sync beacons in neighbor awareness networking (nan)
US20140328168A1 (en) * 2013-05-06 2014-11-06 Minyoung Park Apparatus, system and method of adjusting transmission intervals for discovery frames
WO2015115829A1 (fr) * 2014-01-29 2015-08-06 엘지전자 주식회사 Procédé et dispositif au moyen desquels un terminal nan transmet une trame de recherche de service nan dans un système de communication sans fil
US20150223047A1 (en) * 2014-02-03 2015-08-06 Qualcomm Incorporated Discovery of a neighbor awareness network (nan) using a wake up message

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
DANIEL CAMPS - MUR ET AL.: "Enabling Always on Service Discovery: Wifi Neighbor Awareness Networking", IEEE WIRELESS COMMUNICATIONS, vol. 22, no. issue: 2, 29 April 2015 (2015-04-29), XP011579866 *

Similar Documents

Publication Publication Date Title
WO2021006545A1 (fr) Procédé et appareil de transmission multiplex dans un lan sans fil à liaisons multiples
WO2017099542A1 (fr) Procédé de communication sans fil et terminal de communication sans fil utilisant un ensemble d'identificateurs de service de base multiples
WO2016108633A1 (fr) Procédé et dispositif permettant d'effectuer une transmission de liaison montante après la réception d'une trame de déclenchement dans un système de lan sans fil
WO2018048202A1 (fr) Procédé et dispositif de recherche de point d'accès dans un réseau local (lan) sans fil
WO2014137172A1 (fr) Procédé et appareil pour recevoir un signal par une station dans un système lan sans fil
WO2011149285A2 (fr) Procédé et appareil d'émission-réception de données dans système de réseau local (lan) sans fil
WO2013191439A1 (fr) Procédé et dispositif pour contrôler un accès multiple dans un système lan sans fil
WO2015182969A1 (fr) Procédé de communication sans fil et dispositif de communication sans fil destinés à une configuration de liaison à large bande
WO2013137603A1 (fr) Procédé et appareil pour compresser un en-tête mac dans un système lan sans fil
WO2013147563A1 (fr) Procédé et appareil pour l'émission-réception de balise dans un système de réseau local sans fil
WO2013151311A1 (fr) Procédé et appareil d'accès à un canal dans un système wlan
WO2013122415A1 (fr) Procédé d'accès à des canaux dans des systèmes de communication sans fil et appareil pour la mise en œuvre de ce procédé
WO2013119097A1 (fr) Procédé et appareil pour accéder à un canal dans un système wlan
WO2013119095A1 (fr) Procédé et appareil pour accéder à un canal dans un système wlan
WO2013141669A1 (fr) Procédé et appareil d'accès à un canal dans un système lan sans fil
WO2021215753A1 (fr) Procédé de transmission p2p
WO2016163849A1 (fr) Procédé et dispositif de transmission/réception de trame concernant une transmission multi-utilisateur dans un système de réseau local sans fil
WO2016036140A1 (fr) Procédé et dispositif d'ordonnancement de ressource sans fil pour nan
WO2016140466A1 (fr) Procédé de mise en oeuvre de radiomessagerie dans un système lan sans fil et dispositif utilisant ce procédé
WO2017146461A1 (fr) Procédé pour réseau sensible au voisinage selon un schéma de radiomessagerie et terminal sans fil utilisant celui-ci
WO2017074020A1 (fr) Procédé de réalisation d'accès aléatoire dans un système de réseau local (lan) sans fil et appareil associé
WO2014092450A1 (fr) Procédé et dispositif d'accès à un canal à base de fenêtre d'accès restreint dans un système wlan
WO2017057988A1 (fr) Procédé de fusionnement d'un terminal de nan dans une grappe de nan dans un système de communication sans fil, et dispositif
WO2017014503A1 (fr) Procédé et appareil d'échange de données dans un système de communication sans fil
WO2017043820A1 (fr) Procédé de sondage pour une transmission de formation de faisceau dans un système de réseau local (lan) sans fil, et appareil associé

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16842345

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16842345

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载