EP3044999B1 - Synchronisation des limites de fenêtres de temps de vol - Google Patents

Synchronisation des limites de fenêtres de temps de vol Download PDF

Info

Publication number
EP3044999B1
EP3044999B1 EP13893492.2A EP13893492A EP3044999B1 EP 3044999 B1 EP3044999 B1 EP 3044999B1 EP 13893492 A EP13893492 A EP 13893492A EP 3044999 B1 EP3044999 B1 EP 3044999B1
Authority
EP
European Patent Office
Prior art keywords
sta
time
time window
hard constraint
tof
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
EP13893492.2A
Other languages
German (de)
English (en)
Other versions
EP3044999A4 (fr
EP3044999A1 (fr
Inventor
Jonathan Segev
Adrian P. Stephens
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Intel Corp
Original Assignee
Intel Corp
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 Intel Corp filed Critical Intel Corp
Publication of EP3044999A1 publication Critical patent/EP3044999A1/fr
Publication of EP3044999A4 publication Critical patent/EP3044999A4/fr
Application granted granted Critical
Publication of EP3044999B1 publication Critical patent/EP3044999B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements
    • H04W56/004—Synchronisation arrangements compensating for timing error of reception due to propagation delay
    • H04W56/0045—Synchronisation arrangements compensating for timing error of reception due to propagation delay compensating for timing error by altering transmission time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements
    • H04W56/0055—Synchronisation arrangements determining timing error of reception due to propagation delay
    • H04W56/0065—Synchronisation arrangements determining timing error of reception due to propagation delay using measurement of signal travel time

Definitions

  • Examples generally relate to determining a Time-of- Flight (ToF) or a Round Trip Time (RTT) of one or more signals travelling between two STAtions (STAs), and more specifically to broadcasting a schedule or transmitting hard constraints to help with scheduling a TOF or RTT measurement.
  • TOF Time-of- Flight
  • RTT Round Trip Time
  • a station can, in general, only communicate using one channel at a time.
  • An STA communicating on a channel cannot communicate with another STA that is communicating using another channel. When such a scenario occurs it is called a conflict.
  • Conflicts can result in additional signaling between STAs, thus consuming more energy, and can also result in more channel bandwidth being used.
  • a timing measurement protocol is executed a including a plurality of Timing Measurement Action (TMA) frames between a first wireless station (STA1) and a second STA (STA2) within a wireless network.
  • TMA Timing Measurement Action
  • the plurality of TMA frames span a communications interval and include timing information.
  • a power-save protocol is employed by at least one of STA1 and STA2 during execution of the timing measurement protocol during one or more sub-intervals between the plurality of TMA frames.
  • STA1 or STA2 computes at least one timing parameter using the timing information.
  • Examples in this disclosure relate to apparatuses, systems, and techniques for determining a Time Of Flight (TOF) or a Round Trip Time (RTT) measurement between two STAtions (STAs), and more specifically to broadcasting a schedule or transmitting hard constraints to help with scheduling a TOF or RTT measurement.
  • TOF Time Of Flight
  • RTT Round Trip Time
  • FIG. 1 shows an STA 102A communicating with an STA 102B.
  • STA 102A is a User Equipment (UE) device and STA 102B is an Access Point (AP), such as a WiFi AP or other AP.
  • UE User Equipment
  • AP Access Point
  • STA 102A-B can be any of a UE (e.g., laptop, desktop computer, Personal Digital Assistant (PDA), phone, or the like) or AP, or other device that has the capability to use the protocol detailed herein.
  • the STA 102A-B can be mobile or stationary.
  • the STA 102A-B can measure a TOF or RTT of one or more signals 104A or 104B travelling from one STA 102A-B to the other STA 102A-B.
  • a TOF measurement consists of measuring a time it takes for a signal 104A or 104B to travel from one STA 102A-B to the other STA 102B-A.
  • An RTT measurement consists of measuring the time it takes for a signal 104A or 104B to be sent from the STA 102A-B and for the STA102A-B to receive a signal 104B or 104A in response to the signal sent. As depicted in FIG.
  • the time it takes signal 104A or 104B individually to be transmitted from the STA 102A or 102B, respectively, and received at the other STA 102B or 102A, respectively, represents a TOF time.
  • the time it takes signals 104A and 104B in combination to be transmitted from the STA 102A and 102B, respectively, and received at the other STA 102B and 102A, respectively, is an RTT time. RTT and TOF are described in more detail with regard to FIGS. 2 and 4 .
  • FIG. 2 is a flow diagram depicting a technique 200 for determining a TOF or RTT according to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 Revision mc D1.0 standard.
  • the vertical lines indicate the passage of time with time passing from 202 to 214.
  • a Fine Timing Measurement (FTM) request can be sent from the STA 102A to the STA 102B.
  • the STA 102B can acknowledge receipt of the request.
  • the STA 102B can send an action frame "M" to the STA 102A.
  • the STA 102B can record the Time Of Departure (TOD) of the action frame "M" (t1).
  • the STA 102A can record the Time Of Arrival (TOA) of the action frame "M" (t2).
  • the STA 102A can acknowledge that it received the action frame "M".
  • the STA 102A can record a TOD of the acknowledgment of receiving the action frame "M” (t3).
  • the STA 102B can record a TOA of the acknowledgment (t4).
  • STA 102B can send another action frame "M(t1,t4)" to the STA 102A.
  • This action frame "M(t1,t4)” can include recorded times t1 and t4 or a number equal to the difference between the recorded time t4 and t1.
  • the STA 102B can record a TOD of this action frame "M(t1,t4)" (t1').
  • the STA 102A can determine an RTT or TOF of one or more communications between the STA 102A and the STA 102B.
  • the RTT can be determined as a function of t1, t2, t3, and t4.
  • the TOF can be determined as a function of t1 and t2, or t3 and t4.
  • the TOF can be determined by determining a difference between t2 and t1 (e.g., to determine a TOF of a signal from the STA 102B to the STA 102A) or a difference between t4 and t3 (e.g., to determine a TOF of a signal from the STA 102A to the STA 102B).
  • the measurement can repeat, so as to make another RTT or TOF measurement, such as shown at 210, 212, and 214.
  • the STA 102A can initiate an FTM session concurrently with a number of APs (the STA 102B can represent a single AP) to perform ranging (e.g., a TOF or RTT measurement). Using the ranging information, the STA 102B can determine its position, such as by using trilateration or triangulation.
  • the STA 102B can indicate a soft constraint (e.g., a preferred schedule or timing of an FTM session) in the FTM request, at 202.
  • the STA 102B can "rework" that schedule by sending the action frame M, at 206, at any time, regardless of the soft constraint.
  • the STA 102A can perform concurrent FTM sessions. However, not all FTM sessions may occur on the same channel.
  • the STA 102B may not be able or may not be willing to comply with the soft constraint of the STA 102A (e.g., lack of resources, scheduling limitations, implementation consideration, or the like). Since no further information exists, the STA 102B can allocate a time window which overlaps other concurrent FTM sessions (see FIG. 3 ).
  • FIG. 3 illustrates how a persistent conflict can occur using the technique 200.
  • STA 102A is available when the STA 102B responds.
  • a conflict can occur when multiple STAs 102D, 102E, and 102F attempt to communicate with the STA 102C, such as shown in FIG. 3 .
  • the arrow indicates passing time, and time windows 302A, 302B, and 302C, 304A, 304B, and 304C, and 306A, 306B, and 306C indicate time windows in which STAs 102D, 102E, and 102F, respectively, attempt to communicate with the STA 102C.
  • the STAs 102D and 102E are attempting to communicate with the STA 102C on a channel 308A and the STA 102F is attempting to communicate with the STA 102C on a different channel 308B.
  • a persistent conflict occurs between STA 102E and STA 102F.
  • the STA 102E is attempting to communicate with the STA 102C using the channel 308A while, at the same time, the STA 102F is attempting to communicate with the STA 102C using the channel 308B. Since the STA 102C can only communicate using one channel 308A-B at a time, a conflict as to which channel 308A-B to communicate on is created. This is indicated by the overlapping time windows 304A and 306A, 304B and 306B, and 304C and 306C.
  • the problem can be persistent (e.g., recurring) if the STAs 102E and 102F attempt to communicate with the STA 102C at periodic or fixed intervals, such as with a predetermined or fixed amount of time between communication attempts. These conflicts can cause the STA 102E-F to attempt to communicate with the STA 102C again, thus consuming more time, bandwidth, or power as compared to a situation where there are fewer or no conflicts.
  • FIG. 4 is a flow diagram depicting an example of a technique 400 for determining a TOF or RTT of one or more signals communicated between STA 102A and 102B.
  • the STA 102B can optionally broadcast scheduling resource availability to one or more STAs, such as the STA 102A or 102C-F.
  • the broadcasted availability can indicate a short or long time window in which the STA 102B is available or unavailable (e.g., can include a hard constraint (i.e. an indication that the STA 102B is unavailable for a period of time) or a soft constraint (i.e.
  • a short time window is a time window long enough to service one STA (e.g., a time window long enough to perform a single TOF or RTT measurement), while a long time window is a time window long enough to service at least two STAs.
  • the STA 102A or 102C can make a request, such as at 402, for resource allocation consistent with the broadcasted constraint(s) (e.g., in a time period indicated as available or in a time period not indicated as unavailable by the STA 102B).
  • the STA 102A can make a request only if the resource scheduling is compliant to their needs (e.g., the STA 102A is available or the schedule is consistent with the hard constraint(s) of the STA 102A).
  • the STA 102B can be less likely to make a request, such as at 402, which cannot be complied with. Reducing the number of requests that cannot be serviced by the STA 102B can reduce the medium usage or signal delay or signal jitter of a signal in the medium.
  • the STA 102A cab make a request, such as at 402, which takes into account both the STA 102A soft constraints (e.g., power consumption) as well as the STA 102A hard constraints (e.g., multi-channel operation). Hard constraints are discussed in more detail herein, including in the discussion of item 402 of FIG. 4 .
  • the STA 102B can communicate the timing limitation (e.g., hard or soft constrains) of its resources for FTM through a broadcast, such as in a unique management frame, such as at 401.
  • the communication of the timing limitations can be an information element in a beacon frame, a subset of the beacon frame (e.g., a Delivery Traffic Indication Message (DTIM) beacon), or a short beacon (e.g., a beacon similar to a Fast Initial Link Setup (FILS) discovery beacon), among others.
  • the communication of the timing limitations can be similar in form to the form of information obtained via an Access Network Query Protocol (ANQP) based procedure, where the scheduling of one or more STAs 102B-F (e.g., APs) can be obtained.
  • ANQP Access Network Query Protocol
  • a Fine Timing Measurement (FTM) request can be sent from the STA 102A to the STA 102B.
  • the request can include one or more constraints, such as hard or soft constraints, such as one or more constraints configured to aid in scheduling an FTM measurement.
  • the request can be transmitted at a time consistent with the availability indicated in the broadcast (e.g., at 401).
  • the request can include a request for a time indicated as available in a broadcast, such as at 401.
  • the hard or soft constraints can be transmitted in the form of a schedule.
  • the hard or soft constraints can be represented in a frame, such as at 401 or 402, among others, by one or more fields, elements, or subelements.
  • the fields, elements, or subelements can be in addition to those described in 802.11 REVmc D1.0. These fields, elements, or subelements can convey a periodic window during which future ToF or RTT measurement exchanges can take place.
  • the window can be represented by an interval, duration, or offset to some known event or time.
  • the known event or time can be common knowledge to both STA 102A and STA 102B, such as the time of transmission of a frame, such as at 401 or 402, among others.
  • One of ordinary skill in the art will recognize that there are various other ways of transmitting the hard or soft constraints from one STA 102A or 102B to another STA 102B or 102A.
  • the hard or soft constraints can be transmitted to the STA 102B in a variety of formats.
  • formats for transmitting the hard or soft constraints can include: (1) a bit map where each bit provides information of availability with a known granularity (e.g., a fixed time period, such a number of microseconds, milliseconds, seconds, minutes, etc.) per bit, where a set bit indicates availability and a clear bit indicates unavailability or vice versa; or (2) a parametric format where the start and end of one or more unavailability periods are described.
  • the transmission of the hard or soft constraints can be compressed by the STA 102A-B before being sent to the STA 102B-A.
  • the STA 102A-B can decompress the transmission and determine the unavailability or availability of the STA 102B-A based on the decompressed packet.
  • the compression can include lossless compression techniques, such as can include Huffman coding or arithmetic coding. Some examples of lossless compression techniques include Lempel-Ziv-Welch, Context Tree Weighting (CTW), Burrows-Wheeler transform, Lempel Ziv 77, or Prediction by Partial Matching (PPM).
  • the time reference for the unavailability period can be explicit or implicit.
  • An example of an explicit time reference can include specifying the time reference (e.g., with or without a specific granularity in the request), such as at 402.
  • Another example of an explicit time reference can include basing the time reference granularity on the Time Synchronization Function (TSF) of the STA 102A-B.
  • TSF Time Synchronization Function
  • An example of an implied time reference can include the STA 102A-B referencing a transmission time or reception time of the request, such as at 402.
  • the granularity can be fixed (e.g., explicitly included in a request or implicit by being pre-agreed by either a standard or a specification) or variable, such as previously described.
  • the STA 102B can acknowledge receipt of the request.
  • the STA 102B respond to the request.
  • the response can include an allocation of time within the constraint(s) sent from the STA 102A.
  • the STA 102A can then schedule a specific time, such as the time allocated by the STA 102B, to listen to the channel that the STA 102B is communicating on.
  • the STA 102A can optionally acknowledge the response sent from the STA 102B.
  • the STA 102B can send an action frame "M" to the STA 102A.
  • the STA 102B can record the Time Of Departure (TOD) of the action frame “M” (t1).
  • the STA 102A can record the Time Of Arrival (TOA) of the action frame "M” (t2).
  • the STA 102A can acknowledge that it received the action frame "M”.
  • the STA 102A can record a TOD of the acknowledgment of receiving the action frame "M" (t3).
  • the STA 102B can record a TOA of the acknowledgment (t4).
  • STA 102B can send another action frame "M(t1,t4)" to the STA 102A.
  • This action frame "M(t1,t4)" can include recorded times t1 and t4 or a number equal to the difference between the recorded time t4 and t1.
  • the STA 102B can record a TOD of this action frame "M(t1,t4)" (t1').
  • the STA 102A can determine an RTT or TOF of one or more communications between the STA 102A and the STA 102B.
  • the RTT can be determined as a function of t1, t2, t3, and t4.
  • the RTT can be determined by determining a difference between t2 and t1 and a difference between t4 and t3 and adding the differences (i.e.
  • the TOF can be determined as a function of t1 and t2, or t3 and t4.
  • the TOF can be determined by determining a difference between t2 and t1 (e.g., to determine a TOF of a signal from the STA 102B to the STA 102A) or a difference between t4 and t3 (e.g., to determine a TOF of a signal from the STA 102A to the STA 102B).
  • the measurement can repeat, so as to make another RTT or TOF measurement, such as shown at 414, 416, and 418.
  • FIG. 5 shows an example of a technique 500 for scheduling or determining a TOF or RTT measurement.
  • a hard constraint can be transmitted, such as by using a transceiver of the STA 102A, the hard constraint indicating a time window in which the STA 102A is unavailable. Transmitting the hard constraint can include transmitting the hard constraint as a bit map, wherein each bit of the bit map corresponds to a specified amount of time and wherein a set bit indicates the STA is unavailable and a not set bit indicates the STA is available.
  • an action frame can be received, such as at the transceiver, from another STA 102A at a time that is outside the time window.
  • the technique 500 can include receiving, such as by using the transceiver, a broadcast of a hard or soft constraint of the STA 102B, the second hard constraint indicating a time window in which the STA 102B is unavailable to communicate, such as to help with performing a ToF or RTT measurement.
  • the technique 500 can include receiving, such as by using the transceiver, a time allocation from the STA 102B.
  • the time allocation can specify a time window in which the STA 102B will transmit the action frame.
  • the time window indicated by the action frame can be outside the time window(s) indicated by the hard constraint(s).
  • the technique 500 can include measuring an RTT or ToF time for a communication between the STA and the another STA at a time outside the first and second time windows.
  • FIG. 6 is a block diagram illustrating an example computer system 600 machine which can include a reusable core panel discussed herein.
  • Computer system 600 can be a computing device.
  • the machine can operate as a standalone device or can be connected (e.g., via a cellular network) to other machines.
  • the computer system can be included in the STA 102A-F.
  • the machine can operate in the capacity of either a server or a client machine in server-client network environments, or it can act as a peer machine in peer-to-peer (or distributed) network environments.
  • the term "machine" shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.
  • Example computer system 600 can include a processor 602 (e.g., a Central Processing Unit (CPU), a Graphics Processing Unit (GPU) or both), a main memory 604 and a static memory 606, which communicate with each other via an interconnect 608 (e.g., a link, a bus, etc.).
  • the computer system 600 can further include a video display unit 610, an alphanumeric input device 612 (e.g., a keyboard), and a User Interface (UI) navigation device 614 (e.g., a mouse).
  • the video display unit 610, input device 612 and UI navigation device 614 are a touch screen display.
  • the computer system 600 can additionally include a storage device 616 (e.g., a drive unit), a signal generation device 618 (e.g., a speaker), an output controller 632, a power management controller 634, and a transceivers 620 (which can include or operably communicate with one or more antennas 630, radios, or other wired or wireless communications hardware), and one or more sensors 628, such as a GPS sensor, compass, location sensor, accelerometer, or other sensor.
  • the transceiver 620 can be arranged to transmit or receive communications to or from a respective STA 102A-F.
  • the storage device 616 can include a non-transitory machine-readable medium 622 on which can be stored one or more sets of data structures and instructions 624 (e.g., software) embodying or utilized by any one or more of the methodologies or functions described herein.
  • the instructions 624 can also reside, completely or at least partially, within the main memory 604, static memory 606, or within the processor 602 during execution thereof by the computer system 600, with the main memory 604, static memory 606, and the processor 602 also constituting machine-readable media.
  • machine-readable medium 622 is illustrated in an example embodiment to be a single medium, the term “machine-readable medium” can include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more instructions 624.
  • the term “machine-readable medium” shall also be taken to include any tangible medium that can be capable of storing, encoding or carrying instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present disclosure or that can be capable of storing, encoding or carrying data structures utilized by or associated with such instructions.
  • the term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical media, and magnetic media.
  • machine-readable media include non-volatile memory, including, by way of example, semiconductor memory devices (e.g., Electrically Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM)) and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
  • semiconductor memory devices e.g., Electrically Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM)
  • flash memory devices e.g., Electrically Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM)
  • EPROM Electrically Programmable Read-Only Memory
  • EEPROM Electrically Erasable Programmable Read-Only Memory
  • flash memory devices e.g., electrically Erasable Programmable Read-Only Memory (EEPROM)
  • flash memory devices e.g., Electrically Eras
  • the instructions 624 can further be transmitted or received over a network (e.g., a distributed or hybrid distributed and centralized cellular network) using a transmission medium via the transceiver 620 utilizing any one of a number of well-known transfer protocols (e.g., OFDMA, SC-FDMA, TDMA, TDMA, CDMA, or other channel access method).
  • a network e.g., a distributed or hybrid distributed and centralized cellular network
  • the term "transmission medium” shall be taken to include any intangible medium that can be capable of storing, encoding, or carrying instructions for execution by the machine, and includes digital or analog communications signals or other intangible medium to facilitate communication of such software.
  • a "-" (dash) used when referring to a reference number means “or”, in the non-exclusive sense discussed in the previous paragraph, of all elements within the range indicated by the dash.
  • 103A-B means a nonexclusive “or” of the elements in the range ⁇ 103 A, 103B ⁇ , such that 103A-103B includes “103A but not 103B", “103B but not 103A”, and "103A and 103B".

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radar Systems Or Details Thereof (AREA)

Claims (16)

  1. Station sans fil (STA) (102A) conçue pour réaliser une mesure de temps de vol (ToF), la STA comprenant un émetteur-récepteur conçu pour :
    émettre une contrainte dure (402) indiquant une première fenêtre de temps dans laquelle la STA n'est pas disponible pour réaliser la mesure ToF, l'émetteur-récepteur étant conçu pour émettre la contrainte dure comme un topogramme binaire, chaque bit du topogramme binaire correspondant à une période de temps spécifiée, un bit défini indiquant que la STA n'est pas disponible pour réaliser la mesure ToF et un bit non défini indiquant que la STA est disponible pour réaliser la mesure ToF ;
    recevoir une affectation de temps dans la contrainte dure en provenance d'une autre STA, l'affectation de temps spécifiant une seconde fenêtre de temps extérieure à la première fenêtre de temps dans laquelle l'autre STA émettra une trame d'action ; et
    recevoir la trame d'action (410) de la mesure ToF en provenance de l'autre STA (102B) à un moment dans la seconde fenêtre de temps.
  2. STA selon la revendication 1, dans laquelle l'émetteur-récepteur est conçu pour recevoir la trame d'action dans l'affectation de temps, la STA étant conçue pour déterminer un temps aller-retour ou un temps de vol d'un ou de plusieurs signaux communiqués entre la STA et l'autre STA à un moment dans la seconde fenêtre de temps.
  3. STA selon l'une quelconque des revendications 1 et 2, la STA étant en outre conçue pour déterminer une pluralité de temps aller-retour ou de temps de vol, chaque temps aller-retour ou temps de vol étant pour une communication entre la STA et une STA différente respective.
  4. STA selon l'une quelconque des revendications 1 à 3, la STA étant en outre conçue pour déterminer une localisation de la STA en fonction de la pluralité de temps aller-retour ou de temps de vol.
  5. Station sans fil (STA) (102B) conçue pour communiquer avec une autre STA (102A) d'une pluralité de STA afin d'aider l'autre STA à réaliser une mesure de temps de vol (ToF), la STA comprenant un émetteur-récepteur conçu pour :
    recevoir une contrainte dure indiquant une première fenêtre de temps dans laquelle l'autre STA n'est pas disponible pour réaliser la mesure ToF, la contrainte dure comprenant un topogramme binaire, chaque bit du topogramme binaire correspondant à une période de temps spécifiée, un bit défini indiquant que la STA n'est pas disponible pour réaliser la mesure ToF et un bit non défini indiquant que la STA est disponible pour réaliser la mesure ToF ;
    émettre une affectation de temps vers l'autre STA, l'affectation de temps spécifiant une seconde fenêtre de temps extérieure à la première fenêtre de temps dans laquelle la STA émettra une trame d'action ; et
    émettre la trame d'action à un moment dans la seconde fenêtre de temps.
  6. STA selon la revendication 5, dans laquelle l'émetteur-récepteur est conçu pour diffuser à la pluralité d'autres STA une contrainte dure de la STA, la contrainte dure indiquant une fenêtre de temps dans laquelle la STA n'est pas disponible pour communiquer avec les autres STA, et dans laquelle l'émetteur-récepteur est conçu pour émettre la contrainte dure comme un topogramme binaire, chaque bit du topogramme binaire correspondant à une période de temps spécifiée, un bit défini indiquant que la STA n'est pas disponible pour communiquer avec la pluralité d'autres STA et un bit non défini indiquant que la STA est disponible pour communiquer avec une STA de la pluralité d'autres STA.
  7. STA selon l'une quelconque des revendications 5 et 6, dans laquelle l'émetteur-récepteur est conçu pour diffuser vers la pluralité d'autres STA une contrainte dure de la STA, la contrainte dure indiquant une fenêtre de temps dans laquelle la STA n'est pas disponible pour communiquer avec les autres STA, et dans laquelle l'émetteur-récepteur est conçu pour émettre la contrainte dure comme un ou plusieurs paramètres indiquant un temps de début et un temps de fin d'une période temps pendant laquelle la STA n'est pas disponible.
  8. STA selon l'une quelconque des revendications 5 et 6, dans laquelle l'émetteur-récepteur est conçu pour émettre la période de temps spécifiée dans la diffusion.
  9. Procédé de planification d'une mesure de temps de vol (ToF), consistant à :
    émettre, au moyen d'un émetteur-récepteur, une contrainte dure (402) indiquant une première fenêtre de temps dans laquelle une station (STA) (102A) n'est pas disponible pour réaliser la mesure ToF, l'émetteur-récepteur étant conçu pour émettre la contrainte dure comme un topogramme binaire, chaque bit du topogramme binaire correspondant à une période de temps spécifiée, un bit défini indiquant que la STA n'est pas disponible pour réaliser la mesure ToF et un bit non défini indiquant que la STA est disponible pour réaliser la mesure ToF ;
    recevoir, au moyen de l'émetteur-récepteur, une affectation de temps dans la contrainte dure en provenance d'une autre STA, l'affectation de temps spécifiant une seconde fenêtre de temps extérieure à la première fenêtre de temps dans laquelle l'autre STA émettra une trame d'action ; et
    recevoir, au moyen de l'émetteur-récepteur, la trame d'action (410) en provenance de l'autre STA (102B) à un moment dans la seconde fenêtre de temps.
  10. Station sans fil (STA) selon la revendication 1, dans laquelle le topogramme binaire est émis dans une trame de demande de mesure précise de temporisation (FTM), et dans laquelle l'émission de la trame de demande FTM amorce une session FTM avec une ou plusieurs autres stations.
  11. Station sans fil (STA) selon la revendication 10, dans laquelle l'affectation de temps reçue en provenance de l'autre station est en réponse à la trame de demande FTM.
  12. Station sans fil (STA) selon la revendication 1, dans laquelle la première fenêtre de temps est une fenêtre périodique par rapport à une fonction de synchronisation de temps (TSF) entre la STA et un point d'accès (AP).
  13. Station sans fil (STA) selon la revendication 1, dans laquelle la première fenêtre de temps représentée par le topogramme binaire a une granularité prédéterminée, de sorte que chaque bit représente une période de temps fixe.
  14. Support lisible par machine, stockant, codant ou transportant des instructions qui sont destinées à être exécutées par la machine et qui amènent la machine à :
    émettre une contrainte dure (402) indiquant une première fenêtre de temps dans laquelle une station sans fil (STA) n'est pas disponible pour réaliser une mesure de temps de vol (ToF), la contrainte dure étant émise comme un topogramme binaire, chaque bit du topogramme binaire correspondant à une période de temps spécifiée, un bit défini indiquant que la STA n'est pas disponible pour réaliser la mesure ToF et un bit non défini indiquant que la STA est disponible pour réaliser la mesure ToF ;
    recevoir une affectation de temps dans la contrainte dure en provenance d'une autre STA, l'affectation de temps spécifiant une seconde fenêtre de temps extérieure à la première fenêtre de temps dans laquelle l'autre STA émettra une trame d'action ; et
    recevoir la trame d'action (410) de la mesure ToF en provenance de l'autre STA (102B) à un moment dans la seconde fenêtre de temps.
  15. Support lisible par machine selon la revendication 14, dans lequel le topogramme binaire a une granularité prédéterminée, de sorte que chaque bit représente une période de temps fixe.
  16. Support lisible par machine selon la revendication 14 ou la revendication 15, dans lequel la seconde fenêtre de temps est déterminée par l'autre STA sur la base du topogramme binaire.
EP13893492.2A 2013-09-13 2013-12-17 Synchronisation des limites de fenêtres de temps de vol Active EP3044999B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US201361877630P 2013-09-13 2013-09-13
US201361877414P 2013-09-13 2013-09-13
PCT/US2013/075616 WO2015038176A1 (fr) 2013-09-13 2013-12-17 Synchronisation des limites de fenêtres de temps de vol

Publications (3)

Publication Number Publication Date
EP3044999A1 EP3044999A1 (fr) 2016-07-20
EP3044999A4 EP3044999A4 (fr) 2017-04-26
EP3044999B1 true EP3044999B1 (fr) 2020-05-06

Family

ID=52666113

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13893492.2A Active EP3044999B1 (fr) 2013-09-13 2013-12-17 Synchronisation des limites de fenêtres de temps de vol

Country Status (5)

Country Link
US (1) US9924397B2 (fr)
EP (1) EP3044999B1 (fr)
JP (1) JP6165985B2 (fr)
KR (1) KR101786403B1 (fr)
WO (1) WO2015038176A1 (fr)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6165985B2 (ja) 2013-09-13 2017-07-19 インテル コーポレイション 飛行時間ウィンドウの制限同期
WO2015134741A1 (fr) * 2014-03-05 2015-09-11 Marvell World Trade Ltd. Procédé et appareil pour estimer une distance entre des dispositifs de réseau dans un réseau sans fil
US20160127066A1 (en) * 2014-11-03 2016-05-05 Qualcomm Incorporated Relative clock drift calibration for channel stitching
US9668101B2 (en) * 2015-08-10 2017-05-30 Qualcomm Incorporated Partial timing synchronization function (TSF) synchronization in fine timing measurement (FTM) protocol
US9867004B2 (en) * 2015-12-23 2018-01-09 Qualcomm Incorporated Broadcast time-of-departure (TOD) frame format
US10374778B2 (en) * 2016-07-20 2019-08-06 Intel IP Corporation Apparatus, system and method of multi user resource allocation
US20180249437A1 (en) * 2017-02-27 2018-08-30 Qualcomm Incorporated Access point (ap) to access point (ap) ranging for passive locationing
US20220039058A1 (en) * 2020-08-03 2022-02-03 Qualcomm Incorporated Methods and apparatus for wi-fi ranging protocol enhancement with reduced throughput impact

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7477621B1 (en) 2004-09-07 2009-01-13 Marvell International Ltd. System and method for estimating bandwidth requirements of and allocating bandwidth to communication devices operating in a network
US7304609B2 (en) * 2005-03-25 2007-12-04 Harris Corporation Hybrid wireless ranging system and associated methods
KR101141645B1 (ko) * 2005-03-29 2012-05-17 엘지전자 주식회사 데이터 블록 전송 제어 방법
US7610018B2 (en) * 2006-03-10 2009-10-27 Nokia Corporation Channel change procedures in a wireless communications network
US7936782B2 (en) * 2007-02-15 2011-05-03 Samsung Electronics Co., Ltd. Method and system for bidirectional bandwidth reservation in wireless communication systems
KR101020859B1 (ko) * 2008-08-19 2011-03-09 광주과학기술원 무선센서 네트워크에서의 노드간 거리 검출 방법 및 그 시스템
JP5072778B2 (ja) * 2008-09-02 2012-11-14 株式会社エヌ・ティ・ティ・ドコモ 無線通信基地局、無線通信端末、無線通信システムおよび無線通信制御方法
US8165150B2 (en) * 2008-12-17 2012-04-24 Avaya Inc. Method and system for wireless LAN-based indoor position location
JP4880739B2 (ja) * 2009-11-20 2012-02-22 株式会社エヌ・ティ・ティ・ドコモ 無線ｌａｎシステム、データ通信制御方法、及びアクセスポイント
US9106348B2 (en) 2010-03-15 2015-08-11 Cisco Technology, Inc. Using unscheduled automatic power save delivery to achieve coexistence with interfering sources
US20120163261A1 (en) 2010-12-23 2012-06-28 Texas Instruments Incorporated Timing measurements between wireless stations with reduced power consumption
US8918304B2 (en) * 2011-07-22 2014-12-23 Ascom Network Testing Inc. System and method for tuning geo-location in wideband code division multiple access (WCDMA) networks
US20130211780A1 (en) 2012-02-10 2013-08-15 Qualcomm Incorporated Inferred time of flight ranging
US8837316B2 (en) * 2012-06-14 2014-09-16 Qualcomm Incorporated RTT based ranging system and method
JP6165985B2 (ja) 2013-09-13 2017-07-19 インテル コーポレイション 飛行時間ウィンドウの制限同期

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
JP2016533103A (ja) 2016-10-20
US20160205576A1 (en) 2016-07-14
WO2015038176A1 (fr) 2015-03-19
EP3044999A4 (fr) 2017-04-26
KR20160030306A (ko) 2016-03-16
JP6165985B2 (ja) 2017-07-19
KR101786403B1 (ko) 2017-10-17
US9924397B2 (en) 2018-03-20
EP3044999A1 (fr) 2016-07-20

Similar Documents

Publication Publication Date Title
EP3044999B1 (fr) Synchronisation des limites de fenêtres de temps de vol
US9226260B2 (en) Initiator-conditioned fine timing measurement service request
EP3878202B1 (fr) Procédé et appareil de transmission d'un rapport de mesure de positionnement
JP2017208796A (ja) 通信装置、通信方法及びコンピュータプログラム
US20230141919A1 (en) Electronic device for performing ranging through uwb, and operation method of electronic device
WO2013048520A1 (fr) Procédé et appareil d'affectation de groupes d'accès au support
US11470622B2 (en) Method for scheduling vehicle-to-vehicle communications
US20170188300A1 (en) System, method and apparatus for sharing access data for FTM responders
US10225850B2 (en) Vehicular network communication method, and apparatuses
CN113973378A (zh) 无线通信方法与装置、基站和标签设备
US20140126394A1 (en) ADAPTIVE OPTIMIZATION OF TIME OF FLIGHT (ToF) EXCHANGE
WO2022126459A1 (fr) Procédé et appareil pour la détermination d'une ressource de transmission, et dispositif de communication et support d'enregistrement
WO2021036834A1 (fr) Procédé et appareil d'indication de ressources
WO2016166404A1 (fr) Télémesure de dispositifs sans fil
CN115699664A (zh) 无线通信装置和方法
WO2022206238A1 (fr) Procédé et appareil de communication
WO2022001973A1 (fr) Appareil et procédé de communication sans fil
CN116210292A (zh) 信息传输方法及相关设备
WO2024174942A1 (fr) Procédé de communication, et appareil
WO2024031464A1 (fr) Transmission de signal de référence de positionnement de liaison latérale pour des communications sans fil
EP4135366A1 (fr) Dispositif de communication sans fil, système de communication sans fil et procédé de commande d'énergie
WO2024208110A1 (fr) Procédé et appareil de communication
WO2023279359A1 (fr) Procédé et appareil de communication
Hu et al. LMAC: LTE-assisted MAC protocol to reduce delay for vehicle-to-vehicle communications
CN118509985A (zh) 用于侧链路定位的方法和装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20160205

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20170329

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 56/00 20090101AFI20170323BHEP

Ipc: H04W 24/10 20090101ALI20170323BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20190603

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20191115

RIN1 Information on inventor provided before grant (corrected)

Inventor name: SEGEV, JONATHAN

Inventor name: STEPHENS, ADRIAN, P.

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1268874

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200515

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602013068970

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200806

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200807

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200906

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200907

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200806

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1268874

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200506

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602013068970

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20210209

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20201231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201217

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201217

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230518

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20230925

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230921

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20231006

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230919

Year of fee payment: 11