Movatterモバイル変換


[0]ホーム

URL:


EP3105956B1 - Method, a node, computer program and computer program product for adapting radio coordination schemes - Google Patents

Method, a node, computer program and computer program product for adapting radio coordination schemes
Download PDF

Info

Publication number
EP3105956B1
EP3105956B1EP14710659.5AEP14710659AEP3105956B1EP 3105956 B1EP3105956 B1EP 3105956B1EP 14710659 AEP14710659 AEP 14710659AEP 3105956 B1EP3105956 B1EP 3105956B1
Authority
EP
European Patent Office
Prior art keywords
radio
node
radio coordination
scheme
transport
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
EP14710659.5A
Other languages
German (de)
French (fr)
Other versions
EP3105956A1 (en
Inventor
Balázs VARGA
Mats Forsman
Shahryar KHAN
Lars Peter PEHRSON
Tomas Thyni
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 ABfiledCriticalTelefonaktiebolaget LM Ericsson AB
Publication of EP3105956A1publicationCriticalpatent/EP3105956A1/en
Application grantedgrantedCritical
Publication of EP3105956B1publicationCriticalpatent/EP3105956B1/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Images

Classifications

Definitions

Landscapes

Description

    TECHNICAL FIELD
  • The present technology relates to a method and a node for adapting Radio Coordination schemes in a communication network for wireless communication, especially in transport network.
  • BACKGROUND
  • Radio Coordination schemes (where COMP, Co-Ordinated Multi Point is one set of Radio coordination) puts additional challenges on the transport network as it puts requirements on transport characteristics, e.g. bandwidth, delay, jitter, sync accuracy, etc. Depending on the characteristics of the transport network, influenced by e.g. transport network topology, the specific radio-coordination schemes between participating Radio Nodes may or may not be possible. Each individual coordination function is a radio coordination scheme. A radio coordination scheme is a radio coordination function, which is similar to a radio coordination feature.
  • Radio Coordination schemes that has similar transport characteristics requirements can be grouped. Within a group, the Radio Coordination schemes work within a transport characteristics range, but some radio coordination schemes needs tuning within the range, but outside the characteristics range a different group of Radio Coordination schemes need to be selected.
  • One problem arises when the transport characteristics for a Radio Coordination scheme is "out of range", the radio performance gain is none or can even be negative i.e. the radio performance with Radio Coordination active is less than without it. Therefore Radio Coordination scheme related configuration of Radio Nodes need careful design. However such a design is quite complicated as Radio Coordination relation between neighbouring Radio Nodes are quite dynamic. Neighbouring radio nodes (RBS) are nodes that a single UE can hear, e.g. located between at least two RBSes.
  • An existing solution for Radio Coordination schemes is static pre-configuration of them, see e.g.US 2006/045117, A1. Static pre-configuration of Radio Coordination schemes in Radio Nodes per neighbour relationship means that transport characteristics needs to be known and defined in advance and thus set with such a margin that it avoids to be out-of range. FromUS 2011/136494, A1, is known an inter-cell coordination method based on broadcasting interference coordination information between neighbouring base stations. FromUS 2009/316585, A1, is known wireless nodes that can configure themselves into a balanced and optimized wireless network. Wo2013/113266, A1, discloses a self-organizing network SON coordination method. Thus, it is not possible to follow transport network characteristics changes and optimize Radio Coordination scheme configuration on the fly.
  • SUMMARY
  • The object of the following disclosure is to provide a solution of the problem how to select and/or adapt the configuration of Radio Coordination schemes to transport network characteristics for maximizing radio performance.
  • This object is achieved by a method and embodiments thereof. The method enables adaption of Radio Coordination schemes to transport network characteristics of a transport network's characteristics of the connection between neighbouring radio nodes. The method comprises steps of detecting new radio neighbours, retrieving transport characteristics values between radio neighbours, validity checking of the active Radio Coordination scheme(s), and updating of Radio Coordination scheme, if necessary, based on the retrieved transport characteristics values of the connection between radio neighbours.
  • Different embodiments of said method are disclosed in the description and independent claims.
  • The object is also achieved by a node and embodiments thereof. The node enables adaption of Radio Coordination schemes to transport network characteristics of a transport network's characteristics of the connection between neighbouring radio nodes. The node comprises processing circuitry operative to detect new radio neighbours, to retrieve transport characteristics values between radio neighbours, to validity check the active Radio Coordination scheme, and to update the Radio Coordination scheme, if necessary, based on the retrieved transport characteristics values of the connection between radio neighbours.
  • Different embodiments of said node are disclosed in the description and independent claims.
  • One advantage is that the method gives a solution for automatic Radio Coordination (i) selection and/or (ii) (re)configuration of Radio coordination settings. Further, the method can ensure best customer quality of experience, i.e. maximized radio performance for a given transport network design and network characteristics through Radio Coordination schemes adaptation to changes in transport network characteristics.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The foregoing, and other, objects, features and advantages of the present invention will be more readily understood upon reading the following detailed description in conjunction with the drawings in which:
    • Figure 1 is a flowchart illustrating one example of a method;
    • Figure 2 is a flowchart illustrating an embodiment of the exemplified method infigure 1;
    • Figure 3 is a flowchart illustrating further one embodiment of the exemplified method infigure 1;
    • Figure 4 is a flowchart illustrating further an embodiment of the exemplified method infigure 1;
    • Figure 5 is a flowchart illustrating just another embodiment of the exemplified method infigure 1;
    • Figure 6 is a block diagram illustrating an example of a transport telecommunications network;
    • Figure 7 is a block diagram illustrating one embodiment of a node of a transport telecommunications network;
    • Figure 8 is a block diagram illustrating another embodiment of a node of a transport telecommunications network.
    DETAILED DESCRIPTION
  • In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular circuits, circuit components, techniques, etc. in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known methods, devices, and circuits are omitted so as not to obscure the description of the present invention with unnecessary detail.
  • The object of the following disclosure is to provide a solution of the problem how to select and/or adapt the configuration of Radio Coordination schemes to transport network characteristics. This will be done together with the existing Radio resource management based selections of schemes.
  • The basic idea is that the Radio Node adapts to the transport networks characteristics of the connection between neighbouring radio nodes.
  • The Radio Node gets information from different sources and source locations about transport network characteristics for its Radio Coordination relations either:
    1. (i) via its own measurement; or
    2. (ii) the characteristics are provided by the transport network node(s); or
    3. (iii) the characteristics are provided by a separate measuring node
    4. (iv) the characteristics are provided by a management node
    5. (v) the characteristics are provided by a control node.
  • Periodic measurement can ensure adaptation/selection of Radio Coordination schemes to changes in the transport network.
  • Figure 1 is a flowchart illustrating an example of a method in a Radio Node. Said method provides adaption of Radio Node Radio Coordination schemes to transport network characteristics. The example comprises following steps:
    • S110: - Detecting new neighbours. The Radio Node detects and reacts when new radio neighbours have been discovered by using ANR and at least one neighbour being a target for Radio Coordination scheme functionality.
    • S120: - Retrieving transport characteristics values between radio neighbour(s). Transport characteristics values between radio neighbour(s) are retrieved, e.g. by using active measurement to/from the radio node, or via information from e.g. transport nodes, or from a separate measurement node. A transport node may be any node, such as Ethernet switches, routers, etc., transporting data from the Radio Base Station site. The Radio Node may further ask, e.g. by sending request messages to connected transport node(s) or another system to provide the transport characteristics towards the Radio Coordination neighbours.
  • Radio Coordination neighbours are the neighbouring radio nodes (RBS) that a single UE can hear and there are possibilities to run radio coordination between these two RBS nodes.
  • Different alternatives of step S120 are presented infigures 2 and3.
  • Step S120 is followed by step S130.
  • S130: - Validity checking of the active Radio Coordination scheme(s). There can also be one or more active scheme at the time. How do we handle this using scheme(s) or describe this in the beginning "the term scheme is used to name one or more schemes". The exemplified method infigure 1 involves a test in S130 whether the active Radio Coordination scheme(s) is the optimal scheme(s), e.g. can better scheme(s) be selected, or characteristics are out of range so a different scheme must be selected, or user is moved out of reach for coordination from one/several neighbouring nodes.
  • If validity check is positive, i.e. measured transport characteristics values are within the range and optimal scheme(s) is/are used, then the method returns to step S110. If validity check is negative, i.e. measured transport characteristics values are out of range, or the optimal scheme(s) is/are not used, then the method executes step S140. An optimal scheme is a scheme providing maximal performance and/or performance improvement.
  • An alternative step S130 is presented infigure 4.
  • S140: - Updating of Radio Coordination scheme, if necessary, based on the measured transport characteristics values.
  • In this step, the Radio Node is configured to update the Radio Coordination scheme(s) to be active during the following period, if necessary. The updating may be performed in different ways. The Radio Nodes may either (i) select a Radio Coordination scheme(s) to be active and/or (ii) (re)configure the active Radio Coordination scheme(s) according to the transport characteristics values, or remove Radio Coordination scheme. Configuration and/or selection of Radio Coordination function(s) can be a local decision of the Radio Node or by involving a remote entity, e.g. management, etc. The selected Radio Coordination scheme depends on relevant transport characteristics, e.g. bandwidth, delay, jitter, sync accuracy etc.
  • One example is if transport network characteristics changes are within the valid range for a specific Radio Coordination scheme/ Radio Coordination scheme group, then only reconfiguration of the active scheme is necessary.
  • Step S140 may involve a dampening function with hysteresis for modifying Radio Coordination scheme settings or change of Radio Coordination method. Modification of Radio Coordination scheme settings or change of Radio Coordination method includes a dampening function with hysteresis to avoid oscillation between and within Radio Coordination schemes.
  • An embodiment of the method is presented infigure 5, wherein an alternative implementation ofstep 140 is presented.
  • Figure 2 is a flowchart illustrating an embodiment of the exemplified method infigure 1.
  • The embodiment comprises an alternative step S120 that involves step S122: -Matching the transport characteristic values towards radio coordination requirements. The Radio Node may be provided by or retrieved from a measurement client that checks and matches the transport characteristics towards the Radio Coordination requirements.
  • According to another embodiment, illustrated in the flowchart offigure 3, step S120 involves:
    • S124: - Measuring transport characteristics between Radio Coordination neighbours. Transport characteristics values between radio neighbour(s) are measured, e.g. by using active measurement to/from the radio node, or via information from e.g. transport nodes, or from a separate measurement node.
  • Figure 4 is a flowchart illustrating another embodiment of the exemplified method infigure 1.
  • The embodiment comprises an alternative step S130 that involves step 132. According to embodiment, step S130 involves:
    • S132: - Checking periodically the validity of the active Radio Coordination scheme. Measured transport characteristics in the transport network may be checked whether they are in the range set by the scheme. Thus, the transport characteristics may be measured periodically in order to be able to update by selecting and/or adapting Radio Coordination schemes. When the transport characteristics towards the Radio Coordination neighbours are measured, as in step S122, said measured values are used in the check. The Radio Node may be provided with a measurement client that checks the transport characteristics towards the Radio Coordination neighbours.
  • An alternative step S130 involving step S134 is presented infigure 5.
  • Figure 5 is a flowchart illustrating another embodiment of the exemplified method infigure 1.
  • The embodiment comprises an alternative step S130 that involves step S134 and S136 and an example of an implementation of S140.
  • According to said embodiment, step S130 involves:
    • S134: - Any radio coordination scheme used?
    • S136: - Maximal performance radio coordination scheme(s) used and optimally configured? As stated above, measured transport characteristics in the transport network may be checked whether they are in the range set by the scheme. Thus, the transport characteristics may be measured periodically in order to be able to update by selecting and/or adapting Radio Coordination schemes. If validity check is positive, "YES", i.e. measured transport characteristics values are within the range and the optimal scheme offering maximal performance is used and configured, then the method returns to step S110. If validity check is negative, "NO", i.e. measured transport characteristics values are out of range, and/or maximal performance scheme is not used or optimally configured, then the method executes step S140.
  • First is a test performed in S142: - Maximal performance Radio Coordination scheme used?
  • If transport network characteristics values are "out of range" for a specific Radio Coordination scheme/ Radio Coordination scheme group, then the test is negative, "NO", a new Radio Coordination scheme from another Radio Coordination scheme group need to (or can) be selected, which is performed in step S144:
    • S144: - Select a Radio Coordination scheme to be active.
  • The currently active Radio Coordination scheme may be to remove for a new selected Radio coordination Scheme, or to continue without any radio coordination.
  • If transport network characteristics changes are within the valid range for a specific Radio Coordination scheme/ Radio Coordination scheme group, then only reconfiguration of the active scheme is necessary. Then the test is positive, "YES", and step S146 is performed:
    • S146: - Reconfigure the active Radio Coordination scheme according to the measured transport characteristic values. Thus, the values of the active Radio Coordination scheme are updated according to the currently measured values.
  • When S140 has been performed, the method returns to step S110.
  • The method and its embodiments may be implemented in digital electronically circuitry, or in computer hardware, firmware, software, or in combinations of them. Apparatus may be implemented in a computer program product tangibly embodied in a machine readable storage device for execution by a programmable processor; and method steps may be performed by a programmable processor executing a program of instructions to perform functions of the provided methods and nodes by operating on input data and generating output.
  • The provided methods and nodes may advantageously be implemented in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program may be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language may be a compiled or interpreted language.
  • Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM (erasable programmable read only memory), EEPROM (electrically erasable programmable read only memory), and flash memory devices; magnetic disks such internal hard disks and removable disks; magneto-optical disks; and CD-ROM (compact Disc Read-only Memory) disks. Any of the foregoing may be supplemented by, or incorporated in, specially -designed ASICs (Application Specific Integrated Circuits).
  • Figure 6 is a block diagram illustrating an example of a transport telecommunications network.
  • The exemplifiedtransport telecommunications network 100 is logically divided into a radio access network (RAN), aggregation network and core network CN.
  • A RAN is that part of a telecommunications network which connects subscribers to their immediate service provider. It is contrasted with the core network, e.g. the Network Switching Subsystems, which connects local providers to each other. A RAN is part of a mobile telecommunication system. It implements a radio access technology. Conceptually, it resides between a device such as a mobile phone, and a computer or any remotely controlled machine for providing connection with its core network (CN). Depending on the standard, mobile phones and other wireless connected devices are varyingly known as user equipment (UE), terminal equipment, mobile station (MS), etc. See the following diagram:
    • Examples of radio access network types are:
      • GRAN: GSM radio access network;
      • GERAN: essentially the same as GRAN but specifying the inclusion of EDGE packet radio services;
      • UTRAN: UMTS radio access network;
      • E-UTRAN: The Long Term Evolution (LTE) high speed and low latency radio access network;
      • CDMA2000
      • Wi-Fi
      • WiMAX
  • It is also possible for a single handset/phone to be simultaneously connected to multiple radio access networks. Handsets capable of this are sometimes called dual-mode or multi-mode handsets. For instance it is common for handsets to support both WIFI, GSM and UMTS ("3G") radio access technologies. Such devices seamlessly transfer an ongoing call between different radio access networks without the user noticing any disruption in service.
  • Aradio access network 100 involves one or more base station, BS,nodes 200, e.g. eNB, NodeB, BTS. One of the biggest changes in LTE topology is the introduction of X2 traffic, where intelligent base stations can transmit information directly to one another, rather than communicating solely with the core network. The backhaul traffic for eNB contains user data for one or more cells, plus traffic forwarded over the X2 interface during handovers, plus overheads for transport protocols and security. X2 traffic is supposed to make handover and rapid coordination of radio resources faster and more efficient by placing the intelligence at the base stations, rather than the core. The X2 interfaces are indicated as dot - dashed line.
  • The eNB is connected to the core network using S1 interface. The S1 interfaces are indicated as double dot - dashed line.
  • As mentioned one basic idea is that the radio node adapts to the transport network's characteristics of the connection between neighbouring nodes. The network path may be the same as X2, but some coordination features uses the logical X2 for the functionality, and others use a different logical interface. The network path can pass multiple switches and routers in the network. In most networks today it goes all the way up to the switching/RNC site, and back out again even if the RBSes are located across the street.
  • In the example offigure 6, the transport telecommunications network comprises access networks RAN1 and RAN2. RAN1 comprises a BS1 that is an eNB serving a number of user equipment UE in a cell Cell1. RAN1 further comprises aggregation nodes AG1 and AG2, and routers BR1 and BR2. RAN1 further comprises a BS2 that may be an eNB serving a number of user equipment UE in a cell Cell2. RAN2 comprises a BS3 that is an eNB serving a number of user equipment UE in a cell Cell3.
  • Base stations BS1 and BS2 are connected within RAN1 via an interface X2 involving aggregation points AG1 and AG2. The base station BS3 in RAN2 is connected to the base stations of RAN1 via interface X2 involving aggregation point AG3 and router BR3.
  • The aggregation network comprises routers BR1, BR2 and BR3, switching site SWS1 with gateway X-GW1, SSPE-1 and SSPE-2, and core routers CR1 and CR2.
  • The Core Network, CN, comprises core routers CR1 and CR2 and switching site SWS2 with gateway X-GW2, SSPE-C1 and SSPE-C2.
  • SW1 is a traditional switch site where the RNC/BSC is located today. SW2 is a traditional core site with PDN-GW, MME etc
  • Figure 7 is a block diagram illustrating one example of a node, preferably a radio node in a communications network, e.g. wireless communications network or telecommunications network.
    Saidnode 100 is configured to adapt Radio Coordination schemes to transport network characteristics. The node comprises at least oneprocessing circuitry 210 comprising aprocessor unit 212 and amemory storage 214. Thenode 200 further comprises aninterface 220 for enabling input andoutput communication 222 with other nodes, etc. Thenode 200 may also comprise computer readable means or computerreadable storage medium 230 on which the computer program is stored. Said means or medium 230 may be fixed in the node or removable.
  • It is understood that said may comprise a different number of computer readable means or computerreadable storage medium 230, and the illustrated number of computer readable means or computerreadable storage medium 230 only is for illustrative purposes. One or several of the computer readable means or computerreadable storage medium 230 may be physically separated from the other computer readable means or computerreadable storage medium 230, or may reside on the same physical media.
  • Saidprocessing circuitry 210 causes the node to perform the steps of the above described method S100 and embodiments thereof. Thus, theprocessing circuitry 210 of thenode 200 is adapted to and operative to detect new neighbours, to retrieve transport characteristics values between radio neighbours, to validity check the active Radio Coordination scheme, and to update the Radio Coordination scheme, if necessary, based on the measured transport characteristics values.
  • Thenode 200 may be adapted, e.g. by means of theprocessing circuitry 210, to measure the transport characteristics between the Radio Coordination neighbours.
  • The node may further be adapted, e.g. by means of theprocessing circuitry 210, to retrieve transport characteristics between one or more Radio Coordination neighbours, e.g. different sources and source locations:
    1. (i) via its own measurement; or
    2. (ii) the characteristics are provided by the transport network node(s); or
    3. (iii) the characteristics are provided by a separate measuring node
    4. (iv) the characteristics are provided by a management node
    5. (v) the characteristics are provided by a control node.
  • The node may further be adapted, e.g. by means of theprocessing circuitry 210, to check periodically the validity of the active Radio Coordination scheme.
  • The node may further be adapted, e.g. by means of theprocessing circuitry 210, to validity check by checking if any radio coordination scheme is used; and if maximal performance radio coordination scheme(s) is/are used and optimally configured.
  • The node may further be adapted, e.g. by means of theprocessing circuitry 210, to check if the maximal performance Radio Coordination scheme(s) is/are used.
  • The node may further be adapted, e.g. by means of theprocessing circuitry 210, to select a Radio Coordination scheme to be active.
  • The node may further be adapted, e.g. by means of theprocessing circuitry 210, to reconfigure the active Radio Coordination scheme according to the measured transport characteristic values.
  • The above mentioned embodiments may be implemented asprocessing circuitry 210 and a computer program comprising computer program code which, when run in a processor circuitry of a node, causes the node to perform the method steps of the method S100:
    • S110: - Detecting new neighbours;
    • S120: - Retrieving transport characteristics values between radio neighbours;
    • S130: - Validity checking of the active Radio Coordination scheme;
    • S140: - Updating of Radio Coordination scheme, if necessary, based on the measured transport characteristics values.
  • The computer program comprises computer program code which, when run in a processor circuitry of a node, causes the node to perform the different embodiments of the method S100.
  • It is further provided a computer program product comprising said computer program and a computer readable means on which the computer program is stored.
  • It is further provided a carrier containing the computer program, wherein the carrier is one of an electronic signal, optical signal, radio signal or computer readable storage medium.
  • Figure 8 is a block diagram illustrating another example of a node, preferably a radio node in a communications network, e.g. wireless communications network or telecommunications network.
  • The above mentioned embodiments of the method S100 may be implemented as modules of anode 200, said modules causes the node to perform the method steps of the method S100. Thenode 200 may therefore comprise afirst module 310 for detecting new neighbours, asecond module 320 for retrieving transport characteristics values between radio neighbours; athird module 330 for validity checking the active Radio Coordination scheme, andfourth module 340 for updating of Radio Coordination scheme, if necessary, based on the measured transport characteristics values.
  • Anode 200 may comprise further modules for implementing the different embodiments of the method S100, said modules causes the node to perform the different embodiments of the method S100.
  • The entities and units described above with reference tofigures 6,7 and 8 may be considered as logical units, and do not necessarily correspond to separate physical units. Thus, the person skilled in the art would appreciate that the units disclosed in thefigures 6,7 and 8 may be implemented as physically integrated units, and/or physically separate units, and that the units are provided with appropriate processing circuits.
  • A number of embodiments of the present invention have been described. It will be understood that various modifications may be made without departing from the scope of the invention. Therefore, other implementations are within the scope of the following claims defining the invention.
  • Abbreviation list
  • 3GPP
    Third Generation Partnership Project
    LTE
    Long Term Evolution
    RAN
    Radio Access Network
    CN
    Core Network
    IP
    Internet Protocol
    eNB
    base station in LTE system
    RNC
    Radio Network Controller
    UTRAN
    Universal Terrestrial Radio Access Network
    BSC
    Base Station Controller
    GERAN
    GSM EDGE Radio Access Network
    GSM
    Global System for Mobile communications

Claims (16)

  1. A method in a Radio Node for adapting of Radio Coordination schemes to transport network characteristics of a transport network's characteristics of the connection between neighbouring radio nodes, the method comprises following steps:
    - Detecting (S110) new radio neighbours;
    - Retrieving (S120) transport characteristics values of the connection between radio neighbours;
    - Validity (S130) checking of the active Radio Coordination scheme;
    - Updating (S140) of Radio Coordination scheme, if necessary, based on the retrieved transport characteristics values of the connection between radio neighbours.
  2. The method according to claim 1, wherein the retrieving step (S120) comprises:
    - Measuring (S122) the transport characteristics between the Radio Coordination neighbours.
  3. The method according to claim 1, wherein the retrieving step (S120) comprises:
    - Measuring (S124) transport characteristics between one or more Radio Coordination neighbours.
  4. The method according to any of claims 1 - 3, wherein the validity checking (S130) further comprises:
    - Checking (S132) periodically the validity of the active Radio Coordination scheme.
  5. The method according to any of claims 1 - 4, wherein the validity checking (S130) further comprises two tests:
    - if any radio coordination (S134) scheme is used; and
    - if one or more maximal performance (S136) radio coordination scheme(s) are used and optimally configured.
  6. The method according to any of claims 1 - 5, wherein the updating (S140) further comprises a test:
    - if maximal performance Radio Coordination (S142) scheme is used.
  7. The method according to any of claims 1 - 6, wherein the updating (S140) further comprises:
    - Select (S144) a Radio Coordination scheme to be active.
  8. The method according to any of claims 1 - 7, wherein the updating (S140) further comprises:
    - Reconfigure (S146) the active Radio Coordination scheme according to retrieved transport characteristic values.
  9. A node (200) for adapting of Radio Node Radio Coordination schemes to transport network characteristics of a transport network's characteristics of the connection between neighbouring radio nodes, the node comprises processing circuitry (210) operative to detect new radio neighbours, to retrieve transport characteristics values of the connection between radio neighbours, to validity check the active Radio Coordination scheme, and to update the Radio Coordination scheme, if necessary, based on the retrieved transport characteristics values of the connection between radio neighbours.
  10. The node according to claim 9, wherein the node is adapted to measure the transport characteristics between the Radio Coordination neighbours.
  11. The node according to claim 9, wherein the node is adapted to measure transport characteristics between one or more Radio Coordination neighbours.
  12. The node according to any of claims 9 - 11, wherein the node further is adapted to check periodically the validity of the active Radio Coordination scheme.
  13. The node according to any of claims 9 - 12, wherein the node is adapted to validity check by checking if any radio coordination scheme is used; and if maximal performance radio coordination scheme(s) is/are used and optimally configured.
  14. The node according to any of claims 9 - 13, wherein the node is adapted to check if the maximal performance Radio Coordination scheme(s) is/are used.
  15. The node according to any of claims 9 - 14, wherein the node is further adapted to select a Radio Coordination scheme to be active.
  16. The node according to any of claims 9 - 15, wherein the node is adapted to reconfigure the active Radio Coordination scheme according to retrieved transport characteristic values.
EP14710659.5A2014-02-142014-02-14Method, a node, computer program and computer program product for adapting radio coordination schemesActiveEP3105956B1 (en)

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
PCT/SE2014/050188WO2015122817A1 (en)2014-02-142014-02-14Method, a node, computer program and computer program product for adapting radio coordination schemes

Publications (2)

Publication NumberPublication Date
EP3105956A1 EP3105956A1 (en)2016-12-21
EP3105956B1true EP3105956B1 (en)2017-09-27

Family

ID=50288238

Family Applications (1)

Application NumberTitlePriority DateFiling Date
EP14710659.5AActiveEP3105956B1 (en)2014-02-142014-02-14Method, a node, computer program and computer program product for adapting radio coordination schemes

Country Status (4)

CountryLink
US (1)US10264474B2 (en)
EP (1)EP3105956B1 (en)
CN (1)CN106031212B (en)
WO (1)WO2015122817A1 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
WO2015126444A1 (en)*2014-02-212015-08-27Commscope Technologies LlcDistributed antenna system transport link quality measurement
CN109314916B (en)*2016-04-192021-10-01诺基亚通信公司Method, apparatus and computer readable medium for communication
WO2018174756A1 (en)2017-03-212018-09-27Telefonaktiebolaget Lm Ericsson (Publ)A network node and a method performed thereby for providing a recommendation associated with a service to a wireless device

Family Cites Families (29)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
AU5684100A (en)*2000-06-202002-01-02Nokia Networks OyA method for performing a mobile user terminal route update in a telecommunication network operated based on the internet protocol
US7583645B2 (en)*2004-09-012009-09-01Intel CorporationAdaptive MAC architecture for wireless networks
EP1952571A2 (en)*2005-11-042008-08-06Nokia CorporationMethod, wireless local area network(wlan),node and apparatus for multicast and/or broadcast acknowledgements
EP1786228A1 (en)*2005-11-102007-05-16Alcatel LucentMethod and apparatus for uplink resource allocation in a cellular communication system
US7497763B2 (en)*2006-03-272009-03-03Freescale Semiconductor, Inc.Polishing pad, a polishing apparatus, and a process for using the polishing pad
US20070286122A1 (en)*2006-06-122007-12-13Motorola, Inc.Clear channel assessment threshold adaptation in a wireless network
AU2007357681B2 (en)*2007-08-102014-04-03Telefonaktiebolaget Lm Ericsson (Publ)Improvements in, or relating to, E-UTRAN and handover
JP4558053B2 (en)*2008-03-072010-10-06シャープ株式会社 Mounting member and lighting device
US20090233635A1 (en)*2008-03-112009-09-17Li Guoqing CDiscovering neighbors in wireless personal area networks
CA2728446C (en)2008-06-182015-08-04Spidercloud Wireless, Inc.Methods and apparatus for coordinating network monitoring and/or automating device confirgurations based on monitoring results
KR101729548B1 (en)2009-03-062017-05-02엘지전자 주식회사Method and apparatus for transmitting channel quality information in wireless communication system applied CoMP scheme
US8462695B2 (en)*2009-05-182013-06-11Intel CorporationApparatus and methods for multi-radio coordination of heterogeneous wireless networks
US20110021153A1 (en)*2009-07-102011-01-27Saeid SafaviCentralized cross-layer enhanced method and apparatus for interference mitigation in a wireless network
US9742862B2 (en)*2009-07-142017-08-22Saguna Networks Ltd.Methods circuits devices systems and associated machine executable code for efficient delivery of multi-unicast communication traffic
KR101567370B1 (en)*2009-10-222015-11-23삼성전자주식회사 Cooperative transceiver and method in a broadband wireless communication system
US8682313B2 (en)2009-12-082014-03-25Electronics And Telecommunications Research InstituteOver-the-air inter-cell interference coordination methods in cellular systems
US9288690B2 (en)*2010-05-262016-03-15Qualcomm IncorporatedApparatus for clustering cells using neighbor relations
CN101917381B (en)*2010-08-202013-06-12西安电子科技大学Method for compensating delay difference among cells in cooperative multi-point transmission system
JP5626006B2 (en)*2011-02-242014-11-19富士通株式会社 Wireless device, communication control method, and wireless communication system
EP2498530A1 (en)2011-03-102012-09-12NTT DoCoMo, Inc.Method for coordinated multipoint (CoMP) transmission/reception in wireless communication networks with reconfiguration capability
CN102318398B (en)*2011-05-102014-12-31华为技术有限公司Method, device and base station for coordinated multi-point (comp) reception processing
CN102905277B (en)*2011-07-292017-07-11中兴通讯股份有限公司A kind of base station, the system and method for selection cooperative node
EP2764642B1 (en)*2011-10-052018-01-10Huawei Technologies Co., Ltd.System and method for coordinated transmission in digital communications
CN103227995B (en)*2012-01-302016-03-02华为技术有限公司 Self-organizing network coordination method, device and system
CN102612070B (en)*2012-02-172014-12-24新邮通信设备有限公司Method for configuring wireless resource management and measurement set under multi-point coordination and base station
GB2512599B (en)*2013-04-022015-10-14Broadcom CorpJoint scheduling in a coordinated multipoint system
CN103476105B (en)2013-08-212016-04-06北京邮电大学Space connector synchronization method
ES2532518B1 (en)*2013-09-272016-01-19Vodafone España, S.A.U. Network element and procedure to coordinate the use of radio resources between radio access networks
US20150146519A1 (en)*2013-11-222015-05-28General Dynamics Broadband Inc.Apparatus and Methods for Supporting Control Plane Data

Non-Patent Citations (1)

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

Also Published As

Publication numberPublication date
WO2015122817A1 (en)2015-08-20
EP3105956A1 (en)2016-12-21
US10264474B2 (en)2019-04-16
CN106031212B (en)2020-01-10
CN106031212A (en)2016-10-12
US20160269916A1 (en)2016-09-15

Similar Documents

PublicationPublication DateTitle
US10856200B2 (en)Reporting cell band information in a communication network
US11917470B2 (en)Provision of instructions related to measurements by a wireless communication device on a signal from a wireless communication network
EP2974454B1 (en)Methods and apparatuses for handling a handover event
CN114302468A (en)Communication method and communication device
US20190364443A1 (en)Obtaining additional supported bands of neighbor cells via automatic neighbor relation (anr)
US20130084870A1 (en)Method for handling handover in a communication network
US20080200171A1 (en)Wireless communication system transmitting neighboring cell information
US10383009B2 (en)Handover of a terminal in dual connectivity mode
US20150237663A1 (en)User equipment, a network node, and methods for device discovery in device-to-device (d2d) communications in a wireless telecommunications network
RU2595762C2 (en)Method, apparatus and system for controlling congestion
EP3105956B1 (en)Method, a node, computer program and computer program product for adapting radio coordination schemes
EP2396999B1 (en)Method for receiving information on network configuration and corresponding terminal
EP3793255B1 (en)Measurement control method, ue, network apparatus, and computer storage medium
CN117793735A (en)Configuration method, terminal, network equipment, electronic equipment and medium
CN106688269B (en)Radio network node and method for determining whether a wireless device is a suitable candidate for handover to a target cell for load balancing reasons
WO2017204741A1 (en)Method and arrangements for managing cell identities in a wireless communication network
CN102724700A (en)Method and system for acquiring neighbor cell information
WO2025030501A1 (en)Data sending method and apparatus, and data receiving method and apparatus
CN120379054A (en)Node in communication system and method for performing the same
JP2025530997A (en) SYSTEM AND METHOD FOR OPTIMIZING A PROCESS FOR CHANGE A PRIMARY CELL IN A SECONDARY CELL GROUP - Patent application
JP2025505497A (en) Systems and methods for configuring unmanned aerial vehicle (UAV) multi-RAT dual connectivity (MRDC)

Legal Events

DateCodeTitleDescription
PUAIPublic reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text:ORIGINAL CODE: 0009012

STAAInformation on the status of an ep patent application or granted ep patent

Free format text:STATUS: REQUEST FOR EXAMINATION WAS MADE

17PRequest for examination filed

Effective date:20160830

AKDesignated 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

AXRequest for extension of the european patent

Extension state:BA ME

DAXRequest for extension of the european patent (deleted)
GRAPDespatch of communication of intention to grant a patent

Free format text:ORIGINAL CODE: EPIDOSNIGR1

STAAInformation on the status of an ep patent application or granted ep patent

Free format text:STATUS: GRANT OF PATENT IS INTENDED

INTGIntention to grant announced

Effective date:20170628

GRASGrant fee paid

Free format text:ORIGINAL CODE: EPIDOSNIGR3

GRAA(expected) grant

Free format text:ORIGINAL CODE: 0009210

STAAInformation on the status of an ep patent application or granted ep patent

Free format text:STATUS: THE PATENT HAS BEEN GRANTED

AKDesignated 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

REGReference to a national code

Ref country code:GB

Ref legal event code:FG4D

REGReference to a national code

Ref country code:CH

Ref legal event code:EP

REGReference to a national code

Ref country code:AT

Ref legal event code:REF

Ref document number:933058

Country of ref document:AT

Kind code of ref document:T

Effective date:20171015

REGReference to a national code

Ref country code:IE

Ref legal event code:FG4D

REGReference to a national code

Ref country code:DE

Ref legal event code:R096

Ref document number:602014015057

Country of ref document:DE

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

Ref country code:LT

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

Effective date:20170927

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

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

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

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

REGReference to a national code

Ref country code:NL

Ref legal event code:MP

Effective date:20170927

REGReference to a national code

Ref country code:LT

Ref legal event code:MG4D

REGReference to a national code

Ref country code:AT

Ref legal event code:MK05

Ref document number:933058

Country of ref document:AT

Kind code of ref document:T

Effective date:20170927

REGReference to a national code

Ref country code:FR

Ref legal event code:PLFP

Year of fee payment:5

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

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

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

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

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

PG25Lapsed 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:20170927

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

Ref country code:CZ

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

Effective date:20170927

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

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

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

Ref country code:IS

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

Effective date:20180127

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

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

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

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

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

REGReference to a national code

Ref country code:DE

Ref legal event code:R097

Ref document number:602014015057

Country of ref document:DE

PG25Lapsed 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:20170927

PLBENo opposition filed within time limit

Free format text:ORIGINAL CODE: 0009261

STAAInformation on the status of an ep patent application or granted ep patent

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

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

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

26NNo opposition filed

Effective date:20180628

REGReference to a national code

Ref country code:CH

Ref legal event code:PL

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

Ref country code:MC

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

Effective date:20170927

REGReference to a national code

Ref country code:IE

Ref legal event code:MM4A

REGReference to a national code

Ref country code:BE

Ref legal event code:MM

Effective date:20180228

PG25Lapsed 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:20170927

Ref country code:CH

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

Effective date:20180228

Ref country code:LU

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

Effective date:20180214

Ref country code:LI

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

Effective date:20180228

PG25Lapsed 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:20180214

PG25Lapsed 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:20180228

PG25Lapsed 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:20180214

PG25Lapsed 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:20170927

PG25Lapsed 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:20170927

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

Ref country code:MK

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

Effective date:20170927

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

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

PG25Lapsed 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:20170927

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

Ref country code:DE

Payment date:20250227

Year of fee payment:12

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

Ref country code:FR

Payment date:20250225

Year of fee payment:12

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

Ref country code:GB

Payment date:20250227

Year of fee payment:12


[8]ページ先頭

©2009-2025 Movatter.jp