CN114449640A - Data synchronization method, information transmission method and equipment - Google Patents

Data synchronization method, information transmission method and equipment Download PDF

Info

Publication number
CN114449640A
CN114449640A CN202011218574.8A CN202011218574A CN114449640A CN 114449640 A CN114449640 A CN 114449640A CN 202011218574 A CN202011218574 A CN 202011218574A CN 114449640 A CN114449640 A CN 114449640A
Authority
CN
China
Prior art keywords
edge node
road
terminal
coverage area
preset
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202011218574.8A
Other languages
Chinese (zh)
Inventor
张喆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
China Mobile Communications Ltd Research Institute
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Communications Ltd Research Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Mobile Communications Group Co Ltd, China Mobile Communications Ltd Research Institute filed Critical China Mobile Communications Group Co Ltd
Priority to CN202011218574.8A priority Critical patent/CN114449640A/en
Publication of CN114449640A publication Critical patent/CN114449640A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W56/00Synchronisation arrangements

Landscapes

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

Abstract

The invention provides a data synchronization method, an information transmission method and equipment, belonging to the technical field of wireless communication, wherein the data synchronization method applied to an edge node accessed by a terminal currently comprises the following steps: predicting a second edge node to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road; and sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing the service for the terminal is determined to be lost by the second edge node. The invention can reduce the time delay of data synchronization among multiple operators when the second edge node provides service for the terminal, provide corresponding service for the terminal in time, improve the service performance and the service quality, and improve the user experience and the safety.

Description

Data synchronization method, information transmission method and equipment
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a data synchronization method, an information transmission method, and an apparatus.
Background
Multi-access Edge Computing (MEC) enables localized, close-range, distributed deployment of content and services by migrating Computing, storage, and service capabilities towards the Edge of the network. An MEC (Cellular-Vehicle to evolution, C-V2X) oriented to a Cellular vehicular wireless communication technology can provide a low-delay and high-performance network environment for a Vehicle networking service by using the characteristics of the MEC, and supports the deployment of a C-V2X service with a local characteristic.
The edge node is generally deployed in a network access layer or co-located with a base station, and different operators deploy applications in the edge node, so that low-delay service can be provided for users. Meanwhile, different operators deploy Road Side infrastructure (RSU) at the Road Side, on one hand, information can be collected, for example, a traffic management platform is connected to obtain Road traffic flow information, traffic accident information and the like, and a Road Side sensor is connected to collect sensor information; on the other hand, the RSU can carry out information forwarding and propagate the information in a broadcasting mode. Currently, in order to provide services to a vehicle, an edge node needs to rely on RSUs and/or sensors to obtain necessary information in addition to uploading information to the vehicle.
However, for some operators, the necessary data may not be obtained in some regions, such as the sensors are not deployed locally, or the RSUs are not deployed in the region, which may result in that the corresponding services cannot be provided for the users in the region. In order to solve the above problems, a continuous service is provided for the user, and data synchronization can be performed among multiple operators.
When multi-operator data synchronization is carried out, steps of authentication, data link establishment, data transmission and the like need to be carried out, and certain time is occupied; meanwhile, in some scenes, such as vehicle track prediction, pedestrian collision early warning and the like, historical traffic data needs to be synchronized, and the time delay of data synchronization among multiple operators is further improved. And data synchronization time delay among multiple operators is high, so that the service quality of the Internet of vehicles can be seriously influenced, and even serious traffic accidents can be caused.
Currently, the following techniques exist: the optimal caching decision is made for mobile users under different operators, so that the cache hit rate is improved when the users access data, and the access delay is reduced; in order to improve the forwarding rate of the message and reduce the transmission delay of the message; mainly aiming at the data forwarding process, the configuration of the inter-domain path is simplified. However, there is no technique that can reduce the data synchronization delay between multiple operators associated with edge computation.
Disclosure of Invention
In view of the above, the present invention provides a data synchronization method, an information transmission method, and an apparatus, which are used to solve the problem of high delay in data synchronization of multiple operators at present.
In order to solve the foregoing 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 includes:
predicting a second edge node to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road;
and sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing the service for the terminal is determined to be lost by the second edge node.
Optionally, the 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:
determining a first road where the terminal is located according to a first position where the terminal is located currently;
predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topological structure;
and predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the coverage area of the edge node.
Optionally, the predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topology structure includes:
predicting a road into which the terminal will drive in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
wherein a 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 single edge node coverage area.
Optionally, the predicting, according to the moving direction of the terminal on the first road and the road topology structure, a road into which the terminal will enter in a preset area includes:
predicting a road and a road section thereof to be driven into by the terminal in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
the predicting at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the corresponding relation between the edge node coverage area and the road includes:
predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal, the road section of the road and the coverage area of the edge node and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
In a second aspect, the present invention further provides a data synchronization method applied to a second edge node, where the second edge node is an edge node to be accessed next to a terminal, which is obtained by predicting a correspondence between an edge node coverage area and a road by a first edge node, and the first edge node is an edge node to which the terminal is currently accessed, and the method includes:
receiving first information sent by the first edge node;
after receiving the first information, determining whether the first information lacks at least part of information required for providing service for the terminal;
and if the data are determined to be missing, starting the data synchronization of the multiple operators.
Optionally, the first edge node and the second edge node both belong to a first operator;
the initiating multi-operator data synchronization comprises:
determining a third edge node, the third edge node belonging to a second operator, a coverage area of the third edge node comprising at least a partial coverage area of the second edge node;
and under the condition that the third edge node is determined to be capable of providing missing information of information required by the second edge node for providing the service for the terminal, performing data synchronization with the third edge node.
Optionally, the determining the third edge node includes:
and determining the third edge node according to the corresponding relation between the edge node coverage area of the second operator and the road.
Optionally, the performing data synchronization with the third edge node includes:
receiving missing information of information required for providing service for the terminal, which is sent by the third edge node, so as to provide service for the terminal; or,
and sending the existing information required for providing the service for the terminal to the third edge node so as to provide the service for the terminal by the third edge node.
Optionally, after the starting of the data synchronization of multiple operators, the method further includes:
if the synchronous data are still not used after the preset duration, deleting the synchronous data; and/or the presence of a gas in the gas,
and if the terminal leaves the coverage area of the second edge node, deleting the synchronous data.
In a third aspect, the present invention further provides an information transmission method applied to an electronic device, including:
determining a 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;
for each preset edge node, determining a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
establishing a corresponding relation between an edge node coverage area and a road according to the road covered by each preset edge node;
and sending at least part of content in the corresponding relation between the edge node coverage area and the road to a target edge node in the preset edge nodes, wherein the at least part of content in the corresponding relation between the edge node coverage area and the road comprises the corresponding relation between the coverage area of the preset edge node adjacent to the target edge node and the road.
Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road segment of the road;
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 comprises the following steps:
determining a demarcation point every preset distance from one end of a road, and dividing the road into a plurality of road sections;
calculating a first distance between each demarcation point and the central point of the coverage area of each preset base station, and comparing the first distance with the radius of the coverage area of the corresponding base station;
if the first distance is smaller than or equal to the radius of the coverage area of the corresponding base station, determining that the demarcation point is in the coverage area of the corresponding base station;
if a first boundary point and a second boundary point on one road are both in the coverage area of the corresponding base station, determining that a section between the first boundary point and the second boundary point is in the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
if only the third boundary point of the third boundary point and the fourth boundary point on one road is in the coverage area of the corresponding base station, determining a middle point between the third boundary point and the fourth boundary point according to the radius of the coverage area of the corresponding base station, and determining that a road section between the middle point and the third boundary point is in the coverage area of the corresponding base station.
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, and the first edge node includes:
the prediction module is used for predicting a second edge node which is to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road;
and the first information sending module is used for sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing service for the terminal is determined to be lost.
Optionally, the prediction module includes:
the road determining unit is used for determining a first road where the terminal is located according to a first position where the terminal is located currently;
the road prediction unit is used for predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topological structure;
and the edge node prediction unit is used for predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the edge node coverage area.
Optionally, the road prediction unit is configured to predict a road into which the terminal will drive in a preset area according to a moving direction of the terminal on the first road and a road topology structure;
and the distance between any position in the preset area and the first position is smaller than or equal to a preset value, wherein the preset value is determined according to the size of the coverage area of the single edge node.
Optionally, the road prediction unit is configured to predict a road and a road segment thereof to be driven into by the terminal in a preset area according to a moving direction of the terminal on the first road and a road topology structure;
the edge node prediction unit is used for predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal, the road section of the road and the coverage area of the edge node and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
In a fifth aspect, the present invention further provides a second edge node, where the second edge node is an edge node to be accessed next to a terminal, which is obtained by predicting a correspondence between an edge node coverage area and a road, and the first edge node is an edge node to which the terminal is currently accessed, and the second edge node includes:
a first information receiving module, configured to receive first information sent by the first edge node;
a determining module, configured to determine whether at least part of information required for providing a service for the terminal is missing after receiving the first information;
and the synchronization module is used for starting the data synchronization of the multiple operators if the data synchronization is determined to be missing.
Optionally, the first edge node and the second edge node both belong to a first operator;
the synchronization module includes:
a synchronization node determination unit 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 partial coverage area of the second edge node;
and the synchronization unit is used for performing data synchronization with the third edge node under the condition that the third edge node is determined to be capable of providing missing information of information required by the second edge node for providing the service for the terminal.
Optionally, the synchronization node determining unit is configured to determine the third edge node according to a correspondence between an edge node coverage area of a second operator and a road.
Optionally, the synchronization unit includes:
a receiving subunit, configured to receive missing information of information required to provide a service for the terminal, where the missing information is sent by the third edge node, so as to provide the service for the terminal; or,
and the sending subunit is configured to send existing information required for providing a service for the terminal to the third edge node, so that the third edge node provides the service for the terminal.
Optionally, the second edge node further includes:
the first redundant data deleting module is used for deleting the synchronous data if the synchronous data are still not used after the preset time length; and/or the presence of a gas in the gas,
and the second redundant data deleting module is used for deleting the synchronous data if the terminal leaves the coverage area of the second edge node.
In a sixth aspect, the present invention further provides an electronic device, including:
the base station coverage determining module is used for determining a 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;
an edge node coverage determining module, configured to determine, for each preset edge node, a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
the corresponding relation establishing module is used for establishing the corresponding relation between the edge node coverage area and the road according to the road covered by each preset edge node;
a corresponding relation sending module, configured to send at least part of content in a corresponding relation between the edge node coverage area and the road to a target edge node in the preset edge nodes, where at least part of content in the corresponding relation between the edge node coverage area and the road includes a corresponding relation between a coverage area of a preset edge node adjacent to the target edge node and the road.
Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road segment of the road;
the base station coverage determination module comprises:
the road section dividing unit is used for determining a demarcation point every preset distance from one end of a road and dividing the road into a plurality of road sections;
the comparison unit is used for calculating a first distance between each dividing point and the central point of the coverage area of each preset base station and comparing the first distance with the radius of the coverage area of the corresponding base station;
a first coverage determining unit, configured to determine that the demarcation point is within a coverage area of a corresponding base station if the first distance is less than or equal to a radius of the coverage area of the corresponding base station;
a second coverage determination unit, configured to determine that a section between a first boundary point and a second boundary point on a road is within a coverage area of a corresponding base station if the first boundary point and the second boundary point are both within the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
a third coverage determining unit, configured to determine, if only the third demarcation point is within the coverage area of the corresponding base station, an intermediate point between the third demarcation point and the fourth demarcation point according to the radius of the coverage area of the corresponding base station, and determine that a section between the intermediate point and the third demarcation point is within the coverage area of the corresponding base station.
In a seventh aspect, the present invention further provides a first edge node, where the first edge node is an edge node currently accessed by a terminal, and the first edge node includes: a transceiver and a processor;
the processor is used for predicting a second edge node to be accessed next by the terminal according to the corresponding relation 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 at least part of information required for providing a service for the terminal is missing.
Optionally, the processor is configured to determine a first road where the terminal is currently located according to a first location where the terminal is currently located;
the processor is further configured to predict a road into which the terminal will drive according to the moving direction of the terminal on the first road and a road topology structure;
the processor is further configured to predict at least one second edge node according to a road to be driven into by the terminal and a corresponding relationship between the edge node coverage area and the road.
Optionally, the processor is configured to predict a road into which the terminal will drive in a preset area according to a moving direction of the terminal on the first road and a road topology structure;
wherein a 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 single edge node coverage area.
Optionally, the processor is configured to predict a road and a road segment thereof to be driven into by the terminal in a preset area according to a moving direction of the terminal on the first road and a road topology structure;
the processor is further configured to predict at least one second edge node according to a road to be driven into by the terminal and a corresponding relationship between the road section and the edge node coverage area; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
In an eighth aspect, the present invention further provides a second edge node, where the second edge node is an edge node to be accessed next to a terminal, which is obtained by predicting a correspondence between an edge node coverage area and a road, by a first edge node, and the first edge node is an edge node to which the terminal is currently accessed, and the second edge node includes: a transceiver and a processor;
the transceiver is configured to receive first information sent by the first edge node;
the processor is used for determining whether the processor lacks at least part of information required for providing service for the terminal after receiving the first information;
the transceiver is further configured to initiate multi-operator data synchronization if the absence is determined.
Optionally, the first edge node and the second edge node both belong to a first operator;
the processor is configured to determine a third edge node, the third edge node belonging to a second operator, a coverage area of the third edge node comprising at least a partial coverage area of the second edge node;
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 of information required by the second edge node to provide a service for the terminal.
Optionally, the processor is configured to determine the third edge node according to a correspondence between an edge node coverage area of a second operator and a road.
Optionally, the transceiver is configured to receive missing information of information required to provide a service for the terminal, where the missing information is sent by the third edge node, so as to provide the service for the terminal; or,
the transceiver is configured to send information required for providing a service for the terminal to the third edge node, so that the third edge node provides the service for the terminal.
Optionally, the processor is further configured to delete the synchronized data if the synchronized data is still unused after a preset duration; and/or deleting the synchronized data if the terminal has left the coverage area of the second edge node.
In a ninth aspect, the present invention further provides an electronic device, comprising: a transceiver and a processor;
the processor is used for 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;
the processor is further configured to determine, for each preset edge node, a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
the processor is further configured to establish a corresponding relationship between an edge node coverage area and a road according to the road covered by each preset edge node;
the transceiver is configured to send at least part of content in a correspondence between the edge node coverage area and the road to a target edge node in the preset edge nodes, where the at least part of content in the correspondence between the edge node coverage area and the road includes a correspondence between a coverage area of a preset edge node adjacent to the target edge node and the road.
Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road segment of the road;
the processor is used for determining a demarcation point every preset distance from one end of a road and dividing the road into a plurality of road sections;
the processor is further configured to calculate a first distance between each boundary point and a central point of a coverage area of each preset base station, and compare the first distance with a radius of a coverage area of the corresponding base station;
the processor is further configured to determine that the demarcation point is within a coverage area of a corresponding base station if the first distance is less than or equal to a radius of the coverage area of the corresponding base station;
the processor is further configured to determine that a segment between a first demarcation point and a second demarcation point on a road is within a coverage area of a corresponding base station if the first demarcation point and the second demarcation point are both within the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
the processor is further configured 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 is within the coverage area of the corresponding base station, and determine that a section between the intermediate point and the third dividing point is within the coverage area of the corresponding base station.
In a tenth aspect, the present invention further provides a first edge node, where the first edge node is an edge node currently accessed by a terminal, and includes a memory, a processor, and a program stored in the memory and executable on the processor; the processor implements any of the above steps in the data synchronization method applied to the first edge node when executing the program.
In an eleventh aspect, the present invention further provides a second edge node, including a memory, a processor, and a program stored on the memory and executable on the processor; the second edge node is an edge node which is predicted by the first edge node according to the corresponding relation between the edge node coverage area and the road and is to be accessed next by the terminal, the first edge node is an edge node which is accessed currently by the terminal, and the processor implements any one of the steps in the data synchronization method applied to the second edge node when executing the program.
In a twelfth aspect, the present invention further provides an electronic device, including a memory, a processor, and a program stored in the memory and executable on the processor; the processor implements any of the above steps in the information transmission method applied to the electronic device when executing the program.
In a thirteenth aspect, the present invention also provides a readable storage medium, on which a program is stored, which when executed by a processor, implements the steps in any of the above-described data synchronization methods applied to a first edge node or implements the steps in any of the above-described data synchronization methods applied to a second edge node or implements the steps in any of the above-described information transmission methods applied to an electronic device.
The technical scheme of the invention has the following beneficial effects:
in the embodiment of the invention, the edge node which is currently accessed by the terminal can at least acquire the corresponding relation between the coverage areas of all adjacent edge nodes and the road, so that the next edge node (namely a second edge node) which is about to be accessed by the terminal can be predicted, the second edge node can determine whether the second edge node is missing information required by providing service for the terminal in advance, and if the second edge node is missing, the data synchronization of multiple operators can be started in advance, so that the time delay of data synchronization among the multiple operators when the second edge node provides service for the terminal can be reduced, the corresponding service is provided for the terminal in time, the service performance and the service quality are improved, and the user experience and the safety are improved.
Drawings
Fig. 1 is a schematic flowchart of a data synchronization method according to a first embodiment of the present invention;
FIG. 2 is a diagram illustrating an application scenario in which embodiments of the present invention may be applied;
fig. 3 is a schematic diagram of next hop edge node prediction according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating next hop edge node prediction in accordance with an embodiment of the present invention;
fig. 5 is a flowchart illustrating a data synchronization method according to a second embodiment of the present invention;
FIG. 6 is a schematic diagram illustrating the determination of edge nodes for multi-operator data synchronization according to an embodiment of the present invention;
fig. 7 is a flowchart illustrating an information transmission method according to a third embodiment of the present invention;
fig. 8 is a schematic structural diagram of a first edge node according to a fourth embodiment of the present invention;
fig. 9 is a schematic structural diagram of a second edge node according to a fifth embodiment of the present invention;
fig. 10 is a schematic structural diagram of an electronic device according to a sixth embodiment of the present invention;
fig. 11 is a schematic structural diagram of a first edge node according to a seventh embodiment of the present invention;
fig. 12 is a schematic structural diagram of a second edge node according to an eighth embodiment of the present invention;
fig. 13 is a schematic structural diagram of an electronic device in a ninth embodiment of the present invention;
fig. 14 is a schematic structural diagram of a first edge node according to a tenth embodiment of the present invention;
fig. 15 is a schematic structural diagram of a second edge node according to an eleventh embodiment of the present invention;
fig. 16 is a schematic structural diagram of an electronic device in a twelfth embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the drawings of the embodiments of the present invention. It should be apparent that the described embodiments are only some of the embodiments of the present invention, and not all of them. All other embodiments, which can be derived by a person skilled in the art from the described embodiments of the invention, are within the scope of the invention.
Referring to fig. 1, fig. 1 is a schematic flow chart of a data synchronization method according to an embodiment of the present invention, where the method is applied to a first edge node, where the first edge node is an edge node to which a terminal currently accesses, and the method includes the following steps:
step 11: predicting a second edge node to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road;
step 12: and sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing the service for the terminal is determined to be lost by the second edge node.
The correspondence between the edge node coverage area and the road, specifically, the correspondence (or called matching relationship) between the edge node and the road in the coverage area thereof, may be formed as a matching table between the edge node coverage area and the road, and is used to establish the matching relationship between the road and the edge node.
The corresponding relationship between the edge node coverage area and the road may be the corresponding relationship between the coverage areas of all the edge nodes in a certain area and the road.
In addition, because the deployment positions of the edge nodes of different operators are different, and the size and/or the shape of the coverage area of a single edge node are different, the corresponding relationship between the coverage areas of the edge nodes of different operators and the road may be different.
The predicted second edge node to be accessed (or called connected) next by the terminal may be more than one, and may be all possible second edge nodes to be accessed.
The first information may be specifically used to indicate, to the second edge node, that the second edge node is an edge node that is predicted to be entered by the terminal, and the second information may also be used to indicate, to the second edge node, information required to provide a service for the terminal, that is, to notify the second edge node of what information is required to provide the service for the terminal. When the first information is used for indicating the information required for providing the service for the terminal to the second edge node, the first edge node may comb the information required for providing the service for the terminal in combination with the application subscribed by the terminal.
In addition, the first information may further include history data and authentication information related to the terminal. That is, the first edge node may synchronize the history data and the authentication information related to the terminal to the second edge node.
If there is more than one second edge node, the first edge node needs to send the first information to each second edge node.
According to the embodiment of the invention, the edge node which is currently accessed by the terminal can at least acquire the corresponding relation between the coverage areas of all adjacent edge nodes and the road, so that the next edge node (namely a second edge node) which is about to be accessed by the terminal can be predicted, the second edge node can determine whether the second edge node lacks the information required by providing the service for the terminal in advance, and if the second edge node lacks the information, the data synchronization of multiple operators can be started in advance, so that the time delay of the data synchronization among the multiple operators when the second edge node provides the service for the terminal can be reduced, the corresponding service can be provided for the terminal in time, the service performance and the service quality can be improved, and the user experience and the safety can be improved.
Fig. 2 is a schematic diagram of an application scenario to which the embodiment of the present invention may be applied, please refer to fig. 2, where a terminal (User Equipment, UE) signs a contract with an operator a, receives a service provided by the operator a, and predicts that the UE is about to travel to an area Z2 when the UE is currently located in an area Z1; both the operator a and the operator B deploy an edge platform in the area Z2, and the operator a cannot acquire necessary data in the area Z2; the operator A and the operator B have signed a contract, and the contract is agreed that the operator A can not obtain necessary data, and the operator A can obtain the necessary data through the operator B; operator a has a topology map of the various edge nodes of operator B, as well as data source information available at the various edge nodes.
At the current time T1, the UE is connected to the edge node MEN-A1 in the zone Z1; at the next time T2, the UE is predicted to be connected to the edge node MEN-a2 in zone Z2; the edge node MEN-B of operator B in the figure is also in zone Z2.
Some edge calculation related terms related to the embodiment of the invention are explained as follows:
MEO: an MEC Orchester, MEC Orchestrator, which can maintain the edge node topological graph, manage the application package, select the instantiation resources, etc.;
MEN: MEC Node, edge Node;
and MEMN: an MEC Management Node, which is a Management Node of an edge Node, is an upper Node of an MEN and stores a topological graph of a subordinate MEN, information collected by each subordinate MEN, related information of edge Management nodes of other operators, key information and the like;
MEA: MEC Application, Application at edge node;
MEP: MEC Platform, edge node Platform.
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.
The above-described data synchronization method is exemplified below.
In the embodiment of the invention, the road to which the UE is going to drive needs to be predicted before the multi-operator data synchronization, so that the next edge node to which the UE is going to be connected is matched. The prediction and matching mechanism requires that an edge node platform (which can also be an edge computing platform) of an edge node (i.e. a first edge node) to which the terminal is currently accessed predicts the track of the terminal based on a road topological structure and an edge node topological graph (the edge node topological graph of an operator to which the first edge node belongs), matches the next-hop edge node, and provides new requirements for the edge node platform.
Optionally, the 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:
determining a first road where the terminal is located according to a first position where the terminal is located currently;
specifically, the edge node platform of the first edge node may obtain the GPS coordinate of the current location of the terminal based on Basic Safety Message (BSM), and then may perform inverse analysis on the GPS coordinate of the UE by using an Application Programming Interface (API) of map software, so as to obtain a road L (i.e., a first road) where the UE is currently located.
Predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topological structure;
specifically, the edge node platform of the first edge node may analyze whether a road branches forward from the current position of the terminal based on the driving direction of the terminal in combination with the shape of the road L where the terminal is located. If there is no bifurcation road, the terminal will continue to be on the road L. If the branch exists, the edge node platform of the first edge node analyzes the topological relation of the road L where the terminal is located based on the road topological structure. In the driving direction of the terminal, other roads connected to the current road L may be derived, and assuming that the set of these roads is M, the set is a set of roads on which the terminal is likely to drive subsequently.
And predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the coverage area of the edge node.
Specifically, if the current position of the terminal has no road bifurcation forward, the next edge node to which the terminal will be connected is determined according to the corresponding relationship between the edge node coverage area and the road. If the current position of the terminal has a road bifurcation ahead, based on the road set M, edge nodes corresponding to each road are analyzed in combination with the correspondence between the edge node coverage area and the road (the edge nodes and the edge node to which the terminal is currently connected belong to the same operator), and the corresponding edge node set is assumed to be P. When the terminal leaves the coverage of the first edge node, the terminal may enter the coverage of any edge node in the P.
The road to be entered by the terminal comprises the first road and/or a second road, and the second road is a road intersecting the first road.
For example, referring to fig. 3, based on the BSM message and the map API, the reverse analysis shows that the terminal is currently located on the road L and is in the coverage of MEP-a 1. Based on the road topological structure and the driving direction of the terminal, the range of the terminal which is predicted to be possibly driven into subsequently is a road set M { L2, L3 and L4}, and the corresponding edge node set P { MEP-A2, MEP-A3 and MEP-A4 }.
In some optional specific embodiments, the edge node platform of the first edge node may start the prediction and matching process of the next-hop edge node when detecting that the terminal is about to exit from the coverage area of the terminal.
Optionally, the predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topology structure includes:
predicting a road into which the terminal will drive in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
wherein a 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 single edge node coverage area.
In the embodiment of the invention, the next-hop edge node is required to be predicted, so that the road which is possibly driven into a certain area in front of the terminal is required to be predicted. For example, if the single edge node coverage area diameter is within 1KM, it may be found whether there is a bifurcation road on the road L within 1KM forward from the current location of the UE.
Optionally, the predicting, according to the moving direction of the terminal on the first road and the road topology structure, a road into which the terminal will enter in a preset area includes:
predicting a road and a road section thereof to be driven into by the terminal in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
the predicting at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the corresponding relation between the edge node coverage area and the road includes:
predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal, the road section of the road and the coverage area of the edge node and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
Since a single edge node is likely not to cover the entirety of a road, in other words, a road may be covered by a plurality of different edge nodes. Therefore, the next-hop edge node is accurately predicted. In the embodiment of the invention, the road and the road section thereof to be driven into by the terminal in a certain area are predicted, and then the second edge node is predicted according to the corresponding relation between the edge node coverage area and the road section of the road.
For example, referring to fig. 4, based on the BSM message and the map API, the reverse analysis shows that the terminal is currently located on the road L and is in the coverage of MEP-a 1. And predicting the range which the terminal can drive into subsequently as a road set M { L2, L3 and L4} based on the road topological structure and the driving direction of the terminal. However, within a distance of 1KM from the current position of the terminal (radius of the coverage area of a single edge node), the links of each road that the terminal may travel into are within the coverage of the edge node MEP-a2, and thus it may be determined that the edge node to which the terminal is about to access is the edge node MEP-a 2.
In the embodiment of the present invention, the correspondence between the edge node coverage area and the road may be obtained according to the following method:
determining a demarcation point every preset distance from one end of a road, and dividing the road into a plurality of road sections;
calculating a first distance between each demarcation point and the central point of the coverage area of each preset base station, and comparing the first distance with the radius of the coverage area of the corresponding base station;
if the first distance is smaller than or equal to the radius of the coverage area of the corresponding base station, determining that the demarcation point is in the coverage area of the corresponding base station;
if a first boundary point and a second boundary point on one road are both in the coverage area of the corresponding base station, determining that a section between the first boundary point and the second boundary point is in the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
if only the third boundary point of the third boundary point and the fourth boundary point on one road is in the coverage area of the corresponding base station, determining a middle point between the third boundary point and the fourth boundary point according to the radius of the coverage area of the corresponding base station, and determining a road section between the middle point and the third boundary point to be in the coverage area of the corresponding base station;
and determining the corresponding relation between the edge node coverage area and the road according to the corresponding relation between the base station and the edge node.
According to the method and the device, terminal equipment, a network and the like do not need to be transformed, only an edge node coverage area and a road matching table need to be constructed at an edge computing platform, then a next hop edge node prediction mechanism based on a road topological relation is utilized to analyze which edge node of other operators needs to obtain data, authentication is finally carried out, related historical data on the edge node is firstly synchronized, redundant data are deleted, data synchronization time delay of multiple operators is further reduced, and service performance is improved.
Referring to fig. 5, fig. 5 is a flowchart illustrating a data synchronization method according to a second embodiment of the present invention, where the method is applied to a second edge node, where the second edge node is an edge node that is predicted by a first edge node according to a correspondence between an edge node coverage area and a road and is to be accessed next by a terminal, and the first edge node is an edge node that is currently accessed by the terminal, and the method includes the following steps:
step 51: receiving first information sent by the first edge node;
specifically, the first information is that the first edge node predicts, according to a correspondence between an edge node coverage area and a road, that the second edge node is an edge node to be accessed next by the terminal and then sends the second edge node;
step 52: after receiving the first information, determining whether the first information lacks at least part of information required for providing service for the terminal;
step 53: and if the data are determined to be missing, starting the data synchronization of the multiple operators.
Specifically, after the second edge node receives the first information, if the first information indicates what information is needed for providing service for the terminal, the second edge node analyzes whether the second edge node has full data or not by comparing the data condition of the second edge node with the data condition of the second edge node, if the second edge node has full data, data synchronization among multiple operators is not needed, and if partial data is missing, the data synchronization process of the multiple operators is started.
For the first information, reference may be specifically made to the above method embodiments, and details are not described herein.
In addition, there may be a plurality of second edge nodes, each second edge node needs to determine whether it has the full amount of data required for providing the service for the terminal after receiving the first information, and starts multi-operator data synchronization if there is data loss.
In the embodiment of the invention, the edge node which is currently accessed by the terminal can at least acquire the corresponding relation between the coverage areas of all adjacent edge nodes and the road, so that the next edge node (namely a second edge node) which is about to be accessed by the terminal can be predicted, the second edge node can determine whether the second edge node is missing information required by providing service for the terminal in advance, and if the second edge node is missing, the data synchronization of multiple operators can be started in advance, so that the time delay of data synchronization among the multiple operators when the second edge node provides service for the terminal can be reduced, the corresponding service is provided for the terminal in time, the service performance and the service quality are improved, and the user experience and the safety are improved.
Optionally, the first edge node and the second edge node both belong to a first operator;
the initiating multi-operator data synchronization includes:
determining a third edge node, the third edge node belonging to a second operator, a coverage area of the third edge node comprising at least a partial coverage area of the second edge node;
and under the condition that the third edge node is determined to be capable of providing missing information of information required by the second edge node for providing the service for the terminal, performing data synchronization with the third edge node.
Optionally, the determining the third edge node includes:
and determining the third edge node according to the corresponding relation between the edge node coverage area of the second operator and the road.
For example, referring to fig. 2 and fig. 6, it is known that the edge node MEP-a2 of the operator a covers the predicted area Z2 into which the terminal is going to drive and the roads in the area, and the operator a lacks part of the data D in the area Z2, and starts the multi-operator data synchronization process. The second edge node of the operator a can find out the coverage of the operator B in the area based on the corresponding relationship between the coverage area of the edge node of the operator B and the road, as shown by the dotted line in fig. 6, where the operator B has two edge nodes in the area Z2, i.e., MEP-B1 and MEP-B2.
The second edge node of operator a analyzes whether data D can be provided on MEP-B1 and MEP-B2 based on the data situation of each edge node of operator B acquired at the time of subscription. If both MEP-B1 and MEP-B2 are capable of providing data D, MEP-A2 sends a data request to MEO-B of operator B, and MEO-B initiates an authentication procedure for MEP-A2. After the authentication is passed, the historical data is synchronized between MEP-A2 and MEP-B1 and MEP-B2.
Optionally, the performing data synchronization with the third edge node includes:
receiving missing information of information required for providing service for the terminal, which is sent by the third edge node, so as to provide service for the terminal; or,
and sending the existing information required for providing the service for the terminal to the third edge node so as to provide the service for the terminal by the third edge node.
When data synchronization is performed among multiple operators, although the UE belongs to a contracted vehicle of the operator a, if the UE acquires the key of the RSU-B, the UE may also acquire the service provided by the operator B through the RSU, that is, both the operator a and the operator B may serve as the service principal of the UE.
The body and corresponding scenario serving the UE determine the direction of the synchronization of the history data between operators a and B:
ue receives operator a service in zone Z2
In such a service, the MEP-B needs to synchronize the historical data missing from MEP-a2 to MEP-a2, which is the traffic environment data in the primary synchronization area.
For example, in cA road traffic flow prediction scenario, the MEP-B needs to synchronize historical traffic accident information, road average speed information, etc. in an arecA to the MEP- cA. MEP-A makes predictions based on historical datcA.
UE receives MEP-B service in zone Z2
In such a service mode, MEP-a1 needs to synchronize UE-related history data to MEP-B in advance, and MEP-B provides services for UE based on UE history data.
For example, for cA vehicle trajectory prediction service, the MEP- cA needs to synchronize the historical trajectory information of the UE to the MEP-B, and the MEP-B can provide the UE with cA corresponding trajectory prediction service based on the historical driving trajectory datcA of the vehicle.
In addition, if MEP-B1 and MEP-B2 cannot provide the data missing from MEP-a1, operator a needs to obtain the data through other ways, such as through other contracted operators, or from a higher-level platform.
Optionally, after the starting of the data synchronization of multiple operators, the method further includes:
if the synchronous data are still not used after the preset duration, deleting the synchronous data; and/or the presence of a gas in the gas,
and if the terminal leaves the coverage area of the second edge node, deleting the synchronous data.
The synchronized data may include data sent by the third edge node, that is, data obtained by starting data synchronization of multiple operators, and may also include history data, authentication information, and the like related to the terminal synchronized by the first edge node.
In the above flow, in order to reduce the time delay of data synchronization and improve the accuracy of predicting 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-a 1; 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. A redundant data identification and deletion mechanism is therefore provided on each edge node.
Assuming that the time when the MEP-a1 synchronizes data to each edge node in the set P is T1, within 1 hour from the time T1, if the synchronized data on the edge nodes in the set P are not used, the data are identified as redundant data and deleted.
The embodiments of the present invention provide technical solutions corresponding to the above embodiments and having the same inventive concept, and can achieve the same technical effects.
Referring to fig. 7, fig. 7 is a schematic flowchart of an information transmission method according to a third embodiment of the present invention, where the method is applied to an electronic device, and includes the following steps:
step 71: determining a 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;
step 72: for each preset edge node, determining a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
step 73: establishing a corresponding relation between an edge node coverage area and a road according to the road covered by each preset edge node;
step 74: and sending at least part of content in the corresponding relation between the edge node coverage area and the road to a target edge node in the preset edge nodes, wherein the at least part of content in the corresponding relation between the edge node coverage area and the road comprises the corresponding relation between the coverage area of the preset edge node adjacent to the target edge node and the road.
The target edge node predicts a next hop edge node for a terminal which is accessed to the target edge node and is about to leave the target edge node according to at least part of content in the corresponding relation 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 whether information required for providing service for the terminal is missing in advance, and if the information is missing, multi-operator data synchronization is started in advance.
Each edge node has a certain coverage, and for edge nodes located in an operator network, the coverage of the edge node is the coverage of a base station below the edge node, but in actual application, because the coverage of a single edge node is irregular, accurate description cannot be performed, so that a lot of difficulties are brought to actual application, and at present, no corresponding scheme exists temporarily, and the edge nodes and roads are corresponding. Therefore, the application provides a matching table for designing the edge node coverage area and the road, a specific road section is corresponding to each edge node, and the subsequent edge node matching related work is applied.
Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road segment of the road;
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 comprises the following steps:
determining a demarcation point every preset distance from one end of a road, and dividing the road into a plurality of road sections;
calculating a first distance between each demarcation point and the central point of the coverage area of each preset base station, and comparing the first distance with the radius of the coverage area of the corresponding base station;
since the coverage shape of each base station is a hexagon, it may be approximated to be a circle in the embodiment of the present invention.
If the first distance is smaller than or equal to the radius of the coverage area of the corresponding base station, determining that the demarcation point is in the coverage area of the corresponding base station;
if a first boundary point and a second boundary point on one road are both in the coverage area of the corresponding base station, determining that a section between the first boundary point and the second boundary point is in the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
if only the third boundary point of the third boundary point and the fourth boundary point on one road is in the coverage area of the corresponding base station, determining a middle point between the third boundary point and the fourth boundary point according to the radius of the coverage area of the corresponding base station, and determining that a road section between the middle point and the third boundary point is in the coverage area of the corresponding base station.
According to the embodiment of the invention, the edge node (namely the target edge node) which is currently accessed by the terminal can at least acquire the corresponding relation between the coverage areas of all adjacent edge nodes and the road, so that the next hop edge node which is about to be accessed by the terminal can be predicted, the next hop edge node can determine whether the next hop edge node loses the information required by providing the service for the terminal in advance, and if the next hop edge node loses the information, multi-operator data synchronization can be started in advance, so that the time delay of data synchronization among multiple operators when the next hop edge node provides the service for the terminal can be reduced, the corresponding service is provided for the terminal in time, the service performance and the service quality are improved, and the user experience and the safety are improved.
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 coverage area of the known base station, and the radius r of the coverage area of the known base station.
First, the road is segmented: starting from the starting point of the road, a demarcation point is taken at regular intervals to divide the road into small sections. The dividing points of each road are numbered in sequence, and the coordinates of the dividing points of the roads are assumed to be R0(R0x, R0y), R1(R1x, R1y) … Rn (Rnx, Rny);
then, matching the road demarcation points to the coverage range of the base station: and calculating the distance between the coordinates of each demarcation point of the road section and the central point of each base station, and comparing the distance with the radius r.
If distance is not allowed
Figure BDA0002761263550000221
And if the radius is smaller than the radius r, the demarcation point is within the coverage range of the base station, otherwise, the demarcation point is not within the coverage range.
And comparing the distance d between all the road demarcation points and the central point of the base station with the coverage radius r of the base station, so that all the road demarcation points can be matched in the coverage range of all the base stations.
And finally, matching the road section with the base station and the edge node: for each base station, all road demarcation points within its range have been found. And sequencing the demarcation points according to the sequence of the numbers, wherein the adjacent numbers indicate that the road sections are all in the range of the base station, and the numbers which exist independently indicate that the road sections are partially in the range of the base station and partially in the range of the adjacent base station. At this time, an intermediate point needs to be inserted between two demarcation points of the road, that is, based on the central point of the base station, a circle is drawn by a radius r, and the intersection point of the base station and the road is the intermediate point. Thus, the road section in the range of the base station is determined, the matching of the road section and the base station is completed, and a matching table of the road section and the base station is formed.
Further, since the corresponding relationship between the base station and the edge node is known, the road section and the edge node can be corresponded to form a corresponding relationship table of the road section, the base station and the edge node. The table is exemplified as follows:
Figure BDA0002761263550000222
from the lookup table, the road segments R0 and R1 are in the coverage of the base station C1, the road segment R2 is in the coverage of the base station C2, and the road segments R0, R1 and R2 are in the coverage of the edge node M1.
Referring to fig. 8, fig. 8 is a schematic structural diagram of a first edge node according to a fourth embodiment of the present invention, where the first edge node is an edge node currently accessed by a terminal, and the first edge node 80 includes:
the prediction module 81 is configured to predict a second edge node to be accessed next by the terminal according to a correspondence between an edge node coverage area and a road;
a first information sending module 82, configured to send first information to the second edge node, so that the second edge node starts multi-operator data synchronization when determining that at least part of information required for providing a service for the terminal is missing.
Optionally, the prediction module 81 includes:
the road determining unit is used for determining a first road where the terminal is located currently according to a first position where the terminal is located currently;
the road prediction unit is used for predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topological structure;
and the edge node prediction unit is used for predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the edge node coverage area.
Optionally, the road prediction unit is configured to predict a road into which the terminal will drive in a preset area according to a moving direction of the terminal on the first road and a road topology structure;
and the distance between any position in the preset area and the first position is smaller than or equal to a preset value, wherein the preset value is determined according to the size of the coverage area of the single edge node.
Optionally, the road prediction unit is configured to predict a road to be driven into by the terminal in a preset area and a road segment thereof according to a moving direction of the terminal on the first road and a road topology;
the edge node prediction unit is used for predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal, the road section of the road and the coverage area of the edge node and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
The embodiment of the present invention is a product embodiment corresponding to the above method embodiment, and therefore, detailed description is omitted here, and please refer to the first embodiment in detail.
Referring to fig. 9, fig. 9 is a schematic structural diagram of a second edge node according to a fifth embodiment of the present invention, where the second edge node is an edge node to be accessed next to a terminal, where the edge node is predicted by a first edge node according to a corresponding relationship between an edge node coverage area and a road, the first edge node is an edge node to which the terminal is currently accessed, and the second edge node 90 includes:
a first information receiving module 91, configured to receive first information sent by the first edge node;
a determining module 92, configured to determine whether at least part of information required for providing a service for the terminal is missing after receiving the first information;
and a synchronization module 93, configured to start multi-operator data synchronization if the deletion is determined.
Optionally, the first edge node and the second edge node both belong to a first operator;
the synchronization module 93 includes:
a synchronization node determination unit 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 partial coverage area of the second edge node;
and the synchronization unit is used for performing data synchronization with the third edge node under the condition that the third edge node is determined to be capable of providing missing information of information required by the second edge node for providing the service for the terminal.
Optionally, the synchronization node determining unit is configured to determine the third edge node according to a correspondence between an edge node coverage area of a second operator and a road.
Optionally, the synchronization unit includes:
a receiving subunit, configured to receive missing information of information required to provide a service for the terminal, where the missing information is sent by the third edge node, so as to provide the service for the terminal; or,
and the sending subunit is configured to send existing information required for providing a service for the terminal to the third edge node, so that the third edge node provides the service for the terminal.
Optionally, the second edge node 90 further includes:
the first redundant data deleting module is used for deleting the synchronous data if the synchronous data are still not used after the preset time length; and/or the presence of a gas in the gas,
and the second redundant data deleting module is used for deleting the synchronous data if the terminal leaves the coverage area of the second edge node.
The embodiment of the present invention is a product embodiment corresponding to the above method embodiment, and therefore, detailed description is omitted here, and please refer to the second embodiment.
Referring to fig. 10, fig. 10 is a schematic structural diagram of an electronic device according to a sixth embodiment of the present invention, where the electronic device 100 includes:
a base station coverage determining module 101, configured to determine a road covered by each preset base station according to a distance between the road and the preset base station and a radius of a coverage area of the preset base station;
an edge node coverage determining module 102, configured to determine, for each preset edge node, a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
the corresponding relation establishing module 103 is configured to establish a corresponding relation between an edge node coverage area and a road according to the road covered by each preset edge node;
a corresponding relation sending module 104, configured to send at least part of content in a corresponding relation between the edge node coverage area and the road to a target edge node in the preset edge nodes, where at least part of content in the corresponding relation between the edge node coverage area and the road includes a corresponding relation between a coverage area of a preset edge node adjacent to the target edge node and the road.
Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road segment of the road;
the base station coverage determining module 101 includes:
the road section dividing unit is used for determining a demarcation point every preset distance from one end of a road and dividing the road into a plurality of road sections;
the comparison unit is used for calculating a first distance between each dividing point and the central point of the coverage area of each preset base station and comparing the first distance with the radius of the coverage area of the corresponding base station;
a first coverage determining unit, configured to determine that the demarcation point is within a coverage area of a corresponding base station if the first distance is less than or equal to a radius of the coverage area of the corresponding base station;
a second coverage determination unit, configured to determine that a section between a first boundary point and a second boundary point on a road is within a coverage area of a corresponding base station if the first boundary point and the second boundary point are both within the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
a third coverage determining unit, configured to determine, if only the third demarcation point is within the coverage area of the corresponding base station, an intermediate point between the third demarcation point and the fourth demarcation point according to the radius of the coverage area of the corresponding base station, and determine that a section between the intermediate point and the third demarcation point is within the coverage area of the corresponding base station.
The embodiment of the present invention is a product embodiment corresponding to the third embodiment of the method, and therefore, detailed description is omitted here, and please refer to the third embodiment.
Referring to fig. 11, fig. 11 is a schematic structural diagram of a first edge node according to a seventh embodiment of the present invention, where 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;
the processor 112 is configured to predict a second edge node to be accessed next by the terminal according to a correspondence between an edge node coverage area and a road;
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 at least part of information required for providing a service for the terminal is missing.
Optionally, the processor 112 is configured to determine a first road where the terminal is currently located according to a first location where the terminal is currently located;
the processor 112 is further configured to predict a road into which the terminal will drive according to a moving direction of the terminal on the first road and a road topology structure;
the processor 112 is further configured to predict at least one second edge node according to a road to be driven into by the terminal and a corresponding relationship between the edge node coverage area and the road.
Optionally, the processor 112 is configured to predict a road to be driven into by the terminal in a preset area according to a moving direction of the terminal on the first road and a road topology;
wherein a 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 single edge node coverage area.
Optionally, the processor 112 is configured to predict a road and a road segment thereof to be driven into by the terminal in a preset area according to a moving direction of the terminal on the first road and a road topology structure;
the processor 112 is further configured to predict at least one second edge node according to a road to be driven into by the terminal, a road section of the road, and a corresponding relationship between the edge node coverage area and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
The embodiment of the present invention is a product embodiment corresponding to the above method embodiment, and therefore, detailed description is omitted here, and please refer to the first embodiment in detail.
Referring to fig. 12, fig. 12 is a schematic structural diagram of a second edge node according to an eighth embodiment of the present invention, where the second edge node is an edge node that is predicted by a first edge node according to a correspondence between an edge node coverage area and a road and is to be accessed next by a terminal, the first edge node is an edge node that is currently accessed by the terminal, and the second edge node 120 includes: a transceiver 121 and a processor 122;
the transceiver 121 is configured to receive first information sent by the first edge node;
the processor 122, configured to determine whether at least part of information required for providing a service for the terminal is missing after receiving the first information;
the transceiver 121 is further configured to initiate multi-operator data synchronization if the absence is determined.
Optionally, the first edge node and the second edge node both belong to a first operator;
the processor 122, 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 partial coverage area of the second edge node;
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 of information required by the second edge node to provide a service for the terminal.
Optionally, the processor 122 is configured to determine the third edge node according to a correspondence between an edge node coverage area of a second operator and a road.
Optionally, the transceiver 121 is configured to receive missing information of information required to provide a service for the terminal, where the missing information is sent by the third edge node, so as to provide the service for the terminal; or,
the transceiver 121 is configured to send existing information required for providing a service for the terminal to the third edge node, so that the third edge node provides the service for the terminal.
Optionally, the processor 122 is further configured to delete the synchronized data if the synchronized data is still unused after a preset duration; and/or deleting the synchronized data if the terminal has left the coverage area of the second edge node.
The embodiment of the present invention is a product embodiment corresponding to the above method embodiment, and therefore, detailed description is omitted here, and please refer to the second embodiment.
Referring to fig. 13, fig. 13 is a schematic structural diagram of an electronic device according to a ninth embodiment of the present invention, where the electronic device 130 includes: a transceiver 131 and a processor 132;
the processor 132 is configured to determine a road covered by each preset base station according to a distance between the road and the preset base station and a radius of a coverage area of the preset base station;
the processor 132 is further configured to determine, for each preset edge node, a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
the processor 132 is further configured to establish a corresponding relationship between an edge node coverage area and a road according to the road covered by each preset edge node;
the transceiver 131 is configured to send at least part of content in a correspondence between the edge node coverage area and the road to a target edge node in the preset edge nodes, where the at least part of content in the correspondence between the edge node coverage area and the road includes a correspondence between a coverage area of a preset edge node adjacent to the target edge node and the road.
Optionally, the correspondence between the edge node coverage area and the road includes a correspondence between the edge node coverage area and a road segment of the road;
the processor 132 is configured to determine a demarcation point every preset distance from one end of a road, and divide the road into a plurality of road segments;
the processor 132 is further configured to calculate a first distance between each of the dividing points and a central point of a coverage area of each preset base station, and compare the first distance with a radius of a coverage area of a corresponding base station;
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;
the processor 132 is further configured to determine that a segment between a first demarcation point and a second demarcation point on a road is within the coverage area of a corresponding base station if the first demarcation point and the second demarcation point are both within the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
the processor 132 is further configured 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 is within the coverage area of the corresponding base station, and determine that a section between the intermediate point and the third dividing point is within the coverage area of the corresponding base station.
The embodiment of the present invention is a product embodiment corresponding to the third embodiment of the method, and therefore, detailed description is omitted here, and please refer to the third embodiment.
Referring to fig. 14, fig. 14 is a schematic structural diagram of a first edge node according to a tenth embodiment of the present invention, where the first edge node is an edge node currently accessed by a terminal, and the terminal first edge node 140 includes a processor 141, a memory 142, and a program stored in the memory 142 and capable of running on the processor 141; the processor 141, when executing the program, implements the following steps:
predicting a second edge node to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road;
and sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing the service for the terminal is determined to be lost by the second edge node.
Optionally, the processor 141 may further implement the following steps when executing the program:
the predicting a second edge node to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road includes:
determining a first road where the terminal is located according to a first position where the terminal is located currently;
predicting a road to be driven into by the terminal according to the moving direction of the terminal on the first road and the road topological structure;
and predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the coverage area of the edge node.
Optionally, the processor 141 may further implement the following steps when executing the program:
the predicting the road to be driven into by the terminal according to the moving direction of the terminal on the first road and the road topological structure comprises the following steps:
predicting a road into which the terminal will drive in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
wherein a 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 single edge node coverage area.
Optionally, the processor 141 may further implement the following steps when executing the program:
the predicting a road into which the terminal will drive in a preset area according to the moving direction of the terminal on the first road and the road topological structure comprises the following steps:
predicting a road and a road section thereof to be driven into by the terminal in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
the predicting at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the corresponding relation between the edge node coverage area and the road includes:
predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal, the road section of the road and the coverage area of the edge node and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
The specific working process of the embodiment of the present invention is the same as that of the first embodiment of the method, and therefore, detailed description is not repeated here, and please refer to the description of the method steps in the first embodiment.
Referring to fig. 15, fig. 15 is a schematic structural diagram of a second edge node according to an eleventh embodiment of the present invention, where the second edge node 150 includes a processor 151, a memory 152, and a program stored in the memory 152 and capable of running on the processor 151; the second edge node is an edge node to be accessed next by the terminal, which is predicted by the first edge node according to the corresponding relationship between the edge node coverage area and the road, and the first edge node is an edge node to which the terminal is currently accessed, and the processor 151 implements the following steps when executing the program:
receiving first information sent by the first edge node;
after receiving the first information, determining whether the first information lacks at least part of information required for providing service for the terminal;
and if the data are determined to be missing, starting the data synchronization of the multiple operators.
Optionally, the first edge node and the second edge node both belong to a first operator;
the processor 151 may further implement the following steps when executing the program:
the initiating multi-operator data synchronization comprises:
determining a third edge node, the third edge node belonging to a second operator, a coverage area of the third edge node comprising at least a partial coverage area of the second edge node;
and under the condition that the third edge node is determined to be capable of providing missing information of information required by the second edge node for providing the service for the terminal, performing data synchronization with the third edge node.
Optionally, when the processor 151 executes the program, the following steps may be further implemented:
the determining a third edge node includes:
and determining the third edge node according to the corresponding relation between the edge node coverage area of the second operator and the road.
Optionally, when the processor 151 executes the program, the following steps may be further implemented:
the performing data synchronization with the third edge node includes:
receiving missing information of information required for providing service for the terminal, which is sent by the third edge node, so as to provide service for the terminal; or,
and sending the existing information required for providing the service for the terminal to the third edge node so as to provide the service for the terminal by the third edge node.
Optionally, when the processor 151 executes the program, the following steps may be further implemented:
after the starting of the multi-operator data synchronization, the method further comprises:
if the synchronous data are still not used after the preset duration, deleting the synchronous data; and/or the presence of a gas in the gas,
and if the terminal leaves the coverage area of the second edge node, deleting the synchronous data.
The specific working process of the embodiment of the present invention is the same as that of the second embodiment of the method, and therefore, the detailed description thereof is omitted, and refer to the description of the method steps in the second embodiment.
Referring to fig. 16, fig. 16 is a schematic structural diagram of an electronic device according to a twelfth embodiment of the present invention, where the electronic device 160 includes a processor 161, a memory 162, and a program stored in the memory 162 and capable of running on the processor 161; the processor 161, when executing the program, implements the steps of:
determining a 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;
for each preset edge node, determining a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
establishing a corresponding relation between an edge node coverage area and a road according to the road covered by each preset edge node;
and sending at least part of content in the corresponding relation between the edge node coverage area and the road to a target edge node in the preset edge nodes, wherein the at least part of content in the corresponding relation between the edge node coverage area and the road comprises the corresponding relation between the coverage area of the preset edge node adjacent to the target edge node and the road.
Optionally, when the processor 161 executes the program, the following steps may be further implemented:
the corresponding relation between the edge node coverage area and the road comprises the corresponding relation between the edge node coverage area and a road section of the road;
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 comprises the following steps:
determining a demarcation point every preset distance from one end of a road, and dividing the road into a plurality of road sections;
calculating a first distance between each demarcation point and the central point of the coverage area of each preset base station, and comparing the first distance with the radius of the coverage area of the corresponding base station;
if the first distance is smaller than or equal to the radius of the coverage area of the corresponding base station, determining that the demarcation point is in the coverage area of the corresponding base station;
if a first boundary point and a second boundary point on one road are both in the coverage area of the corresponding base station, determining that a section between the first boundary point and the second boundary point is in the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
if only the third boundary point of the third boundary point and the fourth boundary point on one road is in the coverage area of the corresponding base station, determining a middle point between the third boundary point and the fourth boundary point according to the radius of the coverage area of the corresponding base station, and determining that a road section between the middle point and the third boundary point is in the coverage area of the corresponding base station.
The specific working process of the embodiment of the present invention is the same as that of the second embodiment of the method, and therefore, the detailed description thereof is omitted, and refer to the description of the method steps in the second embodiment.
A thirteenth embodiment of the present invention provides a readable storage medium, on which a program is stored, where the program, when executed by a processor, implements the steps in the data synchronization method in the first embodiment or the steps in the data synchronization method in the second embodiment or the steps in the information transmission method in the third embodiment. Please refer to the above description of the method steps in the corresponding embodiments.
The terminal in the embodiments of the present invention may be a wireless terminal or a wired terminal, and the wireless terminal may be a device providing voice and/or other service data connectivity to a user, a handheld device having a wireless connection function, or other processing devices connected to a wireless modem. A wireless terminal, which may be a mobile terminal such as a mobile telephone (or "cellular" telephone) and a computer having a mobile terminal, e.g., a portable, pocket, hand-held, computer-included, or vehicle-mounted mobile device, may communicate with one or more core networks via a Radio Access Network (RAN), and may exchange language and/or data with the RAN. For example, devices such as Personal Communication Service (PCS) phones, cordless phones, Session Initiation Protocol (SIP) phones, Wireless Local Loop (WLL) stations, and Personal Digital Assistants (PDAs) are used. A wireless Terminal may also be referred to as a system, a Subscriber Unit (Subscriber Unit), a Subscriber Station (Subscriber Station), 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), and a Terminal (User Device or User Equipment), which are not limited herein.
The readable storage medium includes a computer readable storage medium. Computer-readable storage media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, 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, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (20)

1. A data synchronization method is applied to a first edge node, wherein the first edge node is an edge node currently accessed by a terminal, and the method comprises the following steps:
predicting a second edge node to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road;
and sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing the service for the terminal is determined to be lost by the second edge node.
2. The method according to claim 1, wherein the predicting a second edge node to be accessed by the terminal next according to the corresponding relation between the edge node coverage area and the road comprises:
determining a first road where the terminal is located according to a first position where the terminal is located currently;
predicting a road into which the terminal will drive according to the moving direction of the terminal on the first road and the road topological structure;
and predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the coverage area of the edge node.
3. The method according to claim 2, wherein predicting the road into which the terminal will enter according to the moving direction of the terminal on the first road and the road topology comprises:
predicting a road into which the terminal will drive in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
wherein a 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 single edge node coverage area.
4. The method according to claim 3, wherein the predicting the road to be entered by the terminal in the preset area according to the moving direction of the terminal on the first road and the road topology comprises:
predicting a road and a road section thereof to be driven into by the terminal in a preset area according to the moving direction of the terminal on the first road and the road topological structure;
the predicting at least one second edge node according to the corresponding relation between the road to be driven into by the terminal and the road and the corresponding relation between the edge node coverage area and the road includes:
predicting to obtain at least one second edge node according to the corresponding relation between the road to be driven into by the terminal, the road section of the road and the coverage area of the edge node and the road; the corresponding relation comprises a corresponding relation between the edge node coverage area and the road section of the road.
5. A data synchronization method is applied to a second edge node, wherein the second edge node is an edge node which is predicted by a first edge node according to a corresponding relation between an edge node coverage area and a road and is to be accessed next by a terminal, and the first edge node is an edge node which is accessed by the terminal currently, and the method comprises the following steps:
receiving first information sent by the first edge node;
after receiving the first information, determining whether the first information lacks at least part of information required for providing service for the terminal;
and if the data are determined to be missing, starting the data synchronization of the multiple operators.
6. The method of claim 5, wherein the first edge node and the second edge node both belong to a first operator;
the initiating multi-operator data synchronization comprises:
determining a third edge node, the third edge node belonging to a second operator, a coverage area of the third edge node comprising at least a partial coverage area of the second edge node;
and under the condition that the third edge node is determined to be capable of providing missing information of information required by the second edge node for providing the service for the terminal, performing data synchronization with the third edge node.
7. The method of claim 6, wherein determining the third edge node comprises:
and determining the third edge node according to the corresponding relation between the edge node coverage area of the second operator and the road.
8. The method of claim 6, wherein the synchronizing data with the third edge node comprises:
receiving missing information of information required for providing service for the terminal, which is sent by the third edge node, so as to provide service for the terminal; or,
and sending the existing information required for providing the service for the terminal to the third edge node so as to provide the service for the terminal by the third edge node.
9. The method of claim 5, wherein after initiating the multi-carrier data synchronization, further comprising:
if the synchronous data are still not used after the preset duration, deleting the synchronous data; and/or deleting the synchronized data if the terminal has left the coverage area of the second edge node.
10. An information transmission method applied to electronic equipment is characterized by comprising the following steps:
determining a 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;
for each preset edge node, determining a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
establishing a corresponding relation between an edge node coverage area and a road according to the road covered by each preset edge node;
and sending at least part of content in the corresponding relation between the edge node coverage area and the road to a target edge node in the preset edge nodes, wherein the at least part of content in the corresponding relation between the edge node coverage area and the road comprises the corresponding relation between the coverage area of the preset edge node adjacent to the target edge node and the road.
11. The method of claim 10, wherein the edge node coverage area to road correspondence comprises edge node coverage area to road segment correspondence;
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 comprises the following steps:
determining a demarcation point every preset distance from one end of a road, and dividing the road into a plurality of road sections;
calculating a first distance between each demarcation point and the central point of the coverage area of each preset base station, and comparing the first distance with the radius of the coverage area of the corresponding base station;
if the first distance is smaller than or equal to the radius of the coverage area of the corresponding base station, determining that the demarcation point is in the coverage area of the corresponding base station;
if a first boundary point and a second boundary point on one road are both in the coverage area of the corresponding base station, determining that a section between the first boundary point and the second boundary point is in the coverage area of the corresponding base station; the first demarcation point and the second demarcation point are two adjacent demarcation points;
if only the third boundary point of the third boundary point and the fourth boundary point on one road is in the coverage area of the corresponding base station, determining a middle point between the third boundary point and the fourth boundary point according to the radius of the coverage area of the corresponding base station, and determining that a road section between the middle point and the third boundary point is in the coverage area of the corresponding base station.
12. A first edge node, where the first edge node is an edge node currently accessed by a terminal, the method comprising:
the prediction module is used for predicting a second edge node which is to be accessed next by the terminal according to the corresponding relation between the edge node coverage area and the road;
and the first information sending module is used for sending first information to the second edge node, so that the second edge node starts multi-operator data synchronization under the condition that at least part of information required for providing service for the terminal is determined to be lost.
13. A second edge node, where the second edge node is an edge node to be accessed next to a terminal, which is predicted by a first edge node according to a correspondence between an edge node coverage area and a road, and the first edge node is an edge node to which the terminal is currently accessed, and the second edge node includes:
a first information receiving module, configured to receive first information sent by the first edge node;
a determining module, configured to determine whether at least part of information required for providing a service for the terminal is missing after receiving the first information;
and the synchronization module is used for starting the data synchronization of the multiple operators if the data synchronization is determined to be missing.
14. A first edge node, where the first edge node is an edge node currently accessed by a terminal, the method comprising: a transceiver and a processor;
the processor is used for predicting a second edge node to be accessed next by the terminal according to the corresponding relation 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 at least part of information required for providing a service for the terminal is missing.
15. A second edge node, where the second edge node is an edge node to be accessed next to a terminal, which is predicted by a first edge node according to a correspondence between an edge node coverage area and a road, and the first edge node is an edge node to which the terminal is currently accessed, and the second edge node includes: a transceiver and a processor;
the transceiver is used for receiving first information sent by the first edge node;
the processor is used for determining whether the processor lacks at least part of information required for providing service for the terminal after receiving the first information;
the transceiver is further configured to initiate multi-operator data synchronization if the absence is determined.
16. An electronic device, comprising: a transceiver and a processor;
the processor is used for 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;
the processor is further configured to determine, for each preset edge node, a road covered by the preset edge node according to roads covered by all the preset base stations under the preset edge node;
the processor is further configured to establish a corresponding relationship between an edge node coverage area and a road according to the road covered by each preset edge node;
the transceiver is configured to send at least part of content in a correspondence between the edge node coverage area and the road to a target edge node in the preset edge nodes, where the at least part of content in the correspondence between the edge node coverage area and the road includes a correspondence between a coverage area of a preset edge node adjacent to the target edge node and the road.
17. A first edge node, which is an edge node currently accessed by a terminal, and comprises a memory, a processor and a program stored in the memory and capable of running on the processor; characterized in that the processor implements the steps in the data synchronization method according to any one of claims 1 to 4 when executing the program.
18. A second edge node comprising a memory, a processor, and a program stored on the memory and executable on the processor; the method is characterized in that the second edge node is an edge node which is predicted by a first edge node according to a corresponding relation between an edge node coverage area and a road and is to be accessed next by a terminal, the first edge node is an edge node which is accessed currently by the terminal, and the processor implements the steps in the data synchronization method according to any one of claims 5 to 9 when executing the program.
19. An electronic device comprising a memory, a processor, and a program stored on the memory and executable on the processor; characterized in that the processor implements the steps in the information transmission method according to claim 10 or 11 when executing the program.
20. A readable storage medium, on which a program is stored, which program, when being executed by a processor, carries out 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 9 or the steps of the information transmission method according to claim 10 or 11.
CN202011218574.8A 2020-11-04 2020-11-04 Data synchronization method, information transmission method and equipment Pending CN114449640A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011218574.8A CN114449640A (en) 2020-11-04 2020-11-04 Data synchronization method, information transmission method and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011218574.8A CN114449640A (en) 2020-11-04 2020-11-04 Data synchronization method, information transmission method and equipment

Publications (1)

Publication Number Publication Date
CN114449640A true CN114449640A (en) 2022-05-06

Family

ID=81361850

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011218574.8A Pending CN114449640A (en) 2020-11-04 2020-11-04 Data synchronization method, information transmission method and equipment

Country Status (1)

Country Link
CN (1) CN114449640A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116208625A (en) * 2023-05-06 2023-06-02 浪潮通信技术有限公司 Information synchronization method, device, electronic equipment and computer readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070155399A1 (en) * 2005-12-29 2007-07-05 Alberth William P Jr Devices and methods for synchronizing location information in an access point
US20140071804A1 (en) * 2012-09-13 2014-03-13 International Business Machines Corporation Utilizing stored data to reduce packet data loss in a mobile data network with data breakout at the edge
JP2015125065A (en) * 2013-12-26 2015-07-06 株式会社ゼンリン Route search device
WO2017070776A1 (en) * 2015-10-26 2017-05-04 Sierra Wireless, Inc. Cognitive wireless system - predicted overlap

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070155399A1 (en) * 2005-12-29 2007-07-05 Alberth William P Jr Devices and methods for synchronizing location information in an access point
US20140071804A1 (en) * 2012-09-13 2014-03-13 International Business Machines Corporation Utilizing stored data to reduce packet data loss in a mobile data network with data breakout at the edge
JP2015125065A (en) * 2013-12-26 2015-07-06 株式会社ゼンリン Route search device
WO2017070776A1 (en) * 2015-10-26 2017-05-04 Sierra Wireless, Inc. Cognitive wireless system - predicted overlap

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116208625A (en) * 2023-05-06 2023-06-02 浪潮通信技术有限公司 Information synchronization method, device, electronic equipment and computer readable storage medium

Similar Documents

Publication Publication Date Title
US10595253B2 (en) Systems and methods for directing mobile device connectivity
US9775001B2 (en) Method and system of providing data service according to a user's future location
KR101649057B1 (en) Mobile handover management method, apparatus and system in wireless communication network
CN104902529B (en) A kind of method for switching network, device and base station
EP2412191B1 (en) Apparatus and methods of whitespace communication
US20090061862A1 (en) Peer to peer service discovery sharing
US20150163711A1 (en) Method and radio access node for incorporating a moving cell in a wireless communication network
JP2007318354A (en) Communication device for mobile and communication method for mobile
Bi Neighboring vehicle-assisted fast handoff for vehicular fog communications
US20210166567A1 (en) Vehicle platooning
Hagenauer et al. Parked cars as virtual network infrastructure: Enabling stable V2I access for long-lasting data flows
CN103813364A (en) Mobile self-organizing network interrupt data recovery method based on area perception
CN106357729A (en) D2D content distribution method based on regional cooperation cache
EP3069532B1 (en) Scheduling download of data of an on-line service
EP1215930B1 (en) Transceiver station and method for use in cellular radio communications
EP2615857A1 (en) Method for determining a future location of a mobile electronic device
JP2009225011A (en) Base station device and handover control method
CN114449640A (en) Data synchronization method, information transmission method and equipment
CN113711655A (en) Method for predicting modification of link condition of terminal to cellular network
Aljeri et al. An optimized link duration-based mobility management scheme for connected vehicular networks
CN103581016A (en) Vehicle network routing method
CN112449382B (en) Data transmission method and server
Wu et al. A geographic routing protocol based on trunk line in VANETs
CN112449398B (en) Path selection method and core network equipment
KR100540833B1 (en) Handover Method In The Mobile Communication System

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination