CN114095958A - Method, device, equipment and storage medium for determining cell coverage area - Google Patents
Method, device, equipment and storage medium for determining cell coverage area Download PDFInfo
- Publication number
- CN114095958A CN114095958A CN202111357666.9A CN202111357666A CN114095958A CN 114095958 A CN114095958 A CN 114095958A CN 202111357666 A CN202111357666 A CN 202111357666A CN 114095958 A CN114095958 A CN 114095958A
- 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.)
- Granted
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
-
- 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
Abstract
The present application relates to a method, an apparatus, a device and a storage medium for determining a cell coverage area, and in particular, to the technical field of electrical 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 side data to obtain each adjacent point data; the adjacent point data includes adjacent positions of adjacent cells; a cell coverage area of the first cell is determined within an area formed by the respective adjacent positions. According to the scheme, the position information of the adjacent cell 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 cell coverage calculation process is reduced.
Description
Technical Field
The present invention relates to the field of network communication 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 its own location, the current location of the device can be acquired by acquiring the information of the cell (cell) where the device is currently located through the mobile network. When the position of the equipment is updated, the equipment sends information to the current service cell once to generate a signaling of the position update. The accuracy of Cell ID positioning varies with the coverage of the Cell. And the coverage area of the cell is drawn by means of data acquisition on site by a network optimization engineer, data analysis on parameters and the like. And combining the geographic position data to position the user.
However, in the above scheme, when the computer device calculates the cell coverage, a large amount of data needs to be read for analysis, and the large amount of data is stored in the memory of the computer device, which causes a large load on the computer device.
Disclosure of Invention
The application provides a cell coverage area determining method, a cell coverage area determining device, cell coverage area determining 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 cell coverage area is provided, where the method includes:
inquiring first point data containing a target user identifier in a 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 a target terminal corresponding to the target user identification in a first cell; the first edge data is used for indicating the 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 includes adjacent positions of the adjacent cells;
and determining a cell coverage area of the first cell in an area formed by the adjacent positions.
In yet another aspect, an apparatus for determining a cell coverage area is provided, the apparatus comprising:
the side data acquisition module is used for inquiring first point data containing a target user identifier in a 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 a target terminal corresponding to the target user identification in a first cell; the first edge data is used for indicating the 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 obtain each adjacent point data; the adjacent point data includes 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 the adjacent positions.
In a possible implementation manner, the cell coverage area obtaining module includes:
a connection line acquiring unit, configured to acquire a first connection line and a second connection line that are respectively formed by a first position and two target adjacent positions in the first point data;
the perpendicular bisector constructing unit is used for constructing a first perpendicular bisector on the midpoint of the position of the first connecting line and constructing a second perpendicular bisector on the midpoint of the position of the second connecting line;
and a cell coverage determining unit, configured to determine an area formed by the first connection line, the second connection line, the first perpendicular bisector, and the second perpendicular bisector as a cell coverage of the first cell.
In a possible implementation manner, each of the first side 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 the adjacent positions in two continuous first edge data as two target adjacent positions.
In one possible implementation manner, the cell coverage area determination module is further configured to,
and connecting the first position in the first point data with the middle points of the positions of the adjacent positions pairwise, and determining each obtained area as the cell coverage of the first cell.
In a possible implementation manner, the first side data includes first side-in data and first side-out data; the first incoming data is used for indicating a target terminal to be switched from a first adjacent cell to the first cell; the first outgoing 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:
an update data obtaining module, configured to delete first incoming data and first outgoing data in the first edge data to obtain first update data when the first neighboring cell and the second neighboring cell are the same cell;
the adjacency point data acquisition module is further configured to,
and inquiring in the graph database according to the first updating data to obtain the data of each adjacent point.
In one possible implementation, the apparatus further includes:
the signaling acquisition module is used for acquiring a first signaling of a target terminal; the first signaling comprises a first position of the first cell;
and the point data generating 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:
and the edge data generation module is used for acquiring a first cell switching signaling of the target terminal, wherein the first cell switching signaling is used for generating first edge data when the target terminal is indicated to switch between the first cell and an adjacent cell, and importing the first edge data into a graph database to be stored 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, and the at least one instruction, at least one program, a set of codes, or a set of instructions is loaded and executed by the processor to implement the cell coverage area determination method.
In yet another aspect, a computer-readable storage medium is provided, in which at least one instruction is stored, and the at least one instruction is loaded and executed by a processor to implement the cell coverage area determination method described above.
In yet another aspect, a computer program product is provided, as well as a computer program product or a 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 execute 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 needs to be calculated, the position information of the cell where the target terminal is located can be stored in the graph database as point data information, the information of the cell switching process of the target terminal in the moving process is stored in the graph database as side data information, and when the computer equipment needs to calculate the cell coverage area of the first cell, the first point data corresponding to the first cell can be read, and then the first side data corresponding to the first point data can be inquired, so that the position information of the cell adjacent to the first cell can be obtained, and the calculation of the cell coverage area of the first cell can be realized. In the above scheme, the computer device may directly read the location information of the neighboring cell of the first cell according to the first edge data to calculate the cell coverage of the first cell, so as to reduce the amount of data loaded in the memory of the computer device, thereby reducing the burden of the computer device in the cell coverage calculation process.
Drawings
In order to more clearly illustrate the detailed description of the present application or the technical solutions in the prior art, the drawings needed to be used in the detailed description of the present application or the prior art description will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic structural diagram illustrating a cell coverage area determination system according to an exemplary embodiment.
FIG. 2 illustrates a graph database data storage diagram according to an embodiment of the present application.
Fig. 3 is a flowchart illustrating a method of cell coverage area determination, according to an example embodiment.
Fig. 4 is a schematic diagram illustrating a logical relationship between point data and edge data according to an embodiment of the present application.
Fig. 5 is a flowchart illustrating a method of cell coverage area determination, according to an example embodiment.
Fig. 6 shows a schematic cell coverage area diagram according to an embodiment of the present application.
Fig. 7 is a flowchart illustrating a method for determining a cell coverage area according to an embodiment of the present application.
Fig. 8 is a block diagram illustrating a structure of a cell coverage area determining apparatus according to an exemplary embodiment.
FIG. 9 is a schematic diagram of a computer device provided in accordance with an exemplary embodiment of the present application.
Detailed Description
The technical solutions of the present application will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be understood that "indication" mentioned in the embodiments of the present application may be a direct indication, an indirect indication, or an indication of an association relationship. For example, a indicates B, which may mean that a directly indicates B, e.g., B may be obtained by a; it may also mean that a indicates B indirectly, for example, a indicates C, and B may be obtained by C; it can also mean that there is an association between a and B.
In the description of the embodiments of the present application, the term "correspond" may indicate that there is a direct correspondence or an indirect correspondence between the two, may also indicate that there is an association between the two, and may also indicate and be indicated, configure and configured, and so on.
In the embodiment of the present application, "predefining" may be implemented by saving a corresponding code, table, or other manners that may be used to indicate related information in advance in a device (for example, including a terminal device and a network device), and the present application is not limited to a specific implementation manner thereof.
Before describing the various embodiments shown herein, several concepts related to the present application will be described.
1) Graph database
A graph database is a type of NoSQL database that applies graph theory to store relationship information between entities. The graph database is a non-relational database that stores relational information between entities using graph theory. The most common example is the interpersonal relationship in social networks. Relational databases are not effective for storing "relational" data, are complex, slow, and beyond expectations in querying, and the unique design of graphic databases just remedies this deficiency. When many-to-many relationships need to be represented, an association table is often created to record many-to-many relationships of different entities, and the association table is 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, it is only necessary to indicate that there is a different relationship between the two. If it is desired to establish a bi-directional 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 presentation of relationships through the ability of relationships to contain attributes, relative to the various association tables in the relational database. Thus, users of graphical databases will have an extra weapon when abstracting things, that is, a rich relationship, as compared to relational databases.
2) Cell handover
Cell switching (Channel Switch) in a wireless communication system, when a mobile station moves from one cell (meaning a base station or the coverage area of a base station) to another cell, Channel switching is required in order to maintain uninterrupted communication for the mobile user. How to successfully and quickly complete cell handover is one of the important aspects of cell system design in a wireless communication system. In the process of cell switching, UE informs the ID of a target cell of a base station, switching is needed, a source cell sends RRC connection reconfiguration information to the UE, and the information configures the allocated special access signature to the UE; and the UE sends an RRC connection reconfiguration completion message to the target cell, which indicates that the UE is switched to the target side.
Fig. 1 is a schematic structural diagram illustrating a cell coverage area determination system according to an exemplary embodiment. The cell coverage area determination system includes a communication system including a base station 120 and a terminal 130, and a server 110.
The number of terminals 130 is usually multiple, and one or more terminals 130 may be distributed in a cell managed by each base station 120. The terminal 130 may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem having wireless communication functions, as well as various forms of User Equipment (UE), Mobile Stations (MS), terminal Equipment (terminal device), and so on. For convenience of description, in the embodiments of the present application, the above-mentioned devices are collectively referred to as a terminal.
In the embodiment of the present application, the base station 20 may include at least two base stations, and the at least two base stations are respectively used for covering cells corresponding to the base stations.
The Core Network (CN) 30 mainly provides user connection, user management, and service completion bearer, and serves as a bearer Network to provide an interface to an external Network. The establishment of the user connection includes mobility management, call management, switching/routing, voice notification (connection to intelligent network peripheral equipment is completed in conjunction with intelligent network services), and other functions.
Optionally, not shown in fig. 1, the network architecture further includes other network devices, such as: a Central Network Control (CNC), a Session Management Function (SMF), or a User Plane Function (UPF) device, among others.
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 those skilled in the art can understand the meaning thereof. The technical scheme described in the embodiment of the present disclosure may be applied to a 5G NR system, and may also be applied to a subsequent evolution system of the 5G NR system.
Alternatively, when the terminal 130 acquires 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 based on the target data according to a preset import flow.
In a graph database, there are point data and attribute data corresponding to the point data, and edge data and attribute data corresponding to the edge data. Refer to FIG. 2, which illustrates a diagram of a graph database data store according to an embodiment of the present application. The graph database shown in fig. 2 stores data in a node-centered and edge-cut manner. For example, the ID of a node in Hbase is used as the Rowkey of Hbase, and each attribute and each edge on the node are used as the independent cells of the Rowkey row. In the graph database 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, and if the Hbase is used in the bottom layer storage, the vertex id represents the Rowkey of the current line and uniquely represents a certain node. property represents the property of a node; edge represents the corresponding edge of the 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 data of one edge in the graph database needs to be queried, the data of the point corresponding to two nodes (a source node and a target node) corresponding to the data of the edge needs to be queried in a storage space.
Optionally, the server may be an independent physical server, a server cluster formed by a plurality of physical servers, or a distributed system, and may also be a cloud server that provides technical computing services such as cloud service, a cloud database, cloud computing, a cloud function, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN, and a big data and 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 connection states between the modules and the server, and the management device is connected to the server through a communication network. Optionally, the communication network is a wired network or a wireless network.
Optionally, 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, data exchanged over the network is represented using techniques and/or formats including hypertext markup language, extensible markup language, and the like. All or some of the links may also be encrypted using conventional encryption techniques such as secure sockets layer, transport layer security, virtual private network, internet protocol security, and the like. 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 flowchart 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 method for determining the cell coverage area may include the following steps:
The first point data is used for indicating the communication connection of the target terminal corresponding to the target user identification in the first cell.
The first side data is used for indicating the cell switching process of the target terminal between the first cell and each adjacent cell.
Optionally, the first point data includes a first location of the first cell.
In a possible implementation manner, the first point data is generated by the base station acquiring a signaling sent by the user in the first cell and importing a feature 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, an LAC (Location Area Code) of the Cell, and a Cell Code, where a label 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 device stores the characteristic information of the mobile phone signaling into a graph database, wherein the point label is a cell, namely, each user arrives at a certain cell as a point, the attributes are lac, cellid, user, longitude and latitude, and 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 of the cell are respectively corresponding.
In a possible implementation manner, the computer device queries the first point data corresponding to the user unique identifier in the graph database through the user unique identifier of the target terminal.
In a possible implementation manner, the label of the side data in the graph database is move, and the side data includes the signaling occurrence time. That is, when the user terminal corresponding to the user unique identifier has a cell switching process, two consecutive signaling uploaded by the user terminal correspond to two different cells respectively, that is, correspond to two different point data in the graph database, that is, each two signaling of the user generates an edge, the source vertex of the edge is the cell vertex connected in the previous signaling of the user, and the target vertex is the cell vertex connected in the current signaling.
Please refer to fig. 4, which illustrates a schematic diagram of a logical relationship between point data and edge data according to an embodiment of the present application.
As shown in fig. 4, when the user id of the target terminal points to "user 1", the signaling of the uplink base station will generate corresponding point data in the database when the target terminal arrives in the cells 1 to 5. For example, when the target terminal first reaches the cell4, the target terminal uploads a signaling to the base station, and the base station receives the signaling of the target terminal and transmits the signaling to the computer device, and the computer device queries in the graph database according to the user unique identifier and the cell code of the cell4 (i.e., the ID of the cell), and generates point data including the user unique identifier and the cell code of the cell4 when the cell code including the user unique identifier and the cell4 is not queried.
When the computer device detects that two consecutive signaling of the target terminal respectively correspond to different Cell codes, for example, the Cell corresponding to the first signaling is Cell1, and the Cell corresponding to the second signaling is Cell2, it indicates that the target terminal obviously has Cell handover, and the target terminal is handed over from Cell1 to Cell2, that is, the target terminal obviously moves from Cell1 to Cell2 during the time period when the signaling occurs. Therefore, the computer device can generate corresponding edge data, use the point data corresponding to the cell1 as the source point data, use the point data corresponding to the cell2 as the target point data, and use the occurrence time of the second signaling as the time of position movement, thereby constructing the edge data, and import the edge data into the graph database, the area corresponding to the cell1 and the area corresponding to the cell2, respectively.
In the embodiment of the present application, the neighbor point data includes the neighbor locations of the neighboring cells. Wherein the neighboring position is used to indicate the base station position of each neighboring cell.
In the graph database shown in fig. 2, since the edge data is stored in the storage area of the corresponding point data, when the first point data is searched, the first edge data having a connection relationship with the first point data can be determined, and when the search is performed based on the first edge data, the adjacent point data having a connection relationship with the first point data can be determined.
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 side data corresponding to the first point data includes the side data connecting the cell5 and the cell2 and the side data connecting the cell5 and the cell 3.
Therefore, when the query is performed in the graph database according to the first side 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.
Step 303 determines the cell coverage area of the first cell in the area formed by the adjacent positions.
After the adjacent positions of the adjacent cells recorded by the adjacent point data are obtained, the cell having the adjacent relation with the first cell and the corresponding base station position can be judged according to the adjacent positions.
For example, when the terminal performs cell selection, it usually selects the base station with the strongest signal for access, so the midpoint between the first location and the adjacent location, i.e. the boundary of the signal strength, is considered to be the cell coverage area of the first cell, and the side closer to the first location, the signal strength of the base station corresponding to the first cell is higher; on the side close to the adjacent position, the base station corresponding to the adjacent cell has a higher signal strength, and is considered as the cell coverage area of the adjacent cell.
In a possible implementation manner, the first location and the location midpoints of the respective adjacent locations are connected two by two, and the obtained respective areas are determined as the cell coverage area of the first cell.
After the position midpoints of the first position and each adjacent position are obtained, the midpoint areas of each position can be connected in pairs. For example, when three position midpoints exist, connecting the three position midpoints pairwise to obtain a triangular area serving as a cell coverage area of the first cell; when there are more than three position midpoints, for example, there are four position midpoints, the four position midpoints may be connected two by two to obtain four triangular regions, and the four triangular regions are cell coverage areas of the first cell.
In another possible implementation manner, an average value of distances between the midpoint of each position and the first position is obtained, the average value is taken as a radius, and a circular area with the first position as the midpoint is determined as the cell coverage of the first cell.
In summary, when the cell coverage area needs to be calculated, the location information of the cell in which 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 during the movement process of the target terminal is stored in the graph database as side data information. In the above scheme, the computer device may directly read the location information of the neighboring cell of the first cell according to the first edge data to calculate the cell coverage of the first cell, so as to reduce the amount of data loaded in the memory of the computer device, thereby reducing the burden of the computer device in the cell coverage calculation process.
Fig. 5 is a flowchart 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 method for determining the cell coverage area may include the following steps:
Optionally, each of the first side data includes cell handover time information.
In the map database, the first point data includes feature information of the first cell interacting with the target terminal, such as a location 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.
In the graph database, when each user arrives at the first cell, point data corresponding to the first cell by the respective user is generated, that is, the first point data further includes a user unique identifier for characterizing the user corresponding to the first point data.
In the graph database, the first edge data contains the signaling occurrence time, and the first edge data is simultaneously stored in a point data area of the source vertex data and a point data area of the target vertex data; the first edge data may therefore in fact be used to instruct the user to move from the cell corresponding to the source vertex data to the cell corresponding to the target vertex data.
In one possible implementation, a first signaling of a target terminal is obtained; the first signaling comprises a first position of the first cell; the first point data is generated when no point data including the first location exists in the map database.
When the base station transmits the received first signaling sent by the target terminal to the computer device to be imported into the map database, the computer device firstly performs query in the map 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 map database, the first point data including the first position can be updated according to the attribute (for example, time) in the first signaling.
When the computer device does not inquire the point data of the first position in the graph database, the computer device leads each attribute information (such as the position code of the first cell, the cell code, the user unique identifier, 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.
The respective signaling of the target terminal including the first signaling may be stored in the base station and sent to the computer device. After the target terminal and the base station communicate through the first signaling, the base station receives the first signaling, stores the first signaling into 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, according to the unique ID of the user in the first signaling, inquiring in the graph database, wherein each inquired point data is the point data corresponding to the target terminal which sends the first signaling. And the first point data is any one of the point data having the user unique ID.
In a possible implementation manner, when a first cell handover signaling of the target terminal is obtained and the first cell handover signaling is used to indicate cell handover of the target terminal between the first cell and an adjacent cell, first edge data is generated, and a graph database is imported to store the first edge data 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 data is used for indicating a target terminal to be switched from the first adjacent cell to the first cell; the first outgoing 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 includes first edge data and first edge data. In the first edge data, first point data is used as a target vertex; in the first edge data, the first point data is used as a source vertex.
The neighbor point data includes the neighboring positions of the neighboring cells. In the graph database structure shown in fig. 2, each point data including the first edge data can be searched based on the first edge data, and each point data including the first edge data is determined as the adjacent point data, and since the first edge data is generated based on the cell switching operation of the user terminal, the cells indicated by each adjacent point data are all adjacent cells to the first cell.
In a possible implementation manner, when the first neighboring cell and the second neighboring cell are the same cell, deleting first incoming side data and first outgoing side data in the first side data to obtain first update data; and inquiring in the graph database according to the first updating data to obtain the data of each adjacent point.
When the first neighboring cell and the second neighboring cell are the same cell (for example, cell a), it means that the first incoming data is generated when the user terminal moves from cell a to the first cell and the user terminal is handed over from cell a to the first cell, and similarly, the first outgoing data is generated when the user terminal moves from the first cell to the cell a and the user terminal is handed over from the first cell to the cell a.
At this time, the user terminal may generate a ping-pong effect between the first cell and the cell a, and the authenticity of the data is problematic, so that the first incoming data and the first outgoing data can be directly deleted, and the influence of the ping-pong effect on the cell coverage area calculation is prevented.
And 503, sorting the first side data according to the time sequence, and determining the adjacent positions in two continuous first side data as two target adjacent positions.
After the first side data are obtained, the first side data are all used for indicating the cell movement behavior of the user terminal between the user terminal and the adjacent cells of the first cell, and at the moment, the first side data are sequenced according to the time sequence, and the target adjacent positions of two continuous first side data are obtained.
And 505, constructing a first perpendicular bisector on the position midpoint of the first connecting line, and constructing a second perpendicular bisector on the position midpoint of the second connecting line.
Please refer to fig. 6, which illustrates a schematic diagram of a cell coverage area according to an embodiment of the present application. 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, so that an area formed by the first connection line, the second connection line, the first perpendicular bisector and the second perpendicular bisector is a cell coverage area of the first cell.
Optionally, because the target adjacent position is a target adjacent position in any two consecutive pieces of edge data in the first edge data sorted by time, the target adjacent position in each two consecutive pieces of first edge data in the first edge data may be traversed, and cell coverage areas calculated by each two consecutive pieces of edge data are obtained through the manner shown in steps 504 to 506, and the cell coverage areas are merged to obtain a cell coverage area of the first cell.
Optionally, the computer device further obtains point data and edge data corresponding to other terminals in the graph database except the target terminal according to the unique user identifier, calculates the cell coverage areas corresponding to other users in the manners shown in steps 502 to 506, and merges the cell coverage areas corresponding to the target terminal with the cell coverage areas 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 in which 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 during the movement process of the target terminal is stored in the graph database as side data information. In the above scheme, the computer device may directly read the location information of the neighboring cell of the first cell according to the first edge data to calculate the cell coverage of the first cell, so as to reduce the amount of data loaded in the memory of the computer device, thereby reducing the burden of the computer device in the cell coverage calculation process.
Please refer to fig. 7, which is a flowchart illustrating a method for determining a cell coverage area 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) acquiring a mobile phone signaling.
The method comprises the steps of collecting mobile phone signaling of a base station in real time, and acquiring key fields, wherein the key fields comprise: the unique user identification, the occurrence time of the signaling, the longitude of the base station, the latitude of the base station, the LAC and the Cell of the Cell.
2) And (5) mobile phone signaling convergence.
And carrying out data aggregation on the mobile phone signaling data, and aggregating the data from the acquisition end to the data platform for unified processing.
3) The mobile phone signaling is stored in the graph database.
Storing the mobile phone signaling into a graph database, wherein the point label is a cell, namely each cell is a point, the attributes are lac, cellid, user, longitude and latitude, and the position code, the cell code, the unique user identifier, the signaling occurrence time, the longitude of the base station to which the cell belongs and the latitude of the base station to which the cell belongs of the cell are respectively corresponding to the cell. The edge label is move and time, that is, every two signaling of the user generate 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 inquiring all the incoming edges and the outgoing edges of the cell vertex by taking the cell A as a calculation target.
5) And (4) a filtering ring.
All edges forming the ring are removed to eliminate the condition that the position of the user is not changed and the condition that the ping-pong effect occurs in the mobile phone signaling of the user.
6) And inquiring the attributes of the source vertex of the incoming edge and the target vertex of the outgoing edge.
And inquiring the vertex attributes of the incoming edge and the outgoing edge of the cell vertex to obtain all source vertexes and target vertexes.
7) Grouping according to users and sorting according to time.
And performing grouping operation according to the unique user identifier, sequencing according to the time of signaling occurrence to form a sequence with 3 vertex elements, and filtering the sequence with the length less than 3.
8) The coverage area is calculated.
Calculating the coverage area of the cell according to a coverage area algorithm, which is as follows:
marking a source vertex of an incoming edge as a point A, a vertex of the cell as a point B, a target fixed point of an outgoing edge as a point C, a connecting point A and the point B as an edge a, and the connecting point B and the point C as an edge B;
making respective perpendicular bisectors of the opposite side a and the opposite side b, and respectively marking as an edge c and an edge d;
the area formed by the incoming edge a, the outgoing edge b and the vertical bisectors c and d is a coverage area of the cell (vertex);
the union operation is performed according to the polygons obtained from the sequences, and the obtained polygon is the coverage area of the cell, which can be shown in fig. 6.
9) And forming a coverage area of the cell, and executing 4-8 steps for each cell.
And 4, performing the operations of the 4 th step to the 8 th step on each cell to obtain the coverage area of each cell.
Fig. 8 is a block diagram illustrating 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 first point data including a target user identifier in a graph database, and obtain first edge data corresponding to the first point data; the first point data is used for indicating the communication connection of a target terminal corresponding to the target user identification in a first cell; the first edge data is used for indicating the cell switching process of the target terminal between the first cell and each adjacent cell;
an adjacent point data obtaining module 802, configured to query the graph database according to the first edge data to obtain adjacent point data; the adjacent point data includes 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 a possible implementation manner, the cell coverage area obtaining module includes:
a connection line acquiring unit, configured to acquire a first connection line and a second connection line that are respectively formed by a first position and two target adjacent positions in the first point data;
the perpendicular bisector constructing unit is used for constructing a first perpendicular bisector on the midpoint of the position of the first connecting line and constructing a second perpendicular bisector on the midpoint of the position of the second connecting line;
and a cell coverage determining unit, configured to determine an area formed by the first connection line, the second connection line, the first perpendicular bisector, and the second perpendicular bisector as a cell coverage of the first cell.
In a possible implementation manner, each of the first side 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 the adjacent positions in two continuous first edge data as two target adjacent positions.
In one possible implementation manner, the cell coverage area determination module is further configured to,
and connecting the first position in the first point data with the middle points of the positions of the adjacent positions pairwise, and determining each obtained area as the cell coverage of the first cell.
In a possible implementation manner, the first side data includes first side-in data and first side-out data; the first incoming data is used for indicating a target terminal to be switched from the first adjacent cell to the first cell; the first outgoing 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:
an update data obtaining module, configured to delete first incoming data and first outgoing data in the first edge data to obtain first update data when the first neighboring cell and the second neighboring cell are the same cell;
the adjacency point data acquisition module is further configured to,
and inquiring in the graph database according to the first updating data to obtain the data of each adjacent point.
In one possible implementation, the apparatus further includes:
the signaling acquisition module is used for acquiring a first signaling of a target terminal; the first signaling comprises a first position of the first cell;
and the point data generating 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:
and the edge data generation module is used for acquiring a first cell switching signaling of the target terminal, wherein the first cell switching signaling is used for generating first edge data when the target terminal is indicated to switch between the first cell and an adjacent cell, and importing the first edge data into a graph database to be stored 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 in which 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 during the movement process of the target terminal is stored in the graph database as side data information. In the above scheme, the computer device may directly read the location information of the neighboring cell of the first cell according to the first edge data to calculate the cell coverage of the first cell, so as to reduce the amount of data loaded in the memory of the computer device, thereby reducing the burden of the computer device in the cell coverage calculation process.
Please refer to fig. 9, which is a schematic diagram of a computer device according to an exemplary embodiment of the present application, the computer device includes a memory and a processor, the memory is used for storing a computer program, and the computer program is executed by the processor to implement the cell coverage area determining method described above.
The processor may be a Central Processing Unit (CPU). The Processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, or a combination thereof.
The memory, which is 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 of the embodiments of the present invention. The processor executes various functional applications and data processing of the processor by executing non-transitory software programs, instructions and modules stored in the memory, that is, the method in the above method embodiment is realized.
The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by the processor, and the like. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory located remotely from the processor, and such remote memory may be coupled to the processor via 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, which 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 a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc Read-Only Memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention 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 invention 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 will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (11)
1. A method for determining a cell coverage area, the method comprising:
inquiring first point data containing a target user identifier in a 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 a target terminal corresponding to the target user identification in a first cell; the first edge data is used for indicating the 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 includes adjacent positions of the adjacent cells;
and determining a cell coverage area of the first cell in an area formed by the adjacent positions.
2. The method of claim 1, wherein said determining a cell coverage area of the first cell within the area formed by each of the adjacent locations comprises:
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 on the midpoint of the position of the first connecting line, and constructing a second perpendicular bisector on the midpoint of the position of the second connecting 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.
3. The method according to claim 2, wherein each of the first side data includes cell switching time information;
before the obtaining of the first connection line and the second connection line respectively formed by the first position in the first point data and the two target adjacent positions, the method further includes:
and 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.
4. The method of claim 1, wherein said determining a cell coverage area of the first cell within the area formed by each of the adjacent locations comprises:
and connecting the first position in the first point data with the position midpoints of the adjacent positions pairwise, and determining each obtained area as the cell coverage area of the first cell.
5. The method according to any one of claims 1 to 4, wherein the first side data comprises first in-side data and first out-side data; the first incoming data is used for indicating a target terminal to be switched from a first adjacent cell to the first cell; the first outgoing data is used for indicating the target terminal to be switched from the first cell to a second adjacent cell.
6. The method according to claim 5, wherein before querying said graph database for each adjacent point data based on said first edge data, further comprising:
when the first adjacent cell and the second adjacent cell are the same cell, deleting first edge data and first edge data in the first edge data to obtain first updating data;
the querying 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 data of each adjacent point.
7. The method according to any one of claims 1 to 4, wherein before querying the first point data containing the target user identifier in the graph database, further comprising:
acquiring a first signaling of a target terminal; the first signaling comprises a first position of the first cell;
generating the first point data when no point data including the first location exists in the graph database.
8. The method of claim 7, further comprising:
and when a first cell switching signaling of the target terminal is acquired and the first cell switching signaling is used for indicating the cell switching of the target terminal between the first cell and an adjacent cell, generating first edge data, and importing the first edge data into a graph database to be stored in a storage area corresponding to the first point data.
9. An apparatus for cell coverage area determination, the apparatus comprising:
the side data acquisition module is used for inquiring first point data containing a target user identifier in a 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 a target terminal corresponding to the target user identification in a first cell; the first edge data is used for indicating the 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 obtain each adjacent point data; the adjacent point data includes 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 the adjacent positions.
10. A computer device comprising a processor and a memory, the memory having at least one instruction, at least one program, a set of codes, or a set of instructions stored therein, the at least one instruction, at least one program, a set of codes, or a set of instructions being loaded and executed by the processor to implement the method of cell coverage area determination according to any of claims 1 to 8.
11. A computer-readable storage medium having stored thereon at least one instruction which is loaded and executed by a processor to perform a method for cell coverage area determination according to any of claims 1 to 8.
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 true CN114095958A (en) | 2022-02-25 |
| CN114095958B 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 (9)
| 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 |
| US20110081922A1 (en) * | 2009-10-01 | 2011-04-07 | Nokia Corporation | Method and apparatus for providing location based services using connectivity graphs based on cell broadcast information |
| US20140012438A1 (en) * | 2012-07-09 | 2014-01-09 | Washington Metropolitan Area Transit Authority (WMATA) | 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 |
| US20180006898A1 (en) * | 2016-06-30 | 2018-01-04 | At&T Intellectual Property I, L.P. | Systems and methods for modeling networks |
| US20180081990A1 (en) * | 2016-09-16 | 2018-03-22 | At&T Intellectual Property I, L.P. | Concept-Based Querying of Graph Databases |
| 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 |
-
2021
- 2021-11-16 CN CN202111357666.9A patent/CN114095958B/en active Active
Patent Citations (9)
| 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 |
| US20110081922A1 (en) * | 2009-10-01 | 2011-04-07 | Nokia Corporation | Method and apparatus for providing location based services using connectivity graphs based on cell broadcast information |
| US20140012438A1 (en) * | 2012-07-09 | 2014-01-09 | Washington Metropolitan Area Transit Authority (WMATA) | 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 |
| US20180006898A1 (en) * | 2016-06-30 | 2018-01-04 | At&T Intellectual Property I, L.P. | Systems and methods for modeling networks |
| US20180081990A1 (en) * | 2016-09-16 | 2018-03-22 | At&T Intellectual Property I, L.P. | Concept-Based Querying of Graph Databases |
| 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 |
|---|
| 张博;: "分布式集群环境下基于并行计算的图聚类信息高效处理方案", 自动化技术与应用, no. 03 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114095958B (en) | 2023-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020038076A1 (en) | Network switching method and apparatus, terminal and storage medium | |
| CN110049485B (en) | Method, device and system for configuring strategy of UE | |
| US9426044B2 (en) | Radio access network geographic information system with multiple format | |
| US8781459B2 (en) | Method of discovering overlapping cells | |
| US20210232610A1 (en) | Positioning method and apparatus, and offline fingerprint database generation method and apparatus | |
| WO2010138286A2 (en) | Distributed information storage and retrieval of communication network performance data | |
| CN105848131A (en) | Method for realizing STA cross-domain roaming through cloud AC | |
| CN103813364A (en) | Mobile self-organizing network interrupt data recovery method based on area perception | |
| CN108173617B (en) | Method for acquiring full-network clock topology and clock path | |
| Hoßfeld et al. | Supporting vertical handover by using a pastry peer-to-peer overlay network | |
| 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 | |
| CN106535327B (en) | Wireless positioning method and device | |
| CN103348712B (en) | Communication system | |
| CN107493582A (en) | A kind of Automatic Neighboring Relation ANR method for building up, systems and management station | |
| CN104954978A (en) | Method and device for wireless network ranging | |
| CN103945433A (en) | Method and device for determining area with weak network coverage | |
| CN114095958B (en) | Cell coverage area determining method, device, equipment and storage medium | |
| CN113099449B (en) | Authentication method and system of distributed core network and home subscriber server | |
| CN112689301B (en) | Road scene switching sequence identification method and device and computing equipment | |
| CN106792934B (en) | Switching method and device | |
| CN113133008A (en) | Communication method and device | |
| WO2020073555A1 (en) | Paging method and apparatus, equipment, and storage medium | |
| Mukherjee et al. | DAS: An intelligent three dimensional cost effective movement prediction of active users in heterogeneous mobile network | |
| Pomalo et al. | A data generator for cloud-edge vehicle communication in multi domain cellular networks | |
| Lo et al. | Adaptive region-based location management for PCS systems |
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 |