EP3443770B1 - Radio zugang netzwerk node - Google Patents

Radio zugang netzwerk node Download PDF

Info

Publication number
EP3443770B1
EP3443770B1 EP16719793.8A EP16719793A EP3443770B1 EP 3443770 B1 EP3443770 B1 EP 3443770B1 EP 16719793 A EP16719793 A EP 16719793A EP 3443770 B1 EP3443770 B1 EP 3443770B1
Authority
EP
European Patent Office
Prior art keywords
node
data structure
point
map
territory
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
EP16719793.8A
Other languages
English (en)
French (fr)
Other versions
EP3443770A1 (de
Inventor
Simone Bizzarri
Andrea Buldorini
Andrea SCHIAVONI
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.)
Telecom Italia SpA
Original Assignee
Telecom Italia SpA
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 Telecom Italia SpA filed Critical Telecom Italia SpA
Publication of EP3443770A1 publication Critical patent/EP3443770A1/de
Application granted granted Critical
Publication of EP3443770B1 publication Critical patent/EP3443770B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • 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/18—Network planning tools
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/08—Reselecting an access point
    • H04W36/085—Reselecting an access point involving beams of access points
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports

Definitions

  • the solution disclosed in this document generally relates to the field of telecommunications. Particularly, the solution here disclosed relates to radio telecommunication networks, and even more particularly to mobile radio telecommunication networks.
  • Radio telecommunication networks particularly mobile radio telecommunication networks, comprise a Radio Access Network (RAN), based on one or more Radio Access Technologies (RATs, e.g. 2G, 3G, 4G, 5G as defined by the 3GPP - Third Generation Partnership Project), and a core network.
  • RAN Radio Access Network
  • RATs Radio Access Technologies
  • Network nodes of a mobile RAN as an example radio base stations or micro/pico nodes of micro/pico network cells (e.g., eNodeBs of Long Term Evolution - LTE - and LTE-Advanced - LTE-A - networks), from now on named indistinctly as nodes, in their operative context do not make use of information based on and/or representative of the topographical environment, descriptive of the urban environment and/or the orography of the geographic territory subtended by the nodes in terms of geometrical description of buildings, infrastructures and any type of scenario into which they operate. On the other hand, such information is important for the aim of the electromagnetic field propagation etc.
  • the nodes may collect information and measurements related to the radio signal strength or quality together with geolocation information of a single measurement sample or a group of measurements samples.
  • the collected information and measurements can be used to derive a partial knowledge of the topographical environment (e.g., to identify areas where the radio coverage is poor or to infer the existence of main streets/buildings) by observing degradation of system performances due to propagation and traffic, but the use of the collected information and measurements is not intended to allow the node detect the root causes related to the territory topography.
  • An other example can be found in WO 97/36255 .
  • Position planning and radio signal propagation analysis over the topographical environment in which the nodes operate are processes performed outside of the nodes; the generic node is not made aware of these sets of information, it is not informed about what is the environment where it is operating and, as a consequence, the node cannot make use of these pieces of information to take decisions in its operational activity.
  • a node can perform interference status management over its own territory only once the node has the knowledge of the interference situation reported by measurements performed by UE during connection or when a UE requires a service to the node.
  • REMs are currently being studied and specified in ETSI's emerging standard on Reconfigurable Radio Systems. In contrast to the static databases used in 3G and LTE systems, REMs provide a wireless network with a comprehensive and up-to-date representation of the radio environment including dynamic knowledge on propagation environment, which can be used to optimize radio resources".
  • the degrees of freedom intended as a set of technologies and parameters that a node is able to configure in different ways in order to satisfy UE service requests, can be listed in:
  • the selected node configuration it does not take into account any information coming from the environmental radio propagation conditions experimented by the radio signals emitted by the node and/or similar radio signals propagation aspects regarding neighboring network nodes.
  • the decisions that a node can make about the best choice of configuration to adopt for what is relevant to a service request coming from a served UE, or for a service request coming from a to-be-served UE, for a certain UE mode (for example: idle mode, connected mode) are not based on any a-priori internal knowledge regarding the status of the environmental radio propagation condition, the UE and the geographical distribution of the load over the node operation area, and do not take into account neighboring nodes' operation area over the environmental operative context.
  • the knowledge a node has of its own operational area does not include information regarding the topography of the environment and an a-priori coverage/interference information about the topography, but at most includes information collected only by UE in connected mode during their activity.
  • WO 2013/127355 A1 describes a modality to collect measurements by UE in order to build a REM Map and to use it to allocate node's resources.
  • US 2012/0122476 A1 deals with the creation of geo context info data set, collecting spatial information, sensor data and context in order to provide spatial based services to a UE.
  • US 2015/0326994 A1 is related to a UE profiling even if data relevant to the characterization of the electromagnetic environment are indicated too.
  • RRM Radio Resource Management
  • FR 2997813 A1 deals with the definition of a procedure for the optimization of the node's coverage on the base of the collections of measurements taken by the UE. Measurements are then referenced to the topography of the served area and used to optimize coverage, as an example to fill holes in coverage.
  • the Applicant has tackled the problem of the known approaches in the seek to improve operation flexibility of the nodes of telecommunication networks.
  • a radio access network node of a telecommunication network comprising:
  • said processor is further configured to execute computer-readable instructions so as to:
  • Said topographic map of said geographic territory may comprise one among a two-dimensional (2D) map of the geographic area enriched with estimations of heights and a three-dimensional (3D) topography map of said geographic territory.
  • Said topographic map of said geographic territory can either be downloaded from a remote database of digital topographic maps of the environment, or it can be generated onsite by the node or by a remote system in real time by processing mono/stereoscopic images of the environment.
  • said description of a service delivery capability of the node in a point may comprise one or more of:
  • said processor can be configured to execute computer-readable instructions so as to update the first data structure in response to a change in a configuration of the network node.
  • each of said second data structure records contains data corresponding to the data contained in the first data structure record of the at least one neighbor network node for the considered point.
  • Each of said second data structure records may also contain an identifier of the at least one neighbor node.
  • said processor can be configured to execute computer-readable instructions so as to update the second data structure in response to a change in a configuration of at least one neighbor network node.
  • said processor can be further configured to execute computer-readable instructions so as to:
  • said processor van be further configured to execute computer-readable instructions so as to:
  • said processor can be further configured to execute computer-readable instructions so as to:
  • a radio access network node of a telecommunication network comprising a system of radiating antennas comprising at least one radiating antenna for radiating radio signals through a geographic territory, the method comprising:
  • the method may further comprise:
  • the method may comprise either downloading said topographic map of said geographic territory from a remote database of digital topographic maps of the environment, or generating said topographic map onsite at the node or at a remote system in real time by processing mono/stereoscopic images of the environment.
  • the method comprises updating the first data structure in response to a change in a configuration of the network node.
  • each of said second data structure records contains data corresponding to the data contained in the first data structure record of the at least one neighbor network node for the considered point, and an identifier of the at least one neighbor node.
  • the method can comprise updating the second data structure in response to a change in a configuration of at least one neighbor network node.
  • the method further comprises:
  • the method further comprises:
  • the method further comprises:
  • Figure 1 shows pictorially a (small) portion of a radio telecommunication network comprised of three network nodes N, Nn and Nnn .
  • Reference numerals T, Tn and Tnn denote the geographic territory (geographic area) covered (i.e., served) by nodes N, Nn and Nnn respectively.
  • Node N in the following description will be regarded as the network node under consideration, node Nn is a network node in the neighborhood of node N (neighbor network node) and node Nnn is a network node which is not in the neighborhood of node N (non-neighbor network node).
  • a network node like the node Nn , is a neighbor node to another node, like node N, if there is a relationship between the two nodes N and Nn , as an example the two nodes serve a shared portion of territory (like the territory ST in the drawing).
  • a network node of a radio telecommunication network be considered which has to be placed in a defined geographical territory position, or a network node that is already deployed on the field (in a certain geographical territory position) and that has to be upgraded/updated with additional features, for example, but not limited to, a new RAT (for example, a network node that was previously equipped with a GSM - "2G” - and UMTS - "3G" - RATs, is to be upgraded by equipping it with a LTE/LTE-A - "4G" - RAT). Making reference to Figure 1 , such a node is taken to be node N .
  • a node N is equipped with a radiating system (antenna system) 205 including a certain number of antennas 210 1 - 210 p (from 1 - just one antenna - to a generic number p of antennas), each antenna having the possibility to manage 1 to m radiating beams (antenna beams) 215 1 - 215 m .
  • a radiating system antenna system 205 including a certain number of antennas 210 1 - 210 p (from 1 - just one antenna - to a generic number p of antennas), each antenna having the possibility to manage 1 to m radiating beams (antenna beams) 215 1 - 215 m .
  • the antenna system 205 comprises an antenna beam data base 220 which is a repository where, for each beam 215 1 - 215 m of the antenna system 205, there is stored a set of data, parameters and settings in order to allow the generic antenna 210 1 - 210 p to generate and radiate the selected beam; as an example, if the antenna radiator is an antenna array, the data base 220 contains, for each beam that the antenna array can generate, the list of weights to be associated to each current feeding each array radiating element to generate the beam.
  • the antenna system 205 also comprises a functionality for beam synthesis 225, which is a system, implemented locally on the node N or remotely, that is able to synthesize data, parameters and settings in order to allow the antenna 210 1 - 210 p to generate a beam with given characteristics, in case the needed beam is not present in the beam data base 220.
  • a functionality for beam synthesis 225 is a system, implemented locally on the node N or remotely, that is able to synthesize data, parameters and settings in order to allow the antenna 210 1 - 210 p to generate a beam with given characteristics, in case the needed beam is not present in the beam data base 220.
  • the node N includes a data processor configured to execute computer-readable instructions so as to implement the functions of the functional blocks depicted in Figure 3 .
  • the node N has available a detailed description of the geographic territory, of the geographic environment associated to the territory where the node N is placed and (is intended to) operate(s). Such a detailed description of the geographic territory is from now on referred to as "Topographical Map" (TM) 305.
  • the TM 305 can be a two-dimensional (2D) map of the node's geographic environment enriched, if necessary, with heights or estimations of the heights (as an example, hills/mountains heights or buildings heights).
  • the TM 305 can be a three-dimensional (3D) topography map of the environment associated to the territory where the node operates.
  • Figure 4A shows an exemplary 3D topography map for an environment constituted by a "town canyon", i.e. a zone of a town with a central boulevard 405, four building blocks 410 on each side of the central boulevard 405 and three side boulevards departing from each side of the central boulevard 405 between the building blocks 410.
  • Figure 4B shows a plan (2D) view of the exemplary 3D topography map of Figure 4A .
  • the span i.e. the extension of the TM 305 depends on the capability related to the radio coverage of the territory by the considered node N .
  • the TM 305 contains a description of the buildings present on the territory (e.g., the building blocks 410 ), a description of the orography of the territory and, in general, whatever detail is present in the environment, which is useful for the description of the environment itself (such as for example the type of ground, sand, sea water, street furniture etc.) and which should be taken into account for radio coverage assessment purposes.
  • the 3D spatial resolution of the TM 305 depends on the desired accuracy and is not limitative for the solution here disclosed.
  • the TM 305 can be derived, for example but not limited to, by topography databases of the environment topography (like the database 310 shown in Figure 3 ), electronic models of town maps, aerial photogrammetry etc.. If necessary, in particular for coverage computation purposes, the TM 305 could also be submitted to a discretization process according to which the whole space is subdivided into basic elements, e.g. parallelepipeds for a 3D TM representation. In this case, for example, a building will be approximated by a sequence of small parallelepipeds.
  • Figure 4C shows a 2D section of the discretized 3D topography map of Figure 4A .
  • the TM 305 can be downloaded from a centralized server 315 that collects, in a database (like the database 310 ), digital maps of the environment. Once the position of the node N is known, for example by means of geo-referencing (or by storing the node position in the node), the node N can query the centralized server 315 and provide thereto the node N position and radiating capabilities (as better described later on) as entries.
  • the TM 305 in a proper format (for example, but not limited to, .bil, vector arcinfo, .gbr, .dwg formats), is downloaded on the node N . This downloading phase could be managed in different ways:
  • the TM 305 can be built onsite in the node N by a local TM builder 320 or by a remote system 323 in real time on the basis of the node's N position, radiating capability (as better described later on) and on the basis of a set of mono/stereoscopic images of the environment associated to the territory served by the node N .
  • the mono/stereoscopic images are processed by a specialized system, executing an image processing software, for example by exploiting image recognition tools.
  • the TM 305 is then generated automatically (and possibly delivered to the node N ) .
  • the extension of the TM 305 can be estimated by using the radiation properties of the node N, i.e. antenna gain and maximum radiated power.
  • a rough, initial estimation of the initial extension of the TM 305 can be obtained.
  • Such initial TM 305 is actually a non-optimized, "oversized" TM 305.
  • the TM 305 optimal extension will subsequently be accurately computed by using the approach described in the following.
  • the node N makes use of an Electromagnetic Coverage Predictor (ECP) 325 (the ECP 325 can be a function available internally to the node, as depicted in the drawing, or it can be a function available remotely, for example on a remote server, not shown in the drawing) which, on the basis of the knowledge of the node's N environment provided by the TM 305, is able to compute, for each beam 215 1 - 215 m of each antenna 210 1 - 210 p of the Antenna System (AS) 205, the coverage level, expressed for example, but not limited to, in terms of electric field in each point of TM.
  • the ECP 325 can for example use (but this is not limitative) ray tracing techniques associated to electromagnetic field propagation properties (e.g., but not limited to, reflection and diffraction).
  • the ECP 325 can exploit the maximum radiated power on each beam and the initial, oversized, TM 305.
  • An intermediate result of the calculations performed by the ECP 325 is a set 330' of Coverage Maps (CMs), one CM for each beam 215 1 - 215 m of each antenna 210 1 - 210 p belonging to the AS 205 of the node N, computed over the initial, oversized TM 305.
  • CMs Coverage Maps
  • coverage quantity a level for the radio coverage
  • Figure 5A shows an exemplary CM of the set 330' for the exemplary environment considered in Figure 4A (the exemplary CM corresponds to one of the beams 215 1 - 215 m of one of the antennas 210 1 - 210 p belonging to the AS 205 of the node N assumed to be placed at the right central position of the central boulevard 405 - see Figure 4A ).
  • the distance along the central boulevard 405 from the node N is reported in abscissa, in meters; the level of the electric field in different positions is indicated by different tones of grey (a darker grey tone corresponds to a higher electric field level).
  • the CMs of the set 330' are "oversized" CMs, having the same size, in terms of territorial extension, as the initial, oversized TM 305 and, as the oversized TM 305, the oversized CMs of the set 330' are preferably reduced, shrunk, preferably to the minimum useful dimension for the coverage purposes.
  • the oversized CM of the set 330' e.g.
  • CM 330' i depicted in Figure 5B all the regions having a computed coverage quantity (e.g., field level) below a lower coverage quantity (e.g., field level) threshold, preferably a minimum coverage quantity (field level) threshold (e.g., region 500 in Figure 5B ) cannot be reached in terms of radio link by the node N and, consequently, such sub-threshold regions are not of interest for coverage purposes.
  • a computed coverage quantity e.g., field level
  • a lower coverage quantity e.g., field level
  • a minimum coverage quantity (field level) threshold e.g., region 500 in Figure 5B
  • the definition of the lower (minimum) coverage quantity threshold defines a surface, for each CM of the set 330', discriminating regions of the CM that can be reached from regions of the CM that cannot be reached; under this point of view, the separating surface generates a reduced-size CM, preferably a minimum optimal size CM, like the minimum optimal size CM 330 i depicted in Figure 5B , and, consequently, a corresponding shrunk, reduced-size (preferably, minimum) TM 305' (which is a territorial map containing the same territory points as the corresponding minimum optimal size CM 330 i ) for each beam 215 1 -215 m of each antenna 210 1 - 210m belonging to AS 205.
  • a reduced-size CM preferably a minimum optimal size CM
  • the reduction of the generic oversized CM to a minimum optimal size CM can be done by setting a threshold ("coverage quantity threshold”) for the coverage quantity computed by ECP 325 in constructing the minimum optimal size CMs, so as to get the minimum surface containing all the points of the CM over the coverage quantity threshold.
  • coverage quantity threshold a threshold for the coverage quantity computed by ECP 325 in constructing the minimum optimal size CMs.
  • a set of minimum optimal size CMs is created, and the generic minimum optimal size CM of the set contains all the points in which the coverage quantity exceeds the coverage quantity threshold and that are potentially reachable for connection to the network.
  • the process of reduction of the oversized CMs is repeated for each CM of the set 330' (i.e., for each beam 215 1 - 215 m of each antenna 210 1 - 210 p belonging to the AS 205 associated to the node N ) , thereby obtaining, at the end of the process, as many minimum optimal size CMs as many are the beams 215 1 - 215 m of each antenna 210 1 - 210 p associated to the AS 205.
  • the minimum surface defined by the envelope containing all these minimum optimal size CMs forms an overall minimal optimal size CM 330 and also defines the dimension for the reduced-size (preferably, minimum) TM 305', so the minimal (minimum optimal size) TM 305' contains the topographical description of the whole territory that can be reached for connection to the network, by at least one of the beams 215 1 - 215 m of at least one of the antennas 210 1 - 210 p of the AS 205 associated to the node N .
  • a first data structure 335 referred to as Auto-Radiation Array (ARA) is then created by a first data structure (ARA) creator 340 starting from the overall minimum optimal size CM 330.
  • the first data structure 335 contains data relevant to the coverage for the TM and radiated by the node itself.
  • the first data structure 335 comprises a plurality of ARA elements, each ARA element corresponding to a respective position (i.e., point representative of a territorial position) of the minimal TM 305', and to each ARA element there is associated a node service capacity in that minimal TM 305' point, such service capacity being based on the node's N available resources.
  • a service record of the list can contain:
  • Figure 6 shows a part of an exemplary first data structure (ARA) 335.
  • Reference numeral 605 identifies one of the service records of the list of service records in the ARA 335 associated to a generic territory point 610.
  • the ARA 335 can be considered as the logical combination of all the minimum optimal size CMs 330 i associated to all the beams 215 1 - 215 m of all the antennas 210 1 - 210 p of the AS 205 associated to the node N and has the same size as the minimal TM 305'. Even if data relating to the coverage capacity of each beam belonging to the antenna system of the node are already contained in the set of minimum optimal size CMs 330 i , it is more efficient to collect all these data in a unique data structure that is directly related to the minimal TM 305'.
  • the ARA 335 contains more information that the set of minimum optimal size CMs 330 i , in particular the ARA 335 contains, in addition to the indication of the coverage quantity, information about the antennas and beams used to cover the territory points, information about the frequency channels, information about the RAT. All these pieces of information are collected in single service records, an arrangement that makes the different pieces of information easier to exploit.
  • the first data structure 335 pertains to and is directly used by the node N in its operation, as described in greater detail later on.
  • the node N can exploit the information contained in the ARA 335 for taking decisions which are influenced by radio signal propagation aspects and intra-cell interference aspects, taking into account the knowledge of the node's environment (as provided by the minimal TM 305' and the overall minimum optimal size CM 330 ).
  • a configuration change in this context, means whichever change can affect the radiation characteristics experienced by a territory point in the node's TM, thereby causing a change of a node's ARA 335.
  • an increase in the radiating power on one frequency of an antenna of the antenna system of the node generally produces a change (enlargement) of the minimal TM 305'; in this case, a new minimal TM 305' needs to be generated.
  • a second data structure 345 belonging to the node N and referred to as Mutual-Radiation Array (MRA) is created by a second data structure (MRA) creator 350.
  • MRA Mutual-Radiation Array
  • the second data structure 345 for each position (point) of the territory served by the node and included in the minimal TM 305', there is associated a service capability in that point of the neighbor nodes located in the neighborhood of the node N, like the node Nn in Figure 1 .
  • the MRA 345 collects a picture of the ARA 335 pertaining to neighbor nodes (e.g., the node Nn ) over the territory shared with the considered node N (the territory shared by nodes N and Nn is denoted ST in Figure 1 ).
  • the MRA 345 at its maximum extension, has the same size as the ARA 335 and the minimal TM 305' (this happens in case every point of the territory of the minimal TM 305' of the node N is shared with at least one neighbor network node).
  • a list of records is defined, and each record can contain at least:
  • Figure 7 shows (a part of) an exemplary second data structure (MRA) 345 (the part of the MRA 345 shown in Figure 7 is that corresponding to the generic territory point 610 already considered in Figure 6 ).
  • Reference numeral 705 identifies one of the records of the list of records in the MRA 345 associated to the generic point 610.
  • Letters "A”, “L”, “S”, “Y” are meant to be identifiers of neighbor nodes.
  • the second data structure 345 pertains to and is directly used by the node N in its operation, as described in greater detail later on.
  • the node N can exploit the information contained in the MRA 345 for taking decisions which are influenced by inter-cell signal interference aspects, taking into account the knowledge of the node's environment (as provided by the minimal TM 305' and the overall minimum optimal size CM 330 ).
  • the MRA 345 is built by (the MRA creator 350 of) the node N by querying its neighbor nodes (e.g., the node N n ) ; if the considered point of the territory (point 610 in the shown example) can be served, in addition to node N, also by (at least one of) the neighbor nodes (meaning that the considered point also belongs to the ARA 335 of - at least one of - the neighbor nodes), the neighbor node(s) answer(s) to the query by providing to the node N the list of records contained in their respective ARAs 335 for that territory point.
  • the neighbor nodes e.g., the node N n
  • a network node When a network node changes its configuration, it updates its own ARA 335 as described in the foregoing and, as a consequence, the MRAs 345 of all its neighbor nodes are also updated.
  • a configuration change in this context, means whichever change can affect the radiation characteristics experienced by a territory point in the node's TM, thereby causing a change of a node's ARA 335.
  • the MRA 345 of the node N is updated once the node N is activated and every time there are changes in the configuration of either the node N or its neighbor nodes.
  • the modalities according to which the node N is made aware about changes in the configuration of its neighboring nodes can be:
  • the first data structure (ARA) 335 and the second data structure (MRA) 345 are sufficient to allow a generic network node to take operating decisions in aspects that are influenced by the radio signal propagation and intra- / inter-cell interference aspects, taking into account the node's environment.
  • a third data structure 355 named Current Availability Service Array (CASA) is then built by a third data structure (CASA) creator 360.
  • the third data structure 355 which has the same dimension as the minimal TM 305', for each point of the territory served by the node N, there is defined a list of records, each one reporting the presence and the characteristics of a UE placed in that point, for the time the considered UE is in connected mode with the node N, the status or type of service required to the node N by that UE and the resources of the node N dedicated to serving that UE.
  • the node N updates the CASA 355 every time a UE changes its service requests (for example, but not limited to, voice service, data service, etc.) or in case of UE movement (from that point to a different point). If the considered territory point belongs also to the MRA 345 (i.e., the considered territory point is covered also by at least one neighbor node), the node N also causes the CASA 355 of all the neighbor nodes sharing that point (e.g., node Nn ) to be updated. Specifically, the CASA 355 gives a map of:
  • the management of the life cycle of the activity of a UE can be foreseen a-priori by a node, thanks to the fact that the network nodes (serving node and neighbor nodes), by means of the information contained in the respective minimal TM 305', ARA 335, MRA 345 and CASA 355, can learn and define, a-priori, actions to be undertaken to manage the life cycle of the served UE and then the nodes can activate all the necessary mechanisms so as to perform these actions.
  • An example of that is the prediction of trajectories that a UE can follow: by analyzing the path followed by the UE, related to the minimal TM 305' for topography and to the ARA 335 and the MRA 345, the generic network node can foresee which could be the next position of the considered UE and then select the best solution to serve the UE, where by "best solution" there is intended the best serving node (the considered node itself or a neighbor node) and /or the best serving antenna of the AS of the node and/or the best serving antenna beam that the node can radiate to deliver the service to the UE on that time-space point.
  • the choice can be made in terms of, as an example, but not only:
  • the node N can make decisions for the optimization of its performances; an example of that is the decision that a node can make of serving with a same beam all the UE in a geographic area that can be covered by just one beam 215 1 - 215 m of an antenna 210 1 - 210 p of the AS 205, or the decision of causing the UE to be served by a neighbor node, like node N n , working on another RAT/frequency to avoid interference, and the node N can make such a decision just by analyzing the MRA 345.
  • the construction of the third data structure (CASA) 355 requires the localization of the UE over the territory. Localization can be intended as:
  • a record associated to the localized UE is then included in the CASA 355 in correspondence of the point of the territory corresponding to the UE whose localization has been estimated.
  • the accuracy in the localization of the UE is not crucial; more important is to localize and characterize served regions and trajectories over the territory and relate them to the environment topography, within the definition obtainable by the available antenna beams, associated to the typology of the required service (for example, a relatively narrow and low-power beam can advantageously assigned to serve a static UE, whereas for serving a moving UE a wider and higher power beams is preferable).
  • Figure 8 shows a pictorial representation of an exemplary third data structure (CASA) 355.
  • Reference numerals 805 and 810 denotes two trajectories followed by two UE (reference numerals reference numerals T1, T4, T# denote the time instants corresponding to a sequence of three positions along the trajectory 805, and reference numerals T1, T4, T6, T#, T# denote the time instants corresponding to a sequence of five positions along the trajectory 810 ).
  • 810 For each time instant of each trajectory 805, 810 there is an associated record, like the record denoted 820 that contains (in the shown example): an identifier of the UE, an indication of the time instant, an indication of the service required by the UE, as well as, possibly, other data not depicted in the drawing.
  • a fourth data structure 365 referred to as Service Time Image Map Array (STIMA) is created by a fourth data structure (STIMA) creator 370.
  • STIMA Service Time Image Map Array
  • a dynamic space/time image of which types of services are required during the time in each point of the territory served by the node N is given.
  • the service required by each UE located in that point and a time stamp indicating when the service has been required are recorded.
  • the time stamp is useful to get statistics and to remove obsolete (too old) occurrences, maintaining updated the image of the service dynamics.
  • the STIMA 365 could be multidimensional in the time if it is desired to put into evidence time-dependent behaviours, like for example:
  • the STIMA 365 is used to estimate, a priori, what could be the most probable activity that the node N should perform when a UE that is following a certain path described in the CASA 355 (like the trajectory 805 or 810 in Figure 8 ) is approaching one of the accumulation points defined in the STIMA 365. Based on such an activity estimation, the node N is able to prepare actions to best serve the UE or modify its configuration (as an example, but not only, the node N can decide what is the best antenna and beam of its AS 205 to serve the considered UE, taking into account the traffic situation described in the CASA 355, how many resources are needed to serve UE located in accumulation points, pre-configure in time the node N to serve traffic peaks during certain hours of the day etc.).
  • the STIMA 365 is an aggregate of data that provides the history of what UE have done in the past in certain points of the territory served by a node. For example, by knowing that a certain point of the territory served by the node is an accumulation point, and that, statistically, UE stationary in that point request mainly services of a certain kind (e.g., web browsing), the node that is serving a certain UE that is moving along a path and that is approaching the accumulation point can in advance prepare itself to provide to that UE the service that more likely will be requested when the UE reaches the accumulation point.
  • a certain point of the territory served by the node is an accumulation point, and that, statistically, UE stationary in that point request mainly services of a certain kind (e.g., web browsing)
  • the node that is serving a certain UE that is moving along a path and that is approaching the accumulation point can in advance prepare itself to provide to that UE the service that more likely will be requested when the UE reaches the accumulation point.
  • the fourth data structure 365 can be created in various ways, for example by analyzing the third data structure 355.
  • Figure 9 shows a piece of an exemplary fourth data structure (STIMA) 365, associated to a point of the territory (the point 610 considered in Figures 6 and 7 ).
  • STIMA fourth data structure
  • the first data structure (ARA) 335 and the second data structure (MRA) 345 are sufficient to allow a generic network node to take operating decisions on aspects that are influenced by the radio signal propagation and intra- / inter-cell interference aspects, taking into account the node's environment, the third data structure (CASA) 355 and, where present, the fourth data structure (STIMA) 365 allows the network node to take operating decisions on aspects that relate to the services provided/to be provided by the node.
  • the neighbour network nodes exchange (part of) their respective first data structures 335 (so as to create the second data structures 345 and keep them updated): also the third data structure 355 and the fourth data structure 365 are preferably exchanged between neighbour network nodes.
  • a certain network node in preparation of a hand-over to another, neighbor network node of a certain UE, transfers to the neighbour network node the records of its CASA 355 related to the previous positions of that UE, and possibly the records of its STIMA 365 related to an accumulation point that the UE to be handed-over is approaching.
  • Example 1 New node deployment or implementation of a new feature on an already deployed node
  • an exemplary procedure for the deployment of a new network node, or for the implementation of a new feature on an already deployed node is the following, as schematized in the flowchart of Figure 10 .
  • Example 2 Updating the CASA 355 and the STIMA 365
  • An exemplary procedure for updating the CASA 335 and the STIMA 365 of a generic network node, e.g. node N, is the following, as schematized in the flowchart of Figure 11 .
  • Example 3 Usage of the STIMA 365 and the CASA 355 to predict antenna beam to be activated on neighbor nodes
  • the node N1 makes the decision to serve both UE UE1 and UE2 with a directive beam 1305 (one of the beams 215 1 - 215 m of an antenna 210 1 - 210 p of its own AS 205 ), as schematized in Figure 13 (block 1520 ). So, the node N1 (serving node) updates in its own CASA 355 the activities of the UE UE1 and UE2 (block 1525 ).
  • the serving node N1 can estimate that the UE UE1 is approaching to the first accumulation point AP1 (block 1530 ) and, by inspecting its own CASA 355 and STIMA 365, the serving node N1 can decide whether to continue to serve the rightmost UE UE2 while leaving the leftmost UE UE1 to the neighbor node N2.
  • the serving node N1 asks the neighbor node N2 if it can take control of the UE UE1 (block 1535 ) and, on positive answer, the node N1 communicates to the neighbor node N2 the CASA 355 data regarding such UE UE1 (block 1540 ), while for the moment still continuing to serve the UE UE1.
  • the above step is intended as a preparation phase for the actual handover procedure.
  • a traffic and load balancing among nodes can be performed. This is more accurate than typical SON load balancing algorithms, as it considers traffic changes over the time and the space.
  • the neighbor node N2 When ready, the neighbor node N2 will start serving the UE UE1 (block 1545 ), that leaves the previous serving node N1.
  • the neighbor node N2 starts updating its own CASA 355 and STIMA 365 on activity of the UE UE1 (block 1550 ).
  • the node N1 continues to serve the UE UE2 with a proper antenna beam 1405 ( Figure 14B ) selected among the set of beams of its antenna system for the UE UE2 position (block 1555 ).
  • the beam's characteristics are chosen by querying the ARA 345, the MRA 355 and the CASA 365 so to avoid using a coverage generating interference.
  • the node N2 does the same for the UE UE1 by querying its own ARA, MRA and CASA, and selects a suitable antenna beam 1410 for serving the UE UE1.
  • any of the first, second, third and fourth data structure creators 340, 350, 360, 370 can be implemented as functionalities residing on a remote server, remote from the physical location of a node; such functionalities may be invoked by a node when necessary.
  • any of the first, second, third and fourth data structures 335, 345, 355, 365 can reside in the cloud instead of in a node (intended as an apparatus located in a certain point of the territory). More generally, what is called to as "node” in the present description could be regarded as a logical concept, including a part located in a certain territory point, and another part that can be in the cloud.

Landscapes

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

Claims (15)

  1. Funkzugangsnetzwerkknoten (N; N1) eines Telekommunikationsnetzwerks, der Folgendes umfasst:
    - ein System von abstrahlenden Antennen (205), das mindestens eine abstrahlende Antenne (2101-210p) zum Abstrahlen von Funksignalen durch ein geografisches Gebiet umfasst;
    - einen Prozessor, der dazu ausgelegt ist, computerlesbare Anweisungen zu folgendem Zweck auszuführen:
    - Erhalten oder Erzeugen (310, 315; 320; 323; 1020) einer topografischen Karte (305), die die Topografie des geografischen Gebiets beschreibt;
    - auf Basis der topografischen Karte Berechnen (325; 1025) einer Abdeckungskarte (330) der Funkabdeckung des geografischen Gebiets durch die Funksignale, die vom System von abstrahlenden Antennen abgestrahlt werden;
    - auf Basis der Abdeckungskarte Verkleinern (325; 1035) der topografischen Karte, um eine topografische Karte (305') reduzierter Größe zu erhalten, die die Topografie eines geografischen Bereichs innerhalb des geografischen Gebiets beschreibt, der vom Knoten bedient werden kann;
    - auf Basis der berechneten Abdeckungskarte (330) Erstellen (1030) einer ersten Datenstruktur (335), die eine Vielzahl von ersten Datenstrukturdatensätzen (605) umfasst, einen für jeden Punkt der berechneten Abdeckungskarte (330), wobei jeder der ersten Datenstrukturdatensätze (605) eine Beschreibung einer Dienstlieferfähigkeit des Knotens an diesem Punkt bereitstellt;
    - Nutzen der ersten Datenstruktur, um zu beschließen, wie eine Teilnehmereinrichtung, die sich in dem Gebiet befindet, das der topografischen Karte (305') reduzierter Größe entspricht, zu bedienen ist.
  2. Funkzugangsnetzwerkknoten nach Anspruch 1, wobei der Prozessor ferner dazu ausgelegt ist, computerlesbare Anweisungen zu folgendem Zweck auszuführen:
    - Identifizieren von benachbarten Netzwerkknoten (Nn; N2) in der Nachbarschaft des Knotens;
    - auf Basis der topografischen Karte (305') reduzierter Größe Erstellen (350; 1045) einer zweiten Datenstruktur (345), die eine Vielzahl von zweiten Datenstrukturdatensätzen (705) umfasst, einen für jeden Punkt der minimalen topografischen Karte (305'), wobei jeder der zweiten Datenstrukturdatensätze (705) eine Beschreibung einer Dienstlieferfähigkeit an diesem Punkt von mindestens einem benachbarten Netzwerkknoten (Nn; N2) bereitstellt, und
    - auf Basis der Daten, die in der ersten Datenstruktur und der zweiten Datenstruktur enthalten sind, Beschließen, ob der Knoten eine Teilnehmereinrichtung, die sich an einem Punkt des geografischen Bereichs, der von dem Knoten bedient wird, befindet, bedienen oder weiter bedienen soll oder ob bewirkt werden soll, dass der Knoten einen Nachbarknoten bittet, die Teilnehmereinrichtung zu bedienen.
  3. Funkzugangsnetzwerkknoten nach Anspruch 1 oder 2, wobei die topografische Karte (305) des geografischen Gebiets eines von einer zweidimensionalen (2D) Karte des geografischen Bereichs, angereichert mit Schätzungen von Höhen, und einer dreidimensionalen (3D) Topografiekarte des geografischen Gebiets umfasst.
  4. Funkzugangsnetzwerkknoten nach Anspruch 1, 2 oder 3, wobei die topografische Karte (305) des geografischen Gebiets entweder von einer entfernten Datenbank (310) von digitalen topografischen Karten der Umgebung heruntergeladen wird oder vor Ort (320) durch den Knoten oder durch ein entferntes System (323) durch Verarbeiten von mono-/stereoskopischen Bildern der Umgebung in Echtzeit erzeugt wird.
  5. Funkzugangsnetzwerkknoten nach einem der vorhergehenden Ansprüche, wobei die Beschreibung einer Dienstlieferfähigkeit des Knotens an einem Punkt eines oder mehreres von Folgendem umfasst:
    ∘ eine Anzeige einer Funkzugangstechnologie -RAT-, die verwendet wird, um diesen Punkt zu bedienen;
    ∘ eine Anzeige einer abstrahlenden Antenne (2101 -210p) des Systems von abstrahlenden Antennen (205), die verwendet werden, um diesen Punkt abzudecken;
    ∘ eine Anzeige eines Frequenzkanals, der mit diesem Punkt verknüpft ist;
    ∘ eine Anzeige einer Funkabdeckungsmenge, die mit diesem Punkt verknüpft ist.
  6. Funkzugangsnetzwerkknoten nach Anspruch 5, wobei der Prozessor dazu ausgelegt ist, computerlesbare Anweisungen auszuführen, um in Reaktion auf eine Änderung einer Auslegung des Netzwerkknotens die erste Datenstruktur zu aktualisieren.
  7. Funkzugangsnetzwerkknoten nach einem der vorhergehenden Ansprüche 2-6, wenn von Anspruch 2 abhängig, wobei jeder der Datenstrukturdatensätze (705) Daten enthält, die den Daten entsprechen, die im ersten Datenstrukturdatensatz (605) des mindestens einen benachbarten Netzwerkknotens (Nn; N2) für den betreffenden Punkt enthalten sind.
  8. Funkzugangsnetzwerkknoten nach Anspruch 7, wobei jeder der zweiten Datenstrukturdatensätze (705) eine Kennung des mindestens einen Nachbarknotens enthält.
  9. Funkzugangsnetzwerkknoten nach Anspruch 7 oder 8, wobei der Prozessor dazu ausgelegt ist, computerlesbare Anweisungen auszuführen, um in Reaktion auf eine Änderung einer Auslegung von mindestens einem benachbarten Netzwerkknoten die zweite Datenstruktur zu aktualisieren.
  10. Funkzugangsnetzwerkknoten nach einem der vorhergehenden Ansprüche 2-6, wenn von Anspruch 2 abhängig, wobei der Prozessor ferner dazu ausgelegt ist, computerlesbare Anweisungen zu folgendem Zweck auszuführen:
    - Erstellen (360; 1120) einer dritten Datenstruktur (355), die eine Vielzahl von dritten Datenstrukturdatensätzen umfasst, wobei jeder der dritten Datenstrukturdatensätze für eine Teilnehmereinrichtung, die von dem Knoten bedient wird, Daten, die in dem Gebiet, das der topografischen Karte (305') reduzierter Größe entspricht, Gebietspunkte anzeigen, die von der bedienenden Teilnehmereinrichtung besucht werden, und Daten, die Typen von Diensten anzeigen, die der Teilnehmereinrichtung an jedem Gebietspunkt vom Knoten bereitgestellt werden, enthält.
  11. Funkzugangsnetzwerkknoten nach Anspruch 10, wobei der Prozessor ferner dazu ausgelegt ist, computerlesbare Anweisungen zu folgendem Zweck auszuführen:
    - Nutzen der Informationen, die in der dritten Datenstruktur (355) enthalten sind, zum Ableiten von mindestens einem von Folgendem:
    ∘ einer georeferenzierten Karte der Dienste, die der Teilnehmereinrichtung für die Zeit, in der die Teilnehmereinrichtung vom Knoten bedient wird, vom Knoten bereitgestellt werden;
    ∘ Trajektorien der Teilnehmereinrichtung, die vom Knoten N bedient wird,
    und
    - vorab Beschließen von Aktionen, die vom Knoten vorzunehmen sind, wobei derartige Aktionen mindestens eine von Folgendem beinhalten:
    • Auswahl der am besten bedienenden abstrahlenden Antenne zur Optimierung der Abdeckung, während sich jede Teilnehmereinrichtung bewegt;
    • Optimierung der Gesamtdienstfähigkeit des Knotens, was die Auswahl der abstrahlenden Antenne, die angepasst ist, Interferenzen und Energieverbrauch zu reduzieren, beinhaltet;
    • Verwaltung von Interferenzen durch Auswählen von abstrahlenden Antennen zum Bedienen einer anderen Teilnehmereinrichtung oder Ändern der bedienenden Funkfrequenz oder RAT auf Basis von Daten, die in der ersten Datenstruktur und der zweiten Datenstruktur enthalten sind;
    • Änderung des bedienenden Knotens.
  12. Funkzugangsnetzwerkknoten nach Anspruch 11, wobei der Prozessor ferner dazu ausgelegt ist, computerlesbare Anweisungen zu folgendem Zweck auszuführen:
    - Erstellen (370) einer vierten Datenstruktur (365), die eine Liste von vierten Datenstrukturdatensätzen umfasst, einen für jeden Punkt der topografischen Karte (305') reduzierter Größe, wobei jeder der vierten Datenstrukturdatensätze Daten enthält, die den Typ von Diensten anzeigen, die von einer Teilnehmereinrichtung, die für eine vorbestimmte Zeitdauer an dem Punkt stationär bleibt, in der Zeit angefordert werden, und
    - Nutzen der Informationen, die in der vierten Datenstruktur (365) enthalten sind, um zu veranlassen, dass der Knoten Dienste vorhersieht, die einer bedienten Teilnehmereinrichtung, die sich einem Punkt der topografischen Karte (305') reduzierter Größe annähert, bereitzustellen sind.
  13. Verfahren zum Betreiben eines Funkzugangsnetzwerkknotens (N; NI) eines Telekommunikationsnetzwerks, wobei der Knoten ein System von abstrahlenden Antennen (205) umfasst, das mindestens eine abstrahlende Antenne (2101-210p) zum Abstrahlen von Funksignalen durch ein geografisches Gebiet umfasst, wobei das Verfahren Folgendes umfasst:
    - Erhalten oder Erzeugen (310, 315; 320; 323; 1020) einer topografischen Karte (305), die die Topografie des geografischen Gebiets beschreibt;
    - auf Basis der topografischen Karte Berechnen (325; 1025) einer Abdeckungskarte (330) der Funkabdeckung des geografischen Gebiets durch die Funksignale, die vom System von abstrahlenden Antennen abgestrahlt werden;
    - auf Basis der Abdeckungskarte Verkleinern (325; 1035) der topografischen Karte, um eine topografische Karte (305') reduzierter Größe zu erhalten, die die Topografie eines geografischen Bereichs innerhalb des geografischen Gebiets beschreibt, der vom Knoten bedient werden kann;
    - auf Basis der berechneten Abdeckungskarte (330) Erstellen (1030) einer ersten Datenstruktur (335), die eine Vielzahl von ersten Datenstrukturdatensätzen (605) umfasst, einen für jeden Punkt der berechneten Abdeckungskarte (330), wobei jeder der ersten Datenstrukturdatensätze (605) eine Beschreibung einer Dienstlieferfähigkeit des Knotens an diesem Punkt bereitstellt;
    - Nutzen der ersten Datenstruktur, um zu beschließen, wie eine Teilnehmereinrichtung, die sich in dem Gebiet befindet, das der topografischen Karte (305') reduzierter Größe entspricht, zu bedienen ist.
  14. Verfahren nach Anspruch 13, das ferner Folgendes umfasst:
    - Identifizieren von benachbarten Netzwerkknoten (Nn; N2) in der Nachbarschaft des Knotens;
    - auf Basis der topografischen Karte (305') reduzierter Größe Erstellen (350; 1045) einer zweiten Datenstruktur (345), die eine Vielzahl von zweiten Datenstrukturdatensätzen (705) umfasst, einen für jeden Punkt der minimalen topografischen Karte (305'), wobei jeder der zweiten Datenstrukturdatensätze (705) eine Beschreibung einer Dienstlieferfähigkeit an diesem Punkt von mindestens einem benachbarten Netzwerkknoten (Nn; N2) bereitstellt, und
    - auf Basis der Daten, die in der ersten Datenstruktur und der zweiten Datenstruktur enthalten sind, Beschließen, ob der Knoten eine Teilnehmereinrichtung, die sich an einem Punkt des geografischen Bereichs, der von dem Knoten bedient wird, befindet, bedienen oder weiter bedienen soll oder ob bewirkt werden soll, dass der Knoten einen Nachbarknoten bittet, die Teilnehmereinrichtung zu bedienen.
  15. Verfahren nach einem der Ansprüche 13 bis 14, wobei die Beschreibung einer Dienstlieferfähigkeit des Knotens an einem Punkt eines oder mehreres von Folgendem umfasst:
    ∘ eine Anzeige einer Funkzugangstechnologie - RAT - die verwendet wird, um diesen Punkt zu bedienen;
    ∘ eine Anzeige einer abstrahlenden Antenne (2101-210p) des Systems von abstrahlenden Antennen (205), die verwendet werden, um diesen Punkt abzudecken;
    ∘ eine Anzeige eines Frequenzkanals, der mit diesem Punkt verknüpft ist;
    ∘ eine Anzeige einer Funkabdeckungsmenge, die mit diesem Punkt verknüpft ist.
EP16719793.8A 2016-04-12 2016-04-12 Radio zugang netzwerk node Active EP3443770B1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2016/057992 WO2017178038A1 (en) 2016-04-12 2016-04-12 Radio access network node

Publications (2)

Publication Number Publication Date
EP3443770A1 EP3443770A1 (de) 2019-02-20
EP3443770B1 true EP3443770B1 (de) 2020-01-08

Family

ID=55862736

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16719793.8A Active EP3443770B1 (de) 2016-04-12 2016-04-12 Radio zugang netzwerk node

Country Status (4)

Country Link
US (1) US10425845B2 (de)
EP (1) EP3443770B1 (de)
CN (1) CN109155920B (de)
WO (1) WO2017178038A1 (de)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT201700083557A1 (it) * 2017-07-21 2019-01-21 Telecom Italia Spa Metodo e sistema per gestire interferenze ue-ue in una rete di telecomunicazioni mobile
CN114071492B (zh) * 2020-07-31 2023-07-25 中国联合网络通信集团有限公司 语音通话质量优化方法、终端及基站

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2457797A (en) 1996-03-25 1997-10-17 Glenayre Electronics, Inc System and method for integrating planning and operations information
US6356758B1 (en) 1997-12-31 2002-03-12 Nortel Networks Limited Wireless tools for data manipulation and visualization
US6522875B1 (en) * 1998-11-17 2003-02-18 Eric Morgan Dowling Geographical web browser, methods, apparatus and systems
JP3607516B2 (ja) * 1999-01-20 2005-01-05 松下電器産業株式会社 移動体マップマッチング装置
FR2828623B1 (fr) * 2001-08-10 2003-09-26 Radiotelephone Sfr Procede d'etablissement d'une carte de couverture radio
AU2002347940A1 (en) * 2001-10-18 2003-04-28 The Cleveland Clinic Foundation Systems and methods for analysis of corneal topography with convexity map
FR2837596B1 (fr) * 2002-03-19 2005-11-18 Sfr Sa Procede et systeme destines au deploiement de la couverture radio d'un reseau de radiotelephonie cellulaire
FR2853488B1 (fr) * 2003-04-01 2005-07-15 Radiotelephone Sfr Procede de calcul et de visualisation des interferences mutuelles dans le sens descendant dans un reseau de radiotelephonie cellulaire a acces de type w-cdma
WO2004112414A1 (ja) * 2003-06-16 2004-12-23 Nec Corporation 無線ネットワーク変更支援システム及び無線ネットワーク変更支援方法
GB2431814A (en) * 2005-10-31 2007-05-02 Hewlett Packard Development Co Distribution of data in a network
JP2009016948A (ja) * 2007-06-29 2009-01-22 Kenwood Corp 電波状況管理システム、電波状況測定方法及び電波状況管理装置
US9860939B2 (en) * 2010-01-06 2018-01-02 Interdigital Patent Holdings, Inc. Method and apparatus for assisted/coordinated intra-home communications
KR101412658B1 (ko) * 2010-11-15 2014-08-07 한국전자통신연구원 지오컨텍스트 생성 장치와 이를 이용한 공간 기반 상황 인식 서비스 제공 시스템 및 방법
JP5402957B2 (ja) * 2011-02-09 2014-01-29 株式会社デンソー 電子機器
US8868002B2 (en) * 2011-08-31 2014-10-21 Xirrus, Inc. System and method for conducting wireless site surveys
CN103298000A (zh) * 2012-02-29 2013-09-11 中兴通讯股份有限公司 一种无线环境地图信息搜集的方法和系统
US8838376B2 (en) * 2012-03-30 2014-09-16 Qualcomm Incorporated Mashup of AP location and map information for WiFi based indoor positioning
US9088859B2 (en) * 2012-09-06 2015-07-21 Dell Products, Lp Method and apparatus for connection context aware radio communication management
US9179384B2 (en) * 2012-09-26 2015-11-03 Alcatel Lucent Mobility robustness optimization based on reference signal strength maps
FR2997813B1 (fr) 2012-11-02 2018-07-06 Red Technologies Procede de geoptimisation dedie a l'evaluation et la correction de la couverture radio d'un reseau de telecommunications cellulaire sur une aire geographique determinee
CN105247915B (zh) * 2013-03-15 2019-04-26 迈克尔·A·克尔 上下文敏感相关联引擎平台
WO2015106237A1 (en) * 2014-01-13 2015-07-16 Interdigital Patent Holdings, Inc. High frequency radio environmental mapping and system procedures
WO2016003862A1 (en) * 2014-06-30 2016-01-07 Ubiquiti Networks, Inc. Methods and tools for assisting in the configuration of a wireless radio network using functional maps
US9706411B2 (en) * 2015-11-19 2017-07-11 T-Mobile Usa, Inc. Small cell planning tool

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
US20190116507A1 (en) 2019-04-18
WO2017178038A1 (en) 2017-10-19
CN109155920A (zh) 2019-01-04
US10425845B2 (en) 2019-09-24
EP3443770A1 (de) 2019-02-20
CN109155920B (zh) 2021-11-05

Similar Documents

Publication Publication Date Title
EP3661249B1 (de) Messungsbasiertes drahtloskommunikationsnetzwerksdesign
CN103262595B (zh) 无线参数控制装置、基站装置、控制无线参数的方法和非瞬时计算机可读介质
Wang et al. Rethinking cellular network planning and optimization
EP2938117B1 (de) Geografische Positionsanpassung einer Drohnenbasisstation
CN105052191B (zh) 用于自组织无线网络的基于云的管理的方法和系统
EP3624513B1 (de) Geolokalisierung eines benutzergeräts
CN100421496C (zh) 确定基于小区的通信系统中的覆盖区域的方法
CN103945469B (zh) 一种确定目标小区的方法及设备
US20150302123A1 (en) X-maps with flexible tiles
US9338787B2 (en) Network analysis for radio resource activation in green mobile networks
CN110213809A (zh) 用于非蜂窝式无线接入的系统和方法
KR102538867B1 (ko) 네트워크 계획 및 제어를 위한 공중-대-지상 네트워크 파라미터들의 수동적 수집
EP3443770B1 (de) Radio zugang netzwerk node
US20140112178A1 (en) Method, node and system for management of a mobile network
Ferrús et al. Data analytics architectural framework for smarter radio resource management in 5G radio access networks
Subramani et al. Towards practical REM-based radio resource management
Tengkvist et al. Multi-dimensional radio service maps for position-based self-organized networks
Nunes et al. Attraction-area based geo-clustering for LTE vehicular crowdsensing data offloading
Jaziri et al. Tracking traffic peaks in mobile networks using statistics of performance metrics
Koudouridis et al. A method for the generation of radio signal coverage maps for dense networks
US20240334196A1 (en) Wireless telecommunications network
Piri Cell coverage area information service to improve cell selection in HetNets
Cumino et al. Enhancing Mobile Network Performance Through ORAN-Integrated UAV-Based Mobility Management
WO2024079737A1 (en) First node and methods performed thereby for handling location of a network node in a geographical area for operation in a communications system
EP4055863A1 (de) Drahtloses telekommunikationsnetzwerk

Legal Events

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

Free format text: STATUS: UNKNOWN

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

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)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20191011

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016027789

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1224240

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200215

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20200108

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

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

Ref country code: 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: 20200108

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

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

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

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

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

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

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

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

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

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

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

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016027789

Country of ref document: DE

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

Ref country code: RO

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

Effective date: 20200108

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

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

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

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

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

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

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

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

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1224240

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200108

PG25 Lapsed 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: 20200108

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

26N No opposition filed

Effective date: 20201009

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

Ref country code: LI

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

Effective date: 20200430

Ref country code: CH

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

Effective date: 20200430

Ref country code: LU

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

Effective date: 20200412

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

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20200430

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

Ref country code: SI

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

Effective date: 20200108

Ref country code: BE

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

Effective date: 20200430

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

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

Ref country code: IE

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

Effective date: 20200412

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

Ref country code: TR

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

Effective date: 20200108

Ref country code: MT

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

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

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

Ref country code: MK

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

Effective date: 20200108

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

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

Effective date: 20230528

P02 Opt-out of the competence of the unified patent court (upc) changed

Effective date: 20230530

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

Ref country code: GB

Payment date: 20240418

Year of fee payment: 9

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

Ref country code: DE

Payment date: 20240418

Year of fee payment: 9

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

Ref country code: IT

Payment date: 20240430

Year of fee payment: 9

Ref country code: FR

Payment date: 20240422

Year of fee payment: 9