EP3014936A1 - Procédé et noeud radio destinés à gérer des ressources pour la découverte de dispositif à dispositif dans un réseau de radiocommunication ad hoc - Google Patents

Procédé et noeud radio destinés à gérer des ressources pour la découverte de dispositif à dispositif dans un réseau de radiocommunication ad hoc

Info

Publication number
EP3014936A1
EP3014936A1 EP13741864.6A EP13741864A EP3014936A1 EP 3014936 A1 EP3014936 A1 EP 3014936A1 EP 13741864 A EP13741864 A EP 13741864A EP 3014936 A1 EP3014936 A1 EP 3014936A1
Authority
EP
European Patent Office
Prior art keywords
resource
resources
radio node
radio
sinr
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.)
Granted
Application number
EP13741864.6A
Other languages
German (de)
English (en)
Other versions
EP3014936B1 (fr
Inventor
Gabor Fodor
Nadia BRAHMI
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.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP3014936A1 publication Critical patent/EP3014936A1/fr
Application granted granted Critical
Publication of EP3014936B1 publication Critical patent/EP3014936B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/02—Selection of wireless resources by user or 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
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/006—Quality of the received signal, e.g. BER, SNR, water filling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H04W76/14—Direct-mode setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/005—Discovery of network devices, e.g. terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • Embodiments herein relate to wireless communication systems, such as telecommunication systems.
  • a method and a radio node for managing resources for Device-to-Device discovery in an ad-hoc radio communication network are disclosed.
  • An ad-hoc network comprises a set of network nodes, such as cellular phones.
  • a network node may join or leave the ad-hoc network for various reasons, such as mobility, coverage conditions and more.
  • a joining network node i.e. a network node that wishes to join the ad-hoc network
  • the ad-hoc network comprises the network nodes that have already joined the ad-hoc network.
  • the joining node is required to be able to be discovered by the nodes in the ad-hoc network. This is generally referred to as discovery, and in particular to Device-to-Device (D2D) discovery.
  • discovery and in particular to Device-to-Device (D2D) discovery.
  • D2D Device-to-Device
  • D2D discovery refers to a procedure that allows devices in the proximity of each other to detect the presence of one another.
  • D2D discovery may be referred to as neighbor or peer discovery.
  • D2D discovery in ad hoc networks involves an engineering tradeoff between energy efficiency, discovery range, the number of discovered devices and the discovery time.
  • ad hoc technologies such as Bluetooth deal with this problem by carefully designing measurement and beacon signaling procedures and employing state transitions between energy conserving and active states, e.g. between a beacon detecting state and a beacon transmitting state.
  • D2D discovery is a well-known and widely used component of many existing wireless technologies, including ad hoc and cellular networks.
  • IEEE 802.1 1 standards suite such as WFi Direct include technical solutions for device discovery.
  • a key technique used by these standards is to use specially designed so called beacon signals that devices can broadcast and capture, so that nearby devices are able to detect the proximity as well as some characteristics of such beacon broadcasting devices.
  • Beacon signaling based neighbor device discovery requires that a
  • the beacon receiving device is required to be able to decode the information encoded in the beacon signal.
  • the beacon signal must reach a certain Signal-to-Noise-and-lnterference Ratio (SINR) threshold at the receiving device in order for the beacon signal to be detected at the receiving device.
  • SINR Signal-to-Noise-and-lnterference Ratio
  • Bluetooth, WiFi Direct has been known for some time, only few techniques have been proposed and built for devices operating in cellular spectrum and using cellular technologies with or without the need for a base station. Hence, in the context of D2D discovery techniques for devices operating in cellular spectrum and using cellular technologies a few shortcomings have been identified.
  • a first known technique uses random selection of Peer Discovery Resources (PDR), which is a set of resources selected from within the cellular spectrum.
  • PDR Peer Discovery Resources
  • the PDRs are dedicated for beacon signaling.
  • each beacon broadcasting device randomly selects one PDR, or as many as required for the beacon signal to be broadcast, out of dedicated PDRs within the cellular time- frequency resources.
  • This technique may lead to situations in which multiple devices in the vicinity of each other use colliding PDRs. Such collisions of beacon signals make beacon signals undetectable or not decodable by receiving devices.
  • D2D discovery by means of the beacon signals becomes difficult or even impossible.
  • a second known technique uses so called greedy, or opportunistic, selection of PDRs. This means that a device selects a PDR that is not used. When the number of nodes in the ad-hoc network exceeds the number of available discovery resources, all PDRs are being used at a given point in time. In this case, when a new node joins the ad-hoc network, or a device population, the new node selects one PDR for which a distance to the closest peer, or neighbor device, currently using that resource is maximized. This may be expressed by:
  • N k is the set of the nodes that are assigned to the resource k when node i joined the network. Selecting the resource according to the above formula corresponds to so called greedily picking a resource, sometimes referred to as channel, that produces the best Euclidean separation between the node selecting the peer discovery resource and other peers using the same peer discovery resource.
  • This distance based peer discovery resource selection algorithm is that it requires the capability of performing measurements per peer discovery resource and per neighbor node.
  • a second noteworthy characteristic of the distance based selection objective above is that it involves minimizing the distance to a particular peer. In certain scenarios, alternative techniques of separating PDRs selected by different nodes may be required.
  • An object is to improve D2D discovery in an ad-hoc network of the above mentioned kind.
  • the object is achieved by a method, performed by a radio node for managing resources D2D discovery in an ad-hoc radio communication network.
  • the ad-hoc radio communication network comprises a number of further radio nodes.
  • the resources comprise an amount of resources that are dedicated for transmission of beacon signals for D2D discovery.
  • the radio node receives beacon signals from the number of further radio nodes.
  • the beacon signals include a respective beacon signal from a respective further radio node of the further radio nodes.
  • the respective beacon signal includes values indicating power received at the respective further radio node for each resource of the amount of resources.
  • the radio node calculates, for each respective further radio node, values of SIN R based on the values indicating power received at the respective further radio node.
  • the values of SINR include a respective value of SINR for each resource of the amount of resources. The respective value of SINR is calculated as if said each resource is used by the radio node for broadcasting of beacon signals.
  • the radio node calculates, for said each resource, a respective number of further radio nodes that are capable of discovering the radio node by comparing the respective value of SINR to a threshold for discovery of the radio node.
  • Each respective number for all resources of the amount of resources are included in a set of numbers indicating further radio nodes that are capable of discovering the radio node.
  • the radio node calculates, for said each resource, a respective value of average SINR.
  • the respective value of average SINR is determined as an average of each respective value of SINR at each of the further radio nodes over the further radio nodes.
  • Each respective value of average SINR for all resources of the amount of resources are included in a set of values of average SINR.
  • the radio node selects at least one resource out of the amount of resources.
  • the respective number of further radio nodes for the selected at least one resource is among the greatest of the set of numbers indicating further radio nodes and/or the respective value of average SINR for the selected at least one resource is among the greatest of the set of values of average SINR.
  • the radio node broadcasts, to the further radio nodes, a further beacon signal on the selected at least one resource.
  • the object is achieved by a radio node configured to manage resources for D2D discovery in an ad-hoc radio
  • the ad-hoc radio communication network comprises a number of further radio nodes.
  • the resources comprise an amount of resources that are dedicated for transmission of beacon signals for D2D discovery.
  • the radio node comprises a processing circuit configured to receive beacon signals from the number of further radio nodes.
  • the beacon signals include a respective beacon signal from a respective further radio node of the further radio nodes.
  • the respective beacon signal includes values indicating power received at the respective further radio node for each resource of the amount of resources.
  • the processing circuit is further configured to calculate, for each respective further radio node, values of SINR based on the values indicating power received at the respective further radio node.
  • the values of SINR include a respective value of SINR for each resource of the amount of resources. The respective value of SINR is calculated as if said each resource is used by the radio node for broadcasting of beacon signals.
  • the processing circuit is configured to calculate, for said each resource, a respective number of further radio nodes that are capable of discovering the radio node by comparing the respective value of SINR to a threshold for discovery of the radio node.
  • Each respective number for all resources of the amount of resources are included in a set of numbers indicating further radio nodes that are capable of discovering the radio node.
  • the processing circuit is, alternatively or additionally, configured to calculate, for said each resource, a respective value of average SINR.
  • the respective value of average SINR is determined as an average of each respective value of SIN R at each of the further radio nodes over the further radio nodes.
  • Each respective value of average SINR for all resources of the amount of resources are included in a set of values of average SINR.
  • the processing circuit is configured to select at least one resource out of the amount of resources.
  • the respective number of further radio nodes for the selected at least one resource is among the greatest of the set of numbers indicating further radio nodes and/or the respective value of average SINR for the selected at least one resource is among the greatest of the set of values of average SINR.
  • the processing circuit is also configured to broadcast, to the further radio nodes, a further beacon signal on the selected at least one resource.
  • the radio node calculates, for said each resource, a respective number of further radio nodes that are capable of discovering the radio node by comparing the respective value of SINR to a threshold for discovery of the radio node.
  • Each respective number for all resources of the amount of resources are included in a set of numbers indicating further radio nodes that are capable of discovering the radio node.
  • the radio node selects at least one resource out of the amount of resources.
  • the respective number of further radio nodes for the selected at least one resource is among the greatest of the set of numbers indicating further radio nodes.
  • the radio node may have selected the at least one resource for which the radio node is discovered by the greatest, or almost greatest, number of further radio nodes, i.e. neighbouring radio nodes.
  • the radio node calculates, for said each resource, a respective value of average SINR.
  • the respective value of average SINR is determined as an average of each respective value of SINR at each of the further radio nodes over the further radio nodes.
  • Each respective value of average SINR for all resources of the amount of resources are included in a set of values of average SINR.
  • the radio node selects at least one resource out of the amount of resources.
  • the respective value of average SINR for the selected at least one resource is among the greatest of the set of values of average SINR.
  • the radio node may have selected the at least one resource for which the average SINR over the further radio nodes, i.e. neighbouring radio nodes, is the greatest, or almost greatest.
  • each radio node in the ad-hoc radio communication network applies the same method for selection of the at least one resource as described according to embodiments herein.
  • Some of the proposed methods achieve high spatial resource utilizations which translate into gain in the number of discovered devices.
  • Other proposed methods achieve increased average SINR which translate into improved radio conditions for beacons signals.
  • D2D discovery may be improved.
  • Figure 1 is a schematic overview of an exemplifying ad-hoc radio
  • FIG 2 is a schematic, combined signaling scheme and flowchart illustrating embodiments of the methods when performed in the radio communication system according to Figure 1 ,
  • FIG. 3 is a timing scheme illustrating embodiments herein,
  • Figure 4 is a flowchart illustrating embodiments of the method in the radio network node.
  • FIG. 5 is a block diagram illustrating embodiments of the radio network node.
  • Figure 1 depicts an exemplifying ad-hoc radio communication network
  • the radio communication network 100 is a Long Term Evolution (LTE) system.
  • the radio communication network may be any Third Generation
  • the ad-hoc radio communication network 100 may, or may not, be within coverage of a radio network node (not shown).
  • the radio network node may be a radio base station, an eNB, a radio network controller, a base station controller or the like.
  • a radio node 110 may be located in the vicinity of the ad-hoc communication network 100. As will be explained below the radio node 110 may wish to join the ad- hoc radio communication network 100.
  • the ad-hoc radio communication network 100 comprises a number of further radio nodes 120, 130, 140.
  • the term "radio node” may refer to an evolved Node B (eNB), a control node controlling one or more Remote Radio Units (RRUs), a radio base station, an access point or the like.
  • the term "radio node” may refer to a user equipment, a mobile phone, a cellular phone, a Personal Digital Assistant (PDA) equipped with radio communication capabilities, a smartphone, a laptop or personal computer (PC) equipped with an internal or external mobile broadband modem, a tablet PC with radio communication capabilities, a portable electronic radio communication device, a sensor device equipped with radio communication capabilities or the like.
  • the sensor may be any kind of weather sensor, such as wind, temperature, air pressure, humidity etc.
  • the sensor may be a light sensor, an electronic switch, a microphone, a loudspeaker, a camera sensor etc.
  • the radio node 110 may be referred to as a first radio node and each of the further radio nodes 120, 130, 140 may be referred to as a second radio node 120, a third radio node 130 and a fourth radio node 140, respectively.
  • the first radio node 1 10 may be about to join the ad-hoc radio communication network 100. Therefore, the first radio node 110 may send and receive 150, 151 , 152 beacon signals, or beacons for short, in communication with the second radio node 120, the third radio node 130 and/or the fourth radio node 140.
  • the second, third and fourth radio nodes 120, 130, 140 may have already joined the ad-hoc radio communication network 100. Therefore, in order to discover the first radio node 1 10 and to be discovered by the first radio node 1 10, the second, third and fourth radio nodes 120, 130, 140 may additionally send and receive 153, 154 beacons. Moreover, sending and receiving 155 of beacons between the second and third radio node 120, 130, 140 are also shown. In essence, this means that the beacon signals are transmittable between any of the radio node 1 10 and the further radio nodes 120, 130, 140.
  • the first, second, third and fourth radio nodes 110, 120, 130, 140 are assumed to be randomly located, or placed, in some geographical area within which D2D communication is deemed possible.
  • Each of the first, second, third and fourth radio nodes 110, 120, 130, 140 is aware of a default set of resources that are dedicated for transmission of beacon signals for D2D discovery.
  • the default set of resources may be preconfigured in each radio node 1 10, 120, 130, 140.
  • Each radio node 110, 120, 130, 140 may use any PDR of the default set of resources for broadcasting of beacon signals.
  • Such pre-configuration may be achieved by a network node, e.g. an eNB of an LTE system, a base station or the like, that allocates and broadcasts the default set of resources, aka a set of PDRs, based on the density of the UEs.
  • density of the UEs refers to how sparse or compactly the UEs are located from each other.
  • the default set of resources may be based on which method shall be used for selection of a particular PDR for beacon signaling.
  • the set of PDRs that may be used according to embodiments herein may for example be different from a further predefined set of PDRs that may be used when the first and/or second technique, described in the background section, is implemented.
  • the information broadcasted in the beacon signal helps other nodes of the ad-hoc radio communication network 100 to select their PDR to broadcast their respective beacon signals.
  • a resource may refer to a certain coding of a beacon signal and/or a time frame and/or a frequency range in which the beacon signal is transmitted.
  • a resource may refer to one or more physical resource blocks (PRB) which are used when transmitting the beacon signal.
  • PRB may be in the form of orthogonal frequency division multiplexing
  • OFDM OFDM PHY resource blocks
  • PRB Physical resource block
  • All of the first, second, third and fourth radio nodes 1 10, 120, 130, 140 may preferably use the same transmission power level to broadcast their respective beacon signal.
  • the transmission power level may be set either by a network node and/or a default transmit power level may have been preconfigured in each radio node 110, 120, 130, 140.
  • the radio node 110, 120, 130, 140 may be globally synchronized using an external device, e.g. a WCDMA base station, an LTE eNB or a common external timing source, e.g. satellites of the Global Positioning System (GPS).
  • GPS Global Positioning System
  • each radio node 1 10, 120, 130, 140 may be discovered if a beacon signal received from it reaches or exceeds a threshold value for discovery, which threshold value may for example specify a Signal-to-lnterference-and-Noise ratio (SINR).
  • SINR Signal-to-lnterference-and-Noise ratio
  • the threshold value for discovery may depend on receiver sensitivity, employed modulation and coding scheme of the beacon signal and other factors.
  • the threshold value for discovery may be predefined to e.g. 1 dB. A higher threshold value imply better conditions in terms of chance of correctly receiving the beacon signal, but the higher the threshold value is the shorter a so called discovery range may be.
  • the discovery range refers to a maximum distance between any two radio nodes at which the two radio nodes still are able to discover each other.
  • the methods maximize, or at least increase, resource utilization, such as in terms of minimizing, or at least reducing, the number of resources used as PDRs.
  • a number of discovered devices may be increased thanks to the methods described herein.
  • the radio node 110 may transmit beacon signals in certain predetermined frames and only in some peer discovery resources selected as described herein. Furthermore each node measures on each resource the received signals. These measurements may be used to identify the less used resources in their neighborhood and hence select one of them to reduce the inferences or to inform the neighboring nodes about the used resources so that they can adaptively adjust the peer discovery resources in which they may transmit beacons.
  • Figure 2 illustrates an exemplifying method for managing resources for D2D discovery when implemented in the radio communication network 100 of Figure 1.
  • the resources comprise an amount of resources that are dedicated for transmission of beacon signals for D2D discovery. The amount of resources may be less than or equal to the number of further radio nodes 120, 130, 140.
  • Action 201 The following actions may be performed in any suitable order. Action 201
  • the radio node 1 10 receives a respective beacon signal from each of the further radio nodes 120, 130, 140.
  • the respective beacon signal includes values indicating power received at the respective further radio node 120, 130, 140 for each resource of the amount of resources. The values will be used in action 202.
  • the radio node 110 Since the radio node 110 now is aware of power received at its neighbours, the radio node 110 calculates, for each respective further radio node 120, 130, 140, values of SINR based on the values indicating power received at the respective further radio node 120, 130, 140.
  • the values of SINR include a respective value of SINR for each resource of the amount of resources.
  • the respective value of SINR is calculated as if said each resource is used by the radio node 110 for broadcasting of beacon signals.
  • the radio node 1 10 provides estimates of SINR for each possible choice of resource.
  • the radio node 1 10 may estimate SINR, based on beacons, i.e. the values indicating power received included in the beacon, which would be received by each of its neighbors when using each peer discovery resource.
  • the beacons are received from the radio node's 1 10 neighbors during a listening phase as in action 207. Assuming that nodes use the same transmission power for discovery beacons a node- is able to estimate the path loss to a distant node-/ and so deduces its approximate SINR on each peer discovery resource. Channel reciprocity is assumed for the estimation of path loss.
  • the SINR of node- received by a neighboring node-/ on resource-/ ⁇ as calculated in node-i is determined by:
  • Eq. 1 expresses action 202 while using mathematical formulas.
  • the radio node 1 10 is the node Node-i. S 1 ( f)
  • the signal power may be given by a Received Signal Strength Indicator (RSSI).
  • RSSI Received Signal Strength Indicator
  • N k is a set of radio nodes assigned to the resource k before radio node i attempts to join, or has joined, the ad-hoc radio communication network 100.
  • Actions 203 and 204 or actions 205 and 206 are performed in the following.
  • the actions 203 and 204 illustrate the first embodiments and the actions 205 and 206 illustrate the second embodiments.
  • the radio node 110 selects at least one resource out of the amount of resources to increase number of discovering further radio nodes 120, 130, 140 according to the first embodiments or to increase average SINR over the further radio nodes 120, 130, 140 according to the second
  • the radio node 1 10 calculates, for said each resource, a respective number of further radio nodes 120, 130, 140 that are capable of discovering the radio node 1 10 by comparing the respective value of SINR to a threshold for discovery of the radio node 110.
  • Each respective number for all resources of the amount of resources are included in a set of numbers indicating further radio nodes 120, 130, 140 that are capable of discovering the radio node 1 10. This action is similar to action 203.
  • the radio node 110 selects at least one resource out of the amount of resources.
  • the respective number of further radio nodes 120, 130, 140 is among the greatest of the set of numbers indicating further radio nodes 120, 130, 140.
  • the amount of further radio nodes 120, 130, 140 that discovers the radio node 1 10 is at least almost maximized. At least almost maximized may be given by a criterion that the respective number of further radio nodes 120, 130, 140 of the selected at least one resource may be above a first threshold value indicating a desired number of discovering further radio nodes 120, 130, 140.
  • the first embodiments aims at 'at least almost maximizing' the number of the discovering radio nodes i.e. the number of further radio nodes that successfully decode the radio node's 1 10 beacon signal.
  • the radio node 1 10 that joins the network 100 has to estimate for each PDR the number of the nodes that would receive the beacon with an SI NR above the threshold for discovery when using this resource to send the beaconing signals on.
  • an indicator function is defined by:
  • SINR k ' (j) is the SI NR of Node-/ ' received by a Neighbor-y when using the resource-Zc
  • the Node-/ ' selects the PDR (/) such that: th
  • r denotes the threshold for discovery, or the discovery threshold.
  • the summation of Eq. 3 includes all nodes that use Resource-k.
  • the radio node 1 10 calculates, for each resource, a respective value of average SI NR.
  • the respective value of average SIN R is determined as an average of each respective value of SI NR at each of the further radio nodes 120, 130, 140 over the further radio nodes.
  • Each respective value of average SI NR for all resources of the amount of resources are included in a set of values of average SI NR.
  • the radio node 1 10 will select a resource based on its respective value of average SI NR.
  • the calculation of the values of average SI NR received by further radio nodes 120, 130, 140 for each possible choice of resource for the radio node 1 10 is used in action 206 to select the at least one resource to actually be used for broadcasting the beacon signals of radio node 1 10.
  • PDR(z) argmax(£/N3 ⁇ 4 F ⁇ ) , wherein SINR AV ⁇ k denotes average SI NR on Resource-Zf over all nodes that use Resource-Zc. This means that the selected at least one resource may be given by:
  • the radio node 110 selects at least one resource out of the amount of resources.
  • the respective value of average SINR is among the greatest of the set of values of average SINR.
  • average SINR over the further radio nodes 120, 130, 140 is at least almost maximized. At least almost maximized may be given by a criterion that the respective value of average SINR of the selected at least one resource may be above a second threshold value indicating a desired average SINR for the further radio nodes 120, 130, 140.
  • the embodiments including actions 205 and 206 may be referred to as embodiments relating to average SINR, or sometimes maximizing, or increasing, average SINR.
  • the radio node 110 i.e. a newly joining device
  • the radio nodes 120, 130, 140 e.g. any neighboring devices.
  • the radio node 1 10 By achieving higher average SINR, i.e. averaging over the receiving neighbors, the radio node 1 10 increases its chance of being discovered by its neighbors.
  • actions 203 and 204 or actions 205 and 206 may be performed.
  • the radio nodes may cooperate by periodically exchanging local measurements performed individually.
  • each device already present in the ad-hoc network 100 and continuously transmitting a beacon measures the detected energy on each peer discovery resource.
  • measurements such as the total received signal strength per PDR and/or the SINR per detected neighbor and per PDR, are included into the beacon and periodically reported to all the further radio nodes 120, 130, 140.
  • the radio node 1 10 may measure power received at the radio node 1 10 for each resource of the amount of resources, to obtain values indicating power received at the radio node 1 10. This is referred to as "listening phase" herein.
  • the radio node 1 10 increases its local knowledge within its neighborhood, for example within a so called two-hop neighborhood.
  • the radio node 1 10 may include the values into a further beacon signal which will be broadcast in action 209.
  • the radio node 1 10 broadcasts, to the further radio nodes 120, 130, 140, the further beacon signal on the selected at least one resource. Thanks to that the further beacon signal includes the obtained values, the further radio nodes 120, 130, 140 may be informed about radio conditions at the radio node 110, as given by the obtained values. Hence, each of the further radio nodes 120, 130, 140 may apply the first embodiments and/or the second embodiments by use of the values included in the further beacon signal.
  • the respective beacon signal may include an indication of at least one resource of the amount of resources that the respective further radio node 120, 130, 140 has determined to be selectable, or non-selectable, as the at least one resource that is selected in action 204.
  • the radio node 110 may further select, as in action 204, the at least one resource based on the indication.
  • selectable resources these selectable resources may be regarded as particularly recommended as being selected as PDRs.
  • the indication may include a set of
  • the radio node 110 only performs measurements, e.g. action 207, and/or calculations, e.g. action 202, 203 and/or 205 for each resource of the set of recommended PDRs.
  • the radio node 1 10 may select the discovery resources PDRs based on recommendations from neighboring nodes, i.e. the indication above. For this, the radio node 110 computes, based on beacon signals received from the further radio nodes 120, 130, 140 the received signals, i.e.
  • the radio node 1 10 includes the recommendations in its beacons to report them to its neighbors. In turn, these neighbors may forward the recommendations in beacon signals to their neighbors.
  • a new node when joining the network and after collecting information included in all the received beacons during the listening phase aggregates all the recommendations and picks the resource that maximizes the number of the discovering devices.
  • the embodiments described in this section may, in addition to the radio node 110, be applied to any one or more of the further radio nodes 120, 130, 140 that already are comprised in the ad-hoc radio communication network 100.
  • These further radio nodes 120, 130, 140 may already use certain PDRs for transmission of their beacon signals.
  • the further radio nodes 120, 130, 140 may need to, or may decide to reselect the PDR they will use in upcoming, i.e. future, Peer Discovery Frames (PDF).
  • PDF Peer Discovery Frames
  • Such reselection is triggered by a device when it experiences a total received signal energy, on the PDR that it is currently using for transmitting its own beacons, that is greater than a threshold value for re-selection.
  • FIG 3 shows Peer Discover Frames (PDF) and Peer Discovery Resources (PDR). PDFs are typically used with a low duty cycle out of all available radio frames, such as OFDM frames or LTE frames of 10 ms. In the example of Figure 3, there is only two PDFs out of 100 (not shown) radio frames during a 1 s time interval, i.e. 100 x 10 ms. Within each PDF, a subset of the available OFDM PHY resource blocks (PRBs) is used for peer discovery (beacon signaling) purposes (small black square). In this example, it is assumed that the radio node 110 would transmit a beacon signal for the duration of 1 ms. Notably, Figure 3 is schematic, number of rows and columns in the frames are merely illustrative, not actual. Autonomous Peer Discovery
  • a device When joining a network (or moving to a new position), such as the ad-hoc communication network 100, a device, such as the radio node 1 10, may wish to be discovered by other nodes. Therefore, the device may have to select at least one PDR out of the available resources in a Peer Discovery Frame (PDF) to transmit a beacon. If the node also wishes to discover the surrounding devices, it has to listen in the remaining resources to receive the discovery signals from other devices.
  • PDF Peer Discovery Frame
  • the radio node 110 In case the number of further radio nodes, exceeds, or is equal to, the amount of resources in the PDF, the radio node 110, which is about to join the ad-hoc network, will have to reuse resources used by one or more of the further radio nodes 120, 130, 140. In such a case, if the radio nodes sharing the same resources keep sending on each Peer Discovery Frame (PDF) they will not be able to detect each other since the radio node 110 cannot detect a beacon signal on a PDR while simultaneously transmitting on that PDR. To overcome this problem, the radio node 1 10 has to select only some of the frames to broadcast beacon signals in. Instead, the radio node 1 10 will be in a listening mode (not sending beacon signals) during other PDFs. This could be done for example by setting a certain transmission probability Ptr on each PDF.
  • PDF Peer Discovery Frame
  • the radio node 1 10 may "flip a coin", i.e. randomly select out of 2 possible outcomes: listening or broadcast of beacon signal. Hence, broadcast of the beacon signal in that specific peer discovery frame is allowed with a probability Ptr. If the radio node 110 decides to transmit a beacon in that frame, it autonomously selects one peer discovery resource as described in action 204 or 206.
  • the radio node 1 10 determines which PDR out of the available ones in the PDF to use when the radio node 110 decides to actually broadcast the beacon signal in action 209 in that particular PDF. Notably, whether or not to actually broadcast the beacon signal may be performed according to the transmission probability mentioned above.
  • the radio node 1 10 performs a method for managing resources for D2D discovery in an ad-hoc radio communication network 100.
  • the ad-hoc radio communication network 100 comprises a number of further radio nodes 120, 130, 140.
  • the resources comprise an amount of resources that are dedicated for transmission of beacon signals for D2D discovery.
  • the amount of resources may be less than or equal to the number of further radio nodes 120, 130, 140.
  • the radio node 110 receives beacon signals from the number of further radio nodes 120, 130, 140.
  • the beacon signals include a respective beacon signal from a respective further radio node 120, 130, 140 of the further radio nodes 120, 130, 140.
  • the respective beacon signal includes values indicating power received at the respective further radio node 120, 130, 140 for each resource of the amount of resources. This action is similar to action 201.
  • the radio node 110 calculates, for each respective further radio node 120, 130, 140, values of SINR based on the values indicating power received at the respective further radio node 120, 130, 140.
  • the values of SINR include a respective value of SINR for each resource of the amount of resources.
  • the respective value of SINR is calculated as if said each resource is used by the radio node 1 10 for broadcasting of beacon signals. This action is similar to action 202. Action 403 or 404 is performed in the following.
  • the radio node 110 calculates, for said each resource, a respective number of further radio nodes 120, 130, 140 that are capable of discovering the radio node 1 10 by comparing the respective value of SINR to a threshold for discovery of the radio node 110.
  • Each respective number for all resources of the amount of resources are included in a set of numbers indicating further radio nodes 120, 130, 140 that are capable of discovering the radio node 110. This action is similar to action 203. Action 404
  • the radio node 110 calculates, for said each resource, a respective value of average SINR.
  • the respective value of average SINR is determined as an average of each respective value of SIN R at each of the further radio nodes 120, 130, 140 over the further radio nodes, wherein each respective value of average SINR for all resources of the amount of resources are included in a set of values of average SINR. This action is similar to action 205.
  • the radio node 110 selects at least one resource out of the amount of resources. This action is similar to action 204 or 206.
  • the respective number of further radio nodes 120, 130, 140 for the selected at least one resource is among the greatest of the set of numbers indicating further radio nodes 120, 130, 140.
  • the respective number of further radio nodes 120, 130, 140 of the selected at least one resource may be above a first threshold value indicating a desired number of discovering further radio nodes 120, 130, 140.
  • action 405 is similar to action 204.
  • the respective value of average SINR for the selected at least one resource is among the greatest of the set of values of average SINR.
  • the respective value of average SINR of the selected at least one resource may be above a second threshold value indicating a desired average SINR for the further radio nodes 120, 130, 140.
  • action 405 is similar to action 206.
  • the radio node 110 may measure power received at the radio node 1 10 for each resource of the amount of resources, to obtain values indicating power received at the radio node 1 10. This action is similar to action 207.
  • the radio node 110 may include the values into the further beacon signal. This action is similar to action 208. Action 408
  • the radio node 1 10 broadcasts, to the further radio nodes 120, 130, 140, a further beacon signal on the selected at least one resource.
  • This action is similar to action 209.
  • the respective beacon signal may include an indication of at least one resource of the amount of resources that the respective further radio node 120, 130, 140 has determined to be selectable, or non-selectable, as at least one resource.
  • the selecting of the at least one resource further is based on the indication. See sections "recommendations" above.
  • the radio node 110 is configured to perform the methods in Figure 2 and/or 4.
  • the radio node 1 10 configured to manage resources for D2D discovery in an ad-hoc radio communication network 100.
  • the ad-hoc radio communication network 100 comprises a number of further radio nodes 120, 130, 140.
  • the resources comprise an amount of resources that are dedicated for transmission of beacon signals for D2D discovery.
  • the amount of resources may be less than or equal to the number of further radio nodes 120, 130, 140.
  • the radio node 1 10 comprises a processing circuit 510 configured to receive beacon signals from the number of further radio nodes 120, 130, 140.
  • the beacon signals include a respective beacon signal from a respective further radio node 120, 130, 140 of the further radio nodes 120, 130, 140.
  • the respective beacon signal includes values indicating power received at the respective further radio node 120, 130, 140 for each resource of the amount of resources.
  • the processing circuit 510 is further configured to calculate, for each respective further radio node 120, 130, 140, values of SINR based on the values indicating power received at the respective further radio node 120, 130, 140.
  • the values of SINR include a respective value of SINR for each resource of the amount of resources. The respective value of SINR is calculated as if said each resource is used by the radio node 110 for broadcasting of beacon signals.
  • the processing circuit 510 is configured to calculate, for said each resource, a respective number of further radio nodes 120, 130, 140 that are capable of discovering the radio node 1 10 by comparing the respective value of SINR to a threshold for discovery of the radio node 110, wherein each respective number for all resources of the amount of resources are included in a set of numbers indicating further radio nodes 120, 130, 140 that are capable of discovering the radio node 110.
  • the processing circuit 510 is configured to calculate, for said each resource, a respective value of average SINR.
  • the respective value of average SINR is determined as an average of each respective value of SINR at each of the further radio nodes 120, 130, 140 over the further radio nodes.
  • Each respective value of average SINR for all resources of the amount of resources are included in a set of values of average SINR.
  • the processing circuit 510 is configured to select at least one resource out of the amount of resources.
  • the respective number of further radio nodes 120, 130, 140 for the selected at least one resource is among the greatest of the set of numbers indicating further radio nodes 120, 130, 140.
  • the respective number of further radio nodes 120, 130, 140 of the selected at least one resource may be above a first threshold value indicating a desired number of discovering further radio nodes 120, 130, 140.
  • the respective value of average SINR for the selected at least one resource is among the greatest of the set of values of average SINR.
  • the respective value of average SINR of the selected at least one resource may be above a second threshold value indicating a desired average SINR for the further radio nodes 120, 130, 140.
  • the processing circuit 510 is also configured to broadcast, to the further radio nodes 120, 130, 140, a further beacon signal on the selected at least one resource.
  • the processing circuit 510 may further be configured to measure power received at the radio node 1 10 for each resource of the amount of resources, to obtain values indicating power received at the radio node 110, and to include the values into the further beacon signal.
  • the processing circuit 510 may be a processing unit, a processor, an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or the like.
  • ASIC application specific integrated circuit
  • FPGA field-programmable gate array
  • a processor, an ASIC, an FPGA or the like may comprise one or more processor kernels, or processor cores.
  • the respective beacon signal includes an indication of at least one resource of the amount of resources that the respective further radio node 120, 130, 140 has determined to be selectable, or non-selectable, as at least one resource.
  • the processing circuit 510 further is configured to select the at least one resource based on the indication.
  • the radio node 1 10 further comprises a transmitter 520, which may be configured to send one or more beacon signals, measurement values, parameters, messages or the like as described herein.
  • the radio node 1 10 further comprises a receiver 530, which may be configured to receive one or more beacon signals, measurement values, parameters, messages or the like as described herein.
  • the radio node 1 10 further comprises a memory 540 for storing software to be executed by, for example, the processing circuit.
  • the software may comprise instructions to enable the processing circuit to perform the method in the radio node 110 as described above in conjunction with Figure 2 and/or 6.
  • the memory may be a hard disk, a magnetic storage medium, a portable computer diskette or disc, flash memory, random access memory (RAM) or the like.
  • the memory may be an internal register memory of a processor.
  • number may be any kind of digit, such as binary, real, imaginary or rational number or the like. Moreover, “number”, “value” may be one or more characters, such as a letter or a string of letters. Further, “number”, “value” may also be represented by a bit string.

Landscapes

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

Abstract

La présente invention concerne un nœud (110) radio destiné à gérer des ressources de découverte D2D dans un réseau (100) de radiocommunication ad hoc. Le nœud (110) radio reçoit des signaux de balise provenant d'un certain nombre d'autres nœuds (120, 130, 140) radio. Un signal de balise respectif comprend des valeurs indiquant la puissance reçue au niveau de l'autre nœud (120, 130, 140) radio respectif pour chaque ressource de la quantité de ressources. Le nœud (110) radio calcule, pour chaque autre nœud (120, 130, 140) radio respectif, des valeurs de SINR en fonction des valeurs indiquant la puissance reçue au niveau de l'autre nœud (120, 130, 140) radio respectif. Le nœud (110) radio sélectionne au moins une ressource parmi la quantité de ressources pour augmenter le nombre de découverte d'autres nœuds (120, 30, 140) radio respectifs et/ou augmenter le SINR moyen sur les autres nœuds (120, 130, 40) radio. Le nœud (110) radio diffuse un autre signal de balise sur la ou les ressources sélectionnées. Désignés pour publication : Fig. 21
EP13741864.6A 2013-06-27 2013-06-27 Procédé et noeud radio destinés à gérer des ressources pour la découverte de dispositif à dispositif dans un réseau de radiocommunication ad hoc Not-in-force EP3014936B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/SE2013/050798 WO2014209181A1 (fr) 2013-06-27 2013-06-27 Procédé et nœud radio destinés à gérer des ressources pour la découverte de dispositif à dispositif dans un réseau de radiocommunication ad hoc

Publications (2)

Publication Number Publication Date
EP3014936A1 true EP3014936A1 (fr) 2016-05-04
EP3014936B1 EP3014936B1 (fr) 2017-05-17

Family

ID=48875122

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13741864.6A Not-in-force EP3014936B1 (fr) 2013-06-27 2013-06-27 Procédé et noeud radio destinés à gérer des ressources pour la découverte de dispositif à dispositif dans un réseau de radiocommunication ad hoc

Country Status (3)

Country Link
US (1) US9949281B2 (fr)
EP (1) EP3014936B1 (fr)
WO (1) WO2014209181A1 (fr)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20180011871A (ko) * 2013-09-27 2018-02-02 코닌클리즈케 케이피엔 엔.브이. 공공 안전시스템
CN104640172A (zh) * 2013-11-08 2015-05-20 电信科学技术研究院 D2d发现信号的发送方法和发送装置
EP3304988B1 (fr) * 2015-07-06 2020-10-28 Huawei Technologies Co., Ltd. Dispositifs et procédés de communication d2d assistée par réseau
US9825840B2 (en) * 2015-07-17 2017-11-21 Qualcomm Incorporated Link-quality-based resource allocation in device-to-device communications
CN106488385B (zh) * 2015-08-31 2019-08-30 电信科学技术研究院 一种设备间系统的小区资源分配方法及装置
US10320902B2 (en) * 2016-08-31 2019-06-11 Apple Inc. Detecting asymmetric awareness in peer-to-peer protocol
CN108632787B (zh) * 2017-03-23 2023-05-23 中兴通讯股份有限公司 群组间通信方法及装置，资源配置方法、装置以及系统
US10764946B2 (en) * 2017-05-09 2020-09-01 Vivint Wireless, Inc. Autonomous mesh topology
US10356843B1 (en) * 2017-05-26 2019-07-16 L3 Technologies, Inc. Frequency band control algorithm
CN112804665B (zh) * 2021-01-13 2022-06-14 浙江传媒学院 基于d2d协同计算网络构建方法

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006191533A (ja) 2004-12-09 2006-07-20 Matsushita Electric Ind Co Ltd 通信端末装置、制御局及びマルチキャリア通信方法
JP4976419B2 (ja) * 2006-01-11 2012-07-18 クゥアルコム・インコーポレイテッド 無線ピア・ツー・ピアネットワークにおける無線装置発見
JPWO2008114510A1 (ja) * 2007-03-19 2010-07-01 パナソニック株式会社 無線通信基地局装置および無線通信方法
US8396035B2 (en) 2009-04-24 2013-03-12 Futurewei Technologies, Inc. System and method for communications using time-frequency space enabled coordinated beam switching
WO2010143804A1 (fr) 2009-06-09 2010-12-16 Lg Electronics Inc. Méthode et dispositif d'émission et réception de données dans un réseau sans fil
JP5359735B2 (ja) 2009-09-28 2013-12-04 富士通モバイルコミュニケーションズ株式会社 移動通信端末、及び移動通信端末のセルサーチ制御プログラム
CN102687561B (zh) * 2009-12-30 2015-07-08 诺基亚公司 用于自主的ofdma信标接收测量的方法及装置
JP5576936B2 (ja) 2010-06-09 2014-08-20 パナソニック株式会社 通信端末、制御装置、通信方法、制御方法、プログラム、及び集積回路
JP5463419B2 (ja) * 2011-02-16 2014-04-09 パナソニック株式会社 無線通信装置
US9125101B2 (en) * 2013-03-08 2015-09-01 Intel Corporation Distributed power control for D2D communications
US9294951B2 (en) * 2013-06-06 2016-03-22 Intel Deutschland Gmbh Method for joint cell measurement and system information identification

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2014209181A1 *

Also Published As

Publication number Publication date
EP3014936B1 (fr) 2017-05-17
US9949281B2 (en) 2018-04-17
US20160135201A1 (en) 2016-05-12
WO2014209181A1 (fr) 2014-12-31

Similar Documents

Publication Publication Date Title
US9949281B2 (en) Method and radio node for managing resources for D2D discovery in an ad-hoc radio communication network
US9907081B2 (en) Managing resources for device-to-device D2D discovery in an ad-hoc radio communication network
US10834615B2 (en) Beam selection in millimeter wave systems
CN109302720B (zh) 一种选择波束的方法及设备
KR102181447B1 (ko) 시스템 정보를 전송하는 방법, 기지국, 단말 및 시스템
KR101843938B1 (ko) 이웃 인지 네트워크를 위한 개선된 트리거 프레임 기반 발견
US10045302B2 (en) Power control in wireless networks
TWI631836B (zh) 使用無線電存取網路來對wi-fi和未授權頻帶進行通道可用性協調
US9479918B2 (en) Methods, computer program products and apparatuses enabling to improve network controlled discovery in mobile communication networks
US20160234670A1 (en) Device-to-device synchronization method and apparatus for partial coverage
US20140328192A1 (en) Methods and systems for communication in dense wireless environments
US10039052B2 (en) Anchor assisted communication channel hopping
US11317418B2 (en) Communication method and communication apparatus
US20160338086A1 (en) Anchor assisted communication channel hopping
WO2018063051A1 (fr) Réseau, noeud de réseau, équipement d'utilisateur et procédé pour établir des relations de voisinage entre un faisceau en mode actif et des cellules en mode inactif dans un réseau de communication sans fil
TW201815194A (zh) 通訊方法、終端裝置和網路裝置
US9998930B2 (en) Anchor assisted communication channel hopping
WO2016186875A2 (fr) Saut de canal de communication assisté par ancrage
WO2021156994A1 (fr) Dispositif terminal, dispositif de station de base, et procédé de communication sans fil
WO2022073173A1 (fr) Techniques de détection et d'évitement de l'effet ping-pong pour la resélection de cellules

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

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20170105

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 24/00 20090101ALN20161219BHEP

Ipc: H04W 84/18 20090101ALN20161219BHEP

Ipc: H04W 48/16 20090101ALN20161219BHEP

Ipc: H04W 72/02 20090101AFI20161219BHEP

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

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 895487

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170615

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602013021276

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 895487

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170517

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602013021276

Country of ref document: DE

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

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

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

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20180228

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

26N No opposition filed

Effective date: 20180220

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

Ref country code: LU

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

Effective date: 20170627

Ref country code: CH

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

Effective date: 20170630

Ref country code: LI

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

Effective date: 20170630

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

Ref country code: FR

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

Effective date: 20170717

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

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20170630

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

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

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

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

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

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

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

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

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

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

Ref country code: DE

Payment date: 20210629

Year of fee payment: 9

Ref country code: NL

Payment date: 20210626

Year of fee payment: 9

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

Ref country code: GB

Payment date: 20210628

Year of fee payment: 9

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602013021276

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20220701

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

Effective date: 20220627

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

Effective date: 20220701

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

Ref country code: GB

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

Effective date: 20220627

Ref country code: DE

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

Effective date: 20230103