WO2013023698A1 - Procédé permettant de déterminer la topologie d'un réseau de communication sans fil - Google Patents

Procédé permettant de déterminer la topologie d'un réseau de communication sans fil Download PDF

Info

Publication number
WO2013023698A1
WO2013023698A1 PCT/EP2011/064191 EP2011064191W WO2013023698A1 WO 2013023698 A1 WO2013023698 A1 WO 2013023698A1 EP 2011064191 W EP2011064191 W EP 2011064191W WO 2013023698 A1 WO2013023698 A1 WO 2013023698A1
Authority
WO
WIPO (PCT)
Prior art keywords
network transceiver
active
network
entities
transceiver entities
Prior art date
Application number
PCT/EP2011/064191
Other languages
English (en)
Inventor
Chan Zhou
Egon Schulz
Malte Schellmann
Markus M. DILLINGER
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to PCT/EP2011/064191 priority Critical patent/WO2013023698A1/fr
Priority to CN201180003891.0A priority patent/CN103202047B/zh
Publication of WO2013023698A1 publication Critical patent/WO2013023698A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to mobile communications over wireless
  • ICT Information and Communication Technology
  • the wireless communication network arrangements - especially in a dense small cell environment - are designed to support the peak hour traffic. In most of the time the traffic demand is much lower than the network capacity and the network is over-dimensioned. However, the topology of a traditional communication network is determined during the network planning phase. The position and density of the network transceiver entities and hence are then usually fixed. In fact, some of the network transceiver entities can be turned off or turned into an inactive state if they are not serving users and keep the network transceiver entities in active state if they are serving users that the moment.
  • the UMTS and LTE protocols described by the 3GPP specifications TS 25.331 and TS 36.331 suggest a cell selection which is mainly determined by the SNR measured for the corresponding channel. However, such cell selection may lead to an inappropriate constellation of active base stations which may result in unnecessarily increased energy consumption.
  • the invention is based on the finding that the consumption of energy in a wireless communication network arrangement may be reduced by reducing a number of active network transceiver entities in the communication network arrangement such that only a minimum set of network transceiver entities which are required to maintain current communications of user terminals is set active.
  • a method for determining the topology of a wireless communication network arrangement comprising a plurality of network transceiver entities, at least a part of which is currently active for serving communications of user terminals currently registered to the wireless communication network, the method comprising:
  • the minimum set of network transceiver entities to be set active is determined based on the network constraint to enable all currently registered user terminals to be connected to at least one active network transceiver entity, respectively, while each of the following conditions is taken in account: minimizing the number of active network transceiver entities; minimizing frequently occurring activation/deactivation of network transceiver entities; minimizing frequently occurring hand-over between network transceiver entities.
  • This method enables the reduction of energy consumption in a communication network arrangement, as in average the number of active network transceiver entities can be reduced.
  • minimizing usually does not mean finding an absolute minimum but rather reducing to an acceptable minimum.
  • the parameters are rather set to extremely minimize the number of active network transceiver entities, the frequency of hand over may increase and also the frequency of activations/deactivations of network transceiver entities may increase, respectively, certainly always depending on the actual local allocations of currently registered user entities and of currently active network transceiver entities.
  • the minimum set of network transceiver entities to be set active is determined further taking the condition of minimizing the computation complexity of applied algorithm in account.
  • the method comprises deriving information about the currently registered user terminals from registered information in a Radio Network Controller according to the UMTS (Universal Mobile Telecommunications Standard) technology, or from information exchange between eNodeBs according to LTE (Long Term Evolution) technology.
  • UMTS Universal Mobile Telecommunications Standard
  • LTE Long Term Evolution
  • the method comprises determining the current set of active network transceiver entities from the information exchange between eNodeBs according to the LTE (Long Term Evolution) technology.
  • LTE Long Term Evolution
  • the method comprises determining the enablement of all currently registered user terminals to be connected to a particular active network transceiver entity, respectively, from a User Entity Measurement Report according to the UMTS (Universal Mobile
  • the invention relates to the method, wherein the minimum number is determined by solving a linear minimization problem, in particular upon the basis of a cutting-plane or branch-and-bound approach, to determine the minimum set of network transceiver entities.
  • a linear minimization problem in particular upon the basis of a cutting-plane or branch-and-bound approach, to determine the minimum set of network transceiver entities.
  • any other algorithm solving a linear minimization problem can also be utilized.
  • the method comprises determining the minimum set of network transceiver entities to be set active based on the network constraint comprising a maximum allowable number of deactivations/activations of network transceiver entities in the communication network arrangement.
  • the minimum set of network transceiver entities to be set active is determined according to the invention only if a predetermined minimum energy saving can be achieved.
  • the minimum set of network transceiver entities to be set active is determined according to the invention only if the number of currently active network transceiver entities exceeds the number of network transceiver entities of the minimum set of network transceiver entities to be set active by a predetermined threshold.
  • the determined topology of active network transceiver entities according to the minimum set of network transceiver entities required to be set active is realized only if a predetermined minimum energy saving can be achieved.
  • the determined topology of active network transceiver entities according to the minimum set of network transceiver entities required to be set active is realized only if the number of currently active network transceiver entities exceeds the number of network transceiver entities of the minimum set of network transceiver entities to be set active by a predetermined threshold.
  • a method step of determining the minimum set of network transceiver entities to be set active can for example be performed using a rather basic algorithm.
  • More sophisticated basic algorithms could take one or more of the additional parameters according to the invention in account, while the respective thresholds for optimized solutions could be low.
  • a method step of determining the minimum number of network transceiver entities to be set active can for example also be performed as described above according to the first aspect, while only the final implementation will or will not be performed depending on the fulfillment of the additional condition.
  • a set of certain network transceiver entities in the wireless network communication arrangement is per default comprised in the determined topology of active network transceiver entities. This can for example be achieved by foreseeing that certain network transceiver entities in the network communication arrangement are excluded from selection for deactivation.
  • a method according to this eleventh implementation form several different positive effects can be achieved.
  • the local coverage of the whole network can be fixed and additionally to be activated and/or deactivated network transceiver entities are just in order to deal with additional communication traffic.
  • local areas with low density of network transceiver entities are fixed by usually not to be deactivated network transceiver entities, while areas, which can be covered by different network transceiver entities or by different pattern of network transceiver entities can be
  • the determining of the topology of active network transceiver entities is performed periodically with a predetermined time period.
  • the time period actually depends on requirements and on capabilities of different network entities and can be in the range of several milliseconds but also in the range of several minutes.
  • the determining of the topology of active network transceiver entities can be triggered to be performed depending on communication load changing or changing in the number or allocation of registered user entities.
  • a deactivated network transceiver entity is activated when the number of user entities increases.
  • a respective deactivated network transceiver entity is activated when the number of user entities in the local area of that network transceiver entity increases.
  • a network transceiver entity is deactivated only in so far as the network transceiver entity is able to receive control message for reactivation after deactivation.
  • the deactivated network transceiver entity broadcasts a pilot signal.
  • the invention relates to method, wherein the network transceiver entities are one of the following: base stations according to the UMTS, base stations according to the LTE (Long Term Evolution
  • the method according to the invention when performed in a network according to the UMTS standard or in a network according to the GSM (Global
  • the method could also be performed in a particular Base Station or a particular Access Point or even in a Base Station Controller.
  • the method according to the invention when performed in a network according to the LTE (Long Term Evolution) standard, can be preferably performed in a network transceiver entity like a Base Station or a particular Access Point.
  • LTE Long Term Evolution
  • the invention relates to a programmable arranged device comprising a processor which is configured to execute a computer program for executing the method for determining the topology of a wireless communication network arrangement. Further, features of the processor and its arrangement are directly derivable from the first aspect or from any implementation form of the first aspect.
  • Fig. 1 shows a diagram of a method for determining the topology of a wireless communication network arrangement according to an implementation form
  • Fig. 2 shows a block diagram of a method for determining the topology of a wireless communication network arrangement according to an implementation form
  • Fig. 3 shows a block diagram of a programmably arranged device according to an implementation form.
  • Fig. 1 shows a diagram of a method for determining the topology of a wireless communication network arrangement.
  • the wireless communication network arrangement may comprise a current number of active network transceiver entities serving communications of a number of user terminals.
  • the method comprises determining 101 a minimum set of network transceiver entities which are at least required to serve communications of the number of user terminals, determining 103 a the topology of active network transceiver entities according to the minimum set of network transceiver entities required to be set active.
  • the method further comprises initiating 105 the activation and/or deactivation of network transceiver entities in accordance with the determined topology, resulting in reduction of energy consumption.
  • the network transceiver entities may be formed by base stations or access points according to the UMTS or according to the LTE technology. According to some implementation forms, the method may be performed in a radio network controller (RNC) in a UMTS network or in an eNodeB in an LTE network.
  • RNC radio network controller
  • the cutting plane method as disclosed in D.E.L, "A Cutting Plane Optimization algorithm for Integer Programs with an easy Proof von Convergence", Working Paper WP-73-15, International Institute for Applied Systems Analysis, Luxemburg, 1973, a disclosure of which is incorporated herein by reference, may be deployed for determining the minimum set of network transceiver entities.
  • the branch and bound optimization algorithm as disclosed in A. H. Land and A. G. Doig, "An Automatic Method of Solving Discrete Programming Problems", Econometrica, Vol. 28, No. 3, pp. 497-520, July 1960, a disclosure of which being incorporated herein by reference, may be deployed for determining the minimum set of network transceiver entities.
  • a set of available communication connections may vary over time. If the network transceiver entities are activated or deactivated, e.g. switched on or off, then the activation or deactivation may occur as frequently as the connection conditions change. Therefore, a fast adaptation to the connection conditions may be achieved.
  • a network transceiver entity may be selected as follows with exemplarily reference to a base station (BS) forming an example of a network transceiver entity:
  • the BSs or RNCs may obtain the knowledge about which BSs are able to set up a reliable
  • terminal maintains a list of cells which can be the candidate for the cell selection.
  • the information in the list includes for example the cell id and CPICH E c /lo of the corresponding cell.
  • the MeasurementReport will be continuously conveyed to a NodeB by default.
  • the list of the cell information is kept by terminal and should be conveyed regularly at a predefined interval, e.g. every N minutes where N is an integer.
  • a minimum possible set of active BSs which are required to serve all terminals, can be calculated using an optimization algorithm, such as cutting-plane or branch and bound optimization algorithm mentioned above.
  • Threshold_predefined then the achievable gain is large enough so that an optimization process can be triggered in order to reduce the number of active BSs.
  • the optimization algorithm e.g. cutting-plane or branch and bound, may be once in a certain time interval, e.g. every several seconds, minutes or hours.
  • Fig. 2 optimization implementing the selection mechanism is depicted in Fig. 2 may be used to choose the final BSs to be activated or deactivated.
  • a terminal report e.g. a measurement report according to the LTE technology
  • the terminal report comprises information on currently active network transceiver entities.
  • the minimum set of network transceiver entities such as base stations, is determined in step 203. The determination may be based upon a calculation based on the current user entity measurement report received in step 201 .
  • a network constraint is employed in order to determine as to whether any network transceiver entity shall be switched on or off.
  • the network constraint may be e.g. a minimum achievable energy saving, i.e. a maximum potential energy gain which is to be achieved by selecting the network transceiver entity for activation or deactivation.
  • At least one network transceiver entity may be selected in step 207 by e.g. running a stability-based preferential selection optimization algorithm to obtain the final network transceiver entity selection as described above.
  • a network transceiver entity may be activated or deactivated by switching on or switching off the network transceiver entity.
  • the network transceiver entity may be e.g. a base station.
  • the method may terminate in step 21 1 .
  • the method as depicted in Fig. 2 may be iteratively executed and may be performed every certain time period, e.g. every N minutes. In this case, the method may comprise the step 213 for triggering the execution of the method every certain time period.
  • the stability-based preferential selection optimization algorithm may be executed as described with exemplarily reference to a base station (BS) forming an implementation form of a network transceiver entity:
  • STEP 0 Sort the BS according the current assigned terminals.
  • the BSs that currently have the most terminals are at the beginning of the list.
  • the BSs that are deactivated, e.g. turned off, at the moment are placed at the end of the list.
  • Set list index i 1 . Mark the state of all BSs as "OFF”. Set the start up incumbent as the maximum number of BSs.
  • STEP 1 Mark the state of BS i as ON".
  • STEP 2 IF all user terminals can be covered by active BSs
  • the above optimization algorithm may start with the BSs that are currently activated (ON) and with the BSs that have the most terminals in their cells and preferentially keep the ON-state of these BSs. In this manner, it gives preference to these BSs in order to avoids the frequently ON/OFF switches and large number of handovers in the network.
  • the stability and beneficial conditions forming implementation forms of network constraints may be as follows: - if possibly too many BSs will be switched ON/OFF: number_to_be_switched_ON/OFF > predefined_threshold) - if the potential gain is too small: Number_to_be_saved_base_station ⁇ predefined_threshold
  • the reduction of energy consumption is thus achieved by a dynamic node management mechanism that may gradually add or remove network transceiver entities such as base stations and access points in the wireless network according to variation of the location, distribution and traffic demand of users.
  • the dynamic node management terminal exploits the fact that a user terminal has multiple choices to set up a link with one of its neighbouring base stations or access points, hereinafter referred to as BS.
  • the set of BS which may be activated, e.g. turned on to support the assigned user terminals, can be minimized by artful selection of the Terminal-to-BS links.
  • Other BSs that have no links to terminals at the moment can deactivated, e.g. be shut down or turned to power saving mode.
  • a BS which is activated, e.g. turned on, is referred to as active BS and BS which is deactivated, e.g. turned off or turned into sleep mode, is referred to inactive BS.
  • the mechanism to select which BSs are to be activated or deactivated has to satisfy the constraint that all user terminals have to be able to connect to at least one active BS and can for example satisfy in an optimized manner at least one of the following network constraints: Keeping the number of active BSs as small as possible, avoiding frequently turning on/off BSs, avoiding frequent handovers between cells. Preferably, reducing the computation complexity of optimization algorithm should be satisfied, too.
  • a BS is decided to be deactivated, e.g. turned off, it hands off all its user terminals to the neighbouring cell and is turned into a sleep mode.
  • the major parts of the BS are shut down but it still broadcasts pilot signals in a large time interval, i.e. several seconds.
  • pilot signals in a large time interval, i.e. several seconds.
  • only the broadcast unit in the BS is active. In this way, terminal always can obtain the most updated channel state information, also of the BS in sleep mode, thanks to the pilot measurement.
  • the sleeping BS in the neighbourhood - which can be determined according to the collected channel state information - will be activated, e.g. turned ON.
  • the macro BSs may for example constitute the coverage backing while some micro and pico stations are turned off.
  • the code and frequency assignment in cells may be reconfigured during the ON/OFF switching procedure if necessary.
  • Fig. 3 shows a block diagram of a programmably arranged device 300 comprising a processor 301 being configured to perform the method according to clam 1 or any of the claims depending on claim 1 .
  • the device 300 comprises a rocessor configured to implement one of the methods as depicted in Figs. 1 and/or 2 by executing a computer program implementing the method steps depicted in Fig. 1 and/or Fig. 2.
  • the methods described herein are deployed in dense small cells and heterogeneous networks consisting of Femto, Pico, Micro and Macro stations.
  • network transceiver entities such as base stations may be dynamically turned ON or OFF according to the traffic load and number of user terminals in the cells based on neighbour cell list reports of the terminals.
  • an optimization algorithm such as cutting plane optimization algorithm may be deployed to check the potential benefit of changing the network topology.
  • a stability-based preferential selection optimization algorithm may be executed to obtain the selection of network transceiver entities to be switched off or even network transceiver entities to be switched on in order to enable other network transceiver entities to be switched off.
  • using network constraints such as stability and beneficial conditions may keep the complexity of the solution low and may ensure the stability of its operation.
  • the number of active BSs in the wireless network may be reduced.
  • an optimization algorithm may be deployed to select the set of active/inactive BSs in the network. If a BS is chosen to be turned off, it hands over all its subordinate terminals to neighbouring active BSs and then it is shut down or switched to power saving mode.
  • the optimization algorithm takes into account the channel quality requirement, the number of necessary BS-ON/OFF-Switches and user terminal handovers and provides a solution that balances the gain of energy saving and the cost of additional system actions.

Landscapes

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

Abstract

L'invention porte sur un procédé permettant de déterminer la topologie d'un agencement de réseau de communication sans fil comprenant une pluralité d'entités d'émission-réception du réseau, dont une partie est actuellement active afin d'assurer les communications des terminaux utilisateur actuellement enregistrés au sein dudit réseau de communication sans fil. Ce procédé consiste : à déterminer (101), sur la base d'au moins une contrainte du réseau, un ensemble minimal d'entités d'émission-réception du réseau qui doivent être activées pour assurer les communications des terminaux utilisateur actuellement enregistrés ; et à déterminer la topologie des entités d'émission-réception du réseau actives en fonction de l'ensemble minimal d'entités d'émission-réception du réseau qui doivent être activées, cette topologie étant obtenue grâce au lancement de l'activation des entités d'émission-réception du réseau devant être activées et au lancement de la désactivation des autres entités d'émission-réception du réseau. L'ensemble minimal d'entités d'émission-réception du réseau qui doivent être activées est déterminé en fonction de la contrainte du réseau afin que tous les terminaux utilisateur actuellement enregistrés soient connectés respectivement à au moins une entité d'émission-réception du réseau active. De plus, chacune des conditions suivantes est prise en compte : la réduction au minimum du nombre d'entités d'émission-réception du réseau actives ; la réduction au minimum de l'activation/désactivation des entités d'émission-réception du réseau qui se produisent fréquemment ; et la réduction au minimum du transfert entre entités d'émission-réception du réseau qui se produit fréquemment.
PCT/EP2011/064191 2011-08-17 2011-08-17 Procédé permettant de déterminer la topologie d'un réseau de communication sans fil WO2013023698A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/EP2011/064191 WO2013023698A1 (fr) 2011-08-17 2011-08-17 Procédé permettant de déterminer la topologie d'un réseau de communication sans fil
CN201180003891.0A CN103202047B (zh) 2011-08-17 2011-08-17 用于确定无线通信网络的拓扑结构的方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2011/064191 WO2013023698A1 (fr) 2011-08-17 2011-08-17 Procédé permettant de déterminer la topologie d'un réseau de communication sans fil

Publications (1)

Publication Number Publication Date
WO2013023698A1 true WO2013023698A1 (fr) 2013-02-21

Family

ID=44543228

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2011/064191 WO2013023698A1 (fr) 2011-08-17 2011-08-17 Procédé permettant de déterminer la topologie d'un réseau de communication sans fil

Country Status (2)

Country Link
CN (1) CN103202047B (fr)
WO (1) WO2013023698A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160021546A1 (en) * 2013-03-15 2016-01-21 Hewlett-Packard Development Company, L. P. Cloud-based connectivity
EP3041171A1 (fr) * 2015-01-02 2016-07-06 Xieon Networks S.à r.l. Procédé et système pour attribuer des indicateurs de performance à des objets d'un réseau

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009115554A1 (fr) * 2008-03-19 2009-09-24 Nokia Siemens Networks Oy Mécanisme de reconfiguration automatisée d'un élément de réseau d'accès
EP2141947A1 (fr) * 2008-07-04 2010-01-06 Nokia Siemens Networks OY Procédé de reconfiguration dynamique d'un réseau de communication
EP2150073A1 (fr) * 2007-04-27 2010-02-03 NTT DoCoMo, Inc. Système mobile de communication, dispositif de commande de station de base, dispositif de station de base, et méthode de commande de l'état d'une station de base

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2150073A1 (fr) * 2007-04-27 2010-02-03 NTT DoCoMo, Inc. Système mobile de communication, dispositif de commande de station de base, dispositif de station de base, et méthode de commande de l'état d'une station de base
WO2009115554A1 (fr) * 2008-03-19 2009-09-24 Nokia Siemens Networks Oy Mécanisme de reconfiguration automatisée d'un élément de réseau d'accès
EP2141947A1 (fr) * 2008-07-04 2010-01-06 Nokia Siemens Networks OY Procédé de reconfiguration dynamique d'un réseau de communication

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project;Technical Specification Group Services and System Aspects; Telecommunication management;Study on Energy Savings Management (ESM)(Release 9)", 3GPP DRAFT; 32826-200, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. SA WG5, no. Xiamen; 20100301, 15 March 2010 (2010-03-15), XP050440209 *
A. H. LAND, A. G. DOIG: "An Automatic Method of Solving Discrete Programming Problems", ECONOMETRICA, vol. 28, no. 3, July 1960 (1960-07-01), pages 497 - 520
D.E.L: "NN", 1973, INTERNATIONAL INSTITUTE FOR APPLIED SYSTEMS ANALYSIS, article "A Cutting Plane Optimization algorithm for Integer Programs with an easy Proof von Convergence"
NEC: "Adding high-level description of the capacity-limited network use case to ESM stage 1 TS", 3GPP DRAFT; S5-101495-ESM-CAPACITY-LIMITED-USE-CASE-R1, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. SA WG5, no. Montreal, Canada; 20100510, 14 May 2010 (2010-05-14), XP050440628 *
VIJAY V. VACIRANI: "Approximation Optimization algorithms", 2001, SPRINGER-VERLAG

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160021546A1 (en) * 2013-03-15 2016-01-21 Hewlett-Packard Development Company, L. P. Cloud-based connectivity
US9769675B2 (en) * 2013-03-15 2017-09-19 Hewlett Packard Enterprise Development Lp Cloud-based connectivity
EP3041171A1 (fr) * 2015-01-02 2016-07-06 Xieon Networks S.à r.l. Procédé et système pour attribuer des indicateurs de performance à des objets d'un réseau
WO2016107757A1 (fr) * 2015-01-02 2016-07-07 Xieon Networks S.À R.L. Procédé et système pour attribuer des indicateurs de performance à des objets d'un réseau
US10700777B2 (en) 2015-01-02 2020-06-30 Xieon Networks S.A.R.L. Method and system for assigning performance indicators to objects of a network

Also Published As

Publication number Publication date
CN103202047A (zh) 2013-07-10
CN103202047B (zh) 2015-11-25

Similar Documents

Publication Publication Date Title
RU2482630C2 (ru) Механизм для автоматизированной реконфигурации элемента сети доступа
EP3207735B1 (fr) Gestion de ressource radio dans un système de télécommunication
EP2141947B1 (fr) Reconfiguration dynamique d'un réseau de communication pour une consommation efficiente d'énergie dans le cas de détection de couverture double
US9503972B2 (en) Method and base station for energy saving compensation
EP3005797B1 (fr) Système et procédé d'économie d'énergie dans un système sans fil
EP2446672B1 (fr) Économie d'énergie dans une station de base radio par détermination du nombre d'utilisateurs actifs et au repos se trouvant sur une cellule
EP2567561B1 (fr) Procédé et réseau de télécommunications de désactivation ou d'activation d'une cellule dans un tel réseau
EP2422554B1 (fr) Commande d'activation de cellule dans un réseau de communication radio
CN102835160B (zh) 用于促进重定位的网络节点控制
CN104604316B (zh) 蜂窝电信网络中小区呼吸基站中的动态移动性管理
JP5668754B2 (ja) 通信装置
US9706490B2 (en) Method for energy saving in a cellular communication system
CN104094628A (zh) 控制蜂窝网络系统内的用户设备的无线电测量
CN103999506A (zh) 信令业务的减少
CN105323830B (zh) 节能补偿方法、节能补偿恢复方法及装置
CN102948218A (zh) 用于无线蜂窝网络中的计划小区停用的切换过程和信令
WO2011158858A1 (fr) Système de communication sans fil, station de base sans fil, et procédé de commande d'alimentation électrique
WO2013020649A1 (fr) Resélection de cellule autonome par un équipement utilisateur
CN109952787A (zh) 异构网络中的分布式son节能管理
CN103313320A (zh) 一种不同类型的小区之间切换的方法
WO2015169374A1 (fr) Déclenchement reconfiguration de niveau de performance dans des stations de base radio
WO2013023698A1 (fr) Procédé permettant de déterminer la topologie d'un réseau de communication sans fil
Zhou et al. Stability-aware and energy efficient cell management in ultra dense networks
CN117616809A (zh) 电信网络中节点的载波关断

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11751582

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11751582

Country of ref document: EP

Kind code of ref document: A1