[go: up one dir, main page]

EP3030031B1 - Procédé d'attribution de ressources de transmission dans un réseau de communications sans fil - Google Patents

Procédé d'attribution de ressources de transmission dans un réseau de communications sans fil Download PDF

Info

Publication number
EP3030031B1
EP3030031B1 EP14195702.7A EP14195702A EP3030031B1 EP 3030031 B1 EP3030031 B1 EP 3030031B1 EP 14195702 A EP14195702 A EP 14195702A EP 3030031 B1 EP3030031 B1 EP 3030031B1
Authority
EP
European Patent Office
Prior art keywords
index value
identified
frame
transmission
frame identified
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
EP14195702.7A
Other languages
German (de)
English (en)
Other versions
EP3030031A1 (fr
Inventor
Nicolas Gresset
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.)
Mitsubishi Electric Corp
Mitsubishi Electric R&D Centre Europe BV Netherlands
Original Assignee
Mitsubishi Electric Corp
Mitsubishi Electric R&D Centre Europe BV Netherlands
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 Mitsubishi Electric Corp, Mitsubishi Electric R&D Centre Europe BV Netherlands filed Critical Mitsubishi Electric Corp
Priority to EP14195702.7A priority Critical patent/EP3030031B1/fr
Priority to PCT/JP2015/083302 priority patent/WO2016088656A1/fr
Priority to MX2017007028A priority patent/MX362933B/es
Priority to JP2017504201A priority patent/JP6437089B2/ja
Priority to US15/525,725 priority patent/US10264589B2/en
Priority to CN201580065293.4A priority patent/CN107211435B/zh
Publication of EP3030031A1 publication Critical patent/EP3030031A1/fr
Application granted granted Critical
Publication of EP3030031B1 publication Critical patent/EP3030031B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria

Definitions

  • the present invention generally relates to allocating transmission resources in a wireless communications network for performing K individual transmissions between an access point of the wireless communications network and plural mobile terminals.
  • transmission resources (channel related) of the wireless communications network need to be allocated by a device of the wireless communications network in charge of coordinating the resources usage.
  • Such transmission resources depend on the type of wireless communications network is considered.
  • Such transmission resources can thus be time and frequency resources, codes in CDMA (Code Division Multiple Access) wireless communications networks, frequencies in OFDMA (Orthogonal Frequency Division Multiple Access) wireless communications networks, time slots in TDMA (Time Division Multiple Access) wireless communications networks.
  • time is first divided into frame periods, in which frames are respectively transmitted according to a predefined format.
  • Each frame period comprises time slots of equal size, which thus define time resources.
  • Plural frequencies or frequency bands are available to perform transmissions, which thus define frequency resources. Distinct fields of a single frame can then rely on distinct frequency resources. Usage of one such frequency or frequency band during one such time slot defines one time and frequency resource.
  • Time and frequency resources are typically represented using a grid, with frequency resources represented on one axis and time resources represented on another axis.
  • European patent application EP 2 744 141 A1 discloses the allocation of time and frequency resources for at least one data transmission via a fast fading frequency selective channel between an access point of a wireless telecommunications network and at least one communication device located in at least one respective moving conveyance.
  • Resources allocation shall generally be signalled within the wireless communications network in order, for each communication device of the wireless communications network, to be able to determine via which transmission resources the transmissions are expected to effectively occur.
  • Signalling is typically performed in a fixed field of each frame, in a broadcast mode. It means that signalling relies on robust modulation and coding scheme in order to attempt overcoming the worst interference cases that under which the wireless communications network is supposed to operate. Such a configuration for transmitting signalling information is therefore not spectrally efficient, which impacts the wireless communications network performance.
  • the present invention concerns a method for allocating transmission resources in a wireless communications network for performing K individual transmissions between an access point and plural mobile terminals, the transmissions occurring in the wireless communications network on a per frame basis, the method being performed by a managing device in charge of allocating the transmission resources for performing the K individual transmissions, signalling information intended to enable the mobile terminals to determine transmission resources that are allocated in a subsequent frame being transmitted in at least one transmission resource of each frame, wherein, for each one of the K individual transmissions, the managing device has information representative of a signal-plus-interference to noise ratio expected for each transmission resource when used by said individual transmissions, and the managing device has information representative of a signal-plus-interference to noise ratio expected for each transmission resource when said transmission resource is used for transmitting the signalling information.
  • the method is further such that the managing device performs, when considering allocating transmission resources for the K individual transmissions in a frame identified by an index value t : obtaining information representative of the transmission resources allocated beforehand from the frame identified by the index value t-W T+2 to the frame identified by the index value t - 1 , wherein W ⁇ 1 is a first predefined quantity of successive frames and T ⁇ 1 is a second predefined quantity of successive frames; allocating transmission resources in the frame identified by the index value t for performing the K individual transmissions and transmission resources in the frame identified by an index value t-x for transmitting the signalling information related to the frame identified by the index value t , by reviewing transmission resources allocations from the frame identified by the index value t-W+1 to the frame identified by the index value t-1 for maximizing the following expression: min 0 ⁇ u ⁇ W P t ⁇ u wherein x ⁇ 1 represents a difference in terms of quantity of frames between the frame identified by the index value t and the preceding frame in which is
  • the transmission resource used for transmitting the signalling information is dynamically defined as for the K individual transmissions by maximizing the aforementioned expression, the performance of the wireless communications network is improved. Indeed, in prior art systems, the signalling information is broadcast by considering the worst case scenario, which leads to extra overhead to provide adequate robustness.
  • the managing device for reviewing transmission resources allocations from the frame identified by the index value t-W+1 to the frame identified by the index value t-1, allocates all the transmission resources of the frame identified by the index value t , and evaluates changes of the transmission resources allocations from the frame identified by the index value t-W+1 to the frame identified by the index value so as to improve the following expression: min 0 ⁇ u ⁇ W P t ⁇ u
  • the managing device when evaluating said changes of the transmission resources allocations, starts by testing firstly all possible changes among the transmission resources of the frame showing the worst result of the following expression: 1 ⁇ 1 ⁇ E M k R k , t ⁇ u ⁇ ⁇ 1 ⁇ E B k R 0 , t ⁇ u ⁇ ⁇ ⁇ x
  • each frame starts with a fixed field containing further signalling information intended to enable the mobile terminals to determine transmission resources that are allocated in said frame
  • E B k R 0 , t ⁇ u ⁇ ⁇ ⁇ x E M ( k,R k,t-u- ⁇ ) represents a probability of error encountered in the individual transmission identified by the index value k by using a set R k,t-u- ⁇ of at least one transmission resource in the frame identified by the index value t - u - ⁇ ; wherein E B ( k,R 0,t-u- ⁇ -x ) represents a probability of error encountered in the signalling information related to the individual transmission identified by the index value k, which is transmitted using a set R 0,t-u- ⁇ -x of at least one transmission resource in the frame identified by the index value t - u - ⁇ - x, and wherein E B S k , t ⁇ u ⁇ ⁇ represents a probability of error encountered in the signalling information related to the individual transmission identified by the index value k , which is transmitted in the fixed field of the frame identified by the index value t - -
  • the managing device when evaluating said changes of the transmission resources allocations, starts by testing firstly all possible changes among the transmission resources of the frame showing the worst result of the following expression: 1 ⁇ 1 ⁇ ⁇ M k R k , t ⁇ u ⁇ ⁇ 1 ⁇ ⁇ ⁇ H k , t ⁇ u ⁇ ⁇ , R 0 , t ⁇ u ⁇ ⁇ ⁇ x
  • the managing device when evaluating said changes of the transmission resources allocations, starts by testing firstly all possible changes among the transmission resources of the frame identified by the index t-u which shows the worst figure of merit P(t-u).
  • ⁇ M represents a multi-variable function providing data error rate as a function of a set of signal-plus-interference to noise ratios ⁇ ⁇ ⁇ , which depends on a behavioural model of physical layer configuration used for performing transmission over the set R k,t-u- ⁇
  • ⁇ k ( R k,t-u- ⁇ ( i )) represents the signal-plus-interference to noise ratio expected to be encountered for the message in the transmission resource R k,t-u- ⁇
  • f"' M represents a function providing data error rate as a function of signal-plus-interference to noise ratio p, which depends on a behavioural model of physical layer configuration used for performing transmission over the set R k,t-u- ⁇ , and wherein ⁇ k ( R k,t-u- ⁇ ( i )) represents the signal-plus-interference to noise ratio expected to be encountered for the message in the transmission resource
  • the difference in terms of quantity of frames between the frame identified by the index value t and the preceding frame in which is transmitted the signalling information related to the frame identified by the index value t equals to "1".
  • the invention also concerns a managing device for allocating transmission resources in a wireless communications network for performing K individual transmissions between and plural mobile terminals, the transmissions occurring in the wireless communications network on a per frame basis, signalling information intended to enable the mobile terminals to determine transmission resources that are allocated in a subsequent frame being transmitted in at least one transmission resource of each frame, wherein, for each one of the K individual transmissions, the managing device has information representative of a signal-plus-interference to noise ratio expected for each transmission resource when used by said individual transmissions, and the managing device has information representative of a signal-plus-interference to noise ratio expected for each transmission resource when said transmission resource is used for transmitting the signalling information.
  • the managing device is further such that it implements, when considering allocating transmission resources for the K individual transmissions in a frame identified by an index value t : means for obtaining information representative of the transmission resources allocated beforehand from the frame identified by the index value t-W T+2 to the frame identified by the index value t - 1 , wherein W ⁇ 1 is a first predefined quantity of successive frames and T ⁇ 1 is a second predefined quantity of successive frames; means for allocating transmission resources in the frame identified by the index value t for performing the K individual transmissions and transmission resources in the frame identified by an index value t-x for transmitting the signalling information related to the frame identified by the index value t , by reviewing transmission resources allocations from the frame identified by the index value t-W + 1 to the frame identified by the index value t-1 for maximizing the following expression: min 0 ⁇ u ⁇ W P t ⁇ u wherein x ⁇ 1 represents a difference in terms of quantity of frames between the frame identified by the index value t and the preceding
  • the present invention also concerns a computer program that can be downloaded from a communications network and/or stored on a medium that can be read by a processing device.
  • This computer program comprises instructions for causing implementation of the method mentioned above in relation with the managing device, when said program is run by the processing device.
  • the present invention also concerns information storage means, storing a computer program comprising a set of instructions causing implementation of the method mentioned above in relation with the managing device, when the stored information is read from said information storage means and run by the processing device.
  • a wireless communications network providing transmission resources for performing individual transmissions within the wireless communications network.
  • Transmissions in the wireless communications network are performed on a per frame basis.
  • the individual transmissions are performed in the form of messages.
  • Each message can be transmitted in a single transmission resource, or repeated in plural transmission resources, or spread over plural transmission resources.
  • Individual transmissions means that said transmissions are not correlated to each other, e.g. no constraint on whether one or another of said individual transmissions is performed first within one frame. It has to be noted that each transmission resource cannot be allocated to more than one transmission.
  • Fig. 1 schematically represents a wireless communications network in which the present invention may be implemented.
  • the wireless communications network shown in Fig. 1 comprises plural communication devices, including at least one access point AP and plural mobile terminals.
  • the wireless communications network preferably comprises plural APs.
  • Two APs 110, 111 are illustratively represented in Fig. 1 .
  • Each mobile terminal is attached to one AP according to its geographical location, i.e. access services of the wireless communications network via the AP to which said mobile terminal is attached.
  • Fig. 1 it is illustratively represented that three mobile terminals 120, 121, 122 are attached to the AP 110 and two mobile terminals 123, 124 are attached to the AP 111.
  • the wireless communications network is active over land areas referred to as cells.
  • Each AP of the wireless communications network manages a cell allowing mobile terminals present in the land area of the cell to benefit from the services of the wireless communications network via the AP managing the cell, i.e. to which said mobile terminals are attached.
  • the mobile terminals 120, 121, 122 communicate within the wireless communications network via the AP 110, and the mobile terminals 123, 124 communicate within the wireless communications network via the AP 111, as represented by solid line arrows in Fig. 1 .
  • the wireless communications network preferably further comprises a server 100 connected to each AP in order to allow implementing the services of the wireless communications network.
  • Fig. 1 It is further represented in Fig. 1 that, from the standpoint of the mobile terminal 123, downlink and/or uplink communications between the AP 110 and the mobile terminal 122 may interfere with the downlink and/or uplink communications between the AP 111 and the mobile terminal 123. From the standpoint of the mobile terminal 122, downlink and/or uplink communications between the AP 111 and the mobile terminal 123 may interfere with the downlink and/or uplink communications from the AP 110 and the mobile terminal 122. Such interference is represented in Fig. 1 by dashed line arrows. Other interference not relative to downlink and/or uplink communications in the wireless communications network may occur due to presence of external interferers located in the vicinity of the mobile terminals and/or in the vicinity of the APs. Coping with such interference, or noise or path loss, can be performed thanks to frequency hopping when allocating time and frequency resources for transmissions. Frequency hopping provides diversity in terms of frequency resources usage, which allows the transmissions to be robust to narrowband interference.
  • downlink communications refers herein, as typically understood by the one skilled in the art, to as communications from a considered access point to a considered mobile terminal.
  • uplink communications refer herein, as typically understood by the one skilled in the art, to as communications from a considered mobile terminal to a considered access point.
  • the server 100 is in charge of performing transmission resources allocations within the wireless communications network. To achieve this, the server 100 communicates with the APs 110, 111 so as to receive and process allocation requests. In a variant, the allocations of transmission resources are not performed by the server 100, but by the APs 110, 111 themselves.
  • a device i.e. an AP or the server 100, in charge of performing time and frequency resources allocations within the wireless communications network may be referred to as managing device.
  • Transmissions between the APs and the mobile terminals respectively attached thereto are considered as individual transmissions, i.e. uncorrelated transmissions.
  • the mobile terminals considered herein may be communication devices installed in trains performing journeys on railroads on the edge of which the APs 110, 111 are located.
  • Figs. 2A and 2B provides two alternative frame formats that can be used for transmitting data between an AP, such as the AP 110, and the plurality of mobile terminals attached thereto.
  • the frame formats represented in Figs. 2A and 2B are illustratively based on usage of time and frequency resources as transmission resources.
  • the signalling information contained in any payload field (as defined hereafter with regard to Figs. 2A and 2B ) relates to the transmission resources allocation for a subsequent frame (compared to the one in which said signalling information is transmitted).
  • the difference x in terms of quantity of frames between the frame containing said signalling information and the frame to which said signalling information relates is predefined, and known by the mobile terminals attached to the AP transmitting said signalling information.
  • Fig. 2A schematically represents a first frame format, as can be used within the wireless communications network.
  • the first frame format is herein referred to as hybrid mode.
  • the first frame format is such that the frame starts with a fixed field 201 dedicated to signalling information.
  • the fixed field 201 is intended to contain the signalling information that applies to the frame in which the fixed field 201 is present.
  • the fixed field 201 is transmitted over at least one predefined frequency that is also known by each mobile terminal attached to the considered AP.
  • the fixed field 201 is intended to be received by each mobile terminal attached to the AP transmitting said fixed field 201, since said fixed field 201 contains signalling information (broadcast mode). Said AP therefore applies adequate modulation and coding scheme in order to limit risks that the fixed field 201 be not received by one or more mobile terminals attached to said AP.
  • the first frame format is further such that the frame continues with a set of N payload fields 210, 211, 212, wherein N ⁇ 2.
  • Each payload field 210, 211, 212 has a duration that corresponds to a time resource.
  • One payload field is present in the frame for each time resource used in the considered frame period.
  • Each payload field 210, 211, 212 is either dedicated to transmitting data in the scope of one or another of the K individual transmissions, or to transmitting further signalling data.
  • one or another of the K individual transmissions may have no transmission resources allocated in the considered frame, or one transmission resource, or plural transmission resources.
  • Each frame however comprises signalling information in one or more payload fields.
  • each payload field 210, 211, 212 contains an identifier of the concerned individual transmission among the K individual transmissions.
  • the signalling information therefore consists in transmitting the frequency hopping sequence applicable to the considered frame period.
  • said payload field contains an identifier reserved for indicating that said payload field contains signalling information.
  • the signalling information contained in one or more payload fields 210, 211, 212 may therefore be another exemplar of the signalling information transmitted in the fixed field 201 of the frame to which the signalling information contained in one or more payload fields 210, 211,212 relates.
  • the signalling information contained in one or more payload fields 210, 211, 212 may in a variant complement the signalling information transmitted in the fixed field 201 of the frame to which the signalling information contained in one or more payload fields 210, 211, 212 relates.
  • the signalling information indicates, for at least one time resource of the frame period to which said signalling information relates, whether said time resource is intended to be used for downlink communication or for uplink communication, in association with an identifier representative of the individual transmission among the K individual transmissions to which said time resource is allocated.
  • the signalling information contained in one or more payload fields 210, 211, 212 may therefore be another exemplar of the signalling information transmitted in the fixed field 201 of the frame to which the signalling information contained in one or more payload fields 210, 211,212 relates.
  • the signalling information contained in one or more payload fields 210, 211, 212 may in a variant complement the signalling information transmitted in the fixed field 201 of the frame to which the signalling information contained in one or more payload fields 210, 211,212 relates.
  • Fig. 2B schematically represents a second frame format, as can be used within the wireless communications network.
  • the second frame format is herein referred to as dynamic mode.
  • the second frame format is such that the frame directly starts with a set of N payload fields 250, 251, 252, 253. It means that compared to the first frame format shown in Fig. 2A , no static signalling field is present at the beginning of the frame. The signalling information is therefore contained in one or more payload fields 250, 251, 252, 253. As for the first frame format shown in Fig. 2A , each payload field 250, 251, 252, 253 has a duration that corresponds to a time resource. One payload field is present in the frame for each time resource used in the considered frame period. Each payload field 251, 252, 253 is either dedicated to transmitting data in the scope of one or another of the K individual transmissions, or to transmitting the signalling data. As would be detailed hereafter, one or another of the K individual transmissions may have no transmission resources allocated in the considered frame, or one transmission resource, or plural transmission resources. Each frame however comprises signalling information in one or more payload fields.
  • each payload field 250, 251, 252, 253 contains an identifier of the concerned individual transmission among the K individual transmissions.
  • said payload field contains an identifier reserved for indicating that said payload field contains signalling information.
  • the signalling information contained in one payload field 250, 251, 252, 253 indicates, for at least one time resource of the frame period to which the signalling information relates, whether said time resource is intended to be used for downlink communication or for uplink communication, in association with an identifier representative of the individual transmission among the K individual transmissions to which said time resource is allocated.
  • Fig. 3 schematically represents a communication device 350 of the wireless communications network.
  • the communication device 350 may be a representation of an AP, such as the AP 110, and/or may be a representation of a mobile terminal, such as the mobile terminal 120, and/or may be a representation of the server 100.
  • the communication device 350 comprises the following components interconnected by a communications bus 310: a processor, microprocessor, microcontroller or CPU ( Central Processing Unit ) 300; a RAM ( Random-Access Memory ) 301; a ROM ( Read-Only Memory ) 302; an HDD ( Hard-Disk Drive ) or an SD ( Secure Digital ) card reader 303, or any other device adapted to read information stored on storage means; and, a set of at least one communication interface 304.
  • a processor, microprocessor, microcontroller or CPU Central Processing Unit
  • RAM Random-Access Memory
  • ROM Read-Only Memory
  • HDD Hard-Disk Drive
  • SD Secure Digital
  • the set of at least one communication interface 304 allows the communication device to communicate with at least one other communication device of the wireless communications network.
  • CPU 300 is capable of executing instructions loaded into RAM 301 from ROM 302 or from an external memory, such as an SD card. After the communication device 350 has been powered on, CPU 300 is capable of reading instructions from RAM 301 and executing these instructions.
  • the instructions form one computer program that causes CPU 300, and thus the communication device 350, to perform some or all of the steps of the algorithms described hereafter.
  • Any and all steps of the algorithms described hereafter may be implemented in software by execution of a set of instructions or program by a programmable computing machine, such as a PC ( personal Computes ), a DSP ( Digital Signal Professor ) or a microcontroller; or else implemented in hardware by a machine or a dedicated component, such as an FPGA ( Field-Programmable Gate Array ) or an ASIC ( Application-Specific Integrates Circuit ).
  • a programmable computing machine such as a PC ( personal Computes ), a DSP ( Digital Signal Professor ) or a microcontroller; or else implemented in hardware by a machine or a dedicated component, such as an FPGA ( Field-Programmable Gate Array ) or an ASIC ( Application-Specific Integrates Circuit ).
  • Fig. 4 schematically represents an algorithm, performed by the managing device, for allocating transmission resources within the wireless communications network.
  • the managing device has information representative of a signal-plus-interference to noise ratio expected for each transmission resource when used by said individual transmissions. Moreover, the managing device has, for each transmission resource, information representative of a signal-plus-interference to noise ratio expected (from the standpoints of the mobile terminals) when used for transmitting signalling information.
  • the signal-plus-interference to noise ratio is data that allows characterizing useful signal power and interference level, as expected to be perceived by the considered mobile terminal (to which the considered transmission is addressed), for each transmission resource in view of the location of said mobile terminal.
  • a useful signal power and interference level can be obtained from downlink measurements performed by mobile terminals.
  • the measurements are the received signal power on a given transmission resource at a given location, or frame error rates from which short-term signal-plus-interference to noise ratios can be deduced and therefore a long-term signal-plus-interference to noise ratio can be obtained by averaging the short-term signal-plus-interference to noise ratios.
  • the signal-plus-interference to noise ratio is data that allows characterizing the useful signal power and the interference level, as expected to be perceived by the considered AP when receiving signals from a mobile terminal, for each transmission resource in view of the location of said mobile terminal.
  • a useful signal power and interference level can be obtained from measurements performed by said AP. For example, each measurement is the received signal power via a given transmission resource at a given mobile terminal location.
  • the measurements can be frame error rates from which short-term signal-plus-interference to noise ratios can be deduced and therefore a long-term signal-plus-interference to noise ratio can be obtained by averaging the short-term signal-plus-interference to noise ratios.
  • ACK/NACK Acknowledgement / Non-Acknowledgement
  • the processing device determines such a useful signal and interference level from a fingerprint map of long-term signal-plus-interference to noise ratio stored in a database, the fingerprint map of long-term signal-plus-interference to noise ratio being built from the useful signals power and interference observed during preceding journeys of mobile terminals within the cell managed by the considered AP.
  • a step S401 the managing device considers allocating transmission resources for the K individual transmissions in a frame identified by an index value t .
  • the managing device obtains information representative of the transmission resources allocated beforehand from the frame identified by the index value t-W T+2 to the frame identified by the index value t-1, wherein W ⁇ 1 is a first predefined quantity of successive frames and wherein T ⁇ 1 is a second predefined quantity of successive frames.
  • the frames from the frame identified by the index value t-W+1 to the frame identified by the index value t-1 forms a working window of size W in which the managing device is able to modify transmission resources allocations that were performed beforehand.
  • Knowledge of the transmission resources allocation from the frame identified by the index value t-W-T + 2 to the frame identified by the index value t-W is needed in order to be able to perform figure of merit computation, as detailed hereafter.
  • the value T is defined such that at least one message is supposed to be transmitted per individual transmission in any succession of T frames.
  • the signalling information of the frame identified by the index value t-W+1 is at least partly provided in the frame identified by the index value t-W-x + 1, it even means that the transmission of the frame identified by the index value t-W-x + 1 cannot be performed before transmission resources allocations for the frame identified by the index value t are performed at least once (and maybe reviewed later on), since the managing device needs to know the effective transmission resources allocations for the frame identified by the index value t-W + 1 before transmitting the signalling information in the frame identified by the index value t-W-x + 1.
  • the managing device allocates transmission resources in the frame identified by the index value t for performing the K individual transmissions and at least one transmission resource in the frame identified by the index value t-x for transmitting the signalling information related to the frame identified by the index value t , by reviewing the transmission resources allocated from the frame identified by the index value t-W + 1 to the frame identified by the index value t-1 for maximizing the following expression: min 0 ⁇ u ⁇ W P t ⁇ u wherein P(t-u) is a figure of merit representative of a probability that at least one message in each one of the K individual transmissions is correctly received between the frame identified by the index value t-u-T + 1 and the frame identified by the index value t-u in view of the signal-plus-interference to noise ratio, wherein T ⁇ 1 is a second predefined quantity of successive frames.
  • the frames from the frame identified by the index value t-T + 1 to the frame identified by the index value t thus forms a processing window of size T
  • the second predefined quantity of successive frames T may be lower than, or equal to, or greater than the first predefined quantity of successive frames W. Both quantities are indeed independent.
  • E B S k , t ⁇ u ⁇ ⁇ represents a probability of error encountered in the signalling information related to the individual transmission identified by the index value k (from the standpoint of the mobile terminal to which said individual transmission is addressed), which is transmitted in the fixed field 201 of the frame identified by the index value t - u - ⁇ .
  • ⁇ k ( R k,t-u- ⁇ -x ( i )) represents the signal-plus-interference to noise ratio expected to be encountered for said message (of the individual transmission identified by the index value k) in the transmission resource R k,t-u- ⁇ ( i ) identified by the index i among the set R k,t-u- ⁇ , which means that ⁇ ⁇ ( R k,t-u- ⁇ (i)) ⁇ i represents the signal-plus-interference to noise ratio values for the set R k,t-u- ⁇ of transmission resources for the individual transmission identified by the index value k, and wherein f M is a multi-variable function providing data error rate as a function of a set of signal-plus-interference to noise ratios ⁇ ⁇ ⁇ , which depends on a behavioural model of physical layer configuration used for performing transmission over the set R k,t-u- ⁇ (error correcting code rate, modulation scheme,).
  • f M The definition of the function f M is typically obtained by performing computer simulations and storing the results in a look up table (LUT) form for a discrete set of signal to noise ratio values, which are then interpolated for obtaining f M ( ⁇ ⁇ ⁇ ) .
  • LUT look up table
  • Another approach is to first convert the set of signal-plus-interference to noise ratio ⁇ p ⁇ into an equivalent signal-plus-interference to noise ratio ⁇ ' and use a mono-variable function f ⁇ M for example obtained by performing computer simulations and storing the results in a look up table (LUT) form for a discrete set of signal to noise ratio values, which are then interpolated for obtaining f ⁇ M ( ⁇ ' ), but can also rely on theoretical approximations of f ⁇ M in the form ⁇ M Q ⁇ M ⁇ where ⁇ M and ⁇ M are tuning parameters and Q represents the Marcum's function.
  • LUT look up table
  • each message to be transmitted in the frame identified by the index value t - u - ⁇ for the individual transmission identified by the index value k is uniquely transmitted in one transmission resource
  • ⁇ k ( R k,t-u- ⁇ ( i )) represents the signal-plus-interference to noise ratio expected to be encountered for the message (of the individual transmission identified by the index k) in the transmission resource R k,t-u- ⁇ ( i ) identified by the index i among the set R k,t-u- ⁇
  • f' M represents a function providing data
  • the definition of the function f' M is obtained in the same way as the definition of the aforementioned function f ⁇ M .
  • the tuning parameters ⁇ ' M and ⁇ ' M are respectively distinct from the aforementioned tuning parameters ⁇ M and ⁇ M when different modulation and/or coding schemes are used in both cases. Otherwise, the tuning parameters ⁇ ' M and ⁇ ' M are respectively equal to the aforementioned tuning parameters ⁇ M and ⁇ M ,
  • the definition of the function f "M is obtained in the same way as the definition of the aforementioned function f ⁇ M .
  • the tuning parameters ⁇ " M and ⁇ " M are respectively distinct from the aforementioned tuning parameters ⁇ M and ⁇ M when different modulation and/or coding schemes are used in both cases. Otherwise, the tuning parameters ⁇ " M and ⁇ " M are respectively equal to the aforementioned tuning parameters ⁇ M and ⁇ M.
  • the definition of the function f"' M is obtained in the same way as the definition of the aforementioned function f ⁇ M .
  • the tuning parameters ⁇ "' M and ⁇ '" M are respectively distinct from the aforementioned tuning parameters ⁇ M and ⁇ M when different modulation and/or coding schemes are used in both cases. Otherwise, the tuning parameters ⁇ "' M and ⁇ '" M are respectively equal to the aforementioned tuning parameters ⁇ M and ⁇ M .
  • the definition of the function f B is obtained in the same way as the definition of the aforementioned function f ⁇ M .
  • the tuning parameters ⁇ B and ⁇ B are respectively distinct from the aforementioned tuning parameters ⁇ M and ⁇ M when different modulation and/or coding schemes are used in both cases, which is typically the case since signalling information is generally transmitted in a more robust manner than user data. Otherwise, the tuning parameters ⁇ B and ⁇ B are respectively equal to the aforementioned tuning parameters ⁇ M and ⁇ M .
  • the definition of the function f' B is obtained in the same way as the definition of the aforementioned function f B .
  • the tuning parameters ⁇ ' B and ⁇ ' B are respectively distinct from the aforementioned tuning parameters ⁇ B and ⁇ B when different modulation and/or coding schemes are used in both cases. Otherwise, the tuning parameters ⁇ ' B and ⁇ ' B are respectively equal to the aforementioned tuning parameters ⁇ B and ⁇ B .
  • the definition of the function f" B is obtained in the same way as the definition of the aforementioned function f B .
  • the tuning parameters ⁇ " B and ⁇ " B are respectively distinct from the aforementioned tuning parameters ⁇ B and ⁇ B when different modulation and/or coding schemes are used in both cases. Otherwise, the tuning parameters ⁇ " B and ⁇ " B are respectively equal to the aforementioned tuning parameters ⁇ B and ⁇ B .
  • the managing device freezes the transmission resources allocations, resulting from the reviewing operation performed in the step S403, for the frame identified by the index value t-W+1. Therefore, the contents of the signalling information transmitted in the frame identified by the index value t-W-x+1, and which relates to the frame identified by the index value t-W+1, is defined. Then, the managing device enables the transmission of the frame identified by the index value t-W-x+1. It means that the managing device starts considering transmission resources allocations for the frame identified by the index value t before the frame identified by the index value t-W-x+1 needs to be transmitted.
  • step S405 the managing device moves to the frame identified by the index value t+1, i.e. the managing device starts considering transmission resources allocations for the frame identified by the index value t+1, and reiterate the algorithm from the step S402 with the frame identified by the index value t+1 instead of the frame identified by the index value t .
  • Fig. 5 schematically represents an algorithm, performed by the managing device, for reviewing transmission resources allocations.
  • the managing device considers for the first time allocating transmission resources for the frame identified by the index value t .
  • a step S501 the managing device obtains information representative of the transmission resources allocated beforehand from the frame identified by the index value t-W T+2 to the frame identified by the index value t-1.
  • This step S501 corresponds to the step S402 already described with regard to Fig. 4 . None of the transmission resources in the frame period corresponding to the frame identified by the index value t has been allocated so far.
  • the managing device allocates, to at least one of the K individual transmissions, all the transmission resources of the frame identified by the index value t, e.g. in an arbitrary way.
  • the managing device may however allocate at least one transmission resource in the frame identified by the index value t for future insertion of the signalling information in the frame identified by the index value t .
  • This allocation in the frame identified by the index value t for said signalling information is however not taken into account in the computation of the global figure of merit F(t), since said signalling information relates to the transmission resources allocations of the frame identified by the index value t+x.
  • the managing device then removes at least one transmission resource, from the allocations performed beforehand in the frame identified by the index value t-x for at least one of the K individual transmissions, for insertion of the signalling information, which relates to the frame identified by the index value t, in the frame identified by the index value t-x, unless the managing device has allocated beforehand at least one transmission resource for insertion of said signalling information.
  • the managing device computes each figure of merit P(t-u), with u taking values from 0 to W-1, according to the transmission resources allocations resulting from the step S502. Then the managing device computes accordingly the global figure of merit F(t).
  • the managing device stores the transmission resources allocation from the frame identified by the index value t-W+1 to the frame identified by the index value t, in association with each figure of merit P(t-u) and the global figure of merit F(t) which were obtained for said transmission resources allocation.
  • a stop condition avoids that the algorithm of Fig. 5 loops forever.
  • a stop condition is for instance that a time period of predefined duration has elapsed since the beginning of the execution of the algorithm of Fig. 5 .
  • a stop condition is that a quantity of iterations of the step S505 has been reached within one execution of the algorithm of Fig. 5 .
  • such a stop condition is that no improvement of the global figure of merit F(t) has been obtained after a predefined quantity of successive evaluations of transmission resources allocations changes (detailed hereafter with regard to a step S507).
  • a step S506 is performed, in which the algorithm ends; otherwise, the step S507 is performed.
  • the managing device evaluates a change of the transmission resources allocations.
  • the managing device operates in a working window of size W going from the frame identified by the index value t-W+1 to the frame identified by the index value t .
  • No transmission resources allocations performed out of said working window are modified during the current execution of the algorithm of Fig. 5 , i.e. the transmission resources allocations performed for the frames identified by an index value strictly lower than t-W+1 are no more modified.
  • the managing device selects one transmission resource in the working window of size W, e.g. in a round robin fashion.
  • the managing device tests what becomes the global figure of merit F(t) when allocating the selected transmission resource to any other transmission, i.e. to perform any other one of the K individual transmission or to transmit signalling information. It has to be noted that modifying the transmission resource allocated to signalling information in a frame identified by an index v impacts the figure of merit P ( v+x ). The managing device then retains the transmission resources allocation, among the tested transmission resources allocations, which shows the best global figure of merit F(t). At the next iteration of the step S507, the managing device will select another transmission resource to test what becomes the global figure of merit F(t) when allocating the selected transmission resource to any other transmission.
  • step S508 the managing device checks whether the global figure of merit F(t) obtained in the step S507 shows improvement compared to the transmission resources allocation previously stored.
  • a step S509 is performed; otherwise, the step S505 is repeated.
  • the managing device stores the retained transmission resources allocation from the frame identified by the index value t-W+1 to the frame identified by the index value t, in association with each figure of merit P(t-u) and the global figure of merit F(t) which were obtained for said retained transmission resources allocation. Then the step S505 is repeated.
  • the managing device starts evaluating changes of the transmission resources allocations by testing firstly all possible changes among the transmission resources of the frame identified by the index t-u which shows the worst figure of merit P(t-u) among the working window of size W. If no improvement is obtained for the global figure of merit F(t) after all possible changes among the transmission resources of the frame identified by the index t-u, the managing device switches to evaluating changes of the transmission resources allocations by testing all possible changes among the transmission resources of the frame identified by the index t-u', with 0 ⁇ u' ⁇ W and u' ⁇ u, which shows the second worst figure of merit P ( t-u' ) among the working window of size W.
  • the managing device switches to evaluating changes of the transmission resources allocations by testing all possible changes among the transmission resources of the frame that shows now the worst figure of merit P among the working window of size W (since at least one value of the figures of merit P over the working window of size W has changed).
  • the managing device starts evaluating changes of the transmission resources allocations by testing firstly all possible changes among the transmission resources of the frame identified by the index t-u where the worst result of the following expression occurs among the working window of size W: 1 ⁇ 1 ⁇ E M k R k , t ⁇ u ⁇ ⁇ 1 ⁇ E B k R 0 , t ⁇ u ⁇ ⁇ ⁇ x
  • the managing device switches to evaluating changes of the transmission resources allocations by testing all possible changes among the transmission resources of the frame identified by the index t-u', with 0 ⁇ u' ⁇ W and u' ⁇ u, which shows the second worst result of said expression among the working window of size W.
  • the managing device switches to evaluating changes of the transmission resources allocations by testing all possible changes among the transmission resources of the frame that shows now the worst figure of merit P among the working window of size W (since at least one value of the figures of merit P over the working window of size W has changed).
  • the managing device starts evaluating changes of the transmission resources allocations by testing firstly all possible changes among the transmission resources of the frame identified by the index t-u where the worst result of the following expression occurs among the working window of size W: 1 ⁇ 1 ⁇ E M k R k , t ⁇ u ⁇ ⁇ 1 ⁇ E B H k , t ⁇ u ⁇ ⁇ , R 0 , t ⁇ u ⁇ ⁇ ⁇ x
  • the managing device switches to evaluating changes of the transmission resources allocations by testing all possible changes among the transmission resources of the frame identified by the index t-u', with 0 ⁇ u' ⁇ W and u ' ⁇ u, which shows the second worst result of said expression among the working window of size W.
  • the managing device switches to evaluating changes of the transmission resources allocations by testing all possible changes among the transmission resources of the frame that shows now the worst figure of merit P among the working window of size W (since at least one value of the figures of merit P over the working window of size W has changed).

Landscapes

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

Claims (16)

  1. Procédé pour allouer des ressources de transmission dans un réseau de communication sans-fil pour effectuer K transmission individuelles entre un point d'accès (110; 111) et plusieurs terminaux mobiles (120, 121, 122; 123, 124), les transmissions se produisant dans le réseau de communication sans-fil sur une base par trames, le procédé étant effectué par un dispositif gestionnaire (100) en charge d'allouer les ressources de transmission pour effectuer les K transmissions individuelles, des informations de signalisation destinées à permettre aux terminaux mobiles de déterminer des ressources de transmission qui sont allouées dans une trame subséquente étant transmises dans au moins une ressource de transmission de chaque trame,
    dans lequel, pour chacune des K transmissions individuelles, le dispositif gestionnaire dispose d'informations représentatives d'un ratio de signal-plus-interférence-à-bruit espéré pour chaque ressource de transmission lorsqu'utilisée par lesdites transmissions individuelles, et le dispositif gestionnaire dispose d'informations représentatives d'un ratio de signal-plus-interférence-à-bruit espéré pour chaque ressource de transmission lorsqu'utilisée pour transmettre lesdites informations de signalisation,
    dans lequel le dispositif gestionnaire effectue, lorsqu'il considère (S401) d'allouer des ressources de transmission pour les K transmissions individuelles dans une trame identifiée par une valeur d'index t, les étapes suivantes :
    - obtenir (S402) des informations représentatives des ressources de transmission précédemment allouées depuis la trame identifiée par la valeur d'index t-W-T+2 jusqu'à la trame identifiée par la valeur d'index t-l, où W ≥ 1 est une première quantité prédéfinie de trames successives et T ≥ 1 est une seconde quantité prédéfinie de trames successives ;
    - allouer (S403) des ressources de transmission dans la trame identifiée par la valeur d'index t pour effectuer les K transmissions individuelles et des ressources de transmission dans la trame identifiée par la valeur d'index t-x pour transmettre les informations de signalisation relatives à la trame identifiée par la valeur d'index t, en révisant des allocations de ressources de transmission depuis la trame identifiée par la valeur d'index t-W+1 jusqu'à la trame identifiée par la valeur d'index t-1 pour maximiser l'expression suivante :
    min 0 < u < W P t − u
    Figure imgb0071
     où x ≥ 1 représente une différence en termes de quantité de trames entre la trame identifiée par la valeur d'index t et la trame antérieure dans laquelle sont transmises les informations de signalisation relatives à la trame identifiée par la valeur d'index t, et où W ≥ x, et
    où P(t-u) est un facteur de mérite représentatif d'une probabilité qu'au moins un message de chacune des K transmissions individuelles soit correctement reçu entre la trame identifiée par la valeur d'index t-u-T+1 et la trame identifiée par la valeur d'index t-u au vu du ratio signal-plus-interférence-à-bruit ; puis
    - permettre (S404) une transmission de la trame identifiée par la valeur d'index t-W-x+1.
  2. Procédé selon la revendication 1, caractérisé en ce que, pour réviser les allocations de ressources de transmission depuis la trame identifiée par la valeur d'index t-W+1 jusqu'à la trame identifiée par la valeur d'index t-l, le dispositif gestionnaire alloue toutes les ressources de transmission de la trame identifiée par la valeur d'index t, et évalue des changements d'allocations de ressources de transmission depuis la trame identifiée par la valeur d'index t-W+1 jusqu'à la trame identifiée par la valeur d'index de sorte à maximiser l'expression suivante : min 0 < u < W P t − u
    Figure imgb0072
  3. Procédé selon la revendication 2, caractérisé en ce que le facteur de mérite P(t-u) est défini comme suit : P t − u = ∏ k = 1 K 1 − ∏ τ = 0 T − 1 1 − 1 − E M k R k , t − u − τ 1 − E B k R 0 , t − u − τ − x
    Figure imgb0073
     où EM (k, R k,t-u-τ ) représente une probabilité d'erreur rencontrée dans la transmission individuelle identifiée par la valeur d'index k en utilisant un ensemble R k,t-u-τ d'au moins une ressource de transmission dans la trame identifiée par la valeur d'index t - u - τ;
    et où EB (k,R o,t-u-τ-x ) représente une probabilité d'erreur rencontrée dans les informations de signalisation relatives à la transmission individuelle identifiée par la valeur d'index k, qui sont transmises en utilisant un ensemble R o,t-u-τ-x d'au moins une ressource de transmission dans la trame identifiée par la valeur d'index t - u - τ - x.
  4. Procédé selon la revendication 3, caractérisé en ce que, pour évaluer lesdits changements d'allocations de ressources de transmission, le dispositif gestionnaire commence par tester en premier lieu tous les changements possibles parmi les ressources de transmission de la trame montrant le pire résultat de l'expression suivante : 1 − 1 − E M k R k , t − u − τ 1 − E B k R 0 , t − u − τ − x
    Figure imgb0074
  5. Procédé selon la revendication 2, caractérisé en ce que chaque trame commence avec un champ fixe contenant d'autres informations de signalisation destinées à permettre aux terminaux mobiles de déterminer des ressources de transmission qui sont allouées dans ladite trame, le facteur de mérite P(t-u) est défini comme suit : P t − u = ∏ k = 1 K 1 − ∏ τ = 0 T − 1 1 − 1 − E M k R k , t − u − τ 1 − E B H k , t − u − τ , R 0 , t − u − τ − x
    Figure imgb0075
     avec E B H k , t − u − τ , R 0 , t − u − τ − x = E B S k , t − u − τ . E B k R 0 , t − u − τ − x
    Figure imgb0076
     où EM (k,Rk,t-u-τ ) représente une probabilité d'erreur rencontrée dans la transmission individuelle identifiée par la valeur d'index k en utilisant un ensemble R k,t-u-τ d'au moins une ressource de transmission dans la trame identifiée par la valeur d'index t - u - τ;
    où EB (k,R o,t-u-τ-x ) représente une probabilité d'erreur rencontrée dans les informations de signalisation relatives à la transmission individuelle identifiée par la valeur d'index k, qui sont transmises en utilisant un ensemble R o,t-u-τ-x d'au moins une ressource de transmission dans la trame identifiée par la valeur d'index t - u - τ - x,
    et où E B S k , t − u − τ
    Figure imgb0077
     représente une probabilité d'erreur rencontrée dans les informations de signalisation relatives à la transmission individuelle identifiée par la valeur d'index k, qui sont transmises dans le champ fixe de la trame identifiée par la valeur d'index t - u - τ.
  6. Procédé selon la revendication 5, caractérisé en ce que, pour évaluer lesdits changements d'allocations de ressources de transmission, le dispositif gestionnaire commence par tester en premier lieu tous les changements possibles parmi les ressources de transmission de la trame montrant le pire résultat de l'expression suivante : 1 − 1 − E M k R k , t − u − τ 1 − E B H k , t − u − τ , R 0 , t − u − τ − x
    Figure imgb0078
  7. Procédé selon la revendication 3 ou 5, caractérisé en ce que, pour évaluer lesdits changements d'allocations de ressources de transmission, le dispositif gestionnaire commence par tester en premier lieu tous les changements possibles parmi les ressources de transmission de la trame t-u montrant le pire facteur de mérite P(t-u).
  8. Procédé selon l'une quelconque des revendications 3 à 7, caractérisé en ce que chaque message à transmettre dans la trame identifiée par la valeur d'index t - u - τ pour la transmission individuelle identifiée par la valeur d'index k est réparti sur l'ensemble R k,t-u-τ et la probabilité d'erreur EM (k,R k,t-u-τ ) est exprimée comme suit: E M k R k , t − u − τ = f M ( ρ k R k , t − u − τ i i )
    Figure imgb0079
     où fM représente une fonction multi-variable fournissant un taux d'erreur de données en fonction d'un ensemble de ratios signal-plus-interférence-à-bruit {ρ}, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble R k,t-u- τ,
    et où ρk (R k,t-u-τ (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour le message dans la ressource de transmission Rk,t-u-τ (i) identifiée par l'index i parmi l'ensemble Rk,t-u-τ.
  9. Procédé selon l'une quelconque des revendications 3 à 7, caractérisé en ce que chaque message à transmettre dans la trame identifiée par la valeur d'index t - u - τ pour la transmission individuelle identifiée par la valeur d'index k est transmis de manière unique dans une ressource de transmission, et la probabilité d'erreur EM (k, Rk,t-u-τ ) est exprimée comme suit: E M k R k , t − u − τ = 1 − ∏ i 1 − f ′ M ρ k R k , t − u − τ i
    Figure imgb0080
     où f'M représente une fonction fournissant un taux d'erreur de données en fonction d'un ratio signal-plus-interférence-à-bruit ρ, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble Rk,t-u-τ,
    et où ρk (Rk,t-u-τ (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour le message dans la ressource de transmission Rk,t-u-τ (i) identifiée par l'index i parmi l'ensemble Rk,t-u-τ.
  10. Procédé selon l'une quelconque des revendications 3 à 7, caractérisé en ce que chaque message à transmettre dans la trame identifiée par la valeur d'index t - u - τ pour la transmission individuelle identifiée par la valeur d'index k est répété dans chaque ressource de transmission de l'ensemble Rk,t-u-τ et espéré être conjointement décodé, et la probabilité d'erreur EM (k,Rk,t-u-τ ) est exprimée comme suit: E M k R k , t − u − τ = f " M ∑ i ρ k R k , t − u − τ i
    Figure imgb0081
     où ρk (Rk,t-u-τ (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour le message dans la ressource de transmission Rk,t-u-τ ( i) identifiée par l'index i parmi l'ensemble Rk,t-u-τ, et où f"M représente une fonction fournissant un taux d'erreur de données en fonction d'un ratio signal-plus-interférence-à-bruit ρ, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble Rk,t-u-τ
  11. Procédé selon l'une quelconque des revendications 3 à 7, caractérisé en ce que chaque message à transmettre dans la trame identifiée par la valeur d'index t - u - τ pour la transmission individuelle identifiée par la valeur d'index k est répété dans chaque ressource de transmission de l'ensemble Rk,t-u-τ et espéré être indépendamment décodé, et la probabilité d'erreur EM (k,Rk,t-u-τ ) est exprimée comme suit: E M k R k , t − u − τ = ∏ i f‴ M ρ k R k , t − u − τ i
    Figure imgb0082
     où f"'M représente une fonction fournissant un taux d'erreur de données en fonction d'un ratio signal-plus-interférence-à-bruit ρ, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble Rk,t-u-τ,
    et où ρk (Rk,t-u-τ (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour le message dans la ressource de transmission Rk,t-u-τ (i) identifiée par l'index i parmi l'ensemble Rk,t-u-τ.
  12. Procédé selon l'une quelconque des revendications 3 à 10, caractérisé en ce que les informations de signalisation à transmettre dans la trame identifiée par la valeur d'index t - u - z - x et relatives à la trame identifiée par la valeur d'index t - u - τ sont transmises de manière unique dans une ressource de transmission, et la probabilité d'erreur EB (k,R o,t-u-τ-x ) est exprimée comme suit: E B k R 0 , t − u − τ − x = f B ρ k R 0 , t − u − τ − x i
    Figure imgb0083
     où fB représente une fonction fournissant un taux d'erreur de données en fonction d'un ratio signal-plus-interférence-à-bruit ρ, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble R o ,t-u-τ-x,
    et où ρk (R o,t-u-τ-x (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour les informations de signalisation concernant la transmission individuelle identifiée par l'index k dans la ressource de transmission R o,t-u-τ-x (i) identifiée par l'index i parmi l'ensemble R o ,t-u-τ-x.
  13. Procédé selon l'une quelconque des revendications 3 à 10, caractérisé en ce que les informations de signalisation à transmettre dans la trame identifiée par la valeur d'index t - u - τ - x et relatives à la trame identifiée par la valeur d'index t - u - τ sont réparties sur l'ensemble R o,t-u-τ-x et espérées être conjointement décodées, et la probabilité d'erreur EB (k, Ro,t-u-τ-x ) est exprimée comme suit: E B k R 0 , t − u − τ − x = f ′ B ∑ i ρ k R 0 , t − u − τ − x i
    Figure imgb0084
     où f'B représente une fonction fournissant un taux d'erreur de données en fonction d'un ratio signal-plus-interférence-à-bruit ρ, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble R o ,t-u-τ-x,
    et où ρk (R o,t-u-τ-x (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour les informations de signalisation concernant la transmission individuelle identifiée par l'index k dans la ressource de transmission R o,t-u-τ-x (i) identifiée par l'index i parmi l'ensemble R o ,t-u-τ-x.
  14. Procédé selon l'une quelconque des revendications 3 à 10, caractérisé en ce que les informations de signalisation à transmettre dans la trame identifiée par la valeur d'index t - u - τ - x et relatives à la trame identifiée par la valeur d'index t - u - τ sont répétées dans chaque ressource de transmission de l'ensemble R o,t-u-τ-x et espérées être indépendamment décodées, et la probabilité d'erreur EB (k, R o,t-u-τ-x ) est exprimée comme suit: E B k R 0 , t − u − τ − x = ∏ i f " B ρ k R 0 , t − u − τ − x i
    Figure imgb0085
     où f"B représente une fonction fournissant un taux d'erreur de données en fonction d'un ratio signal-plus-interférence-à-bruit ρ, qui dépend d'un modèle comportemental d'une configuration de couche physique utilisée pour effectuer une transmission sur l'ensemble R o ,t-u-τ-x,
    et où ρk (R o,t-u-x (i)) représente le ratio signal-plus-interférence-à-bruit espéré être rencontré pour les informations de signalisation concernant la transmission individuelle identifiée par l'index k dans la ressource de transmission R o,t-u-τ-x (i) identifiée par l'index i parmi l'ensemble R o ,t-u-τ-x.
  15. Procédé selon l'une quelconque des revendications 1 à 14, caractérisé en ce que la différence en termes de quantité de trames entre la trame identifiée par la valeur d'index t et la trame antérieure dans laquelle sont transmises les informations de signalisation relatives à la trame identifiée par la valeur d'index t est égale à « 1 ».
  16. Dispositif gestionnaire (100) pour allouer des ressources de transmission dans un réseau de communication sans-fil pour effectuer K transmission individuelles entre un point d'accès (110; 111) et plusieurs terminaux mobiles (120, 121, 122; 123, 124), les transmissions se produisant dans le réseau de communication sans-fil sur une base par trames, des informations de signalisation destinées à permettre aux terminaux mobiles de déterminer des ressources de transmission qui sont allouées dans une trame subséquente étant transmises dans au moins une ressource de transmission de chaque trame, dans lequel, pour chacune des K transmissions individuelles, le dispositif gestionnaire dispose d'informations représentatives d'un ratio de signal-plus-interférence-à-bruit espéré pour chaque ressource de transmission lorsqu'utilisée par lesdites transmissions individuelles, et le dispositif gestionnaire dispose d'informations représentatives d'un ratio de signal-plus-interférence-à-bruit espéré pour chaque ressource de transmission lorsqu'utilisée pour transmettre lesdites informations de signalisation,
    dans lequel le dispositif gestionnaire implémente, lorsqu'il considère (S401) d'allouer des ressources de transmission pour les K transmissions individuelles dans une trame identifiée par une valeur d'index t, les étapes suivantes :
    - des moyens pour obtenir (S402) des informations représentatives des ressources de transmission précédemment allouées depuis la trame identifiée par la valeur d'index t-W-T+2 jusqu'à la trame identifiée par la valeur d'index t-l, où W ≥ 1 est une première quantité prédéfinie de trames successives et T ≥ 1 est une seconde quantité prédéfinie de trames successives ;
    - des moyens pour allouer (S403) des ressources de transmission dans la trame identifiée par la valeur d'index t pour effectuer les K transmissions individuelles et des ressources de transmission dans la trame identifiée par la valeur d'index t-x pour transmettre les informations de signalisation relatives à la trame identifiée par la valeur d'index t, en révisant des allocations de ressources de transmission depuis la trame identifiée par la valeur d'index t-W+1 jusqu'à la trame identifiée par la valeur d'index t-1 pour maximiser l'expression suivante : min 0 < u < W P t − u
    Figure imgb0086
    où x ≥ 1 représente une différence en termes de quantité de trames entre la trame identifiée par la valeur d'index t et la trame antérieure dans laquelle sont transmises les informations de signalisation relatives à la trame identifiée par la valeur d'index t, et où W ≥ x, et
    où P(t-u) est un facteur de mérite représentatif d'une probabilité qu'au moins un message de chacune des K transmissions individuelles soit correctement reçu entre la trame identifiée par la valeur d'index t-u-T+1 et la trame identifiée par la valeur d'index t-u au vu du ratio signal-plus-interférence-à-bruit; puis
    - des moyens pour permettre (S404) une transmission de la trame identifiée par la valeur d'index t-W-x+1.
EP14195702.7A 2014-12-01 2014-12-01 Procédé d'attribution de ressources de transmission dans un réseau de communications sans fil Active EP3030031B1 (fr)

Priority Applications (6)

Application Number Priority Date Filing Date Title
EP14195702.7A EP3030031B1 (fr) 2014-12-01 2014-12-01 Procédé d'attribution de ressources de transmission dans un réseau de communications sans fil
PCT/JP2015/083302 WO2016088656A1 (fr) 2014-12-01 2015-11-19 Procédé et dispositif de gestion pour attribuer des ressources de transmission dans un réseau de communication sans fil
MX2017007028A MX362933B (es) 2014-12-01 2015-11-19 Método y dispositivo de gestión para asignar recursos de transmisión en una red de comunicaciones inalámbricas.
JP2017504201A JP6437089B2 (ja) 2014-12-01 2015-11-19 無線通信ネットワークにおいて送信リソースを割り当てるための方法及び管理デバイス
US15/525,725 US10264589B2 (en) 2014-12-01 2015-11-19 Method and managing device for allocating transmission resources in a wireless communications network
CN201580065293.4A CN107211435B (zh) 2014-12-01 2015-11-19 用于在无线通信网络中分配传输资源的方法和管理装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP14195702.7A EP3030031B1 (fr) 2014-12-01 2014-12-01 Procédé d'attribution de ressources de transmission dans un réseau de communications sans fil

Publications (2)

Publication Number Publication Date
EP3030031A1 EP3030031A1 (fr) 2016-06-08
EP3030031B1 true EP3030031B1 (fr) 2017-09-06

Family

ID=51999346

Family Applications (1)

Application Number Title Priority Date Filing Date
EP14195702.7A Active EP3030031B1 (fr) 2014-12-01 2014-12-01 Procédé d'attribution de ressources de transmission dans un réseau de communications sans fil

Country Status (6)

Country Link
US (1) US10264589B2 (fr)
EP (1) EP3030031B1 (fr)
JP (1) JP6437089B2 (fr)
CN (1) CN107211435B (fr)
MX (1) MX362933B (fr)
WO (1) WO2016088656A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3656641A1 (fr) * 2018-11-26 2020-05-27 Mitsubishi Electric R & D Centre Europe B.V. Procédé de transmission de données d'amélioration de détection d'obstacles vers un transport de déplacement
CN112088559B (zh) * 2019-04-15 2022-02-08 Oppo广东移动通信有限公司 无线通信的方法、终端设备和网络设备
JP7206425B2 (ja) 2019-06-11 2023-01-17 ブリティッシュ・テレコミュニケーションズ・パブリック・リミテッド・カンパニー セルラ電気通信ネットワークにおけるフロントホール物理レイヤ分割
JP7318018B2 (ja) 2019-06-11 2023-07-31 ブリティッシュ・テレコミュニケーションズ・パブリック・リミテッド・カンパニー セルラー電気通信ネットワークにおけるフロントホール物理レイヤスプリット
EP3873167B1 (fr) * 2020-02-28 2022-06-22 British Telecommunications public limited company Réseau de télécommunications cellulaires
CN112882575A (zh) * 2021-02-24 2021-06-01 宜春职业技术学院（宜春市技术工人学校） 一种全景舞蹈动作建模方法及舞蹈教学辅助系统

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0621767D0 (en) * 2006-11-01 2006-12-13 Nec Corp Resource allocation
US8204008B2 (en) * 2007-06-22 2012-06-19 Apple Inc. Techniques for resource block mapping in a wireless communication system
GB201002215D0 (en) * 2010-02-10 2010-03-31 Nec Corp Resource allocation signalling
EP2472948A2 (fr) * 2010-12-28 2012-07-04 Thomson Licensing Procédé et dispositif de traitement pour l'estimation de l'interférence optimale et la programmation d'un réseau sans fil à sauts multiples avec un contrôle centralisé
US20140219115A1 (en) * 2012-02-06 2014-08-07 Kamran Etemad Signaling for configuration of downlink coordinated multipoint communications
EP2744141B1 (fr) * 2012-12-17 2017-09-06 Mitsubishi Electric R&D Centre Europe B.V. Procédé et dispositif d'attribution de ressources de temps et de fréquence pour au moins une transmission de données par l'intermédiaire d'un canal d'évanouissement sélectif en fréquence rapide
US9426675B2 (en) * 2013-03-15 2016-08-23 Futurewei Technologies, Inc. System and method for adaptation in a wireless communications system

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
JP2017529732A (ja) 2017-10-05
US20180295629A1 (en) 2018-10-11
CN107211435A (zh) 2017-09-26
WO2016088656A8 (fr) 2017-06-29
MX362933B (es) 2019-02-27
EP3030031A1 (fr) 2016-06-08
CN107211435B (zh) 2020-06-23
WO2016088656A1 (fr) 2016-06-09
JP6437089B2 (ja) 2018-12-12
US10264589B2 (en) 2019-04-16
MX2017007028A (es) 2017-08-24

Similar Documents

Publication Publication Date Title
EP3030031B1 (fr) Procédé d&#39;attribution de ressources de transmission dans un réseau de communications sans fil
US10952148B2 (en) Data transmission method and terminal device thereof
CN106992847B (zh) 上行数据发送、接收方法、装置、终端及基站
EP3840278B1 (fr) Procédé et appareil de transmission de liaison montante dans un système de communication sans fil
KR20220071198A (ko) 전송 방법 및 장치
CN111436128A (zh) 传输上行信息的方法和通信装置
EP2744141B1 (fr) Procédé et dispositif d&#39;attribution de ressources de temps et de fréquence pour au moins une transmission de données par l&#39;intermédiaire d&#39;un canal d&#39;évanouissement sélectif en fréquence rapide
CN107027179B (zh) 一种无线通信中的调度方法和装置
US20080304448A1 (en) System and Method for Dynamic Resource Allocation in Wireless Communications Networks
US8804595B2 (en) Communication transmission system
US10075962B2 (en) Method and processing device for determining transmission channel resources to be allocated for a communication
US10075967B2 (en) Method for signaling time and frequency resources allocation in wireless communication system
US8767577B2 (en) Radio base station and communication control method
JP7148639B2 (ja) データ伝送方法及び通信装置
EP4297315A2 (fr) Longueur d&#39;émission spécifique au récepteur
CN109691204B (zh) 用于无线通信系统的网络节点、用户装置和方法
CN115473606A (zh) 通信控制方法及装置、基站、计算机可读介质
CN105612777B (zh) 测量信道质量的方法、用户设备和发送端
EP2360867A1 (fr) Procédé et appareil pour la programmation de liaison montante dans un système de OFDMA avec multiplexage spatial collaboratif
US20230106966A1 (en) Downlink control channel transmission method and apparatus, terminal and access network device
CN116981070A (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

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

17P Request for examination filed

Effective date: 20161205

RBV Designated contracting states (corrected)

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

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20170410

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Ref legal event code: EP

Ref country code: AT

Ref legal event code: REF

Ref document number: 927189

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170915

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

Country of ref document: DE

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 4

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20170906

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

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

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

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

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

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 927189

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170906

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602014014107

Country of ref document: DE

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

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

26N No opposition filed

Effective date: 20180607

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

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

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

Ref country code: MT

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

Effective date: 20171201

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20171231

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

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

Ref country code: CH

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

Effective date: 20171231

Ref country code: LI

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

Effective date: 20171231

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

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

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

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

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

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

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

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

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

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

Effective date: 20230512

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602014014107

Country of ref document: DE

Representative=s name: PUSCHMANN BORCHERT KAISER KLETTNER PATENTANWAE, DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R084

Ref document number: 602014014107

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: 746

Effective date: 20240605

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

Ref country code: DE

Payment date: 20241029

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

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

Year of fee payment: 11