Data synchronization method, information transmission method and device

Abstract

The present invention provides a data synchronization method, an information transmission method and a device, belonging to the field of wireless communication technology, wherein the data synchronization method applied to the edge node currently accessed by the terminal comprises: predicting the second edge node to be accessed next by the terminal according to the corresponding relationship between the edge node coverage area and the road; sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization when it determines that it lacks at least part of the information required to provide services for the terminal. The present invention can reduce the delay of data synchronization between multiple operators when the second edge node provides services for the terminal, provide corresponding services for the terminal in a timely manner, improve service performance and service quality, and improve user experience and security.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a data synchronization method, an information transmission method and a device. Background Art

[0002] Multi-access Edge Computing (MEC) achieves localized, close-range, and distributed deployment of content and services by migrating computing, storage, and service capabilities to the edge of the network. MEC for cellular-vehicle to everything (C-V2X) wireless communication technology can use the characteristics of MEC to provide a low-latency, high-performance network environment for Internet of Vehicles services, and support the deployment of C-V2X services with more local characteristics.

[0003] Edge nodes are generally deployed at the network access layer or co-located with base stations. Different operators deploy applications at edge nodes to provide users with low-latency services. At the same time, different operators deploy roadside infrastructure (Road Side Unit, RSU) on the roadside. On the one hand, it can collect information, such as connecting to the traffic management platform to obtain road traffic flow information, traffic accident information, etc., and connecting to roadside sensors to collect sensor information; on the other hand, RSU can forward information and disseminate information through broadcasting. At present, in order to provide services to vehicles, edge nodes need to rely on RSU and / or sensors to obtain necessary information in addition to relying on vehicle uploaded information.

[0004] However, some operators may not be able to obtain necessary data in some areas, such as not deploying sensors or RSUs in the area, which will result in the inability to provide corresponding services to users in the area. In order to solve the above problems and provide users with continuous services, data synchronization can be performed between multiple operators.

[0005] When synchronizing data among multiple operators, authentication, data link establishment, data transmission and other steps are required, which takes a certain amount of time. At the same time, in some scenarios, such as vehicle trajectory prediction and pedestrian collision warning, historical traffic data needs to be synchronized, which further increases the latency of data synchronization among multiple operators. The high latency of data synchronization among multiple operators will seriously affect the quality of Internet of Vehicles services and even cause serious traffic accidents.

[0006] Currently, the following technologies exist: making optimal cache decisions for mobile users under different operators, thereby improving the cache hit rate when users access data and reducing access latency; in order to increase the forwarding rate of messages and reduce the transmission latency of messages; mainly for the data forwarding process, simplifying the configuration of inter-domain paths. However, there is no technology that can reduce the data synchronization latency between multiple operators related to edge computing. Summary of the invention

[0007] In view of this, the present invention provides a data synchronization method, an information transmission method and a device, which are used to solve the problem of high delay in the current multi-operator data synchronization.

[0008] In order to solve the above technical problem, in a first aspect, the present invention provides a data synchronization method, which is applied to a first edge node, where the first edge node is an edge node currently accessed by a terminal, and the method comprises:

[0009] Predicting a second edge node that the terminal will access next based on a correspondence between an edge node coverage area and a road;

[0010] The first information is sent to the second edge node, so that the second edge node starts multi-operator data synchronization when it is determined that the second edge node lacks at least part of the information required to provide services for the terminal.

[0011] Optionally, predicting a second edge node to be accessed next by the terminal according to the correspondence between the edge node coverage area and the road includes:

[0012] Determining a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0013] Predicting a road that the terminal will enter based on the moving direction of the terminal on the first road and the road topology;

[0014] At least one second edge node is predicted based on the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road.

[0015] Optionally, predicting the road that the terminal will enter according to the moving direction of the terminal on the first road and the road topology structure includes:

[0016] Predicting a road that the terminal will enter within a preset area according to the moving direction of the terminal on the first road and the road topology;

[0017] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0018] Optionally, predicting the road that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology structure includes:

[0019] Predicting the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology;

[0020] The predicting and obtaining at least one second edge node according to the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road includes:

[0021] At least one second edge node is predicted based on the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0022] In a second aspect, the present invention further provides a data synchronization method, which is applied to a second edge node, where the second edge node is the edge node that the terminal will access next, which is predicted by the first edge node based on the correspondence between the edge node coverage area and the road, and the first edge node is the edge node that the terminal is currently accessing, and the method includes:

[0023] receiving first information sent by the first edge node;

[0024] After receiving the first information, determining whether the device itself lacks at least part of the information required to provide services for the terminal;

[0025] If it is determined to be missing, start multi-operator data synchronization.

[0026] Optionally, both the first edge node and the second edge node belong to a first operator;

[0027] The starting of multi-operator data synchronization includes:

[0028] Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0029] In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

[0030] Optionally, determining the third edge node includes:

[0031] The third edge node is determined according to the correspondence between the edge node coverage area of ​​the second operator and the road.

[0032] Optionally, the performing data synchronization with the third edge node includes:

[0033] receiving missing information of information required to provide service for the terminal sent by the third edge node, so as to provide service for the terminal; or,

[0034] The existing information required for providing services for the terminal is sent to the third edge node, so that the third edge node provides services for the terminal.

[0035] Optionally, after starting the multi-operator data synchronization, the method further includes:

[0036] If the synchronized data is still not used after a preset period of time, then the synchronized data is deleted; and / or,

[0037] If the terminal has left the coverage area of ​​the second edge node, the synchronized data is deleted.

[0038] In a third aspect, the present invention further provides an information transmission method, applied to an electronic device, comprising:

[0039] Determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0040] For each preset edge node, determine the roads covered by the preset edge node according to the roads covered by all the preset base stations under the preset edge node;

[0041] According to the roads covered by each of the preset edge nodes, a corresponding relationship between the edge node coverage area and the roads is established;

[0042] At least part of the correspondence between the edge node coverage area and the road is sent to a target edge node among the preset edge nodes, wherein at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge node adjacent to the target edge node.

[0043] Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road section;

[0044] The determining the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station includes:

[0045] Starting from one end of the road, a dividing point is determined at every preset distance to divide the road into multiple sections;

[0046] Calculating a first distance between each of the demarcation points and a center point of each preset base station coverage area, and comparing the first distance with the radius of the coverage area of ​​the corresponding base station;

[0047] If the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station, determining that the demarcation point is within the coverage area of ​​the corresponding base station;

[0048] If a first demarcation point and a second demarcation point on a road are both within the coverage area of ​​the corresponding base station, then it is determined that the road section between the first demarcation point and the second demarcation point is within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0049] If only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, an intermediate point is determined between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station, and the road section between the intermediate point and the third dividing point is determined to be within the coverage area of ​​the corresponding base station.

[0050] In a fourth aspect, the present invention further provides a first edge node, where the first edge node is an edge node currently accessed by a terminal, including:

[0051] A prediction module, used for predicting a second edge node that the terminal will access next based on the correspondence between the edge node coverage area and the road;

[0052] The first information sending module is used to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when it determines that the second edge node lacks at least part of the information required to provide services for the terminal.

[0053] Optionally, the prediction module includes:

[0054] a road determination unit, configured to determine a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0055] A road prediction unit, configured to predict a road that the terminal will enter according to a moving direction of the terminal on the first road and a road topology structure;

[0056] The edge node prediction unit is used to predict at least one of the second edge nodes according to the correspondence between the road that the terminal will enter and the edge node coverage area and the road.

[0057] Optionally, the road prediction unit is used to predict a road that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology structure;

[0058] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0059] Optionally, the road prediction unit is used to predict the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology structure;

[0060] The edge node prediction unit is used to predict at least one second edge node according to the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0061] In a fifth aspect, the present invention further provides a second edge node, the second edge node being the edge node that the terminal will access next, which is predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node being the edge node that the terminal is currently accessing, and the second edge node comprising:

[0062] A first information receiving module, configured to receive first information sent by the first edge node;

[0063] a determination module, configured to determine, after receiving the first information, whether it lacks at least part of the information required to provide a service for the terminal;

[0064] The synchronization module is used to start multi-operator data synchronization if it is determined to be missing.

[0065] Optionally, both the first edge node and the second edge node belong to a first operator;

[0066] The synchronization module comprises:

[0067] a synchronization node determination unit, configured to determine a third edge node, wherein the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0068] A synchronization unit is configured to perform data synchronization with the third edge node when it is determined that the third edge node can provide the missing information required by the second edge node to provide a service for the terminal.

[0069] Optionally, the synchronization node determination unit is used to determine the third edge node according to the correspondence between the edge node coverage area of ​​the second operator and the road.

[0070] Optionally, the synchronization unit includes:

[0071] A receiving subunit is configured to receive missing information of information required for providing a service to the terminal, which is sent by the third edge node, so as to provide a service to the terminal; or

[0072] The sending subunit is used to send the existing information required to provide services for the terminal to the third edge node, so that the third edge node provides services for the terminal.

[0073] Optionally, the second edge node further includes:

[0074] a first redundant data deleting module, configured to delete the synchronized data if the synchronized data is still not used after a preset period of time; and / or,

[0075] The second redundant data deleting module is configured to delete the synchronized data if the terminal has left the coverage area of ​​the second edge node.

[0076] In a sixth aspect, the present invention further provides an electronic device, comprising:

[0077] A base station coverage determination module, used to determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0078] An edge node coverage determination module, configured to determine, for each preset edge node, roads covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;

[0079] A correspondence establishing module, used to establish a correspondence between an edge node coverage area and a road according to the roads covered by each of the preset edge nodes;

[0080] A correspondence sending module is used to send at least part of the correspondence between the edge node coverage area and the road to a target edge node among the preset edge nodes, wherein at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge node adjacent to the target edge node.

[0081] Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road section;

[0082] The base station coverage determination module includes:

[0083] A road segment division unit is used to determine a dividing point at a preset distance from one end of the road to divide the road into multiple road segments;

[0084] A comparison unit, configured to calculate a first distance between each of the demarcation points and a center point of each preset base station coverage area, and compare the first distance with a radius of a coverage area of ​​a corresponding base station;

[0085] a first coverage determination unit, configured to determine that the demarcation point is within the coverage area of ​​the corresponding base station if the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station;

[0086] A second coverage determination unit is configured to determine that a road section between a first demarcation point and a second demarcation point on a road is within the coverage area of ​​the corresponding base station if both the first demarcation point and the second demarcation point are within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0087] The third coverage determination unit is used to determine an intermediate point between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station if only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, and determine whether the road section between the intermediate point and the third dividing point is within the coverage area of ​​the corresponding base station.

[0088] In a seventh aspect, the present invention further provides a first edge node, the first edge node being the edge node currently accessed by the terminal, comprising: a transceiver and a processor;

[0089] The processor is used to predict a second edge node that the terminal will access next based on the correspondence between the edge node coverage area and the road;

[0090] The transceiver is used to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when it determines that the second edge node lacks at least part of the information required to provide services for the terminal.

[0091] Optionally, the processor is used to determine a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0092] The processor is further configured to predict a road that the terminal will enter based on a moving direction of the terminal on the first road and a road topology structure;

[0093] The processor is further configured to predict at least one of the second edge nodes according to a correspondence between a road that the terminal will enter and a coverage area of ​​the edge node and the road.

[0094] Optionally, the processor is used to predict a road that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology;

[0095] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0096] Optionally, the processor is used to predict the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology;

[0097] The processor is further used to predict at least one second edge node based on the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0098] In an eighth aspect, the present invention further provides a second edge node, the second edge node being the edge node that the terminal will access next, predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node being the edge node that the terminal is currently accessing, and the second edge node comprising: a transceiver and a processor;

[0099] The transceiver is used to receive the first information sent by the first edge node;

[0100] The processor is configured to determine, after receiving the first information, whether the processor lacks at least part of the information required to provide a service for the terminal;

[0101] The transceiver is further configured to start multi-operator data synchronization if it is determined to be missing.

[0102] Optionally, both the first edge node and the second edge node belong to a first operator;

[0103] The processor is configured to determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0104] The transceiver is configured to perform data synchronization with the third edge node when it is determined that the third edge node can provide missing information required by the second edge node to provide a service to the terminal.

[0105] Optionally, the processor is used to determine the third edge node according to the correspondence between the edge node coverage area of ​​the second operator and the road.

[0106] Optionally, the transceiver is used to receive missing information of information required to provide a service to the terminal sent by the third edge node, so as to provide a service to the terminal; or,

[0107] The transceiver is used to send the existing information required to provide a service for the terminal to the third edge node, so that the third edge node provides a service for the terminal.

[0108] Optionally, the processor is further configured to delete the synchronized data if the synchronized data is still not used after a preset period of time; and / or delete the synchronized data if the terminal has left the coverage area of ​​the second edge node.

[0109] In a ninth aspect, the present invention further provides an electronic device, comprising: a transceiver and a processor;

[0110] The processor is used to determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0111] The processor is further configured to determine, for each preset edge node, a road covered by the preset edge node according to the roads covered by all the preset base stations under the preset edge node;

[0112] The processor is further configured to establish a correspondence between an edge node coverage area and a road according to the road covered by each preset edge node;

[0113] The transceiver is used to send at least part of the correspondence between the edge node coverage area and the road to a target edge node among the preset edge nodes, wherein at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge node adjacent to the target edge node.

[0114] Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road section;

[0115] The processor is used to determine a dividing point at every preset distance from one end of the road to divide the road into a plurality of sections;

[0116] The processor is further configured to calculate a first distance between each of the demarcation points and a center point of each preset base station coverage area, and compare the first distance with a radius of a coverage area of ​​a corresponding base station;

[0117] The processor is further configured to determine that the demarcation point is within the coverage area of ​​the corresponding base station if the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station;

[0118] The processor is further configured to determine that a road section between a first demarcation point and a second demarcation point on a road is within the coverage area of ​​the corresponding base station if both the first demarcation point and the second demarcation point are within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0119] The processor is also used to determine an intermediate point between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station if only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, and determine that the road section between the intermediate point and the third dividing point is within the coverage area of ​​the corresponding base station.

[0120] In the tenth aspect, the present invention also provides a first edge node, which is the edge node currently accessed by the terminal, including a memory, a processor, and a program stored in the memory and executable on the processor; when the processor executes the program, it implements any one of the steps in the above-mentioned data synchronization method applied to the first edge node.

[0121] In the eleventh aspect, the present invention also provides a second edge node, including a memory, a processor, and a program stored in the memory and executable on the processor; the second edge node is the next edge node to be connected by the terminal predicted by the first edge node based on the correspondence between the edge node coverage area and the road, the first edge node is the edge node currently connected by the terminal, and when the processor executes the program, it implements any one of the steps in the above-mentioned data synchronization method applied to the second edge node.

[0122] In the twelfth aspect, the present invention also provides an electronic device, comprising a memory, a processor, and a program stored in the memory and executable on the processor; when the processor executes the program, the steps of any one of the above-mentioned information transmission methods applied to the electronic device are implemented.

[0123] In the thirteenth aspect, the present invention also provides a readable storage medium having a program stored thereon, which, when executed by a processor, implements the steps of any of the above-mentioned data synchronization methods applied to a first edge node, or implements the steps of any of the above-mentioned data synchronization methods applied to a second edge node, or implements the steps of any of the above-mentioned information transmission methods applied to an electronic device.

[0124] The beneficial effects of the above technical solution of the present invention are as follows:

[0125] In an embodiment of the present invention, the edge node to which the terminal is currently connected can at least obtain the corresponding relationship between the coverage area and the road of all adjacent edge nodes, so that the next edge node (that is, the second edge node) that the terminal is about to access can be predicted, so that the second edge node can determine in advance whether it lacks the information required to provide services to the terminal. If it is determined to be missing, multi-operator data synchronization can be started in advance, thereby reducing the delay in data synchronization between multiple operators when the second edge node provides services to the terminal, providing corresponding services to the terminal in a timely manner, improving service performance and service quality, and improving user experience and security. BRIEF DESCRIPTION OF THE DRAWINGS

[0126] Figure 1 A schematic diagram of a data synchronization method in Embodiment 1 of the present invention;

[0127] Figure 2 A schematic diagram of an application scenario to which an embodiment of the present invention can be applied;

[0128] Figure 3 A schematic diagram of a next-hop edge node prediction in an embodiment of the present invention;

[0129] Figure 4 A schematic diagram of another next-hop edge node prediction in an embodiment of the present invention;

[0130] Figure 5 A schematic diagram of a data synchronization method in Embodiment 2 of the present invention;

[0131] Figure 6 A schematic diagram of determining edge nodes for multi-operator data synchronization in an embodiment of the present invention;

[0132] Figure 7 This is a flow chart of an information transmission method in Embodiment 3 of the present invention;

[0133] Figure 8 This is a schematic diagram of the structure of a first edge node in Embodiment 4 of the present invention;

[0134] Fig. 9 This is a schematic diagram of the structure of a second edge node in Embodiment 5 of the present invention;

[0135] Fig.10 This is a schematic diagram of the structure of an electronic device in Embodiment 6 of the present invention;

[0136] Fig.11 This is a schematic diagram of the structure of a first edge node in Embodiment 7 of the present invention;

[0137] Fig.12 This is a schematic diagram of the structure of a second edge node in Embodiment 8 of the present invention;

[0138] Fig.13 This is a schematic diagram of the structure of an electronic device in Embodiment 9 of the present invention;

[0139] Fig.14 This is a schematic diagram of the structure of a first edge node in Embodiment 10 of the present invention;

[0140] Fig.15 This is a schematic diagram of the structure of a second edge node in Embodiment 11 of the present invention;

[0141] Fig.16 This is a schematic diagram of the structure of an electronic device in the twelfth embodiment of the present invention. DETAILED DESCRIPTION

[0142] In order to make the purpose, technical solution and advantages of the embodiment of the present invention clearer, the technical solution of the embodiment of the present invention will be clearly and completely described below in conjunction with the drawings of the embodiment of the present invention. Obviously, the described embodiment is a part of the embodiment of the present invention, not all of the embodiments. Based on the described embodiment of the present invention, all other embodiments obtained by ordinary technicians in this field belong to the scope of protection of the present invention.

[0143] See also Figure 1 , Figure 1 A flow chart of a data synchronization method provided in Embodiment 1 of the present invention is provided. The method is applied to a first edge node, where the first edge node is an edge node currently accessed by a terminal. The method includes the following steps:

[0144] Step 11: predicting the second edge node that the terminal will access next based on the correspondence between the edge node coverage area and the road;

[0145] Step 12: Send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when it determines that the second edge node lacks at least part of the information required to provide services for the terminal.

[0146] Among them, the correspondence between the edge node coverage area and the road, specifically, the correspondence between the edge node and the road in its coverage area (or called matching relationship), can be formed into an edge node coverage area and road matching table, which is used to establish a matching relationship between the road and the edge node.

[0147] The correspondence between the edge node coverage area and the road may be the correspondence between the coverage areas of all edge nodes and the roads in a certain area.

[0148] In addition, since edge nodes of different operators are deployed at different locations and the coverage area of ​​a single edge node is different in size and / or shape, the correspondence between the coverage area of ​​edge nodes of different operators and roads may be different.

[0149] The predicted second edge node that the terminal will access (or connect to) next may be more than one, and may be all possible second edge nodes.

[0150] The first information can be specifically used to indicate to the second edge node that the second edge node is the predicted edge node that the terminal is about to enter, and the second information can also be used to indicate to the second edge node the information required to provide services to the terminal, that is, to notify the second edge node of what information is required to provide services to the terminal. When the first information is used to indicate to the second edge node the information required to provide services to the terminal, the first edge node can combine the application subscribed by the terminal to sort out the information required to provide services to the terminal.

[0151] In addition, the first information may also include historical data and authentication information related to the terminal, that is, the first edge node may synchronize the historical data and authentication information related to the terminal to the second edge node.

[0152] If there is more than one second edge node, the first edge node needs to send the first information to each second edge node.

[0153] In an embodiment of the present invention, the edge node currently accessed by the terminal can at least obtain the corresponding relationship between the coverage area and the road of all adjacent edge nodes, so that the next edge node (that is, the second edge node) that the terminal is about to access can be predicted, so that the second edge node can determine in advance whether it lacks the information required to provide services to the terminal. If it is determined to be missing, multi-operator data synchronization can be started in advance, thereby reducing the delay of data synchronization between multiple operators when the second edge node provides services to the terminal, providing corresponding services to the terminal in a timely manner, improving service performance and service quality, and improving user experience and security.

[0154] Figure 2 A schematic diagram of an application scenario to which the embodiment of the present invention can be applied is shown in FIG. Figure 2, the terminal (User Equipment, UE) signs a contract with operator A and receives services provided by operator A. The UE is currently in area Z1, and it is predicted that the UE will soon travel to area Z2; both operator A and operator B have deployed edge platforms in area Z2, and operator A cannot obtain necessary data in area Z2; operator A and operator B have signed a contract, stipulating that when operator A cannot obtain necessary data, it can obtain it through operator B; operator A has a topological map of each edge node of operator B, as well as the data source information available on each edge node.

[0155] At the current time T1, the UE is in area Z1 and connected to the edge node MEN-A1. At the next time T2, the UE is predicted to be in area Z2 and connected to the edge node MEN-A2. In the figure, the edge node MEN-B of operator B is also in area Z2.

[0156] Some edge computing related terms involved in the embodiments of the present invention are explained as follows:

[0157] MEO: MEC Orchestrator, MEC orchestrator, can maintain edge node topology, manage application packages, instantiate resource selection, etc.;

[0158] MEN: MEC Node, edge node;

[0159] MEMN: MEC Management Node, the management node of the edge node, is the upper node of MEN, and stores the subordinate MEN topology map, information collected by subordinate MENs, relevant information of other operators' edge management nodes, key information, etc.;

[0160] MEA: MEC Application, application at edge node;

[0161] MEP: MEC Platform, edge node platform.

[0162] In the embodiment of the present invention, the method steps executed by each edge node (including the first edge node, the second edge node and the third edge node) may be specifically executed by an edge node platform on the corresponding edge node.

[0163] The following example illustrates the above data synchronization method.

[0164] In an embodiment of the present invention, before performing multi-operator data synchronization, it is necessary to predict the road that the UE is about to drive on, and then match the next edge node that the UE is about to connect to. The prediction and matching mechanism requires the edge node platform (also known as the edge computing platform) of the edge node (i.e., the first edge node) that the terminal currently accesses to predict the trajectory of the terminal based on the road topology and the edge node topology map (the edge node topology map of the operator to which the first edge node belongs) and match the next hop edge node, which puts forward new requirements for the edge node platform.

[0165] Optionally, predicting a second edge node to be accessed next by the terminal according to the correspondence between the edge node coverage area and the road includes:

[0166] Determining a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0167] Specifically, the edge node platform of the first edge node can obtain the GPS coordinates of the terminal's current location based on the Basic Safety Message (BSM), and then can use the application programming interface (API) of the map software to reversely analyze the GPS coordinates of the UE to find out the road L (i.e., the first road) where the UE is currently located.

[0168] Predicting a road that the terminal will enter based on the moving direction of the terminal on the first road and the road topology;

[0169] Specifically, the edge node platform of the first edge node can analyze whether there is a road fork ahead of the current location of the terminal based on the driving direction of the terminal and the shape of the road L where the terminal is located. If there is no forked road, the terminal will continue to form on the road L. If there is a fork, the edge node platform of the first edge node analyzes the topological relationship of the road L where the terminal is located based on the road topology structure. In the driving direction of the terminal, other roads connected to the current road L can be obtained. Assuming that the set of these roads is M, the set is the set of roads that the terminal may travel on later.

[0170] At least one second edge node is predicted based on the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road.

[0171] Specifically, if there is no road fork ahead of the current position of the terminal, the next edge node to which the terminal will connect is determined based on the correspondence between the edge node coverage area and the road. If there is a road fork ahead of the current position of the terminal, the edge nodes corresponding to each road (these edge nodes belong to the same operator as the edge node currently connected by the terminal) are analyzed based on the road set M and the correspondence between the edge node coverage area and the road, and it is assumed that the corresponding edge node set is P. For the terminal, when it leaves the coverage range of the first edge node, it is possible to enter the coverage area of ​​any edge node in P.

[0172] The road that the terminal will enter includes the first road and / or the second road, and the second road is a road intersecting with the first road.

[0173] For example, see Figure 3 Based on BSM messages and map API, the inverse analysis shows that the terminal is currently located on road L, which is within the coverage of MEP-A1. Based on the road topology and the terminal's driving direction, the predicted range that the terminal may enter in the future is the road set M = {L2, L3, L4}, and the corresponding edge node set P = {MEP-A2, MEP-A 3, MEP-A 4}.

[0174] In some optional specific implementations, the edge node platform of the first edge node may initiate a prediction and matching process of a next-hop edge node when detecting that the terminal is about to leave its coverage area.

[0175] Optionally, predicting the road that the terminal will enter according to the moving direction of the terminal on the first road and the road topology structure includes:

[0176] Predicting a road that the terminal will enter within a preset area according to the moving direction of the terminal on the first road and the road topology;

[0177] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0178] In the embodiment of the present invention, the next hop edge node needs to be predicted, so it is sufficient to predict the possible roads in a certain area ahead of the terminal. For example, if the diameter of the area covered by a single edge node is within 1 km, it is possible to find out whether there is a fork in the road L within 1 km ahead of the current location of the UE.

[0179] Optionally, predicting the road that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology structure includes:

[0180] Predicting the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology;

[0181] The predicting and obtaining at least one second edge node according to the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road includes:

[0182] At least one second edge node is predicted based on the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0183] Since a single edge node may not cover the entirety of a road, in other words, a road may be covered by multiple different edge nodes. Therefore, in order to accurately predict the next-hop edge node, in an embodiment of the present invention, the road and its section that the terminal will enter in a certain area are predicted, and then the second edge node is predicted based on the correspondence between the edge node coverage area and the road section.

[0184] For example, see Figure 4 Based on the BSM message and map API, the inverse analysis shows that the terminal is currently located on road L, which is within the coverage of MEP-A1. Based on the road topology and the driving direction of the terminal, it is predicted that the range that the terminal may enter in the future is the road set M = {L2, L3, L4}. However, within 1KM (the radius of the coverage area of ​​a single edge node) from the current location of the terminal, the sections of each road that the terminal may enter are all within the coverage of edge node MEP-A2, so it can be determined that the edge node that the terminal is about to access is edge node MEP-A2.

[0185] In the embodiment of the present invention, the correspondence between the edge node coverage area and the road can be obtained according to the following method:

[0186] Starting from one end of the road, a dividing point is determined at every preset distance to divide the road into multiple sections;

[0187] Calculating a first distance between each of the demarcation points and a center point of each preset base station coverage area, and comparing the first distance with the radius of the coverage area of ​​the corresponding base station;

[0188] If the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station, determining that the demarcation point is within the coverage area of ​​the corresponding base station;

[0189] If a first demarcation point and a second demarcation point on a road are both within the coverage area of ​​the corresponding base station, then it is determined that the road section between the first demarcation point and the second demarcation point is within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0190] If only the third demarcation point among the third demarcation point and the fourth demarcation point on a road is within the coverage area of ​​the corresponding base station, a middle point is determined between the third demarcation point and the fourth demarcation point according to the radius of the coverage area of ​​the corresponding base station, and the road section between the middle point and the third demarcation point is determined to be within the coverage area of ​​the corresponding base station;

[0191] According to the correspondence between the base station and the edge node, the correspondence between the edge node coverage area and the road is determined.

[0192] This application does not require any modification to terminal devices, networks, etc. It only requires building an edge node coverage area and road matching table on the edge computing platform, and then using the next-hop edge node prediction mechanism based on the road topology relationship to analyze which edge node of other operators needs to obtain data from. Finally, authentication is performed, the relevant historical data on the edge node is synchronized first, and redundant data is deleted, so as to further reduce the data synchronization delay of multiple operators and improve service performance.

[0193] See also Figure 5 , Figure 5 : is a flow chart of a data synchronization method provided in Embodiment 2 of the present invention, the method is applied to a second edge node, the second edge node is the edge node to be accessed by the terminal next predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node is the edge node currently accessed by the terminal, and the method comprises the following steps:

[0194] Step 51: receiving first information sent by the first edge node;

[0195] Specifically, the first information is sent to the second edge node after the first edge node predicts that the second edge node is the next edge node to be accessed by the terminal according to the correspondence between the edge node coverage area and the road;

[0196] Step 52: after receiving the first information, determining whether the device itself lacks at least part of the information required to provide services for the terminal;

[0197] Step 53: If it is determined to be missing, multi-operator data synchronization is initiated.

[0198] Specifically, after the second edge node receives the first information, if the first information indicates what information is needed to provide services to the terminal, the second edge node will compare its own data situation to analyze whether it has full data. If it has full data, there is no need to synchronize data between multiple operators. If some data is missing, the multi-operator data synchronization process is started.

[0199] Among them, regarding the first information, please refer to the above method embodiment for details, which will not be repeated here.

[0200] In addition, there may be multiple second edge nodes. After receiving the first information, each second edge node needs to determine whether it has all the data required to provide services to the terminal. If there is data missing, multi-operator data synchronization is initiated.

[0201] In an embodiment of the present invention, the edge node to which the terminal is currently connected can at least obtain the corresponding relationship between the coverage area and the road of all adjacent edge nodes, so that the next edge node (that is, the second edge node) that the terminal is about to access can be predicted, so that the second edge node can determine in advance whether it lacks the information required to provide services to the terminal. If it is determined to be missing, multi-operator data synchronization can be started in advance, thereby reducing the delay in data synchronization between multiple operators when the second edge node provides services to the terminal, providing corresponding services to the terminal in a timely manner, improving service performance and service quality, and improving user experience and security.

[0202] Optionally, both the first edge node and the second edge node belong to a first operator;

[0203] The starting of multi-operator data synchronization includes:

[0204] Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0205] In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

[0206] Optionally, determining the third edge node includes:

[0207] The third edge node is determined according to the correspondence between the edge node coverage area of ​​the second operator and the road.

[0208] For example, see Figure 2 and Figure 6, it is known that the edge node MEP-A2 of operator A covers the predicted area Z2 that the terminal is about to enter and the roads in the area. Operator A lacks some data D in area Z2, and the multi-operator data synchronization process is started. The second edge node of operator A can find out the coverage of operator B in the area based on the correspondence between the edge node coverage area and the road of operator B, such as Figure 6 As shown by the dotted line in FIG, operator B has two edge nodes in area Z2, namely MEP-B1 and MEP-B2.

[0209] The second edge node of operator A analyzes whether MEP-B1 and MEP-B2 can provide data D based on the data of each edge node of operator B obtained at the time of signing. If both MEP-B1 and MEP-B2 can provide data D, MEP-A2 sends the data request to MEO-B of operator B, and MEO-B initiates the authentication process for MEP-A2. After the authentication is passed, historical data synchronization is performed between MEP-A2 and MEP-B1 and MEP-B2.

[0210] Optionally, the performing data synchronization with the third edge node includes:

[0211] receiving missing information of information required to provide service for the terminal sent by the third edge node, so as to provide service for the terminal; or,

[0212] The existing information required for providing services for the terminal is sent to the third edge node, so that the third edge node provides services for the terminal.

[0213] When synchronizing data between multiple operators, although the UE belongs to the contracted vehicle of operator A, if the UE obtains the key of RSU-B, it can also obtain the services provided by operator B through RSU, that is, both operator A and operator B can serve as the service subject of UE.

[0214] The entity that provides services to UE and the corresponding scenarios determine the direction of historical data synchronization between operators A and B:

[0215] a.UE receives service from operator A in area Z2

[0216] In this service mode, MEP-B needs to synchronize the missing historical data of MEP-A2 to MEP-A2, and the traffic environment data in the synchronization area is mainly synchronized.

[0217] For example, in the road traffic flow prediction scenario, MEP-B needs to synchronize historical traffic accident information and average road speed information in the area to MEP-A. MEP-A makes predictions based on historical data.

[0218] b.UE receives service from MEP-B in zone Z2

[0219] In this service mode, MEP-A1 needs to synchronize the historical data related to the UE to MEP-B in advance, and MEP-B provides services to the UE based on the historical data of the UE.

[0220] For example, for vehicle trajectory prediction services, MEP-A needs to synchronize the historical trajectory information of the UE to MEP-B. MEP-B can provide the corresponding trajectory prediction service for the UE based on the historical driving trajectory data of the vehicle.

[0221] In addition, if MEP-B1 and MEP-B2 cannot provide the missing data of MEP-A1, operator A needs to obtain the data through other channels, such as obtaining it through other contracted operators or obtaining data from a high-level platform.

[0222] Optionally, after starting the multi-operator data synchronization, the method further includes:

[0223] If the synchronized data is still not used after a preset period of time, then the synchronized data is deleted; and / or,

[0224] If the terminal has left the coverage area of ​​the second edge node, the synchronized data is deleted.

[0225] The synchronized data may include data sent by the third edge node, that is, data obtained by starting multi-operator data synchronization, and may also include historical data and authentication information related to the terminal synchronized by the first edge node.

[0226] In the above process, in order to reduce the delay of data synchronization and improve the accuracy of the prediction of the next-hop edge node of the UE, each edge node in the edge node set P obtains the UE-related historical data provided by MEP-A1; however, in practice, the UE may only connect to one of the edge nodes, and the data on the other edge nodes becomes redundant data. Therefore, a redundant data identification and deletion mechanism is set on each edge node.

[0227] Assuming that the time when MEP-A1 synchronizes data to each edge node in set P is T1, then within 1 hour from time T1, if the data synchronized from the edge nodes in set P are not used, these data are identified as redundant data and deleted.

[0228] The embodiment of the present invention provides a technical solution corresponding to the above-mentioned embodiment 1, having the same inventive concept, and can achieve the same technical effect. For details, please refer to the above-mentioned embodiment 1, which will not be repeated here.

[0229] See also Figure 7, Figure 7 1 is a flow chart of an information transmission method provided in Embodiment 3 of the present invention. The method is applied to an electronic device and comprises the following steps:

[0230] Step 71: Determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0231] Step 72: for each preset edge node, determine the roads covered by the preset edge node according to the roads covered by all the preset base stations under the preset edge node;

[0232] Step 73: establishing a correspondence between an edge node coverage area and a road according to each road covered by the preset edge node;

[0233] Step 74: Send at least part of the correspondence between the edge node coverage area and the road to a target edge node among the preset edge nodes, wherein at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge nodes adjacent to the target edge node.

[0234] Among them, the target edge node predicts the next-hop edge node for the terminal that has connected to the target edge node and is about to leave the target edge node based on at least part of the correspondence between the edge node coverage area and the road, and sends first information to the next-hop edge node, so that the next-hop edge node can determine in advance whether the information required to provide services to the terminal is missing, and if missing, start multi-operator data synchronization in advance.

[0235] Each edge node has a certain coverage area. For edge nodes located in the operator network, the coverage area of ​​the edge node is the coverage area of ​​the base station below it. However, in actual use, since the coverage area of ​​a single edge node is irregular and cannot be accurately described, it brings a lot of difficulties to the actual use, and there is currently no corresponding solution to match edge nodes with roads. Therefore, this application proposes to design a matching table of edge node coverage areas and roads, correspond specific road sections to each edge node, and apply it in subsequent edge node matching related work.

[0236] Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road section;

[0237] The determining the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station includes:

[0238] Starting from one end of the road, a dividing point is determined at every preset distance to divide the road into multiple sections;

[0239] Calculating a first distance between each of the demarcation points and a center point of each preset base station coverage area, and comparing the first distance with the radius of the coverage area of ​​the corresponding base station;

[0240] Since the coverage shape of each base station is a hexagon, it can be approximated as a circle in the embodiment of the present invention.

[0241] If the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station, determining that the demarcation point is within the coverage area of ​​the corresponding base station;

[0242] If a first demarcation point and a second demarcation point on a road are both within the coverage area of ​​the corresponding base station, then it is determined that the road section between the first demarcation point and the second demarcation point is within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0243] If only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, an intermediate point is determined between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station, and the road section between the intermediate point and the third dividing point is determined to be within the coverage area of ​​the corresponding base station.

[0244] In the embodiment of the present invention, the edge node currently accessed by the terminal (i.e., the target edge node) can at least obtain the corresponding relationship between the coverage area and the road of all adjacent edge nodes, so as to predict the next-hop edge node that the terminal is about to access, so that the next-hop edge node can determine in advance whether it lacks the information required to provide services to the terminal. If it is determined to be missing, multi-operator data synchronization can be started in advance, thereby reducing the delay of data synchronization between multiple operators when the next-hop edge node provides services to the terminal, providing corresponding services to the terminal in a timely manner, improving service performance and service quality, and improving user experience and security.

[0245] For example, the coordinates of each base station are the center point of its coverage area. The GPS coordinates (Gx, Gy) of the center point G of the base station coverage area are known, and the radius r of the base station coverage area is known.

[0246] First, divide the road into sections: starting from the starting point of the road, take a dividing point at a certain distance to divide the road into small sections. Number the dividing points of each road in sequence, assuming that the coordinates of the road dividing points are R0(R0x, R0y), R1(R1x, R1y)…Rn(Rnx, Rny);

[0247] Then, the road demarcation points are matched to the coverage of the base station: the distance between the coordinates of each demarcation point of the road section and the center point of each base station is calculated and compared with the radius r.

[0248] If the distance If it is smaller than the radius r, it means that the demarcation point is within the coverage range of the base station, otherwise it is not within the coverage range.

[0249] By comparing the distance d between all road demarcation points and the center point of the base station with the base station coverage radius r, all road demarcation points can be matched to the coverage range of all base stations.

[0250] Finally, match the road sections with base stations and edge nodes: For each base station, all road demarcation points within its range have been found. Sort the demarcation points in order of numbers. For adjacent numbers, it means that the road sections are all within the range of the base station. For individual numbers, it means that part of this road section is within the range of the base station and part is within the range of the adjacent base station. At this time, it is necessary to insert an intermediate point between the two demarcation points of the road, that is, based on the center point of the base station, draw a circle with a radius of r, and the intersection with the road is the intermediate point. In this way, the road sections within the range of the base station are determined, the matching of road sections and base stations is completed, and a matching table of road sections and base stations is formed.

[0251] Furthermore, since the correspondence between base stations and edge nodes is known, the road sections and edge nodes can be matched to form a correspondence table between road sections, base stations and edge nodes. An example of the table is as follows:

[0252]

[0253] By querying the table, it can be known that road sections R0 and R1 are within the coverage of base station C1, road section R2 is within the coverage of base station C2, and road sections R0, R1 and R2 are all within the coverage of edge node M1.

[0254] See also Figure 8 , Figure 8 1 is a schematic diagram of the structure of a first edge node provided in Embodiment 4 of the present invention. The first edge node is an edge node currently accessed by a terminal. The first edge node 80 includes:

[0255] A prediction module 81, configured to predict a second edge node that the terminal will access next based on a correspondence between an edge node coverage area and a road;

[0256] The first information sending module 82 is used to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when it determines that it lacks at least part of the information required to provide services for the terminal.

[0257] Optionally, the prediction module 81 includes:

[0258] a road determination unit, configured to determine a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0259] A road prediction unit, configured to predict a road that the terminal will enter according to a moving direction of the terminal on the first road and a road topology structure;

[0260] The edge node prediction unit is used to predict at least one of the second edge nodes according to the correspondence between the road that the terminal will enter and the edge node coverage area and the road.

[0261] Optionally, the road prediction unit is used to predict a road that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology structure;

[0262] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0263] Optionally, the road prediction unit is used to predict the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology structure;

[0264] The edge node prediction unit is used to predict at least one second edge node according to the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0265] The embodiment of the present invention is a product embodiment corresponding to the above-mentioned method embodiment 1, so it will not be described in detail here. Please refer to the above-mentioned embodiment 1 for details.

[0266] See also Fig. 9 , Fig. 9 : is a schematic diagram of the structure of a second edge node provided in Embodiment 5 of the present invention, wherein the second edge node is the edge node that the terminal will access next, which is predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node is the edge node that the terminal is currently accessing, and the second edge node 90 includes:

[0267] A first information receiving module 91, configured to receive first information sent by the first edge node;

[0268] A determination module 92, configured to determine, after receiving the first information, whether it lacks at least part of the information required to provide a service to the terminal;

[0269] The synchronization module 93 is used to start multi-operator data synchronization if it is determined to be missing.

[0270] Optionally, both the first edge node and the second edge node belong to a first operator;

[0271] The synchronization module 93 includes:

[0272] a synchronization node determination unit, configured to determine a third edge node, wherein the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0273] A synchronization unit is configured to perform data synchronization with the third edge node when it is determined that the third edge node can provide the missing information required by the second edge node to provide a service for the terminal.

[0274] Optionally, the synchronization node determination unit is used to determine the third edge node according to the correspondence between the edge node coverage area of ​​the second operator and the road.

[0275] Optionally, the synchronization unit includes:

[0276] A receiving subunit is configured to receive missing information of information required for providing a service to the terminal, which is sent by the third edge node, so as to provide a service to the terminal; or

[0277] The sending subunit is used to send the existing information required to provide services for the terminal to the third edge node, so that the third edge node provides services for the terminal.

[0278] Optionally, the second edge node 90 further includes:

[0279] a first redundant data deleting module, configured to delete the synchronized data if the synchronized data is still not used after a preset period of time; and / or,

[0280] The second redundant data deleting module is configured to delete the synchronized data if the terminal has left the coverage area of ​​the second edge node.

[0281] The embodiment of the present invention is a product embodiment corresponding to the above-mentioned method embodiment 2, so it will not be described in detail here. Please refer to the above-mentioned embodiment 2 for details.

[0282] See also Fig.10 , Fig.101 is a schematic diagram of the structure of an electronic device provided in Embodiment 6 of the present invention, wherein the electronic device 100 includes:

[0283] The base station coverage determination module 101 is used to determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0284] The edge node coverage determination module 102 is used to determine, for each preset edge node, the roads covered by the preset edge node according to the roads covered by all the preset base stations under the preset edge node;

[0285] A correspondence establishing module 103, configured to establish a correspondence between an edge node coverage area and a road according to the road covered by each of the preset edge nodes;

[0286] The correspondence sending module 104 is used to send at least part of the correspondence between the edge node coverage area and the road to the target edge node among the preset edge nodes, and at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge node adjacent to the target edge node.

[0287] Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road section;

[0288] The base station coverage determination module 101 includes:

[0289] A road segment division unit is used to determine a dividing point at a preset distance from one end of the road to divide the road into multiple road segments;

[0290] A comparison unit, configured to calculate a first distance between each of the demarcation points and a center point of each preset base station coverage area, and compare the first distance with a radius of a coverage area of ​​a corresponding base station;

[0291] a first coverage determination unit, configured to determine that the demarcation point is within the coverage area of ​​the corresponding base station if the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station;

[0292] A second coverage determination unit is configured to determine that a road section between a first demarcation point and a second demarcation point on a road is within the coverage area of ​​the corresponding base station if both the first demarcation point and the second demarcation point are within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0293] The third coverage determination unit is used to determine an intermediate point between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station if only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, and determine whether the road section between the intermediate point and the third dividing point is within the coverage area of ​​the corresponding base station.

[0294] The embodiment of the present invention is a product embodiment corresponding to the above-mentioned method embodiment 3, so it will not be described here in detail. Please refer to the above-mentioned embodiment 3 for details.

[0295] See also Fig.11 , Fig.11 1 is a schematic diagram of the structure of a first edge node provided in Embodiment 7 of the present invention, wherein the first edge node is an edge node currently accessed by a terminal, and the first edge node 110 includes: a transceiver 111 and a processor 112;

[0296] The processor 112 is configured to predict a second edge node that the terminal will access next based on a correspondence between an edge node coverage area and a road;

[0297] The transceiver 111 is configured to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when determining that the second edge node lacks at least part of the information required to provide services for the terminal.

[0298] Optionally, the processor 112 is configured to determine a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0299] The processor 112 is further configured to predict a road that the terminal will enter based on the moving direction of the terminal on the first road and the road topology;

[0300] The processor 112 is further configured to predict at least one second edge node according to a correspondence between a road that the terminal will enter and a coverage area of ​​the edge node and the road.

[0301] Optionally, the processor 112 is configured to predict a road that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology;

[0302] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0303] Optionally, the processor 112 is configured to predict a road and a road section that the terminal will enter in a preset area according to a moving direction of the terminal on the first road and a road topology structure;

[0304] The processor 112 is further configured to predict at least one second edge node based on the road and road section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0305] The embodiment of the present invention is a product embodiment corresponding to the above-mentioned method embodiment 1, so it will not be described in detail here. Please refer to the above-mentioned embodiment 1 for details.

[0306] See also Fig.12 , Fig.12 1 is a schematic diagram of the structure of a second edge node provided in Embodiment 8 of the present invention, wherein the second edge node is an edge node that the terminal will access next, which is predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node is the edge node that the terminal currently accesses, and the second edge node 120 includes: a transceiver 121 and a processor 122;

[0307] The transceiver 121 is used to receive the first information sent by the first edge node;

[0308] The processor 122 is configured to determine, after receiving the first information, whether it lacks at least part of the information required to provide a service for the terminal;

[0309] The transceiver 121 is further configured to start multi-operator data synchronization if it is determined to be missing.

[0310] Optionally, both the first edge node and the second edge node belong to a first operator;

[0311] The processor 122 is configured to determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0312] The transceiver 121 is configured to perform data synchronization with the third edge node when it is determined that the third edge node can provide missing information required by the second edge node to provide a service for the terminal.

[0313] Optionally, the processor 122 is configured to determine the third edge node according to a correspondence between an edge node coverage area of ​​the second operator and a road.

[0314] Optionally, the transceiver 121 is used to receive missing information of information required to provide a service to the terminal sent by the third edge node, so as to provide a service to the terminal; or,

[0315] The transceiver 121 is used to send the existing information required to provide services for the terminal to the third edge node, so that the third edge node can provide services for the terminal.

[0316] Optionally, the processor 122 is further configured to delete the synchronized data if the synchronized data is still not used after a preset period of time; and / or delete the synchronized data if the terminal has left the coverage area of ​​the second edge node.

[0317] The embodiment of the present invention is a product embodiment corresponding to the above-mentioned method embodiment 2, so it will not be described in detail here. Please refer to the above-mentioned embodiment 2 for details.

[0318] See also Fig.13 , Fig.13 is a structural diagram of an electronic device provided by Embodiment 9 of the present invention, wherein the electronic device 130 includes: a transceiver 131 and a processor 132;

[0319] The processor 132 is used to determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0320] The processor 132 is further configured to determine, for each preset edge node, a road covered by the preset edge node according to the roads covered by all the preset base stations under the preset edge node;

[0321] The processor 132 is further configured to establish a correspondence between an edge node coverage area and a road according to the road covered by each preset edge node;

[0322] The transceiver 131 is used to send at least part of the correspondence between the edge node coverage area and the road to a target edge node among the preset edge nodes, wherein at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge node adjacent to the target edge node.

[0323] Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road section;

[0324] The processor 132 is used to determine a dividing point at a preset distance from one end of the road to divide the road into a plurality of sections;

[0325] The processor 132 is further configured to calculate a first distance between each of the demarcation points and a center point of each preset base station coverage area, and compare the first distance with a radius of a coverage area of ​​the corresponding base station;

[0326] The processor 132 is further configured to determine that the demarcation point is within the coverage area of ​​the corresponding base station if the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station;

[0327] The processor 132 is further configured to determine that a road section between the first demarcation point and the second demarcation point is within the coverage area of ​​the corresponding base station if both the first demarcation point and the second demarcation point on a road are within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0328] The processor 132 is also used to determine an intermediate point between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station if only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, and determine whether the road section between the intermediate point and the third dividing point is within the coverage area of ​​the corresponding base station.

[0329] The embodiment of the present invention is a product embodiment corresponding to the above-mentioned method embodiment 3, so it will not be described here in detail. Please refer to the above-mentioned embodiment 3 for details.

[0330] See also Fig.14 , Fig.14 1 is a schematic diagram of the structure of a first edge node provided in Embodiment 10 of the present invention. The first edge node is an edge node currently accessed by a terminal. The first edge node 140 of the terminal includes a processor 141, a memory 142, and a program stored in the memory 142 and executable on the processor 141. When the processor 141 executes the program, the following steps are implemented:

[0331] Predicting a second edge node that the terminal will access next based on a correspondence between an edge node coverage area and a road;

[0332] The first information is sent to the second edge node, so that the second edge node starts multi-operator data synchronization when it is determined that the second edge node lacks at least part of the information required to provide services for the terminal.

[0333] Optionally, the processor 141 may further implement the following steps when executing the program:

[0334] The predicting, based on the correspondence between the edge node coverage area and the road, a second edge node to be accessed next by the terminal includes:

[0335] Determining a first road where the terminal is currently located according to the first location where the terminal is currently located;

[0336] Predicting a road that the terminal will enter based on the moving direction of the terminal on the first road and the road topology;

[0337] At least one second edge node is predicted based on the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road.

[0338] Optionally, the processor 141 may further implement the following steps when executing the program:

[0339] The predicting, based on the moving direction of the terminal on the first road and the road topology, the road that the terminal will enter comprises:

[0340] Predicting a road that the terminal will enter within a preset area according to the moving direction of the terminal on the first road and the road topology;

[0341] The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

[0342] Optionally, the processor 141 may further implement the following steps when executing the program:

[0343] The predicting, based on the moving direction of the terminal on the first road and the road topology, of a road that the terminal will enter within a preset area comprises:

[0344] Predicting the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology;

[0345] The predicting and obtaining at least one second edge node according to the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road includes:

[0346] At least one second edge node is predicted based on the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

[0347] The specific working process of the embodiment of the present invention is consistent with that in the above method embodiment 1, so it will not be repeated here. Please refer to the description of the method steps in the above method embodiment 1 for details.

[0348] See also Fig.15 , Fig.151 is a schematic diagram of the structure of a second edge node provided in the eleventh embodiment of the present invention. The second edge node 150 includes a processor 151, a memory 152, and a program stored in the memory 152 and executable on the processor 151; the second edge node is the next edge node to be accessed by the terminal predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node is the edge node currently accessed by the terminal, and the processor 151 implements the following steps when executing the program:

[0349] receiving first information sent by the first edge node;

[0350] After receiving the first information, determining whether the device itself lacks at least part of the information required to provide services for the terminal;

[0351] If it is determined to be missing, start multi-operator data synchronization.

[0352] Optionally, both the first edge node and the second edge node belong to a first operator;

[0353] When the processor 151 executes the program, the following steps may also be implemented:

[0354] The starting of multi-operator data synchronization includes:

[0355] Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node;

[0356] In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

[0357] Optionally, the processor 151 may further implement the following steps when executing the program:

[0358] The determining of the third edge node includes:

[0359] The third edge node is determined according to the correspondence between the edge node coverage area of ​​the second operator and the road.

[0360] Optionally, the processor 151 may further implement the following steps when executing the program:

[0361] The performing data synchronization with the third edge node includes:

[0362] receiving missing information of information required to provide service for the terminal sent by the third edge node, so as to provide service for the terminal; or,

[0363] The existing information required for providing services for the terminal is sent to the third edge node, so that the third edge node provides services for the terminal.

[0364] Optionally, the processor 151 may further implement the following steps when executing the program:

[0365] After starting the multi-operator data synchronization, the method further includes:

[0366] If the synchronized data is still not used after a preset period of time, then the synchronized data is deleted; and / or,

[0367] If the terminal has left the coverage area of ​​the second edge node, the synchronized data is deleted.

[0368] The specific working process of the embodiment of the present invention is consistent with that in the above method embodiment 2, so it will not be repeated here. Please refer to the description of the method steps in the above method embodiment 2 for details.

[0369] See also Fig.16 , Fig.16 1 is a schematic diagram of the structure of an electronic device provided in Embodiment 12 of the present invention. The electronic device 160 includes a processor 161, a memory 162, and a program stored in the memory 162 and executable on the processor 161; when the processor 161 executes the program, the following steps are implemented:

[0370] Determine the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station;

[0371] For each preset edge node, determine the roads covered by the preset edge node according to the roads covered by all the preset base stations under the preset edge node;

[0372] According to the roads covered by each of the preset edge nodes, a corresponding relationship between the edge node coverage area and the roads is established;

[0373] At least part of the correspondence between the edge node coverage area and the road is sent to a target edge node among the preset edge nodes, wherein at least part of the correspondence between the edge node coverage area and the road includes the correspondence between the coverage area and the road of the preset edge node adjacent to the target edge node.

[0374] Optionally, the processor 161 may further implement the following steps when executing the program:

[0375] The correspondence between the edge node coverage area and the road includes the correspondence between the edge node coverage area and the road section;

[0376] The determining the road covered by each preset base station according to the distance between the road and the preset base station and the radius of the coverage area of ​​the preset base station includes:

[0377] Starting from one end of the road, a dividing point is determined at every preset distance to divide the road into multiple sections;

[0378] Calculating a first distance between each of the demarcation points and a center point of each preset base station coverage area, and comparing the first distance with the radius of the coverage area of ​​the corresponding base station;

[0379] If the first distance is less than or equal to the radius of the coverage area of ​​the corresponding base station, determining that the demarcation point is within the coverage area of ​​the corresponding base station;

[0380] If a first demarcation point and a second demarcation point on a road are both within the coverage area of ​​the corresponding base station, then it is determined that the road section between the first demarcation point and the second demarcation point is within the coverage area of ​​the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;

[0381] If only the third dividing point among the third dividing point and the fourth dividing point on a road is within the coverage area of ​​the corresponding base station, an intermediate point is determined between the third dividing point and the fourth dividing point according to the radius of the coverage area of ​​the corresponding base station, and the road section between the intermediate point and the third dividing point is determined to be within the coverage area of ​​the corresponding base station.

[0382] The specific working process of the embodiment of the present invention is consistent with that in the above method embodiment 2, so it will not be repeated here. Please refer to the description of the method steps in the above method embodiment 2 for details.

[0383] Embodiment 13 of the present invention provides a readable storage medium on which a program is stored. When the program is executed by a processor, the program implements the steps of any one of the data synchronization methods in Embodiment 1 or any one of the data synchronization methods in Embodiment 2 or any one of the information transmission methods in Embodiment 3. For details, please refer to the description of the method steps in the corresponding embodiments above.

[0384] The terminal in the embodiment of the present invention can be a wireless terminal or a wired terminal. The wireless terminal can be a device that provides voice and / or other service data connectivity to users, a handheld device with wireless connection function, or other processing devices connected to a wireless modem. The wireless terminal can communicate with one or more core networks via a radio access network (Radio Access Network, referred to as RAN). The wireless terminal can be a mobile terminal, such as a mobile phone (or "cellular" phone) and a computer with a mobile terminal, for example, a portable, pocket-sized, handheld, computer-built-in or vehicle-mounted mobile device, which exchanges language and / or data with the radio access network. For example, personal communication service (Personal Communication Service, referred to as PCS) phone, cordless phone, Session Initiation Protocol (Session Initiation Protocol, referred to as SIP) phone, wireless local loop (Wireless Local Loop, referred to as WLL) station, personal digital assistant (Personal Digital Assistant, referred to as PDA) and other devices. A wireless terminal may also be referred to as a system, a subscriber unit (Subscriber Unit), a subscriber station (Subscriber Station), a mobile station (MobileStation), a mobile station (Mobile), a remote station (Remote Station), a remote terminal (Remote Terminal), an access terminal (Access Terminal), a user terminal (User Terminal), a user agent (User Agent), a terminal (User Device or User Equipment), without limitation herein.

[0385] The above-mentioned readable storage medium includes computer-readable storage medium. Computer-readable storage media include permanent and non-permanent, removable and non-removable media that can implement information storage by any method or technology. The information can be computer-readable instructions, data structures, program modules or other data. Examples of storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device.

[0386] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A data synchronization method, applied to a first edge node, the first edge node is the edge node currently accessed by a terminal, characterized in that: The method comprises: Predicting a second edge node that the terminal will access next based on a correspondence between an edge node coverage area and a road; Sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization when determining that the second edge node lacks at least part of the information required to provide services for the terminal; The first edge node and the second edge node both belong to a first operator; The starting of multi-operator data synchronization includes: Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node; In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

2. The method according to claim 1, characterized in that The predicting, based on the correspondence between the edge node coverage area and the road, a second edge node to be accessed next by the terminal includes: Determining a first road where the terminal is currently located according to the first location where the terminal is currently located; Predicting a road that the terminal will enter based on the moving direction of the terminal on the first road and the road topology; At least one second edge node is predicted based on the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road.

3. The method according to claim 2, characterized in that The predicting, based on the moving direction of the terminal on the first road and the road topology, the road that the terminal will enter comprises: Predicting a road that the terminal will enter within a preset area according to the moving direction of the terminal on the first road and the road topology; The distance between any position in the preset area and the first position is less than or equal to a preset value, and the preset value is determined according to the size of the coverage area of ​​a single edge node.

4. The method according to claim 3, characterized in that The predicting, based on the moving direction of the terminal on the first road and the road topology, of a road that the terminal will enter within a preset area comprises: Predicting the road and road section that the terminal will enter in a preset area according to the moving direction of the terminal on the first road and the road topology; The predicting and obtaining at least one second edge node according to the correspondence between the road that the terminal will enter and the coverage area of ​​the edge node and the road includes: At least one second edge node is predicted based on the road and its section that the terminal will enter and the correspondence between the edge node coverage area and the road; the correspondence includes the correspondence between the edge node coverage area and the road section.

5. A data synchronization method, applied to a second edge node, characterized in that: The second edge node is an edge node that the terminal will access next, which is predicted by the first edge node according to the correspondence between the edge node coverage area and the road, and the first edge node is an edge node that the terminal is currently accessing. The method includes: Receiving first information sent by the first edge node; After receiving the first information, determining whether the terminal lacks at least part of the information required to provide services for the terminal; If it is determined to be missing, start multi-operator data synchronization; The first edge node and the second edge node both belong to a first operator; The starting of multi-operator data synchronization includes: Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node; In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

6. The method according to claim 5, characterized in that The determining of the third edge node includes: The third edge node is determined according to the correspondence between the edge node coverage area of ​​the second operator and the road.

7. The method according to claim 5, characterized in that The performing data synchronization with the third edge node includes: receiving missing information of information required to provide service for the terminal sent by the third edge node, so as to provide service for the terminal; or, The existing information required for providing services for the terminal is sent to the third edge node, so that the third edge node provides services for the terminal.

8. The method according to claim 5, characterized in that After starting the multi-operator data synchronization, the method further includes: If the synchronized data is still not used after a preset period of time, then the synchronized data is deleted; and / or, If the terminal has left the coverage area of ​​the second edge node, the synchronized data is deleted.

9. A first edge node, the first edge node being the edge node currently accessed by a terminal, characterized in that: include: A prediction module, used for predicting a second edge node that the terminal will access next based on the correspondence between the edge node coverage area and the road; A first information sending module, configured to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when determining that the second edge node lacks at least part of the information required to provide services for the terminal; The first edge node and the second edge node both belong to a first operator; The starting of multi-operator data synchronization includes: Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node; In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

10. A second edge node, characterized in that: The second edge node is an edge node that the terminal will access next, which is predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node is the edge node that the terminal is currently accessing, and the second edge node includes: A first information receiving module, configured to receive first information sent by the first edge node; a determination module, configured to determine, after receiving the first information, whether it lacks at least part of the information required to provide a service for the terminal; A synchronization module, used to start multi-operator data synchronization if it is determined to be missing; The first edge node and the second edge node both belong to a first operator; The starting of multi-operator data synchronization includes: Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node; In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

11. A first edge node, the first edge node being the edge node currently accessed by a terminal, characterized in that: include: transceivers and processors; The processor is used to predict a second edge node that the terminal will access next based on the correspondence between the edge node coverage area and the road; The transceiver is configured to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when determining that the second edge node lacks at least part of the information required to provide services for the terminal; The first edge node and the second edge node both belong to a first operator; The starting of multi-operator data synchronization includes: Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node; In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

12. A second edge node, characterized in that: The second edge node is an edge node that the terminal will access next, which is predicted by the first edge node according to the correspondence between the edge node coverage area and the road, the first edge node is the edge node that the terminal currently accesses, and the second edge node includes: a transceiver and a processor; The transceiver is used to receive the first information sent by the first edge node; The processor is configured to determine, after receiving the first information, whether the processor lacks at least part of the information required to provide a service for the terminal; The transceiver is further configured to start multi-operator data synchronization if it is determined to be missing; The first edge node and the second edge node both belong to a first operator; The starting of multi-operator data synchronization includes: Determine a third edge node, where the third edge node belongs to a second operator, and a coverage area of ​​the third edge node includes at least a portion of a coverage area of ​​the second edge node; In a case where it is determined that the third edge node can provide the missing information of the information required by the second edge node to provide a service for the terminal, data synchronization is performed with the third edge node.

13. A first edge node, the first edge node being the edge node currently accessed by a terminal, comprising a memory, a processor, and a program stored in the memory and executable on the processor; characterized in that: When the processor executes the program, the steps in the data synchronization method according to any one of claims 1 to 4 are implemented.

14. A second edge node, comprising a memory, a processor, and a program stored in the memory and executable on the processor; characterized in that: The second edge node is the edge node that the terminal will access next, predicted by the first edge node based on the correspondence between the edge node coverage area and the road, and the first edge node is the edge node that the terminal is currently connected to. When the processor executes the program, it implements the steps in the data synchronization method as described in any one of claims 5 to 8.

15. A readable storage medium having a program stored thereon, characterized in that: When the program is executed by a processor, the program implements the steps of the data synchronization method according to any one of claims 1 to 4 or the steps of the data synchronization method according to any one of claims 5 to 8.

Images