EP3076724B1 - Appareil et procédé de transmission de données - Google Patents

Appareil et procédé de transmission de données Download PDF

Info

Publication number
EP3076724B1
EP3076724B1 EP13899585.7A EP13899585A EP3076724B1 EP 3076724 B1 EP3076724 B1 EP 3076724B1 EP 13899585 A EP13899585 A EP 13899585A EP 3076724 B1 EP3076724 B1 EP 3076724B1
Authority
EP
European Patent Office
Prior art keywords
data
lqi
pieces
value
transmitted
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.)
Not-in-force
Application number
EP13899585.7A
Other languages
German (de)
English (en)
Other versions
EP3076724A1 (fr
EP3076724A4 (fr
Inventor
Pei Liu
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of EP3076724A1 publication Critical patent/EP3076724A1/fr
Publication of EP3076724A4 publication Critical patent/EP3076724A4/fr
Application granted granted Critical
Publication of EP3076724B1 publication Critical patent/EP3076724B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
    • H04L1/203—Details of error rate determination, e.g. BER, FER or WER
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1825—Adaptation of specific ARQ protocol parameters according to transmission conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
    • H04L1/201—Frame classification, e.g. bad, good or erased
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/29—Flow control; Congestion control using a combination of thresholds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1671—Details of the supervisory signal the supervisory signal being transmitted together with control information

Definitions

  • Embodiments of the present invention relate to communications technologies, and in particular, to a data transmission apparatus and method.
  • a wireless multimedia sensor network (WMSN for short) is a distributed sensor network with information storage, data computing, and communication capabilities, and consists of various sensor nodes, where the sensor nodes are video, audio, and image sensor nodes and the like that are added to a wireless sensor network and collect richer information.
  • the wireless multimedia sensor network covers a traditional scalar sensor network, a video sensor network, an image sensor network, a visual sensor network, and a mixture of various sensor node networks, such as video, audio, and image sensor node networks.
  • the wireless multimedia sensor network has higher requirements for real-time and reliable multimedia data transmission.
  • US 2010/0067401A1 refers to methods and systems for transmission mode selection in a multi-channel communication system.
  • a channel state situation is determined by comparing a calculated frame error rate with a frame error rate threshold, and then sending an acknowledgment frame (a NO-ACK mechanism) or sending an immediate acknowledgment frame (an Imm-ACK mechanism) is adaptively selected according to a channel state.
  • a source device After sending a data frame, a source device updates a current frame error rate of a receiving device according to a received acknowledgment frame. Then, a currently calculated frame error rate is compared with a preset frame error rate threshold. If the current frame error rate is less than the threshold, it indicates that channel quality is good, and the source device selects the NO-ACK mechanism to process a to-be-sent data frame.
  • the source device selects the Imm-ACK mechanism to process a to-be-sent data frame.
  • channel state measurement by calculating an overall frame error rate does not take an unexpected channel interference situation into consideration, and cannot reflect a channel state in real time.
  • Embodiments of the present invention provide a data transmission apparatus and method to resolve a problem in the prior art that selection of an ACK acknowledgment mechanism cannot reflect a channel state in real time.
  • an embodiment of the present invention provides a data receiver, including:
  • the reply module is further configured to:
  • the preprocessing module is further configured to:
  • processing module is further specifically configured to:
  • an embodiment of the present invention provides a data receiving method, including:
  • the method further includes: if the received data is retransmission data, immediately replying with an acknowledgment frame.
  • the method further includes:
  • the increasing, when the average value LQI is greater than or equal to an upper threshold LQI max , the quantity of pieces of data allowed to be transmitted in the next period, where the quantity of pieces of data is not greater than a second preset value N max includes:
  • an embodiment of the present invention provides a data transmission device, including:
  • a link quality indication value LQI corresponding to the data is recorded, and incremental processing is performed by adding 1 to a count value, where the count value is used to count a quantity of pieces of received data; if it is learned by means of comparison that the count value is not less than a quantity N of pieces of data allowed to be transmitted in a current period, an average value LQI of link quality indication values corresponding to all data received within the current period is calculated; the average value LQI is compared with a threshold to determine a quantity of pieces of data allowed to be transmitted in a next period; and a periodicity acknowledgment frame is returned, where the periodicity acknowledgment frame carries the quantity of pieces of data allowed to be transmitted in the next period.
  • a real-time channel detection mechanism is formed by comparing and analyzing the average value of the LQI and the threshold; the quantity of pieces of data allowed to be transmitted in the next period is adaptively adjusted to ensure data reliability; and by means of replying with the periodicity acknowledgment frame, exchanges of acknowledgment frames are reduced, which reduces overheads required for the exchanges of acknowledgment frames, reduces a waiting delay of data, improves network throughput and data sending and receiving efficiency, and meets a real-time requirement of multimedia data, especially, video data.
  • a solution of a data transmission apparatus in the embodiments of the present invention may be used to improve network throughput.
  • FIG. 1 is a schematic structural diagram of Embodiment 1 of a data transmission apparatus according to the present invention
  • FIG. 2 is a flowchart of Embodiment 1 of the data transmission apparatus according to the present invention.
  • This embodiment is executed by the data transmission apparatus, where the data transmission apparatus may be implemented by using software and/or hardware.
  • the solution in this embodiment may be applied to a wireless multimedia sensor network. As shown in FIG.
  • a data transmission apparatus 10 in this embodiment may include: a preprocessing module 101, a processing module 102, and a reply module 103, where the preprocessing module 101 is configured to, if data is received within a preset period of time, record a link quality indication value LQI corresponding to the data, and perform incremental processing by adding 1 to a count value, where the count value is used to count a quantity of pieces of received data; the processing module 102 is configured to, if it is learned by means of comparison that the count value is not less than a quantity N of pieces of data allowed to be transmitted in a current period, calculate an average value LQI of link quality indication values corresponding to all data received within the current period, where the processing module 102 is further configured to compare the average value LQI with a threshold to determine a quantity of pieces of data allowed to be transmitted in a next period; and the reply module 103 is configured to reply with a periodicity acknowledgment frame, where the periodicity acknowledgment frame carries the quantity of pieces of data allowed to be transmitted in
  • the reply module 103 is further configured to:
  • the preprocessing module 101 is further configured to:
  • the data transmission apparatus in this embodiment may be a receiving device in the multimedia sensor network.
  • the preset link quality indication critical value, a quantity N of pieces of data allowed to be transmitted in an initialization period, and a preset period of time t, namely, a timeout interval of a timer are configured when the network is initialized. As shown in FIG.
  • a timer of the preprocessing module 101 of the data transmission apparatus 10 that is, the receiving device starts timing, and it is determined whether data is received within the preset time t; if no data is received, it is considered that a piece of null data is received, LQI of the data is recorded as the preset link quality indication critical value, incremental processing is performed by adding 1 to the count value of the quantity of pieces of data, and the timer is cleared; or if data is received within the preset time t, when the received data is retransmission data, the reply module 103 immediately replies with an ACK frame, the preprocessing module 101 records LQI of the data, and performs incremental processing by adding 1 to the count value of the quantity of pieces of data, and the timer is cleared, or when the received data is non-retransmission data, the preprocessing module 101 records LQI of the data, and performs incremental processing by adding 1 to the count value of the quantity of pieces of data, and the timer is cleared.
  • the processing module 102 calculates the average value LQI of the LQI of the data received within the current period, and compares LQI with the threshold, so that the quantity of pieces of data allowed to be transmitted in the next period is adaptively adjusted.
  • the reply module 103 constructs a periodicity acknowledgment frame Pec-ACK and replies with the Pec-ACK for confirmation, and feeds back the quantity of pieces of data allowed to be transmitted in the next period to a source device by using the Pec-ACK frame; after receiving the Pec-ACK frame, the source device starts to send data of the next period.
  • a link quality indication value LQI corresponding to the data is recorded, and incremental processing is performed by adding 1 to a count value, where the count value is used to count a quantity of pieces of received data; if it is learned by means of comparison that the count value is not less than a quantity N of pieces of data allowed to be transmitted in a current period, an average value LQI of link quality indication values corresponding to all data received within the current period is calculated; the average value LQI is compared with a threshold to determine a quantity of pieces of data allowed to be transmitted in a next period; and a periodicity acknowledgment frame is returned, where the periodicity acknowledgment frame carries the quantity of pieces of data allowed to be transmitted in the next period.
  • a real-time channel detection mechanism is formed by comparing and analyzing the average value of the LQI and the threshold; the quantity of pieces of data allowed to be transmitted in the next period is adaptively adjusted to ensure data reliability; and by means of replying with the periodicity acknowledgment frame, exchanges of acknowledgment frames are reduced, which reduces overheads required for the exchanges of acknowledgment frames, reduces a waiting delay of data, improves network throughput and data sending and receiving efficiency, and meets a real-time requirement of multimedia data, especially, video data.
  • FIG. 3 is a flowchart of Embodiment 2 of a data transmission apparatus according to the present invention
  • FIG. 4 is schematic diagram 1 of a data frame exchange of Embodiment 2 of the data transmission apparatus according to the present invention
  • FIG. 5 is schematic diagram 2 of a data frame exchange of Embodiment 2 of the data transmission apparatus according to the present invention.
  • the processing module 102 in this embodiment is specifically configured to:
  • the lower threshold LQI min , the upper threshold LQI max , the first preset value N min , namely, a minimum value of a quantity of pieces of data allowed to be transmitted in one period, and the second preset value N max , namely, a maximum value of a quantity of pieces of data allowed to be transmitted in one period are configured when the network is initialized. As shown in FIG.
  • the processing module 102 calculates the average value LQI of the LQI of data received within the current period, and compares LQI with the threshold, so that the quantity of pieces of data allowed to be transmitted in the next period is adaptively adjusted specifically uses the following manner:
  • a quantity N of pieces of data allowed to be transmitted in a first period is equal to 5.
  • the receiving device receives data of the fourth frame in this period, no data is received within the preset length t for a timer timeout, and therefore the count value increases by 1.
  • the count value n of the quantity of pieces of data is equal to 5
  • the processing module 102 of the receiving device calculates the average value LQI , and compares LQI with the lower threshold LQI min and the upper threshold LQI max separately. If LQI is less than or equal to LQI min , it indicates that a channel is interfered, and channel quality is relatively poor.
  • the quantity of pieces of data allowed to be transmitted in the next period is reduced and cannot be less than the first preset value N min .
  • the quantity of pieces of data allowed to be transmitted in the next period is 4.
  • the reply module 103 constructs a Pec-ACK frame and replies with the Pec-ACK frame for confirmation, and feeds back, by using the Pec-ACK frame, the quantity of pieces of data allowed to be transmitted in the next period to the source device.
  • the source node then starts data transmission of the next period.
  • data of the fifth frame in the previous period needs to be retransmitted.
  • the reply module 103 immediately replies with an ACK frame for confirmation.
  • the processing module 102 calculates the average value LQI , and compares LQI with the lower threshold LQI min and the upper threshold LQI max separately. If LQI is greater than or equal to LQI max , it indicates that channel quality is relatively high.
  • the quantity of pieces of data allowed to be transmitted in the next period is increased and cannot be greater than the second preset value N max . For example, the quantity of pieces of data allowed to be transmitted in the next period is 6. As shown in FIG.
  • a quantity of pieces of data allowed to be transmitted in a fourth period is a quantity of pieces of data allowed to be transmitted in the third period, for example, 6.
  • processing module 102 is further specifically configured to:
  • the quantity of pieces of data allowed to be transmitted in the next period is reduced, but cannot be less than the first preset value N min , and may be a larger value between N min and a result of rounding N*(1-k), where k is ( LQI min - LQI )/ LQI min.
  • processing module 102 is further specifically configured to:
  • the quantity of pieces of data allowed to be transmitted in the next period is increased, but cannot be greater than the second preset value N max , and may be a smaller value between N max and a result of rounding N*(1+k), where k is ( LQI - LQI max )/ LQI max .
  • a frame format of the Pec-ACK frame is shown in Table 1: Table 1 Frame format of the Pec-ACK frame 4 bytes 2 bytes ... 2 bytes 1 byte 1 byte 1 byte 10 bytes FCS MPDU ID n ... MPDU ID 1 MPDUs confirmation Quantity of pieces of data in a next period Quantity of pieces of data in a current period MAC frame header section
  • MPDU refers to a MAC protocol data unit
  • FCS refers to a frame check sequence.
  • a format of a MAC frame header section is shown in Table 2: Table 2 Format of a MAC frame header section 1 byte 3 bytes 1 byte 1 byte 2 bytes 2 bytes Flow indication Data fragment control Address of a source device Address of a destination device PNID Frame control
  • 0xFA is added to a flow indication to identify a video data flow
  • PNID refers to a network identifier of a personal area network.
  • a format of a frame control field is shown in Table 3, a periodicity acknowledgment frame Pec-ACK is added, and remaining fields are the same as those in the IEEE802.15.3 standard.
  • Table 4 shows an effective ACK mechanism field type value in frame control. For example, No ACK is no ACK reply, and bits 7, 8, 11, 14, and 15 of a frame control field are all set to 0; Imm-ACK is an immediate ACK reply; Dly-ACK is a delayed ACK reply; Imp-ACK is a system default ACK; Blk-ACK is an ACK of packet data.
  • an average value LQI is less than or equal to a lower threshold LQI min , a quantity of pieces of data allowed to be transmitted in a next period is reduced, where the quantity of pieces of data is not less than a first preset value N min ; or when the average value LQI is greater than or equal to an upper threshold LQI max , the quantity of pieces of data allowed to be transmitted in the next period is increased, where the quantity of pieces of data is not greater than a second preset value N max ; or when the average value LQI is greater than a lower threshold LQI min and less than an upper threshold LQI max , it is determined that the quantity of pieces of data allowed to be transmitted in the next period is a quantity N of pieces of data allowed to be transmitted in a current period.
  • a real-time channel detection mechanism is formed by comparing and analyzing an average value of LQI and a threshold; the quantity of pieces of data allowed to be transmitted in the next period is adaptively adjusted to ensure data reliability; and by means of replying with a periodicity acknowledgment frame, exchanges of acknowledgment frames are reduced, which reduces overheads required for the exchanges of acknowledgment frames, reduces a waiting delay of data, improves network throughput and data sending and receiving efficiency, and meets a real-time requirement of multimedia data, especially, video data.
  • normal period rotation is performed after an exchange is completed according to a quantity, of pieces of data allowed to be transmitted in one period, agreed between a source device that sends data and a receiving device.
  • a data exchange if a data loss case occurs, a count value of a quantity of pieces of data cannot be updated, an agreed quantity of pieces of data cannot be properly counted, and an average LQI value cannot be accurately obtained.
  • a preset period of time t namely a timeout interval of a timer. If no data is received within the specified time t, it may be determined that data is lost, a count value of a quantity of pieces of data in the period is increased by 1, and the timer restarts timing.
  • Td Td + TMIFS.
  • Td is an average time required for receiving one frame of data
  • TMIFS is an average waiting time of minimum interframe spacing (Minimum Interframe Spacing, MIFS for short).
  • FIG. 6 is a schematic diagram of a relationship, between an average LQI value and an average data packet receive rate, simulated on a MicaZ hardware platform
  • FIG. 7 is a schematic diagram of a relationship, between LQI and a packet error rate PER, simulated on a TelosB hardware platform.
  • LQI is less than 80
  • a data packet receive rate is 0
  • LQI is greater than 105
  • the data packet receive rate is 1, and reliability is highest
  • 100 ⁇ LQI ⁇ 105 the data packet receive rate is close to 1, and reliability is relatively high
  • LQI is less than 100, the data packet receive rate progressively decreases, and smaller LQI indicates lower reliability.
  • a threshold interval in the solution of this embodiment may be set to [95,105] to meet a reliability requirement of video transmission, that is, a lower threshold LQI min is 95, and an upper threshold LQI max is 105.
  • a preset link quality indication critical value may be set to 80; on the TelosB hardware platform, the preset link quality indication critical value may be set to 50.
  • FIG. 8 is a flowchart of Embodiment 1 of a data transmission method according to the present invention; this embodiment is executed by a data transmission apparatus, where the data transmission apparatus may be implemented by using software and/or hardware.
  • the solution in this embodiment may be applied to a wireless multimedia sensor network.
  • the data transmission apparatus may be a receiving device in the wireless multimedia sensor network.
  • the method in this embodiment may include:
  • step 801 if the received data is retransmission data, an acknowledgment frame is immediately returned.
  • the method in this embodiment may further include:
  • the comparing the average value LQI with a threshold to determine a quantity of pieces of data allowed to be transmitted in a next period includes:
  • the reducing, when the average value LQI is less than or equal to a lower threshold LQI min , the quantity of pieces of data allowed to be transmitted in the next period, where the quantity of pieces of data is not less than a first preset value N min includes:
  • the increasing, when the average value LQI is greater than or equal to an upper threshold LQI max , the quantity of pieces of data allowed to be transmitted in the next period, where the quantity of pieces of data is not greater than a second preset value N max includes:
  • FIG. 9 is a schematic structural diagram of Embodiment 1 of a data transmission device according to the present invention.
  • a data transmission device 90 provided in this embodiment includes a processor 901 and a memory 902.
  • the data transmission device 90 may further include a transmitter 903 and a receiver 904.
  • the transmitter 903 and the receiver 904 may be connected to the processor 901, where the transmitter 903 is configured to send data or information; the receiver 904 is configured to receive data or information; the memory 902 stores an execution instruction; when the data transmission device 90 runs, the processor 901 communicates with the memory 902, and the processor 901 invokes the execution instruction in the memory 902 to execute the technical solution of the method embodiment shown in FIG. 8 , where implementation principles and technical effects thereof are similar, and are not described in detail herein again.
  • the disclosed device and method may be implemented in other manners.
  • the described device embodiment is merely exemplary.
  • the unit or module division is merely logical function division and may be other division in actual implementation.
  • a plurality of units or modules may be combined or integrated into another system, or some features may be ignored or not performed.
  • the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented by using some interfaces.
  • the indirect couplings or communication connections between the devices or modules may be implemented in electronic, mechanical, or other forms.
  • modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical modules, may be located in one position, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual requirements to achieve the objectives of the solutions of the embodiments.
  • the program may be stored in a computer-readable storage medium.
  • the foregoing storage medium includes: any medium that can store program code, such as a ROM, a RAM, a magnetic disk, or an optical disc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Communication Control (AREA)

Claims (9)

  1. Récepteur de données (10), comprenant :
    un module de prétraitement (101) configuré pour, si des données sont reçues dans une période de temps préétablie, enregistrer une valeur d'indication de qualité de lien LQI correspondant aux données, et réaliser un traitement incrémental en ajoutant 1 à une valeur de dénombrement, dans lequel la valeur de dénombrement est utilisée pour dénombrer une quantité de données reçues ;
    un module de traitement (102), configuré pour, si l'on apprend au moyen d'une comparaison que la valeur de dénombrement est égale à une quantité N de données autorisées à être transmises par l'émetteur, dans une période en cours, calculer une valeur moyenne LQI de valeurs d'indication de qualité de lien correspondant à toutes les données reçues dans la période en cours, dans lequel
    le module de traitement (102) est en outre configuré pour comparer la valeur moyenne LQI avec un seuil pour déterminer une quantité de données autorisées à être transmises dans une période suivante ; et
    un module de réplique (103), configuré pour répliquer avec un cadre d'accusé de réception de périodicité, dans lequel le cadre d'accusé de réception de périodicité porte la quantité de données autorisées à être transmises dans la période suivante,
    dans lequel le module de traitement (102) est spécifiquement configuré pour :
    lorsque la valeur moyenne LQI est inférieure ou égale à un seuil inférieur LQI min, réduire la quantité de données autorisées à être transmises dans la période suivante, dans lequel la quantité de données est non inférieure à une première valeur préétablie N min ; ou
    lorsque la valeur moyenne LQI est supérieure ou égale à un seuil supérieur LQI max, augmenter la quantité de données autorisées à être transmises dans la période suivante, dans lequel la quantité de données est non supérieure à une seconde valeur préétablie N max; ou
    lorsque la valeur moyenne LQI est supérieure à un seuil inférieur LQI min et inférieure à un seuil supérieur LQI max , déterminer que la quantité de données autorisées à être transmises dans la période suivante est la valeur N de la quantité de données autorisées à être transmises dans la période en cours,
    caractérisé en ce que
    le module de traitement (102) est en outre spécifiquement configuré pour :
    lorsque la valeur moyenne LQI est inférieure ou égale au seuil inférieur LQI min, si N*(1-k) est inférieur à la première valeur préétablie N min, déterminer que la quantité de données autorisées à être transmises dans la période suivante est la première valeur préétablie N min, ou si N*(1-k) est supérieur ou égal à la première valeur préétablie N min, déterminer que la quantité de données autorisées à être transmises dans la période suivante est une valeur arrondie de N*(1-k), dans lequel k vaut (LQI min - LQI )/LQI min .
  2. Appareil selon la revendication 1, dans lequel le module de réplique est en outre configuré pour :
    si les données reçues sont des données de retransmission, répliquer immédiatement avec un cadre d'accusé de réception.
  3. Appareil selon la revendication 1, dans lequel le module de prétraitement est en outre configuré pour :
    si aucune donnée n'est reçue dans le temps préétabli, dont on considère qu'une donnée nulle est reçue dans le temps préétabli, réaliser un traitement incrémental en ajoutant 1 à la valeur de dénombrement, dans lequel une valeur d'indication de qualité de lien de la donnée nulle est une valeur critique d'indication de qualité de lien préétablie.
  4. Appareil selon l'une quelconque des revendications 1 à 3, dans lequel le module de traitement est en outre spécifiquement configuré pour :
    lorsque la valeur moyenne LQI est supérieure ou égale au seuil supérieur LQI max , si N*(1+k) est supérieur à la seconde valeur préétablie N max, déterminer que la quantité de données autorisées à être transmises dans la période suivante est la seconde valeur préétablie N max, ou si N*(1+k) est inférieur ou égal à la seconde valeur préétablie N max, arrondir N*(1+k), dans lequel k vaut ( LQI - LQI max)/LQI max .
  5. Procédé de réception de données, comprenant :
    si des données sont reçues dans une période de temps préétablie, l'enregistrement d'une valeur d'indication de qualité de lien LQI correspondant aux données, et la réalisation d'un traitement incrémental en ajoutant 1 à une valeur de dénombrement, dans lequel la valeur de dénombrement est utilisée pour dénombrer une quantité de données reçues ;
    si l'on apprend au moyen d'une comparaison que la valeur de dénombrement est égale à une quantité N de données autorisées à être transmises par l'émetteur dans une période en cours, le calcul d'une valeur moyenne LQI de valeurs d'indication de qualité de lien correspondant à toutes les données reçues dans la période en cours ;
    la comparaison de la valeur moyenne LQI avec un seuil pour déterminer une quantité de données autorisées à être transmises dans une période suivante ; et
    la réplique avec un cadre d'accusé de réception de périodicité, dans lequel le cadre d'accusé de réception de périodicité porte la quantité de données autorisées à être transmises dans la période suivante,
    dans lequel la comparaison de la valeur moyenne LQI avec un seuil pour déterminer une quantité de données autorisées à être transmises dans une période suivante comprend :
    la réduction, lorsque la valeur moyenne LQI est inférieure ou égale à un seuil inférieur LQI min , de la quantité de données autorisées à être transmises dans la période suivante, dans lequel la quantité de données est non inférieure à une première valeur préétablie N min ; ou
    l'augmentation, lorsque la valeur moyenne LQI est supérieure ou égale à un seuil supérieur LQI max , de la quantité de données autorisées à être transmises dans la période suivante, dans lequel la quantité de données est non supérieure à une seconde valeur préétablie N max; ou
    le fait de déterminer, lorsque la valeur moyenne LQI est supérieure à un seuil inférieur LQI min et inférieure à un seuil supérieur LQI max , que la quantité de données autorisées à être transmises dans la période suivante est la valeur N de la quantité de données autorisées à être transmises dans la période en cours,
    dans lequel la réduction, lorsque la valeur moyenne LQI est inférieure ou égale à un seuil inférieur LQI min , de la quantité de données autorisées à être transmises dans la période suivante, dans lequel la quantité de données est non inférieure à une première valeur préétablie N min, est caractérisée en ce que :
    lorsque la valeur moyenne LQI est inférieure ou égale au seuil inférieur LQI min, si N*(1-k) est inférieur à la première valeur préétablie N min, le fait de déterminer que la quantité de données autorisées à être transmises dans la période suivante est la première valeur préétablie N min, ou si N*(1-k) est supérieur ou égal à la première valeur préétablie N min, le fait de déterminer que la quantité de données autorisées à être transmises dans la période suivante est une valeur arrondie de N*(1-k), dans lequel k vaut (LQI min - LQI )/LQI min .
  6. Procédé selon la revendication 5, comprenant en outre : si les données reçues sont des données de retransmission, la réplique immédiate avec un cadre d'accusé de réception.
  7. Procédé selon la revendication 5, comprenant en outre :
    si aucune donnée n'est reçue dans le temps préétabli, c'est-à-dire que l'on considère qu'une donnée nulle est reçue dans le temps préétabli, la réalisation d'un traitement incrémental en ajoutant 1 à la valeur de dénombrement, dans lequel une valeur d'indication de qualité de lien de la donnée nulle est une valeur critique d'indication de qualité de lien préétablie.
  8. Procédé selon l'une quelconque des revendications 5 à 7, dans lequel l'augmentation, lorsque la valeur moyenne LQI est supérieure ou égale à un seuil supérieur LQI max , de la quantité de données autorisées à être transmises dans la période suivante, dans lequel la quantité de données est non supérieure à une seconde valeur préétablie N max comprend :
    lorsque la valeur moyenne LQI est supérieure ou égale au seuil supérieur LQI max , si N*(1+k) est supérieur à la seconde valeur préétablie N max, le fait de déterminer que la quantité de données autorisées à être transmises dans la période suivante est la seconde valeur préétablie N max, ou si N*(1+k) est inférieur ou égal à la seconde valeur préétablie N max, arrondir N*(1+k), dans lequel k vaut ( LQI - LQI max)/LQI max .
  9. Dispositif de transmission de données (90), comprenant :
    un processeur (901) et une mémoire (902), dans lequel la mémoire (902) stocke une instruction d'exécution ; lorsque le dispositif de transmission de données (90) fonctionne, le processeur (901) communique avec la mémoire (902), et le processeur (901) exécute l'instruction d'exécution pour que le dispositif de transmission de données (90) exécute le procédé décrit dans l'une quelconque des revendications 5 à 8.
EP13899585.7A 2013-12-17 2013-12-17 Appareil et procédé de transmission de données Not-in-force EP3076724B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/089696 WO2015089740A1 (fr) 2013-12-17 2013-12-17 Appareil et procédé de transmission de données

Publications (3)

Publication Number Publication Date
EP3076724A1 EP3076724A1 (fr) 2016-10-05
EP3076724A4 EP3076724A4 (fr) 2016-12-21
EP3076724B1 true EP3076724B1 (fr) 2018-04-18

Family

ID=53401928

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13899585.7A Not-in-force EP3076724B1 (fr) 2013-12-17 2013-12-17 Appareil et procédé de transmission de données

Country Status (5)

Country Link
US (1) US10135742B2 (fr)
EP (1) EP3076724B1 (fr)
CN (1) CN105052217B (fr)
ES (1) ES2671480T3 (fr)
WO (1) WO2015089740A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10869224B2 (en) 2018-05-18 2020-12-15 Apple Inc. Fast synchronization of compressor state and decompression state in marginal wireless coverage

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI20065614L (fi) * 2006-09-29 2008-03-30 Nokia Corp Lähetysaikavälin allokointi pakettiradiopalvelua varten
CN100553185C (zh) * 2007-01-09 2009-10-21 北京天碁科技有限公司 高速下行分组接入中信道质量指示的产生方法及用户设备
CN101102312B (zh) * 2007-06-11 2010-06-02 华为技术有限公司 一种网络通信数据处理方法、网络通信系统及客户端
US8238313B2 (en) 2007-09-14 2012-08-07 Intel Corporation Techniques for wireless personal area network communications with efficient spatial reuse
CN101170381B (zh) * 2007-10-29 2010-10-27 华为技术有限公司 控制前向链路的数据包的发送速率的方法和装置
US8619620B2 (en) * 2008-09-16 2013-12-31 Qualcomm Incorporated Methods and systems for transmission mode selection in a multi channel communication system
CN101621829B (zh) * 2009-07-27 2012-07-04 北京天碁科技有限公司 一种信道质量指示符上报的方法及装置
CN101702824B (zh) * 2009-11-25 2012-07-04 北京天碁科技有限公司 增强上行绝对接入允许信道的功率控制方法及用户终端
KR20120112981A (ko) 2011-04-04 2012-10-12 삼성전기주식회사 데이터 프레임의 재전송 감소 방법 및 이를 위한 수신 노드
CN102694731B (zh) * 2012-05-29 2016-03-30 北京星网锐捷网络技术有限公司 速率调整方法、装置和网络设备
US9182248B2 (en) * 2012-09-11 2015-11-10 Texas Instruments Incorporated Power line communication network and discovery process
US9264103B2 (en) * 2012-12-17 2016-02-16 Texas Instruments Incorporated Asymmetric channels in power line communications

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
US10135742B2 (en) 2018-11-20
EP3076724A1 (fr) 2016-10-05
CN105052217B (zh) 2019-04-26
US20160294708A1 (en) 2016-10-06
WO2015089740A1 (fr) 2015-06-25
ES2671480T3 (es) 2018-06-06
EP3076724A4 (fr) 2016-12-21
CN105052217A (zh) 2015-11-11

Similar Documents

Publication Publication Date Title
US9049017B2 (en) Efficient TCP ACK prioritization in wireless networks
US7904777B2 (en) Method and system for generating block acknowledgements in wireless communications
US20060168504A1 (en) Method and devices for error tolerant data transmission, wherein retransmission of erroneous data is performed up to the point where the remaining number of errors is acceptable
US20020122385A1 (en) Data throughput over lossy communication links
US8274906B2 (en) Transient analysis of packet queuing loss in a broadcast network
KR100750170B1 (ko) 통신 네트워크에서 데이터 프레임을 효율적으로 전송하는방법 및 장치
EP3592101B1 (fr) Procédé et dispositif de traitement de données
US8681608B2 (en) Method for enhancing of controlling radio resources and transmitting status report in mobile telecommunications system and receiver of mobile telecommunications system
JP6145853B2 (ja) 確認応答（ａｃｋ）ビットマップに基づいてアグリゲーションサイズを調節するための方法
US8171365B2 (en) Communication apparatus and method thereof
JP2007028623A (ja) ネットワークストリームベースの伝送速度を加速するためにｂｅｒ／ｐｅｒを調整するためのシステムおよび方法
US9729269B2 (en) Wireless communication system including communication apparatus and data communication method thereof
US8332711B2 (en) Systems and methods of information transmission
US20170289843A1 (en) Method and apparatus for transmitting data unit
US11258721B2 (en) Radio link control (RLC) acknowledged mode (AM) data reception
CN102299777B (zh) 数据重传方法及装置
US9866350B2 (en) Streaming media packet processing method, WiFi chip, and mobile terminal
US10200154B2 (en) System and method for early packet header verification
EP3076724B1 (fr) Appareil et procédé de transmission de données
JP2015508254A (ja) インテリジェントアグリゲーション（ｉｎｔｅｌｌｉｇｅｎｔａｇｇｒｅｇａｔｉｏｎ）を用いる低レイテンシＷＩＦＩディスプレイ
US11463201B2 (en) HARQ TXOP frame exchange for HARQ retransmission using HARQ threads
US20070230349A1 (en) Adjustment of the number of burst frames transmitted over wireless network
WO2017185893A1 (fr) Procédé de transmission de données, dispositif et entité rlc
CN115967705A (zh) 一种媒体数据传输方法、装置、电子设备及存储介质
US9680610B2 (en) Method and apparatus for error control in 3D video transmissoin

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: 20160627

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

A4 Supplementary search report drawn up and despatched

Effective date: 20161123

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 1/00 20060101ALI20161117BHEP

Ipc: H04L 1/16 20060101ALI20161117BHEP

Ipc: H04L 1/20 20060101ALI20161117BHEP

Ipc: H04W 52/12 20090101AFI20161117BHEP

Ipc: H04L 1/18 20060101ALI20161117BHEP

DAX Request for extension of the european patent (deleted)
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: 20170928

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

GRAL Information related to payment of fee for publishing/printing deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR3

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

GRAR Information related to intention to grant a patent recorded

Free format text: ORIGINAL CODE: EPIDOSNIGR71

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

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

INTC Intention to grant announced (deleted)
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

INTG Intention to grant announced

Effective date: 20180309

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 991748

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180515

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602013036310

Country of ref document: DE

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2671480

Country of ref document: ES

Kind code of ref document: T3

Effective date: 20180606

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20180418

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: NL

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: 20180418

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: 20180418

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: 20180418

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: 20180718

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: 20180418

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: 20180418

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: 20180718

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: 20180418

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: 20180418

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: 20180719

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: 20180418

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: 20180418

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 991748

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180418

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602013036310

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: 20180418

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: 20180418

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: 20180418

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: 20180418

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: 20180418

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: 20180418

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

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

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: 20180418

26N No opposition filed

Effective date: 20190121

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: 20180418

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602013036310

Country of ref document: DE

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20181217

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: 20181217

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: 20180418

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20181231

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

Ref country code: IE

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

Effective date: 20181217

Ref country code: DE

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

Effective date: 20190702

Ref country code: IT

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

Effective date: 20181217

Ref country code: FR

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

Effective date: 20181231

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: 20181231

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

Ref country code: CH

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

Effective date: 20181231

Ref country code: LI

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

Effective date: 20181231

Ref country code: GB

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

Effective date: 20181217

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

Ref country code: MT

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

Effective date: 20181217

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20200203

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: 20180418

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

Ref country code: ES

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

Effective date: 20181218

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

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: 20180418

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 NON-PAYMENT OF DUE FEES

Effective date: 20180418

Ref country code: HU

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

Effective date: 20131217

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: 20180418

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

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: 20180818