EP3381213A1 - Procédé et noeud de réseau pour une mise en forme de cellule dépendant du trafic - Google Patents

Procédé et noeud de réseau pour une mise en forme de cellule dépendant du trafic

Info

Publication number
EP3381213A1
EP3381213A1 EP15801383.9A EP15801383A EP3381213A1 EP 3381213 A1 EP3381213 A1 EP 3381213A1 EP 15801383 A EP15801383 A EP 15801383A EP 3381213 A1 EP3381213 A1 EP 3381213A1
Authority
EP
European Patent Office
Prior art keywords
traffic
traffic situation
cell
network node
situation type
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.)
Withdrawn
Application number
EP15801383.9A
Other languages
German (de)
English (en)
Inventor
Andreas Nilsson
Sven Petersson
Niklas JALDÈN
Panagiota Lioliou
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 EP3381213A1 publication Critical patent/EP3381213A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/04—Traffic adaptive resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/06—Hybrid resource partitioning, e.g. channel borrowing
    • H04W16/08—Load shedding arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24—Cell structures
    • H04W16/30—Special cell shapes, e.g. doughnuts or ring cells
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/082—Load balancing or load distribution among bearers or channels

Definitions

  • the technology disclosed herein relates generally to the field of reconfigurable antenna systems and in particular to a method and a network node for traffic dependent cell shaping, and related computer programs and computer program products.
  • a difficulty when deploying wireless communication systems is to properly dimension the system in accordance with need.
  • One difficulty in this regards is that the capacity needed in the system varies over time. An operator therefore needs to dimension the system such as to be able to handle the busy hours when the traffic demand is the highest.
  • the capacity need may be high at a subway station, just as it may be high in a residential area in the evening when subscribers are consuming streaming services in their homes. It is common for operators of communications systems to try to guarantee some level of service for a given percentage of users per area, which in view of this varying capacity need makes the proper dimensioning even more difficult.
  • a reconfigurable antenna system entails the possibility to adapt antenna beam patterns and is considered to be a key enabler for dynamically changing the cell sizes and/ or shapes, known as cell shaping.
  • the antenna tilt is one antenna parameter that can be reconfigured and it is typically applied through remote electrical tilt (RET).
  • RET remote electrical tilt
  • the radiation pattern may be controlled by transmitting a signal from a plurality of antenna elements with an element specific gain and phase. In this way, radiation patterns with different pointing directions and beam widths in both elevation and azimuth directions may be created.
  • UE user equipment
  • a further gain is the possibility to dynamically share the load between cells; if one cell becomes overloaded, the overall capacity in the network decreases due to the system not being able to support the users per area with the minimum requested service. If using beam-forming, the cell size and/ or shape may be adapted and load thereby be shared between cells.
  • SNR Signal-to-noise ratio
  • SINR signal-to-interference-plus-noise ratio
  • RAS-SON Re-configurable Antenna System - Self-Organizing Network
  • An objective of the present disclosure is to solve or at least alleviate at least one of the above mentioned problems.
  • the objective is according to an aspect achieved by a method performed in a network node for traffic dependent cell shaping.
  • the method comprises establishing at least one parameter indicative for a traffic distribution in a cell; selecting, based on the at least one parameter, a traffic situation type among at least a first and a second traffic situation types, wherein each traffic situation type has a respective process running a cell shaping algorithm; and applying, in the cell, the process corresponding to the selected traffic situation type.
  • the present method indeed facilitates such fast tracking.
  • the method facilitates to dynamically exploiting the adaptive nature of active antenna systems.
  • the antenna settings may, according to the present method, be adapted to particular traffic situations.
  • the predictable nature of the traffic distribution, both spatially and temporally, in a network is utilized, and optimized antenna settings are used for each of a number of traffic situation types corresponding to these traffic distributions. This results in an increased performance of the network by the network being capable of adapting to the changing demand from the end users. By measuring and analyzing the traffic variations in the network it is possible to identify a number of different traffic situations.
  • the objective is according to an aspect achieved by a computer program for a network node for traffic dependent cell shaping.
  • the computer program comprises computer program code, which, when executed on at least one processor on network node causes the network node to perform the method as above.
  • the objective is according to an aspect achieved by a computer program product comprising a computer program as above and a computer readable means on which the computer program is stored.
  • the objective is according to an aspect achieved by a network node for traffic dependent cell shaping.
  • the network node is configured to: establish at least one parameter indicative for a traffic distribution in a cell; select, based on the at least one parameter, a traffic situation type among at least a first and a second traffic situation types, wherein each traffic situation type has a respective process running a cell shaping algorithm ; and apply, in the cell, the process corresponding to the selected traffic situation type.
  • Figure 1 illustrates graphs over measured traffic variation over time in a real network.
  • Figure 2 illustrate different traffic scenarios and corresponding measured traffic variation.
  • Figure 3 illustrates a flow chart over steps of an embodiment of a method in accordance with the present teachings.
  • Figure 4 illustrates an environment in which embodiments of the present teachings may be implemented.
  • Figure 5 illustrates graphs on total traffic load and number of handovers during a day.
  • Figure 6 illustrates exemplary traffic situations according to the present teachings.
  • Figure 7 illustrates a flow chart over steps of an embodiment of a method in accordance with the present teachings.
  • Figure 8 illustrates schematically a network node and means for implementing embodiments of the present teachings.
  • Figure 9 illustrates a network node comprising function modules/ software modules for implementing embodiments of the present teachings.
  • Figure 1 illustrates graphs over measured traffic variation over time in a real network.
  • the graphs in figure 1 represent measured traffic in the real system for two different sectors, wherein the graph drawn with dashed line represents a first sector (Sector A) and the graph drawn with solid line represents a second sector (Sector B).
  • the traffic is neither random nor chaotic, but rather dynamic and still predictable.
  • Relative traffic per hour (y-axis) in kilobits per second (kbits/ s) is shown as function of time (x-axis).
  • the traffic patterns during business days, i.e. Monday, Tuesday, Wednesday, Thursday and Friday are quite similar to each other, as are the traffic patterns during weekend, i.e. Saturday and Sunday.
  • the traffic patterns in the different sectors are also similar to each other. The traffic changes are hence, to a large extent, predictable.
  • Figure 2 illustrates different traffic scenarios and corresponding measured traffic variations.
  • the different traffic scenarios are shown overlaid on the measured traffic variation over a day. For example, there may be high traffic in one area during the day, and lower at night. This can be exemplified by scenario 3 wherein there is high traffic in the office building area during office hours, and then in scenarios 1 and 2 (night time and morning/ evening, respectively) there is no or very little traffic in this office building area. As another example, the residential area may have higher traffic at night (scenario 1), while lower during the day (scenario 3). Since the traffic distribution changes, there is not only one setting that is optimal for all of a set of different scenarios.
  • information relating to the traffic distribution is obtained, e.g. measured and/ or calculated.
  • the traffic distribution is also characterized into discrete scenarios. Given each scenario one optimized antenna setting is applied. The traffic is measured and its predictable nature and distribution is utilized to form a number of antenna settings that suits each traffic scenario.
  • By measuring and analyzing the traffic variations in the network it is possible to identify a number of different traffic situation types. In reality, every moment in time will have different traffic distributions. However in order to limit the number of different traffic situation types, traffic distributions that are similar to each other, e.g. with respect to some Key Performance Indicators (KPIs), may be grouped into one and same traffic situation type.
  • KPIs Key Performance Indicators
  • Some metrics that can be established, e.g. by measuring, and used for establishing the traffic distributions are for example, base station utilization, utilization for a cluster of base stations, offered traffic per cell, UE positions, total traffic load in the network, user bitrate, handover rates, which may indicate where UEs are going etc.
  • the UE positions may for instance be based on Global Positioning System (GPS) or coarse directional information through precoder matrix indicator (PMI) reports, Timing advance (TA), angle-of-arrival (AoA) measurements, etc.
  • GPS Global Positioning System
  • PMI precoder matrix indicator
  • TA Timing advance
  • AoA angle-of-arrival
  • FIG. 3 illustrates a flow chart over steps of an embodiment of a method in accordance with the present teachings.
  • a method 10 according to the teachings may comprise the following steps:
  • the traffic distribution is measured. Measurements are collected and analyzed. Such analysis can be made according to prior art. One example on measured traffic distribution and collected measurements was described earlier and illustrated with reference to figure 1, giving the relative traffic per hour in different sectors.
  • the nature of the traffic distribution is characterized and divided into a number of traffic situations.
  • the traffic situations may comprise a high traffic load situation, a low traffic load situation, a certain traffic location situation, e.g. a location at which the majority of traffic is generated, etc.
  • the measurements are used to group the traffic distributions into a finite number of traffic situation types. This grouping may be done such that similar (w.r.t. some KPI) traffic distributions are grouped into the same traffic situation type. For the grouping, similar KPIs may be used as they may later also be used to identify which traffic situation type exists in the network.
  • antenna settings for instance RAS settings, which are used as example in figure 3 and in the following
  • the RAS settings may be optimized individually for each traffic situation type. This means that appropriate RAS settings can be found and adapted independently for each traffic situation type.
  • the current traffic situation is identified during network operation based on several different possible metrics.
  • the RAS settings that are best for each respective traffic situation type may be stored and these RAS settings may then be used later for each respective identified traffic situation type.
  • pre-optimized RAS settings may be applied.
  • the traffic distributions are continuously monitored (as indicated by the arrow back to box 13) based on specified metrics in order to find out which traffic situation type dominates. That is, depending on how the traffic situation types are defined different traffic situation types might occur simultaneously, but the traffic situation type best fitting (dominating) the specified metrics is identified as the currently prevailing traffic situation type. Some examples of possible such specified metrics were mentioned earlier (e.g. base station utilization, offered traffic per cell or sector etc.).
  • thresholds for various KPIs may be used.
  • the closeness of the established KPIs to the respective thresholds may be weighed and used to determine which traffic situation type is the most dominating.
  • the pre-determined RAS settings corresponding to the identified traffic situation type are applied.
  • the number of different traffic situation types should preferably not be too high as the system would then have to change RAS settings often and each change of the RAS settings may temporarily degrade the system performance.
  • too many different traffic situation types it may be more difficult to distinguish between them, which in turn may increase the risk of using a non-optimal setting.
  • Another reason for keeping down the number of different traffic scenario types may be that since the RAS settings are optimized individually for each traffic situation type, more traffic situations will result in a longer optimization time. However, since these RAS settings may be done offline, such prolonged optimization time may be acceptable.
  • the optimization of the RAS settings for each traffic situation type may be done prior to the network installation by classical methods of network planning. One difficulty that might then arise is that the traffic movements and variations can be hard to predict. Another method is to use different SON algorithms as mentioned earlier. It is also possible to combine both, wherein a skilled network planner deduces the initial network settings, and a SON algorithm may be used to fine-tune these settings while the system is up and running.
  • SON algorithms may be used according to the present teachings. This method is more complex, but has the potential to be much quicker, and decouples the risk of evaluating poor settings in the real network. Either of these SON algorithms could be applied together with the present teachings as long as the system keeps track of the traffic situation types during the RAS optimizations. Since one RAS optimization has to be done for each traffic situation type, the total time for the RAS optimizations may increase for the present teachings compared to using one single RAS setting for all traffic distributions. However, once the optimized RAS settings are found for each traffic situation type, the performance of the system may be
  • FIG. 4 illustrates an environment in which embodiments of the present teachings may be implemented.
  • a communications system 20 is illustrated comprising a radio access network (RAN) 21 and a core network (CN) 24.
  • An external packet data network (PDN) 27 is also illustrated.
  • the RAN 21 comprises radio access nodes 22, which may be denoted differently, e.g. base station, evolved NodeB, or eNB to mention a few examples.
  • the radio access node 22 provides wireless communication for communication devices 23 residing within its coverage area. In this context it is noted that one such radio access node 22 may control several geographical areas, e.g. cells or sectors.
  • the CN 24 comprises various network nodes, which may also be denoted differently depending on communication system at hand.
  • the CN 24 may comprise entities such as a Mobility Management Entity (MME) and packet data network gateways (PDN GW) providing connectivity to e.g. the PDN 27.
  • MME Mobility Management Entity
  • PDN GW packet data network gateways
  • the communication system 20 may comprise or be connectable to a PDN 27, which in turn may comprise a server 28 or cluster of servers, e.g. a server of the Internet ("web -server") or any application server. Such server 28 may run applications 29. It is noted that some embodiments of the present teachings may be implemented in a distributed manner, locally and/ or in a centralized component (e.g. in a so called cloud environment).
  • Figure 4 also illustrates a city with some office buildings (indicated by letter “O") and some residential buildings (indicated by letter “R").
  • Figure 5 illustrates graphs on total traffic load and number of handovers during a day.
  • the total traffic load and handover rate (y-axes), respectively, are shown as function of time (x-axis).
  • the total traffic load (indicated as traffic intensity in the figure) as function of time is illustrated by the graph indicated at Gl.
  • the total number of handovers varies during a day, as is illustrated by the graph indicated at G2.
  • the beams transmitted from the base stations could be more up-tilted to increase the path gain of the UEs.
  • the base stations may focus their energy towards the office buildings and during Evening Traffic most base stations may focus their energy towards the residential buildings.
  • One efficient way to define different traffic situation types is to measure the positions of the UEs by exploiting some network information.
  • the UE positions may, as mentioned earlier, be found for example by GPS signaling, TA measurements, PMI statistics, triangulation etc.
  • GPS signaling may, as mentioned earlier, be found for example by GPS signaling, TA measurements, PMI statistics, triangulation etc.
  • different hotspots scenarios that typically occur in networks in a periodical manner. For example, during lunch time many people typically gather in lunch restaurants and during weekends people gather in shopping malls. The different hotspot scenarios can then easily be divided into different traffic situation types.
  • Figure 6 illustrates exemplary traffic situations according to the present teachings.
  • a backup traffic situation may also be defined that may be used for all identified traffic distributions that do not match any of the already defined traffic situations. This backup traffic situation may then be used whenever a non-categorized traffic distribution occurs.
  • Figure 6 illustrates three different traffic situation types, denoted Traffic Situation 1, Traffic Situation 2 and Traffic Situation 3, corresponding to three different hotspot scenarios. The hotspots are illustrated as circles with lines.
  • a Backup Traffic Situation is shown that does not apply to any specific traffic distribution, but may be used if the current traffic distribution does not apply to any of the first three Traffic Situations.
  • Some thresholds of different traffic measurement metrics may be defined for each of the first three traffic situation types so as the system can decide which traffic situation type (Traffic Situation 1, Traffic Situation 2 or Traffic Situation 3) the current traffic distribution belongs to.
  • one threshold for Traffic Situation 1 could be that more than 60 % of the total traffic is located within the hotspot area. If not all the thresholds for any of the first three traffic distributions are fulfilled, the Backup Traffic Situation may be used.
  • all traffic distributions except the one corresponding to the first three Traffic Situations could be used to gather measurements. That is, the Backup Traffic Situation type is an average of all traffic distributions falling outside the defined traffic situation types.
  • RAS-SON algorithms are typically very time consuming and it can take several weeks to tune a network in a city. Operators typically run one RAS-SON algorithm for a city to tune the network and after a couple of weeks, when the antenna settings are tuned, the RAS-SON algorithm stops and the resulting antenna settings are used henceforth.
  • the present teachings defines a number of traffic situations, e.g. as a first step. Then one separate process of a cell-shaping algorithm (e.g. RAS-SON algorithm) is set up for each traffic situation. This means that several individual processes (e.g. of one or more RAS-SON algorithms) are running in parallel and switched between . That is, only the process of the cell-shaping algorithm
  • the present teachings instead defines different traffic situation types.
  • the traffic situation types are not dependent on time of day as such, but adapted to the actual traffic situation at hand.
  • the known method would apply certain antenna settings e.g. between 9 am and 17 pm every day
  • the method according to the present teachings would account for e.g. weekends or holidays having differing traffic situations during those times of day. For instance, the present method would recognize that the traffic situation in a cell on a Monday between office hours might differ from the traffic situation in the cell on a Sunday.
  • the traffic distribution is continuously monitored and mapped to the different traffic situations. This gives a more flexible solution than known methods, as described, i.e.
  • FIG. 7 illustrates a flow chart over steps of an embodiment of a method in accordance with the present teachings.
  • the method 30 may be performed in a network node 22, 26, 28 , e.g. an access point, for traffic dependent cell shaping.
  • the method 30 comprises establishing 31 at least one parameter indicative for a traffic distribution in a cell.
  • the establishing 31 may comprise measuring some parameter e.g. utilization of a cluster of radio access nodes 22, or calculating the parameter or receiving or inquiring the parameter from another node or from a database.
  • the method 30 comprises selecting 33, based on the at least one parameter, a traffic situation type among at least a first and a second traffic situation types, wherein each traffic situation type has a respective process running a cell shaping algorithm.
  • the method 30 comprises applying 34, in the cell, the process corresponding to the selected traffic situation type.
  • the method 30 provides several advantages. For instance, by creating different traffic situation types e.g. in view of traffic distribution, optimized settings for different processes of a cell shaping algorithm can be provided.
  • the processes are not dependent on or bound to certain pre-defined times of day, but are instead based on and triggered by the actual traffic situation at hand, i.e. irrespective of time of day.
  • the provided method 30 facilitates dynamically exploiting the adaptive nature of adaptive antenna systems (AASs) to track traffic changes. This may result in a decreased number of sites needed for a well operating radio access network (RAN), which in turn decreases the hardware costs, as well as the maintenance cost, and cost of operation, e.g. owing to decreased energy consumption.
  • AASs adaptive antenna systems
  • An algorithm such as a cell-shaping algorithm (e.g. a RAS-SON algorithm), may be defined as a set of step-by-step operations to be performed.
  • the cell-shaping algorithm uses parameters to make a change in the network, with the aim to find the parameters that are optimized in some sense, e.g. in view of coverage or throughput.
  • a process in this context, can be defined as an instance of a program run in e.g. a computer, and in particular a process running the cell-shaping algorithm.
  • the cell-shaping algorithm aims at finding the parameters giving e.g. the best possible antenna settings, transmission power, etc. by running a respective process of the cell-shaping algorithm for each respective traffic situation type. That is, multiple such processes of the cell-shaping algorithm are run: one process for each traffic situation type. Each such process then has its own parameters to improve.
  • the parameters may comprise any parameter having impact on e.g. coverage, throughput, capacity etc.
  • the method 30 may be performed in a system as well.
  • the different steps may be performed in a distributed manner, wherein devices are configured to collaborate. For instance, one or more steps may be performed by a first device (e.g.
  • the network node 22, 26, 28 and other steps by other devices (e.g. in a core network node 26).
  • a core network node 26 an implementation that may be envisioned is that the establishing 31 the at least one parameter and the selecting 33 a traffic situation type based on the at least one parameter may be performed by a core network node 26 or PDN server 28 , and that the network node 22 receives
  • the method 30 comprises identifying 32, based on the
  • the traffic distribution in the cell as one of at least a first and a second traffic situation types or as a traffic situation type different than the at least first and second traffic situation types.
  • the method 30 comprises, for the case that the traffic distribution in the cell is identified as a traffic situation type different than the at least first and second traffic situation types, classifying the traffic distribution in the cell as a third traffic situation type.
  • a traffic situation type that does not fit into any already existing traffic situation type may thus be the basis for creating a new traffic situation type.
  • the method 30 is thus flexible and different degrees of accuracy may be provided e.g. in that the method meets the different needs of different traffic situations by using different sets of parameters which are to be adapted to the particular traffic situation type. There may be a tradeoff between the number of different traffic situation types and efficiency in that it may be inefficient use of e.g. processing capacity to alter between too many different traffic situations.
  • the method 30 comprises grouping traffic distributions into one of the at least first and second traffic situation types based on the traffic distributions having one or more identical key performance indicators, KPIs, or differing less than a set value.
  • the method 30 comprises applying as initial values, in the respective process running the cell shaping algorithm, current process parameter values of the selected traffic situation type.
  • the method 30 comprises updating the process parameters of the process corresponding to the selected traffic situation type.
  • the algorithm for improving the antenna settings comprises a re-configuration antenna system self- organizing network, RAS-SON, algorithm.
  • the at least one parameter indicative for the traffic distribution comprises one or more of: utilization of a radio access node 22, utilization of a cluster of radio access nodes 22, offered traffic in the cell, positions of communication devices 23, total traffic load in a network 20 , user bitrate and handover rate of communication devices 23. It is noted that a user bitrate,
  • throughput, traffic load, handover rate etc. may be per cell or sector, per cluster of cells or sectors, per site or in the whole network.
  • the process parameter of the processes running the cell shaping algorithm comprise one or more of: antenna settings of a re-configurable antenna system, transmission power, number of sectors, number of communication device specific beamforming ports.
  • the method 30 comprises, for each process for which all process parameters have converged to their final values, applying these final values for the cell-shaping algorithm for the respective traffic situation type.
  • the various embodiments according to the present teachings obtain these final, optimized values faster than conventionally used methods.
  • Figure 8 illustrates schematically a network node and means for implementing embodiments of the present teachings.
  • the network node 22, 26, 28 comprises a processor 40 comprising any combination of one or more of a central processing unit (CPU), multiprocessor, microcontroller, digital signal processor (DSP), application specific integrated circuit etc. capable of executing software instructions stored in a memory 41, which can thus be a computer program product 41.
  • the processor 40 can be configured to execute any of the various embodiments of the method 30 for instance as described in relation to figure 7.
  • the memory 41 can be any combination of read and write memory (RAM) and read only memory (ROM), Flash memory, magnetic tape, Compact Disc (CD)-ROM, digital versatile disc (DVD), Blu-ray disc etc.
  • the memory 41 also comprises persistent storage, which, for example, can be any single one or combination of magnetic memory, optical memory, solid state memory or even remotely mounted memory.
  • a data memory (not explicitly illustrated) may also be provided for reading and/ or storing data during execution of software instructions in the processor 40.
  • the network node 22, 26, 28 may also comprise an input/ output device 43, indicated by II O in figure 8.
  • the input/ output device 43 may comprise an interface for communication exchange for instance with other network nodes, or other entities of the communications system 20.
  • the input/ output device 43 may for instance comprise a communication protocol enabling communication between different nodes.
  • the network node 22, 26, 28 may also comprise or control an antenna system and may then comprise an antenna control device 44, e.g. used for beamforming etc.
  • the network node 22, 26, 28 may also comprise or have access to a database 46 for storing e.g. parameter settings, historical data etc.
  • the network node 22, 26, 28 may also comprise additional processing circuitry 45, e.g. receiving circuitry, transmitting circuitry, etc.
  • the network node 22, 26, 28 is configured to perform any of the embodiments of the method 30 that has been described herein, e.g. with reference to figure 7.
  • a network node 22, 26, 28 is provided for traffic dependent cell shaping.
  • the network node 22, 26, 28 is configured to:
  • each traffic situation type has a respective process running a cell shaping algorithm
  • the network node 22, 26, 28 may be configured to perform the steps of the described embodiments e.g. by comprising a processor 40 and memory 41, the memory 41 containing instructions executable by the processor 40 , whereby the network node 22, 26, 28 is operative to perform the steps.
  • the network node 22, 26, 28 is configured to identify, based on the establishing, the traffic distribution in the cell as one of at least a first and a second traffic situation types or as a traffic situation type different than the at least first and second traffic situation types.
  • the network node 22, 26, 28 is configured to, for the case that the traffic distribution in the cell is identified as a traffic situation type different than the at least first and second traffic situation types, classify the traffic distribution in the cell as a third traffic situation type.
  • the network node 22, 26, 28 is configured to group traffic distributions into one of the at least first and second traffic situation types based on the traffic distributions having one or more identical key performance indicators, KPIs, or differing less than a set value.
  • the network node 22, 26, 28 is configured to apply as initial values, in the respective process running the cell shaping algorithm, current process parameter values of the selected traffic situation type.
  • the network node 22, 26, 28 is configured to update the process parameters of the process corresponding to the selected traffic situation type.
  • the algorithm for improving the antenna settings comprises a re-configuration antenna system self-organizing network, RAS-SON, algorithm.
  • the at least one parameter indicative for the traffic distribution comprises one or more of: utilization of a radio access node 22, utilization of a cluster of radio access nodes 22, offered traffic in the cell, positions of communication devices 23, total traffic load in a network 20 , user bitrate and handover rate of communication devices 23.
  • the process parameter of the processes running the cell shaping algorithm comprises one or more of: antenna settings of a re-configurable antenna system, transmission power, number of sectors, number of communication device specific beamforming ports.
  • the network node 22, 26, 28 is configured to, for each process for which all process parameters have converged to their final values, apply these final values for the cell-shaping algorithm for the respective traffic situation type.
  • the present teachings also provide a computer program 42 for a network node 22, 26, 28 for traffic dependent cell shaping.
  • the computer program 42 comprises computer program code, which, when executed on at least one processor on the network node 22, 26, 28 causes the network node 22, 26, 28 to perform the method 30 as has been described.
  • a computer program product 41 comprising a computer program 42 as described above and a computer readable means on which the computer program 42 is stored is also provided.
  • the computer program product thus comprises instructions executable by the processor 40.
  • Such instructions may be comprised in a computer program, or in one or more software modules or function modules.
  • Figure 9 illustrates a network node comprising means for implementing
  • the means can be implemented using software instructions such as computer program executing in a processor and/ or using hardware, such as application specific integrated circuits (ASICs), field programmable gate arrays, discrete logical components etc., and any combination thereof.
  • Processing circuitry may be provided, which may be adaptable and in particular adapted to perform any of the steps of the methods that have been described.
  • a network node is provided for traffic dependent cell shaping.
  • the network node comprises first means 51 for establishing at least one parameter indicative for a traffic distribution in a cell.
  • the first means may comprise means for measuring a certain parameter, or means for retrieving, inquiring or receiving the parameter from a device, e.g. database or other network node.
  • the network node comprises second means 52 for selecting, based on the at least one parameter, a traffic situation type among at least a first and a second traffic situation types, wherein each traffic situation type has a respective process running a cell shaping algorithm.
  • the second means 52 may for instance comprise processing circuitry adapted for such selection .
  • the network node comprises third means 53 for applying, in the cell, the process corresponding to the selected traffic situation type.
  • the third means 53 may comprise processing circuitry adapted to output a signal to e.g. antenna control means, which in turn sets e.g. antennas according to the selected traffic situation type.
  • the means 51, 52, 53 can, as mentioned, be implemented using software instructions such as computer program executing in a processor and/ or using hardware.
  • additional means schematically indicated at reference numeral 54, may be provided for implementing the various embodiments of the present teachings.
  • the network node may comprise additional means 54 for identifying traffic

Landscapes

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

Abstract

L'invention concerne un procédé (30) qui peut être exécuté dans un nœud de réseau (22, 26, 28) pour une mise en forme de cellule dépendant du trafic. Le procédé (30) consiste : à établir (31) au moins un paramètre indiquant une distribution de trafic dans une cellule ; à sélectionner (33), sur la base du ou des paramètres, un type de situation de trafic parmi au moins un premier et un second type de situations de trafic, chaque type de situation de trafic ayant un processus respectif exécutant un algorithme de mise en forme de cellule, et à appliquer (34), dans la cellule, le processus correspondant au type de situation de trafic sélectionné. L'invention concerne également un nœud de réseau correspondant (22, 26, 28), un programme d'ordinateur et des produits programme d'ordinateur.
EP15801383.9A 2015-11-24 2015-11-24 Procédé et noeud de réseau pour une mise en forme de cellule dépendant du trafic Withdrawn EP3381213A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2015/077415 WO2017088903A1 (fr) 2015-11-24 2015-11-24 Procédé et nœud de réseau pour une mise en forme de cellule dépendant du trafic

Publications (1)

Publication Number Publication Date
EP3381213A1 true EP3381213A1 (fr) 2018-10-03

Family

ID=54705588

Family Applications (1)

Application Number Title Priority Date Filing Date
EP15801383.9A Withdrawn EP3381213A1 (fr) 2015-11-24 2015-11-24 Procédé et noeud de réseau pour une mise en forme de cellule dépendant du trafic

Country Status (3)

Country Link
US (1) US20180332475A1 (fr)
EP (1) EP3381213A1 (fr)
WO (1) WO2017088903A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10212615B1 (en) 2017-10-29 2019-02-19 Cisco Technology, Inc. Tracking area optimization
US11991581B2 (en) 2020-08-06 2024-05-21 Samsung Electronics Co., Ltd. Methods and apparatus for multi-shot network parameter optimization

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ES2649891T3 (es) * 2011-07-05 2018-01-16 Alcatel Lucent Concepto para coordinación de interferencia entre células en una red de comunicación celular
US9405129B2 (en) * 2013-08-02 2016-08-02 Jungwoo Kim Structure of eyeglass frame
JP6441925B2 (ja) * 2013-08-09 2018-12-19 エルジー エレクトロニクス インコーポレイティド 無線通信システムにおけるセル形成指示を送信する方法及び装置
WO2015043618A1 (fr) * 2013-09-24 2015-04-02 Nokia Solutions And Networks Oy Échange d'informations sur une répartition de charge dans des cellules voisines
US9992686B2 (en) * 2014-11-03 2018-06-05 Lg Electronics Inc. Method and device for performing cell shaping

Also Published As

Publication number Publication date
US20180332475A1 (en) 2018-11-15
WO2017088903A1 (fr) 2017-06-01

Similar Documents

Publication Publication Date Title
CN107750471B (zh) 使用节点之间的路径损耗确定的无线网络配置
CN107787534B (zh) 子采样天线元件
CN107787595B (zh) 管理无线网络中的外部干扰
US20150302123A1 (en) X-maps with flexible tiles
US11395307B1 (en) Systems and methods for interference management in a radio access network
EP4000228A1 (fr) Optimisation proactive d'un réseau mobile
Muñoz et al. Self-dimensioning and planning of small cell capacity in multitenant 5G networks
RU2676867C1 (ru) Использование информации о луче антенны
US11304074B1 (en) Systems and methods for orchestration and optimization of wireless networks
EP3818743A1 (fr) Procédé dans un réseau de communication radio utilisant le regroupement de mesures géolocalisées
CN114145042B (zh) 移动网络中的交叉优化
US20190036587A1 (en) A method and a network node for muting antenna elements of an active antenna system
EP3326405A1 (fr) Paramètres d'antenne dans des réseaux de communication sans fil
CN107431937B (zh) 自适应天线系统的自适应扇区配置
CN112913276A (zh) 用于无线电网络优化的动态小区选择
US20180332475A1 (en) Method and network node for traffic dependent cell shaping
US20220346033A1 (en) Systems and methods for dynamic per-beam adjustment of output power in a wireless network
US20170013475A1 (en) Performance Improvement in Wireless Communications Networks
CN107113633A (zh) 优化通信网络的处理方法和装置
KR20140148229A (ko) 무선 통신 시스템에서 안테나 제어 방법 및 장치
US20220303790A1 (en) Adaptive beamwidth switching and beam steering in large public venue (lpv) smart antenna system
US10490890B2 (en) Dynamic antenna azimuth adjustment
Bratu et al. Antenna tilt load balancing in self-organizing networks
WO2014136742A1 (fr) Système de communication sans fil, procédé de contrôle de paramètres de communication sans fil, dispositif de gestion de réseau, et station de base sans fil
WO2023126185A1 (fr) Système de communication cellulaire ayant une fonctionnalité son avancée

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20180529

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

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20200204

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 16/08 20090101AFI20210430BHEP

Ipc: H04W 16/24 20090101ALN20210430BHEP

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

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20211012