CN114095958B - Cell coverage area determining method, device, equipment and storage medium - Google Patents
Cell coverage area determining method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN114095958B CN114095958B CN202111357666.9A CN202111357666A CN114095958B CN 114095958 B CN114095958 B CN 114095958B CN 202111357666 A CN202111357666 A CN 202111357666A CN 114095958 B CN114095958 B CN 114095958B
- Authority
- CN
- China
- Prior art keywords
- cell
- data
- adjacent
- point data
- coverage area
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application relates to a cell coverage area determining method, device, equipment and storage medium, in particular to the technical field of electric digital data processing. The method comprises the following steps: inquiring first point data containing a target user identifier in a graph database, and acquiring first edge data corresponding to the first point data; inquiring in a graph database according to the first edge data to obtain the data of each adjacent point; the adjacent point data comprises adjacent positions of adjacent cells; the cell coverage area of the first cell is determined within the area constituted by the respective adjacent locations. According to the scheme, the position information of the adjacent cells of the first cell can be directly read according to the first edge data, so that the cell coverage of the first cell is calculated, the data amount loaded in the memory of the computer equipment is reduced, and the burden of the computer equipment in the process of calculating the cell coverage is reduced.
Description
Technical Field
The present application relates to the field of network communications technologies, and in particular, to a method, an apparatus, a device, and a storage medium for determining a cell coverage area.
Background
The mobile phone signaling is communication data between a mobile phone user and a base station, and when the mobile phone communicates with a nearby base station, the position information of the base station reflects the position of the user because the position of the communication base station is fixed and known.
Therefore, when the terminal needs to acquire the self position, the mobile network can acquire the cell information of the current position of the device to acquire the current position of the device. When the device location is updated, the device sends a message to the current serving cell to generate a location update signaling. The accuracy of Cell ID positioning varies with the coverage of the Cell. The coverage of the cell is drawn by means of data acquisition, data analysis and the like of parameters on site by means of a network optimization engineer. And combining the geographic position data to locate the user.
However, in the above scheme, when the computer device calculates the coverage area of the cell, a large amount of data needs to be read and analyzed, and the large amount of data is stored in the memory of the computer device, which has a large load on the computer device.
Disclosure of Invention
The application provides a cell coverage area determining method, a device, equipment and a storage medium, which reduce the burden of computer equipment in the cell coverage area calculating process.
In one aspect, a method for determining a coverage area of a cell is provided, the method comprising:
inquiring first point data containing a target user identifier in a graph database, and acquiring first edge data corresponding to the first point data; the first point data is used for indicating the communication connection of the target terminal corresponding to the target user identifier in a first cell; the first edge data is used for indicating a cell switching process of the target terminal between the first cell and each adjacent cell;
inquiring in the graph database according to the first edge data to obtain each adjacent point data; the adjacent point data comprises adjacent positions of the adjacent cells;
and determining the cell coverage area of the first cell in the area formed by each adjacent position.
In yet another aspect, there is provided a cell coverage area determining apparatus, the apparatus including:
the side data acquisition module is used for inquiring first point data containing a target user identifier in the graph database and acquiring first side data corresponding to the first point data; the first point data is used for indicating the communication connection of the target terminal corresponding to the target user identifier in a first cell; the first edge data is used for indicating a cell switching process of the target terminal between the first cell and each adjacent cell;
The adjacent point data acquisition module is used for inquiring in the graph database according to the first edge data to acquire each adjacent point data; the adjacent point data comprises adjacent positions of the adjacent cells;
and the cell coverage area acquisition module is used for determining the cell coverage area of the first cell in the area formed by each adjacent position.
In one possible implementation manner, the cell coverage area obtaining module includes:
a connection line obtaining unit, configured to obtain a first connection line and a second connection line, where the first connection line and the second connection line are respectively formed by a first position and two target adjacent positions in the first point data;
a perpendicular bisector constructing unit, configured to construct a first perpendicular bisector at a midpoint of the first connection line, and construct a second perpendicular bisector at a midpoint of the second connection line;
and the cell coverage area determining unit is used for determining the area formed by the first connecting line, the second connecting line, the first perpendicular bisector and the second perpendicular bisector as the cell coverage area of the first cell.
In a possible implementation manner, each first edge data includes time information of cell switching;
The cell coverage area determining module further includes:
and the adjacent position determining module is used for sequencing the first edge data according to the time sequence and determining adjacent positions in two continuous first edge data as two target adjacent positions.
In one possible implementation, the cell coverage area determining module is further configured to,
and connecting the first position in the first point data with the position midpoints of the adjacent positions in pairs, and determining each obtained area as the cell coverage of the first cell.
In one possible implementation, the first edge data includes first in edge data and first out edge data; the first incoming side data are used for indicating the target terminal to be switched from a first adjacent cell to the first cell; the first outgoing edge data is used for indicating the target terminal to be switched from the first cell to a second adjacent cell.
In one possible implementation, the apparatus further includes:
the updating data acquisition module is used for deleting the first incoming side data and the first outgoing side data in the first side data when the first adjacent cell and the second adjacent cell are the same cell, so as to acquire first updating data;
The adjacent point data acquisition module is also used for,
and inquiring in the graph database according to the first updating data to obtain the adjacent point data.
In one possible implementation, the apparatus further includes:
the signaling acquisition module is used for acquiring a first signaling of the target terminal; the first signaling comprises a first position of the first cell;
and the point data generation module is used for generating the first point data when the point data containing the first position does not exist in the graph database.
In one possible implementation, the apparatus further includes:
the side data generating module is used for acquiring a first cell switching signaling of the target terminal, and the first cell switching signaling is used for indicating the target terminal to generate first side data when the target terminal is switched between the first cell and an adjacent cell, and importing the first side data into the graph database to store the first side data in a storage area corresponding to the first point data.
In yet another aspect, a computer device is provided, where the computer device includes a processor and a memory, where the memory stores at least one instruction, at least one program, a set of codes, or a set of instructions, where the at least one instruction, at least one program, a set of codes, or a set of instructions are loaded and executed by the processor to implement the above-described cell coverage area determining method.
In yet another aspect, a computer readable storage medium having stored therein at least one instruction loaded and executed by a processor to implement the above-described cell coverage area determination method is provided.
In yet another aspect, a computer program product or computer program is provided, the computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to cause the computer device to perform the cell coverage area determination method described above.
The technical scheme provided by the application can comprise the following beneficial effects:
when the cell coverage area of the first cell needs to be calculated, the first point data corresponding to the first cell can be read by the computer equipment, and then the first edge data corresponding to the first point data is queried, so that the position information of the cell adjacent to the first cell is obtained, and the calculation of the cell coverage area of the first cell is realized. In the above scheme, the computer device can directly read the position information of the adjacent cells of the first cell according to the first edge data so as to calculate the cell coverage of the first cell, and the data amount loaded in the memory of the computer device is reduced, so that the burden of the computer device in the calculation process of the cell coverage is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are needed in the description of the embodiments or the prior art will be briefly described, and it is obvious that the drawings in the description below are some embodiments of the present application, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram illustrating a structure of a cell coverage area determining system according to an exemplary embodiment.
FIG. 2 illustrates a diagram of a graph database data store in accordance with an embodiment of the present application.
Fig. 3 is a method flow diagram illustrating a method of cell coverage area determination according to an example embodiment.
FIG. 4 is a schematic diagram of the logical relationship between point data and edge data according to an embodiment of the present application.
Fig. 5 is a method flow diagram illustrating a method of cell coverage area determination according to an example embodiment.
Fig. 6 shows a schematic diagram of a cell coverage area according to an embodiment of the present application.
Fig. 7 is a flowchart of a method for determining a coverage area of a cell according to an embodiment of the present application.
Fig. 8 is a block diagram showing a structure of a cell coverage area determining apparatus according to an exemplary embodiment.
Fig. 9 is a schematic diagram of a computer device according to an exemplary embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made apparent and fully in view of the accompanying drawings, in which some, but not all embodiments of the application are shown. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
It should be understood that the "indication" mentioned in the embodiments of the present application may be a direct indication, an indirect indication, or an indication having an association relationship. For example, a indicates B, which may mean that a indicates B directly, e.g., B may be obtained by a; it may also indicate that a indicates B indirectly, e.g. a indicates C, B may be obtained by C; it may also be indicated that there is an association between a and B.
In the description of the embodiments of the present application, the term "corresponding" may indicate that there is a direct correspondence or an indirect correspondence between the two, or may indicate that there is an association between the two, or may indicate a relationship between the two and the indicated, configured, etc.
In the embodiment of the present application, the "predefining" may be implemented by pre-storing corresponding codes, tables or other manners that may be used to indicate relevant information in devices (including, for example, terminal devices and network devices), and the present application is not limited to the specific implementation manner thereof.
Before explaining the various embodiments of the present application, a description is given first of several concepts to which the present application relates.
1) Graph database
The graph database is a type of NoSQL database that uses graph theory to store relationship information between entities. The graph database is a non-relational database that uses graph theory to store relationship information between entities. The most common example is the relationship from person to person in a social network. Relational databases are not effective for storing "relational" data, and their queries are complex, slow, unexpected, and the unique design of the graphic database exactly compensates for this deficiency. When many-to-many relationships need to be represented, it is often necessary to create an association table to record many-to-many relationships for different entities, and these association tables are often not used to record information. If there are multiple relationships between two entities, then multiple association tables need to be created between them. In a graphic database, however, it is only necessary to indicate that there is a different relationship between the two. If it is desired to establish a two-way relationship between two sets of nodes, a relationship needs to be defined for each direction. That is, the relationships in the graph database may provide a richer representation of relationships through the ability of the relationships to include attributes, as opposed to various association tables in the relationship database. Thus, users of the graphic database will have an extra weapon, i.e., a rich relationship, when abstracting things, compared to the relational database.
2) Cell handover
Cell switching (Channel Switch) in a wireless communication system, when a mobile station moves from one cell (referred to as a base station or coverage of a base station) to another cell, channel switching is required to maintain uninterrupted communication for the mobile user. How to successfully and quickly complete a cell handover is one of the important aspects of cell system design in a wireless communication system. In the cell switching process, the UE informs the base station of the ID of a target cell, the target cell needs to be switched, and a source cell transmits RRC connection reconfiguration information to the UE, wherein the distributed special access signature is configured to the UE; the UE sends an RRC connection reconfiguration complete message to the target cell, indicating that the UE has been handed over to the target side.
Fig. 1 is a schematic diagram illustrating a structure of a cell coverage area determining system according to an exemplary embodiment. The cell coverage area determining system includes a communication system including a base station 120 and a terminal 130, and a server 110.
The number of terminals 130 is typically multiple, and one or more terminals 130 may be distributed within the cell managed by each base station 120. The terminal 130 may include various handheld devices, in-vehicle devices, wearable devices, computing devices, or other processing devices connected to a wireless modem, as well as various forms of User Equipment (UE), mobile Station (MS), terminal devices (terminal devices), etc. having wireless communication capabilities. For convenience of description, in the embodiment of the present application, the above-mentioned devices are collectively referred to as a terminal.
Base station 120 is a device deployed in an access network to provide wireless communication functionality for terminal 130. The base stations 120 may include various forms of macro base stations, micro base stations, relay stations, access points, and the like. The names of base station capable devices may vary in systems employing different Radio access technologies, for example in 5G New Radio (NR) systems, called gndeb or gNB. As communication technology evolves, the name "base station" may change. For convenience of description, in the embodiment of the present application, the above-mentioned devices for providing the wireless communication function for the terminal 20 are collectively referred to as a base station.
In the embodiment of the present application, the base station 20 may include at least two base stations, where the at least two base stations are respectively used to cover cells corresponding to the base stations.
The Core Network (CN) 30 mainly provides a user connection, management of a user, and completion of a bearer for a service, and provides an interface to an external Network as a bearer Network. The establishment of the user connection comprises the functions of mobility management, call management, switching/routing, recording notification (connection relation to the peripheral devices of the intelligent network is completed in combination with the intelligent network service) and the like.
Optionally, not shown in fig. 1, the network architecture further includes other network devices, such as: a central control node (Central Network Control, CNC), session management functions (Session Management Function, SMF) or user plane functions (User Plane Function, UPF) devices, and so on.
The "5G NR system" in the embodiments of the present disclosure may also be referred to as a 5G system or an NR system, but a person skilled in the art may understand the meaning thereof. The technical scheme described in the embodiment of the disclosure can be applied to a 5G NR system and also can be applied to a subsequent evolution system of the 5G NR system.
Alternatively, when the terminal 130 acquires the target data to be imported into the graph database, the target data may be transmitted to the server 110 loaded with the graph database through a communication network. The server updates the graph database in the server 110 according to the target data according to a preset import flow.
The map database includes point data, attribute data corresponding to the point data, and attribute data corresponding to the edge data. Referring to fig. 2, a schematic diagram of a graph database data storage according to an embodiment of the present application is shown. The graph database, as shown in fig. 2, stores data in a trimmed manner, centered on nodes. For example, in Hbase, the ID of the node is a Rowkey of Hbase, and each attribute and each edge on the node is a separate Cell of the Rowkey row. In the graph database as shown in fig. 2, the storage of the graph is entirely divided into three parts: vertex id, property, edge. Wherein, the vertex id is the unique id of the corresponding node, if Hbase is used in the bottom storage, the vertex id represents the Rowkey of the current row, and the vertex id only represents a certain node. property represents a property of a node; edge represents the corresponding edge of a node.
Therefore, in the graph database shown in fig. 2, since one edge is used to connect two nodes, any one edge needs to be stored in the storage portion corresponding to the two nodes, that is, any one edge is stored twice in the graph database. When one side data in the graph database needs to be queried, the query needs to be performed in the storage space of the point data corresponding to the two nodes (the source node and the target node) corresponding to the side data.
Optionally, the server may be an independent physical server, a server cluster formed by a plurality of physical servers or a distributed system, or may be a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDNs, and technical computing services such as big data and an artificial intelligence platform.
Optionally, the system may further include a management device, where the management device is configured to manage the system (e.g., manage a connection state between each module and the server, etc.), where the management device is connected to the server through a communication network. Optionally, the communication network is a wired network or a wireless network.
Alternatively, the wireless network or wired network described above uses standard communication techniques and/or protocols. The network is typically the internet, but may be any other network including, but not limited to, a local area network, a metropolitan area network, a wide area network, a mobile, a limited or wireless network, a private network, or any combination of virtual private networks. In some embodiments, techniques and/or formats including hypertext markup language, extensible markup language, and the like are used to represent data exchanged over a network. All or some of the links may also be encrypted using conventional encryption techniques such as secure socket layer, transport layer security, virtual private network, internet protocol security, etc. In other embodiments, custom and/or dedicated data communication techniques may also be used in place of or in addition to the data communication techniques described above.
Fig. 3 is a method flow diagram illustrating a method of cell coverage area determination according to an example embodiment. The method is performed by a computer device, which may be a server in a cell coverage area determination system as shown in fig. 1. As shown in fig. 3, the cell coverage area determining method may include the steps of:
step 301, inquiring first point data containing a target user identifier in a graph database, and acquiring first edge data corresponding to the first point data.
The first point data is used for indicating the communication connection of the target terminal corresponding to the target user identifier in the first cell.
The first edge data is used for indicating a cell switching process of the target terminal between the first cell and each adjacent cell.
Optionally, the first point data comprises a first location of the first cell.
In one possible implementation manner, the first point data is generated by the base station acquiring signaling sent by the user in the first cell and importing features corresponding to the signaling into the graph database.
Optionally, the first point data includes a unique user identifier, a longitude of the base station, a latitude of the base station, a LAC (Location Area Code ) of the Cell, and the Cell code, and the tag of the first point data is a Cell (i.e. an identifier of the Cell).
After receiving the mobile phone signaling collected by the base station, the computer equipment stores the characteristic information of the mobile phone signaling into a graph database, and the point label is a cell, namely, each user reaches a certain cell as a point, and the attribute is lac, cellid, user, longitude and latitude, which correspond to the position code, the cell code, the unique user identifier, the longitude of the base station to which the cell belongs and the latitude of the base station to which the cell belongs respectively.
In one possible implementation, the computer device queries the graph database for first point data corresponding to the user unique identifier by the user unique identifier of the target terminal.
In one possible implementation, the label of the edge data in the graph database is move, and the edge data includes signaling occurrence time. When the cell switching process occurs, two continuous signaling uploaded by the user terminal respectively correspond to two different cells, namely, two different point data in the corresponding graph database, namely, each two signaling of the user generates an edge, the source vertex of the edge is the cell vertex connected in the last signaling of the user, and the target vertex is the cell vertex connected in the current signaling.
Referring to fig. 4, a schematic diagram of a logical relationship between point data and edge data according to an embodiment of the application is shown.
As shown in fig. 4, when the unique user identifier of the target terminal points to "user 1", the corresponding point data is generated in the graph database when the target terminal reaches cells 1 to 5 by uploading the signaling of the base station. For example, when the target terminal arrives at the cell4 for the first time, the target terminal uploads the signaling to the base station, at this time, the base station receives the signaling of the target terminal and transmits the signaling to the computer device, at this time, the computer device queries in the graph database according to the unique user identifier and the cell code of the cell4 (i.e., the cell ID), and when the cell code including the unique user identifier and the cell4 is not queried, generates the point data including the unique user identifier and the cell code of the cell 4.
When the computer device detects that two consecutive signaling of the target terminal respectively correspond to different Cell codes, for example, a Cell corresponding to the first signaling is Cell1, and a Cell corresponding to the second signaling is Cell2, it is indicated that the target terminal obviously performs Cell switching at this time, and the target terminal is switched from Cell1 to Cell2, that is, the target terminal obviously moves from Cell1 to Cell2 in a time period when the signaling occurs. Therefore, the computer device can generate corresponding edge data, take the point data corresponding to the cell1 as source point data, take the point data corresponding to the cell2 as target point data, and take the occurrence time of the second signaling as the time of the position movement, thereby constructing the edge data, and respectively importing the edge data into the graph database, the area corresponding to the cell1 and the area corresponding to the cell 2.
Step 302, query is performed in the graph database according to the first edge data to obtain each neighboring point data.
In the embodiment of the present application, the neighboring point data includes the neighboring position of the neighboring cell. Wherein the neighbor locations are used to indicate the base station locations of the respective neighbor cells.
In the graph database shown in fig. 2, since the edge data is stored in the storage area of the corresponding point data, the first edge data having a connection relationship with the first point data can be determined by searching for the first point data, and then, when searching for the adjacent point data having a connection relationship with the first point data according to the first edge data.
That is, in the graph database model structure shown in fig. 4, assuming that the first point data is the point data corresponding to the cell5, the first edge data corresponding to the first point data includes the edge data connecting the cell5 and the cell2, and the edge data connecting the cell5 and the cell3.
Therefore, when the query is performed in the graph database according to the first edge data, the obtained adjacent point data are the point data corresponding to the cell3 and the point data corresponding to the cell3 respectively. Therefore, the neighboring cells of the first cell5 are cell2 and cell3, respectively.
In step 303, a cell coverage area of the first cell is determined within the area formed by each adjacent location.
When the adjacent positions of the adjacent cells recorded by the adjacent point data are acquired, the cells with adjacent relation with the first cell and the corresponding base station positions can be judged according to the adjacent positions.
For example, when a terminal performs cell selection, it generally selects a base station with the strongest signal to access, so that a position midpoint between a first position and an adjacent position can be considered as a boundary of signal strength, and if the terminal is close to the first position, the signal strength of the base station corresponding to the first cell is higher, the terminal is considered as a cell coverage area of the first cell; on the side of the adjacent position, the signal intensity of the base station corresponding to the adjacent cell is higher, and the base station is regarded as the cell coverage area of the adjacent cell.
In one possible implementation, the first location is connected to the location midpoint of the respective adjacent locations in pairs, and the respective areas obtained are determined as the cell coverage areas of the first cell.
After the position midpoints of the first position and each adjacent position are obtained, the position midpoint areas can be connected in pairs. For example, when three position midpoints exist, the three position midpoints are connected in pairs to obtain a cell coverage area which is used as the first cell with a triangle area; when there are more than three location midpoints, for example, when there are four location midpoints, the four location midpoints may be connected in pairs to obtain four triangle areas, and the four triangle areas are all the cell coverage area of the first cell.
In another possible implementation, an average value of distances between the midpoint of the respective locations and the first location is obtained, and a circular area with the first location as the midpoint is determined as the cell coverage of the first cell with the average value as a radius.
In summary, when the cell coverage area needs to be calculated, the location information of the cell where the target terminal is located may be stored in the graph database as point data information, and the information of the cell handover process occurring in the moving process of the target terminal is stored in the graph database as side data information, and when the computer device needs to calculate the cell coverage area of the first cell, the computer device may read the first point data corresponding to the first cell, and further query the first side data corresponding to the first point data, thereby obtaining the location information of the cell adjacent to the first cell, so as to implement calculation of the cell coverage area of the first cell. In the above scheme, the computer device can directly read the position information of the adjacent cells of the first cell according to the first edge data so as to calculate the cell coverage of the first cell, and the data amount loaded in the memory of the computer device is reduced, so that the burden of the computer device in the calculation process of the cell coverage is reduced.
Fig. 5 is a method flow diagram illustrating a method of cell coverage area determination according to an example embodiment. The method is performed by a computer device, which may be a server in a cell coverage area determination system as shown in fig. 1. As shown in fig. 5, the cell coverage area determining method may include the steps of:
step 501, inquiring first point data containing a target user identifier in a graph database, and acquiring first side data corresponding to the first point data.
Optionally, each of the first edge data includes time information of cell handover.
In the graph database, the first point data contains characteristic information of a first cell interacted with the target terminal, such as a position code of the first cell, a cell code, a longitude of a base station to which the cell belongs and a latitude of the base station to which the cell belongs.
When each user arrives at the first cell in the graph database, point data corresponding to the first cell by the user is generated, namely the first point data also comprises a unique user identifier which is used for representing the user corresponding to the first point data.
In the graph database, the first edge data contains signaling occurrence time, and the first edge data is simultaneously stored in a point data area of source vertex data and a point data area of target vertex data; the first edge data may thus be used to actually instruct the user to move from the cell to which the source vertex data corresponds to the cell to which the target vertex data corresponds.
In one possible implementation, a first signaling of a target terminal is acquired; the first signaling includes a first location of the first cell; when the point data containing the first position does not exist in the graph database, the first point data is generated.
When the base station transmits the received first signaling sent by the target terminal to the computer equipment to be imported into the graph database, the computer equipment firstly queries in the graph database according to the first position of the first cell recorded in the first signaling, and when the point data of the first position exists in the graph database, the first point data containing the first position can be updated according to the attribute (such as time) in the first signaling.
When the computer equipment does not inquire that the point data of the first position exists in the graph database, at the moment, the computer equipment introduces all attribute information (such as the position code of the first cell, the cell code, the unique user identification, the longitude of the base station to which the cell belongs and the latitude of the base station to which the cell belongs) corresponding to the first signaling into the graph database, and generates the first point data.
Wherein, each signaling of the target terminal including the first signaling can be stored in the base station and sent to the computer equipment. After the target terminal and the base station communicate through the first signaling, the base station receives the first signaling, stores the first signaling in a storage module in the base station, and sends the first signaling to the computer equipment.
When the computer equipment receives the first signaling, firstly, inquiring is carried out in the graph database according to the unique ID of the user in the first signaling, and the inquired point data are point data corresponding to the target terminal for sending the first signaling. The first point data is any one of the point data having a user unique ID.
In one possible implementation, when a first cell handover signaling of the target terminal is acquired, where the first cell handover signaling is used to instruct the target terminal to perform cell handover between the first cell and an adjacent cell, first edge data is generated and imported into a graph database to be stored in a storage area corresponding to the first point data.
In one possible implementation, the first edge data includes first in edge data and first out edge data; the first incoming side data is used for indicating the target terminal to be switched from the first adjacent cell to the first cell; the first outgoing side data is used for indicating the target terminal to be switched from the first cell to the second adjacent cell.
The first edge data corresponding to the first point data comprises first edge entering data and first edge exiting data. In the first edge data, the first point data is taken as a target vertex; in the first outgoing edge data, first point data is used as a source vertex.
Step 502, query is performed in the graph database according to the first edge data, and each neighboring point data is obtained.
The neighboring point data includes neighboring locations of the neighboring cells. In the graph database structure shown in fig. 2, each point data including the first edge data can be queried based on the first edge data, and each point data including the first edge data is determined as adjacent point data, and since the first edge data is generated based on a cell switching operation of the user terminal, each cell indicated by each adjacent point data is an adjacent cell of the first cell.
In one possible implementation manner, when the first neighboring cell and the second neighboring cell are the same cell, deleting the first incoming side data and the first outgoing side data in the first side data to obtain first updated data; and inquiring in the graph database according to the first updating data to obtain the adjacent point data.
When the first neighboring cell and the second neighboring cell are the same cell (e.g., referred to as cell a), it is explained that the first incoming side data is generated by the user terminal moving from cell a to the first cell resulting in the user terminal switching from cell a to the first cell, and similarly the first outgoing side data is generated by the user terminal moving from the first cell from cell a resulting in the user terminal switching from the first cell to cell a.
At this time, the user terminal may generate ping-pong effect between the first cell and the cell a, and the authenticity of the data is problematic, so that the first incoming edge data and the first outgoing edge data can be directly deleted, thereby preventing the ping-pong effect from affecting the calculation of the cell coverage area.
Step 503, sorting the first edge data according to time sequence, and determining the adjacent positions in two consecutive first edge data as two target adjacent positions.
After each first edge data is obtained, each first edge data is used for indicating the cell movement behavior of the user terminal between adjacent cells of the first cell, at this time, the first edge data are ordered according to time sequence, and the target adjacent positions of two continuous first edge data are obtained.
Step 504, a first connection line and a second connection line respectively formed by the first position and the two target adjacent positions are obtained.
Step 505, a first perpendicular bisector is constructed at the midpoint of the first link and a second perpendicular bisector is constructed at the midpoint of the second link.
And step 506, determining an area formed by the first connecting line, the second connecting line, the first perpendicular bisector and the second perpendicular bisector as a cell coverage area of the first cell.
Referring to fig. 6, a schematic diagram of a cell coverage area according to an embodiment of the present application is shown. As shown in fig. 6, two target adjacent positions are a and C, the first position is B, the midpoint on the first connection line AB is a, the midpoint on the second connection line BC is B, a first perpendicular bisector of AB is made on a, and a second perpendicular bisector of BC is made on B, and then the area formed by the first connection line, the second connection line, the first perpendicular bisector and the second perpendicular bisector is the cell coverage area of the first cell.
Optionally, since the target adjacent position is a target adjacent position in any two consecutive edge data in the time-ordered first edge data, the target adjacent position in each consecutive two first edge data in the first edge data may be traversed, and the cell coverage calculated by each consecutive two edge data is obtained by a manner shown in steps 504 to 506, and the cell coverage of the first cell is obtained by merging the cell coverage.
Optionally, the computer device further obtains point data and edge data corresponding to other terminals except the target terminal in the graph database according to the unique identifier of the user, calculates a cell coverage area corresponding to the other users in a manner shown in steps 502 to 506, and obtains a union set with the cell coverage area corresponding to the target terminal, thereby obtaining the cell coverage area of the first cell.
In summary, when the cell coverage area needs to be calculated, the location information of the cell where the target terminal is located may be stored in the graph database as point data information, and the information of the cell handover process occurring in the moving process of the target terminal is stored in the graph database as side data information, and when the computer device needs to calculate the cell coverage area of the first cell, the computer device may read the first point data corresponding to the first cell, and further query the first side data corresponding to the first point data, thereby obtaining the location information of the cell adjacent to the first cell, so as to implement calculation of the cell coverage area of the first cell. In the above scheme, the computer device can directly read the position information of the adjacent cells of the first cell according to the first edge data so as to calculate the cell coverage of the first cell, and the data amount loaded in the memory of the computer device is reduced, so that the burden of the computer device in the calculation process of the cell coverage is reduced.
Fig. 7 is a flowchart of a method for determining a coverage area of a cell according to an embodiment of the present application. As shown in fig. 7, the steps of the cell coverage area determination method are as follows.
1) And (5) collecting mobile phone signaling.
Acquiring mobile phone signaling of a base station in real time to acquire key fields, wherein the acquisition of the key fields comprises the following steps: user unique identification, signaling time, longitude of base station, latitude of base station, LAC of Cell and Cell.
2) And (5) converging the mobile phone signaling.
And data aggregation is carried out on the mobile phone signaling data, and the data are aggregated to a data platform from the acquisition end to be uniformly processed.
3) The mobile phone signaling is stored in the graph database.
The mobile phone signaling is stored in a graph database, the point label is a cell, namely, each cell is a point, the attribute is lac, cellid, user, longitude and the attribute is tile, and the position code, the cell code, the unique user identification, the signaling occurrence time, the longitude of the base station of the cell and the latitude of the base station of the cell are respectively corresponding to the cell. The edge label is move and time, namely, each two signaling of the user generates an edge, the source vertex of the edge is the cell vertex connected in the last signaling of the user, and the target vertex is the cell vertex connected in the current signaling.
4) A cell is queried.
And taking the cell A as a calculation target, and inquiring all the incoming edges and outgoing edges of the cell vertex.
5) A filter ring.
And removing all edges forming the ring to eliminate the situation that the position of the user is not changed, the situation that the signaling of the mobile phone of the user generates ping-pong effect and the like.
6) The attributes of the source vertex of the incoming edge and the target vertex of the outgoing edge are queried.
And inquiring vertex attributes of the incoming edge and the outgoing edge of the cell vertex to acquire all source vertexes and all target vertexes.
7) Grouping is carried out according to users, and sorting is carried out according to time.
And performing grouping operation according to the unique user identifier, sorting according to the occurrence time of the signaling, forming a sequence with 3 vertex elements, and filtering a sequence with the length less than 3.
8) A coverage area is calculated.
The coverage area of the cell is calculated according to a coverage area algorithm, which is as follows:
the source vertex of the incoming side is marked as a point A, the cell vertex is marked as a point B, the target point of the outgoing side is marked as a point C, the connection point A and the point B are marked as a side a, and the connection point B and the point C are marked as a side B;
making respective perpendicular bisectors on the side a and the side b, and marking the perpendicular bisectors as a side c and a side d respectively;
the area formed by the incoming side a, the outgoing side b and the perpendicular bisectors c and d is a coverage area of the cell (vertex);
the union operation is performed according to the multiple polygons obtained by each sequence, and the obtained polygons are coverage areas of the cell, and the coverage areas can be shown in fig. 6.
9) The coverage area of the cell is formed and 4-8 steps are performed for each cell.
And carrying out the 4 th to 8 th steps on each cell to obtain the coverage area of each cell.
Fig. 8 is a block diagram showing a structure of a cell coverage area determining apparatus according to an exemplary embodiment. The device comprises:
an edge data obtaining module 801, configured to query a graph database for first point data including a target user identifier, and obtain first edge data corresponding to the first point data; the first point data is used for indicating the communication connection of the target terminal corresponding to the target user identifier in a first cell; the first edge data is used for indicating a cell switching process of the target terminal between the first cell and each adjacent cell;
a neighboring point data obtaining module 802, configured to query the graph database according to the first edge data, to obtain each neighboring point data; the adjacent point data comprises adjacent positions of the adjacent cells;
a cell coverage area obtaining module 803, configured to determine a cell coverage area of the first cell in an area formed by each of the adjacent positions.
In one possible implementation manner, the cell coverage area obtaining module includes:
A connection line obtaining unit, configured to obtain a first connection line and a second connection line, where the first connection line and the second connection line are respectively formed by a first position and two target adjacent positions in the first point data;
a perpendicular bisector constructing unit, configured to construct a first perpendicular bisector at a midpoint of the first connection line, and construct a second perpendicular bisector at a midpoint of the second connection line;
and the cell coverage area determining unit is used for determining the area formed by the first connecting line, the second connecting line, the first perpendicular bisector and the second perpendicular bisector as the cell coverage area of the first cell.
In a possible implementation manner, each first edge data includes time information of cell switching;
the cell coverage area determining module further includes:
and the adjacent position determining module is used for sequencing the first edge data according to the time sequence and determining adjacent positions in two continuous first edge data as two target adjacent positions.
In one possible implementation, the cell coverage area determining module is further configured to,
and connecting the first position in the first point data with the position midpoints of the adjacent positions in pairs, and determining each obtained area as the cell coverage of the first cell.
In one possible implementation, the first edge data includes first in edge data and first out edge data; the first incoming side data are used for indicating a target terminal to be switched from the first adjacent cell to the first cell; the first outgoing side data is used for indicating the target terminal to be switched from the first cell to the second adjacent cell.
In one possible implementation, the apparatus further includes:
the updating data acquisition module is used for deleting the first incoming side data and the first outgoing side data in the first side data when the first adjacent cell and the second adjacent cell are the same cell, so as to acquire first updating data;
the adjacent point data acquisition module is also used for,
and inquiring in the graph database according to the first updating data to obtain the adjacent point data.
In one possible implementation, the apparatus further includes:
the signaling acquisition module is used for acquiring a first signaling of the target terminal; the first signaling comprises a first position of the first cell;
and the point data generation module is used for generating the first point data when the point data containing the first position does not exist in the graph database.
In one possible implementation, the apparatus further includes:
the side data generating module is used for acquiring a first cell switching signaling of the target terminal, and the first cell switching signaling is used for indicating the target terminal to generate first side data when the target terminal is switched between the first cell and an adjacent cell, and importing the first side data into the graph database to store the first side data in a storage area corresponding to the first point data.
In summary, when the cell coverage area needs to be calculated, the location information of the cell where the target terminal is located may be stored in the graph database as point data information, and the information of the cell handover process occurring in the moving process of the target terminal is stored in the graph database as side data information, and when the computer device needs to calculate the cell coverage area of the first cell, the computer device may read the first point data corresponding to the first cell, and further query the first side data corresponding to the first point data, thereby obtaining the location information of the cell adjacent to the first cell, so as to implement calculation of the cell coverage area of the first cell. In the above scheme, the computer device can directly read the position information of the adjacent cells of the first cell according to the first edge data so as to calculate the cell coverage of the first cell, and the data amount loaded in the memory of the computer device is reduced, so that the burden of the computer device in the calculation process of the cell coverage is reduced.
Referring to fig. 9, a schematic diagram of a computer device according to an exemplary embodiment of the present application is provided, where the computer device includes a memory and a processor, and the memory is configured to store a computer program, and the computer program is executed by the processor to implement the method for determining a cell coverage area.
The processor may be a central processing unit (Central Processing Unit, CPU). The processor may also be any other general purpose processor, digital signal processor (Digital Signal Processor, DSP), application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof.
The memory, as a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer-executable programs, and modules, such as program instructions/modules, corresponding to the methods in embodiments of the present application. The processor executes various functional applications of the processor and data processing, i.e., implements the methods of the method embodiments described above, by running non-transitory software programs, instructions, and modules stored in memory.
The memory may include a memory program area and a memory data area, wherein the memory program area may store an operating system, at least one application program required for a function; the storage data area may store data created by the processor, etc. In addition, the memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some implementations, the memory optionally includes memory remotely located relative to the processor, the remote memory being connectable to the processor through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
In an exemplary embodiment, a computer readable storage medium is also provided for storing at least one computer program that is loaded and executed by a processor to implement all or part of the steps of the above method. For example, the computer readable storage medium may be Read-Only Memory (ROM), random-access Memory (Random Access Memory, RAM), compact disc Read-Only Memory (CD-ROM), magnetic tape, floppy disk, optical data storage device, and the like.
Other embodiments of the application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It is to be understood that the application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (10)
1. A method for determining a coverage area of a cell, the method comprising:
inquiring first point data containing a target user identifier in a graph database, and acquiring first edge data corresponding to the first point data; the first point data is used for indicating the communication connection of the target terminal corresponding to the target user identifier in a first cell; the first edge data is used for indicating a cell switching process of the target terminal between the first cell and each adjacent cell;
Inquiring in the graph database according to the first edge data to obtain each adjacent point data; the adjacent point data comprises adjacent positions of the adjacent cells;
determining a cell coverage area of the first cell in the area formed by each adjacent position;
and determining a cell coverage area of the first cell in the area formed by each adjacent position, wherein the method comprises the following steps:
acquiring a first connecting line and a second connecting line which are respectively formed by a first position and two target adjacent positions in the first point data;
constructing a first perpendicular bisector at the midpoint of the first connection line and constructing a second perpendicular bisector at the midpoint of the second connection line;
and determining an area formed by the first connecting line, the second connecting line, the first perpendicular bisector and the second perpendicular bisector as a cell coverage area of the first cell.
2. The method of claim 1, wherein each of the first edge data includes time information of cell handover;
before the first connection line and the second connection line respectively formed by the first position and the two target adjacent positions in the first point data are acquired, the method further comprises:
And sequencing the first edge data according to the time sequence, and determining the adjacent positions in two continuous first edge data as two target adjacent positions.
3. The method of claim 1, wherein said determining a cell coverage area of said first cell within an area defined by each of said contiguous locations comprises:
and connecting the first position in the first point data with the position midpoints of the adjacent positions in pairs, and determining each obtained area as the cell coverage area of the first cell.
4. A method according to any one of claims 1 to 3, wherein the first edge data comprises first in edge data and first out edge data; the first incoming side data are used for indicating the target terminal to be switched from a first adjacent cell to the first cell; the first outgoing edge data is used for indicating the target terminal to be switched from the first cell to a second adjacent cell.
5. The method of claim 4, wherein the querying in the graph database according to the first edge data further comprises, before obtaining each neighboring point data:
when the first adjacent cell and the second adjacent cell are the same cell, deleting the first incoming side data and the first outgoing side data in the first side data to obtain first updated data;
The inquiring in the graph database according to the first edge data to obtain each adjacent point data comprises the following steps:
and inquiring in the graph database according to the first updating data to obtain the adjacent point data.
6. A method according to any one of claims 1 to 3, wherein before querying the graph database for the first point data containing the target user identity, further comprising:
acquiring a first signaling of a target terminal; the first signaling comprises a first position of the first cell;
and generating the first point data when the point data containing the first position does not exist in the graph database.
7. The method of claim 6, wherein the method further comprises:
when a first cell switching signaling of the target terminal is acquired, and the first cell switching signaling is used for indicating the target terminal to switch cells between the first cell and an adjacent cell, first edge data are generated and imported into a graph database to be stored in a storage area corresponding to the first point data.
8. A cell coverage area determining apparatus, the apparatus comprising:
The side data acquisition module is used for inquiring first point data containing a target user identifier in the graph database and acquiring first side data corresponding to the first point data; the first point data is used for indicating the communication connection of the target terminal corresponding to the target user identifier in a first cell; the first edge data is used for indicating a cell switching process of the target terminal between the first cell and each adjacent cell;
the adjacent point data acquisition module is used for inquiring in the graph database according to the first edge data to acquire each adjacent point data; the adjacent point data comprises adjacent positions of the adjacent cells;
a cell coverage area obtaining module, configured to determine a cell coverage area of the first cell in an area formed by each of the adjacent positions;
the cell coverage area acquisition module includes:
a connection line obtaining unit, configured to obtain a first connection line and a second connection line, where the first connection line and the second connection line are respectively formed by a first position and two target adjacent positions in the first point data;
a perpendicular bisector constructing unit, configured to construct a first perpendicular bisector at a midpoint of the first connection line, and construct a second perpendicular bisector at a midpoint of the second connection line;
And the cell coverage area determining unit is used for determining the area formed by the first connecting line, the second connecting line, the first perpendicular bisector and the second perpendicular bisector as the cell coverage area of the first cell.
9. A computer device comprising a processor and a memory, wherein the memory stores at least one instruction, at least one program, code set, or instruction set, and wherein the at least one instruction, at least one program, code set, or instruction set is loaded and executed by the processor to implement a method of determining a cell coverage area according to any one of claims 1 to 7.
10. A computer readable storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement the cell coverage area determination method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111357666.9A CN114095958B (en) | 2021-11-16 | 2021-11-16 | Cell coverage area determining method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111357666.9A CN114095958B (en) | 2021-11-16 | 2021-11-16 | Cell coverage area determining method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114095958A CN114095958A (en) | 2022-02-25 |
| CN114095958B true CN114095958B (en) | 2023-09-12 |
Family
ID=80301167
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111357666.9A Active CN114095958B (en) | 2021-11-16 | 2021-11-16 | Cell coverage area determining method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114095958B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207889A (en) * | 2006-12-18 | 2008-06-25 | 日本电气株式会社 | Neighboring cell list setting method, terminal, server, and mobile communication network |
| CN110121698A (en) * | 2016-12-31 | 2019-08-13 | 英特尔公司 | System, method and apparatus for Heterogeneous Computing |
| CN111746553A (en) * | 2019-03-27 | 2020-10-09 | 株式会社斯巴鲁 | Vehicle control device, vehicle control method, and vehicle control system |
| CN112287182A (en) * | 2020-10-30 | 2021-01-29 | 杭州海康威视数字技术股份有限公司 | Graph data storage and processing method and device and computer storage medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8290516B2 (en) * | 2009-10-01 | 2012-10-16 | Nokia Corporation | Method and apparatus for providing location based services using connectivity graphs based on cell broadcast information |
| US8996208B2 (en) * | 2012-07-09 | 2015-03-31 | Washington Metropolitan Area Transit Authority (WMTA) | System, method, and computer-readable medium for track circuit monitoring and alerting in automatic train control systems |
| US20180006897A1 (en) * | 2016-06-30 | 2018-01-04 | At&T Intellectual Property I, L.P. | Systems and methods for modeling networks |
| US10530661B2 (en) * | 2016-06-30 | 2020-01-07 | At&T Intellectual Property I, L.P. | Systems and methods for modeling networks |
| US10621236B2 (en) * | 2016-09-16 | 2020-04-14 | At&T Intellectual Property I, L.P. | Concept based querying of graph databases |
-
2021
- 2021-11-16 CN CN202111357666.9A patent/CN114095958B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207889A (en) * | 2006-12-18 | 2008-06-25 | 日本电气株式会社 | Neighboring cell list setting method, terminal, server, and mobile communication network |
| CN110121698A (en) * | 2016-12-31 | 2019-08-13 | 英特尔公司 | System, method and apparatus for Heterogeneous Computing |
| CN111746553A (en) * | 2019-03-27 | 2020-10-09 | 株式会社斯巴鲁 | Vehicle control device, vehicle control method, and vehicle control system |
| CN112287182A (en) * | 2020-10-30 | 2021-01-29 | 杭州海康威视数字技术股份有限公司 | Graph data storage and processing method and device and computer storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 分布式集群环境下基于并行计算的图聚类信息高效处理方案;张博;;自动化技术与应用(03);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114095958A (en) | 2022-02-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020038076A1 (en) | Network switching method and apparatus, terminal and storage medium | |
| US6636742B1 (en) | Tracking of mobile terminal equipment in a mobile communications system | |
| US9426044B2 (en) | Radio access network geographic information system with multiple format | |
| US8781459B2 (en) | Method of discovering overlapping cells | |
| CN112449302B (en) | Method and device for generating positioning and offline fingerprint database | |
| CN105373559A (en) | Geographic information acquisition method and geographic information acquisition system | |
| CN103686617A (en) | Method and device for creating instant communication group | |
| Hoßfeld et al. | Supporting vertical handover by using a pastry peer-to-peer overlay network | |
| US9271175B2 (en) | Wireless quality collecting device, wireless quality collecting method, and computer-readable recording medium | |
| KR20070059215A (en) | A method, an access point, a telecommunication device, a server and an information system for providing and for retrieving within a telecommunication network available network connection types | |
| CN109389848A (en) | A kind of car networking real-time analyzer based on HASH | |
| CN104954978A (en) | Method and device for wireless network ranging | |
| CN106535327B (en) | Wireless positioning method and device | |
| CN115150970A (en) | Network connection method and device | |
| CN114095958B (en) | Cell coverage area determining method, device, equipment and storage medium | |
| CN112689301A (en) | Switching sequence identification method and device of road scene and computing equipment | |
| CN111050398B (en) | Paging method, paging device, paging equipment and storage medium | |
| Leng et al. | Design of an internet of things system for smart hospitals | |
| CN106535317B (en) | Mobile terminal and positioning method thereof | |
| US20220286365A1 (en) | Methods for data model sharing for a radio access network and related infrastructure | |
| ES2498791T3 (en) | Method for determining the geographical traffic load on a mobile telecommunications network | |
| CN114630378B (en) | Network split determination method, device, server and storage medium | |
| CN112052299A (en) | Method, device, equipment and medium for updating interest points | |
| CN117222000A (en) | Gateway reselection judging method, device and equipment | |
| Gielow et al. | Data similarity aware dynamic nodes clustering for supporting management operations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |