An efficient distribution and sharing method for edge information in highly mobile environments

Abstract

The present invention discloses an efficient distribution and sharing method for edge information in a high-mobility environment, comprising the following steps: receiving, on any starting edge communication node, a receiving application software, information to be distributed, its information distribution range type, and a list requirement submitted by a cached upper-layer sending application software; determining a next-round relay node and its corresponding distribution parameters according to the information distribution range type and the list requirement, and transmitting the receiving application software, information to be distributed, and related parameters to the next-round relay node when communication conditions are met; after receiving and caching the information, the relay node delivers the information to be distributed to the local receiving application, and determines whether to continue relaying according to the distribution range type: if necessary, a new relay node is determined and the transmission is performed; otherwise, the relay process is terminated; the present invention helps to improve the practicality and application efficiency of the edge information distribution and sharing of the system.

Description

Technical Field

[0001] The present invention relates to the field of edge computing technology, and in particular to a method for efficiently distributing and sharing edge information in a highly mobile environment. Background Art

[0002] Edge environments host a vast array of information devices used to build small and medium-sized information systems. However, these devices possess varying hardware and software resources, with varying performance levels and even poor performance. Furthermore, complex terrain and weather conditions often impact mobility, leading to limited communication resources and weak connectivity at the edge. To provide enhanced and quality-assured mobile information sharing support for all types of edge information systems, a reliable, weakly connected information distribution pathway can be constructed. This approach sequentially identifies relay nodes along the upstream, neighboring, and downstream flows of each message. All relay nodes are monitored, cached, and then distributed when appropriate, collaboratively distributing information at the edge. Furthermore, this approach can meet the demands of highly mobile and weakly connected scenarios, making minimal use of edge communication resources. It supports reliable and efficient cross-node information sharing in distributed system applications, enabling them to conduct relevant business operations while also improving the efficiency of communication and other resource utilization and system availability. Efficient information distribution and sharing technologies applicable to highly mobile and weakly connected edge communication environments have become essential considerations in the overall planning of information system software service platforms.

[0003] Currently, there is no method for efficient information distribution and sharing under conditions of high edge mobility and weak connection communication. Therefore, it has become an urgent need for the current information system construction to comprehensively design a lightweight method to distribute application information under conditions of high edge mobility, support the efficient availability of weak connection under which physical distributed system applications share information across nodes, and reduce the risks of inefficient information distribution and sharing in distributed systems due to limited edge communication resources. Summary of the Invention

[0004] Purpose of the invention: The purpose of the present invention is to provide a method for efficient distribution and sharing of edge information in a high-mobility environment, based on edge application scenarios to achieve reliable, time-saving and autonomous delivery of edge shared information under high-mobility conditions to solve the problems existing in the background technology.

[0005] Technical solution: The present invention provides a method for efficiently distributing and sharing edge information in a highly mobile environment, characterized by comprising the following steps:

[0006] S1. Receive and cache the receiving application software, the information to be distributed, the type of information distribution range, and the list requirements submitted by the upper-layer sending application software at any starting edge communication node;

[0007] S2. Determine the next relay node and its corresponding distribution parameters based on the information distribution range type and list requirements, and transmit the recipient application software, the information to be distributed, and related parameters to the next relay node when communication conditions are met;

[0008] S3. After the relay node receives and caches the information, it delivers the information to be distributed to the local recipient application and determines whether to continue relaying based on the distribution range type: if necessary, repeat S2 to determine a new relay node and transmit; otherwise, terminate the relay process.

[0009] Furthermore, in step S1, the information distribution range types include: full network node mode, covering all nodes in the edge address book; hierarchical expansion mode, including all upper nodes, all lower nodes and directly lower nodes; topological association mode, including the same direct friendly neighbor nodes and directly upper friendly neighbor nodes; directed designation mode, accurately specifying the target node through the node ID list.

[0010] Furthermore, step S1 includes the following steps:

[0011] S1-1 Create an information to be distributed item at the starting node, and associate and store the recipient application software and the information to be distributed;

[0012] S1-2 record distribution parameters include source node identification, relay status mark and relay node list;

[0013] S1-3 adds the information to be distributed to the node task queue. The relay status mark includes two states: to be determined and confirmed. The relay node list records the communication status of the relay nodes in each direction.

[0014] Furthermore, the relay node list includes: an uplink relay node group, which points to an upper-level node at a higher level; a friendly relay node group, which points to a parallel node at the same level; a downlink relay node group, which points to a lower-level node under direct jurisdiction; each relay node entry includes a node ID, a distribution range type, a target list, and a transmission status mark.

[0015] Furthermore, in step S2, the logic for determining the relay nodes includes: when the distribution range is the entire network of nodes, the relay nodes in the uplink, downlink and friendly directions are activated at the same time; when the distribution range is a specified node, the optimal relay path is selected according to the topological position of the target node; after each relay transmission, the target node list is updated to exclude the covered nodes.

[0016] Furthermore, the relay node selection strategy includes: prioritizing the directly superior node as the first-hop relay in the uplink direction; using broadcasting to cover all nodes at the same level in the friendly direction; selecting the directly subordinate node step by step according to the jurisdiction relationship in the downlink direction; and automatically switching to the backup relay node when encountering a communication interruption and maintaining data integrity.

[0017] Furthermore, the communication transmission in step S3 adopts: a connectionless transmission mechanism based on the UDP protocol; a data packet sending and response confirmation mechanism; a dynamically adjusted packet size and a retransmission timeout mechanism.

[0018] Furthermore, step S3 includes a status feedback mechanism: after each relay node completes local distribution, it sends a status confirmation message to the source node; the source node maintains a global distribution status table and updates the task progress of each relay node in real time; when an unconfirmed node is detected, automatic rerouting or local cache retransmission is initiated.

[0019] An electronic device described in the present invention includes a memory, a processor, and a computer program stored in the memory, and the processor implements the steps of any one of the methods when executing the program.

[0020] The computer-readable storage medium of the present invention stores a computer program, which implements the steps of any one of the methods when executed by a processor.

[0021] Beneficial effects: Compared with the existing technology, the present invention has the following significant advantages: In a highly mobile and weakly connected communication environment at the edge, the present invention determines relay nodes one by one along the upstream, friendly, and downstream directions of each information, monitors all relay nodes, caches them first, and then distributes information when appropriate, and collaboratively builds a weakly connected reliable information distribution channel to support distributed system applications to reliably and efficiently share information across nodes. The method of the present invention not only supports the efficient distribution of information shared across nodes in distributed systems, but also realizes the application of efficient information distribution and sharing in scenarios facing highly mobile environments, making it more practical for business information systems such as motor vehicles, ships, and aircraft, and supports distributed system applications to reliably and efficiently share information across nodes so that related businesses can be carried out based on them, which helps to improve the practicality and application efficiency of information distribution and sharing at the edge of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 Schematic diagram of an application scenario of the present invention;

[0023] Figure 2 A schematic diagram of the process of submitting information cache for the application of the present invention;

[0024] Figure 3 This is a schematic diagram of the process of timely distributing the first round of information of the present invention;

[0025] Figure 4 This is a schematic diagram of the process of network-wide information distribution and relaying of the present invention. DETAILED DESCRIPTION

[0026] The technical solution of the present invention will be further described below with reference to the accompanying drawings.

[0027] like Figure 1As shown, an embodiment of the present invention provides a method for efficiently distributing and sharing edge information in a high-mobility environment, comprising the following steps:

[0028] Step 1: Application submission information cache; receive the receiving application software, the information to be distributed, its information distribution range type, and the list requirements submitted by the upper-layer sending application software at any starting edge communication node.

[0029] The edge communication node refers to a node including an edge node that can communicate with the edge node;

[0030] The information distribution range types include all network nodes, all upper nodes, all lower nodes, directly lower nodes, directly affiliated friendly neighbor nodes, directly affiliated upper friendly neighbor nodes and designated nodes, wherein all network nodes refer to all nodes in the edge address book, all upper nodes refer to all directly and indirectly affiliated upper nodes of the local node in the edge address book, all lower nodes refer to all lower nodes of the local node in the edge address book, directly affiliated lower nodes refer to all directly affiliated lower nodes of the local node in the edge address book, directly affiliated friendly neighbor nodes refer to all directly affiliated friendly neighbor nodes with the same direct subordinate as the local node in the edge address book, directly affiliated upper friendly neighbor nodes refer to the directly affiliated upper and directly affiliated friendly neighbor nodes of the local node in the edge address book, and designated nodes refer to any designated number of nodes in the edge address book;

[0031] The information distribution range list is a list of designated nodes of the upper-layer sending application software when the information distribution range type is designated nodes, including the node IDs of all nodes designated by the upper-layer sending application software.

[0032] like Figure 2 As shown, the detailed steps for applying submission information cache are as follows:

[0033] (1.1) Receiving the distribution information submitted by the sending application. At the starting edge communication node, the receiving application software, the information to be distributed, its information distribution scope type, and the list requirements submitted by the upper-layer sending application software are received;

[0034] (1.2) Temporary storage of distribution information submitted by the sending application. On the starting edge communication node, the receiving application software, the information to be distributed, its information distribution scope type, and list requirements submitted by the upper-layer sending application software are temporarily stored;

[0035] (1.3) Create a new information distribution item for the sender's application. On the originating edge communication node, create a new information distribution item based on the recipient's application software, the information to be distributed, its information distribution scope type, and the list requirements.

[0036] The information to be distributed includes the recipient's application software, the information to be distributed and its information distribution range type, a link to the list requirements, as well as the sender's node ID, the next round of relay node determination status, and the next round of relay node relay status list, where the next round of relay node determination status is divided into pending and determined. The next round of relay node relay status list includes the node IDs of the next round of uplink relay nodes, the next round of downlink relay nodes, and the next round of friendly relay nodes, and the node relay status, where the node relay status is divided into not started, accepted, and completed;

[0037] The newly added information to be distributed items based on the recipient's application software, the information to be distributed, its information distribution range type, and the list requirements include:

[0038] (1.3.1) Create information to be distributed and link the recipient application software, the information to be distributed, its distribution scope type, and list requirements;

[0039] (1.3.2) For items related to pending information distribution, initialize the sender node ID to the local node ID, the next round relay node confirmation status to pending, and the next round relay node relay status list to empty;

[0040] (1.3.3) Add the newly created information to be distributed to the list of information to be distributed.

[0041] Step 2: Distribute information at an appropriate time; determine the next round of relay nodes and their information distribution range type and list requirements based on the information distribution range type and list requirements, and deliver the recipient application software, the information to be distributed, and its information distribution range type and list requirements to the next round of relay nodes when the communication with the next round of relay nodes is normal.

[0042] The relay nodes include uplink relay nodes, friendly relay nodes, and downlink relay nodes, wherein the uplink relay node refers to the nearest node to which the local node is to distribute information to the directly superior node, the friendly relay node refers to the nearest node to which the local node is to distribute information to one of several directly subordinate friendly nodes, and the downlink relay node refers to the nearest node to which the local node is to distribute information to one of several directly subordinate nodes.

[0043] like Figure 3 As shown, the detailed steps for the first round of information distribution are as follows:

[0044] (2.1) Determination of the first round of relay nodes and their scope. At the starting edge communication node, the next round of uplink relay nodes, next round of downlink relay nodes, next round of friendly relay nodes, and the information distribution scope type and list requirements for each next round of relay nodes are determined based on the information distribution scope type and list requirements.

[0045] The determination of the next round of uplink relay nodes, the next round of downlink relay nodes, the next round of friendly relay nodes, and the information distribution scope type and list requirements for each next round of relay nodes in combination with the information distribution range type and list requirements includes:

[0046] (2.1.1) Determination of the next round of uplink relay nodes. Determine the next round of uplink relay nodes and their information distribution range type and list requirements in combination with the information distribution range type and list requirements: When the information distribution range type is all network nodes or all upper-level nodes, the next round of uplink relay nodes is the direct upper-level node of the local node, and the required information distribution range type is all upper-level nodes. The information distribution range list does not need to be supplemented; when the information distribution range type is all lower-level nodes, direct lower-level nodes, and directly affiliated friendly nodes, there is no need for the next round of uplink relay nodes; when the information distribution range type is directly affiliated with the friendly node, the next round of uplink relay nodes is not required. If the node is a direct superior node of the local node and the required information distribution range type is None, the information distribution range list does not need to be supplemented. If the information distribution range type is Designated Node, and if there is a direct or indirect superior node of the local node in the Designated Node List, the next-round uplink relay node is the node closest to the local node among the direct or indirect superior nodes of the local node in the Designated Node List, the required information distribution range type is Designated Node, and the information distribution range list includes the node IDs of all superior nodes of the local node in the Designated Node List except the next-round uplink relay node.

[0047] (2.1.2) Determination of the next round of downlink relay nodes. Determine the next round of downlink relay nodes and their information distribution range type and list requirements in combination with the information distribution range type and list requirements: When the information distribution range type is all network nodes or all lower-level nodes, the next round of downlink relay nodes are all direct lower-level nodes of the local node, and the required information distribution range type is all lower-level nodes. The information distribution range list does not need to be supplemented; when the information distribution range type is all upper-level nodes, directly affiliated friendly nodes, and directly affiliated friendly nodes, the next round of downlink relay nodes are not required; when the information distribution range type is directly affiliated nodes, the next round of downlink relay nodes are all directly affiliated nodes of the local node. For a first-level node, if the required information distribution range type is none, the information distribution range list does not need to be supplemented; when the information distribution range type is designated node, if there are subordinate nodes of the local node in the designated node list, the next-round downlink relay node is the node closest to the local node in the direction of each direct subordinate node of the local node among the subordinate nodes of the local node in the designated node list, the information distribution range type required for each next-round downlink relay node is designated node, and the information distribution range list includes the node IDs of all subordinate nodes in the designated node list in the direction of the corresponding direct subordinate nodes of the local node except the corresponding next-round downlink relay node;

[0048] (2.1.3) Determination of the next round of friendly relay nodes. The next round of friendly relay nodes and their information distribution scope type and list requirements are determined based on the information distribution scope type and list requirements: When the information distribution scope type is all network nodes, all upper-level nodes, same-direct friendly nodes, or directly upper-level friendly nodes, the next round of friendly relay nodes are all the local node's same-direct friendly nodes. The required information distribution scope type for these nodes is all lower-level nodes, and the information distribution scope list does not need to be supplemented. When the information distribution scope type is all lower-level nodes or directly lower-level nodes, no next round of friendly relay nodes is required. When the information distribution scope type is designated nodes, if the local node's same-direct friendly nodes are included in the designated node list, the next round of friendly relay nodes are all the local node's same-direct friendly nodes in the designated node list. The required information distribution scope type for each next round of friendly relay nodes is designated nodes. The information distribution scope list includes the node IDs of all lower-level nodes in the designated node list in the direction of the local node's corresponding same-direct friendly nodes, excluding the corresponding next round of friendly relay nodes.

[0049] (2.2) Status update of the starting pending distribution items. On the starting edge communication node, the next round relay node confirmation status of the corresponding information pending distribution items in the information pending distribution items list is updated to confirmed. The node IDs of the next round uplink relay nodes, next round downlink relay nodes, and next round friendly relay nodes in the next round relay node relay status list are updated, as well as the information distribution range type and list requirements for each next round relay node. The node relay status of each next round relay node is initialized to not started.

[0050] (2.3) Initially distribute the information to be distributed at an appropriate time. At the starting edge communication node, query and follow up the communication status between the local node and the next round of uplink relay nodes, the next round of downlink relay nodes, and the next round of friendly relay nodes. When the communication with the next round of uplink relay nodes, the next round of downlink relay nodes, or the next round of friendly relay nodes is normal, based on the UDP connectionless transmission protocol applicable to edge high-mobility environments and its packet transmission response timeout retransmission mechanism, deliver the recipient application software, the information to be distributed, its information distribution range type, and the list requirements to the corresponding next round of relay nodes, and update the node relay status of each next round of relay nodes to "accepted".

[0051] Step 3: Information distribution relay for the entire network; the relay node receives and caches the recipient application software, information to be distributed, its information distribution range type, and list requirements delivered by the sending node, and after delivering the information to be distributed to the upper-level recipient application software in the local node, determines whether the next round of relay nodes is needed based on the information distribution range type and list requirements. If so, the next round of relay nodes and their information distribution range type and list requirements are determined, and the recipient application software, information to be distributed, its information distribution range type, and list requirements are delivered to the next round of relay nodes when the communication between the relay nodes and the next round is normal. Otherwise, the information distribution relay ends.

[0052] like Figure 4 As shown, the detailed steps of the network-wide information distribution relay are as follows:

[0053] (3.1) Delivery Relay Node Information Cache. On the relay node, the receiving application software, the information to be distributed, its information distribution scope type, and the list requirements delivered by the sending node are received and temporarily stored, and new information to be distributed items are created based on the receiving application software, the information to be distributed, its information distribution scope type, and the list requirements;

[0054] (3.2) Relay node distribution and local delivery. On the relay node, the information to be distributed is delivered to the upper-layer receiving application software in the local node;

[0055] (3.3) Relay node relay completion determination. On the relay node, determine whether the information distribution range only includes local nodes based on the information distribution range type and list requirements: If yes, the next round of relay nodes is not required, and go to step (3.4); otherwise, the next round of relay nodes is required, and go to step (3.5);

[0056] (3.4) Relay node relay completion processing:

[0057] (3.4.1) Relay Node Relay Completion Report. On the relay node, a message is sent to the sending node to inform the local relay node that the node relay status is completed. The corresponding information to be distributed is then deleted, including the linked recipient application software, the information to be distributed, the type of information distribution range, and the list requirements.

[0058] (3.4.2) Determine the last relay node of the sender. On the sender's node, update the node relay status of the corresponding next-round relay node in the corresponding information to be distributed to completed. Then, determine whether the corresponding next-round relay node is the last one to complete the node relay based on the relay status list of the next-round relay node. If yes, go to step (3.4.3); otherwise, the information distribution relay of the corresponding next-round relay node is completed and the process ends directly.

[0059] (3.4.3) Determine whether the sender is a relay node. On the sender node, determine whether the local node is a relay node, i.e., a non-originating edge node, based on whether the sender node in the corresponding information to be distributed is different from the local node. If yes, proceed to step (3.4.4); otherwise, proceed to step (3.4.5).

[0060] (3.4.4) Sender Node Relay Completion Report. On the sender node, the local node is a relay node. It sends a notification to the sender node in the corresponding information to be distributed, notifying the local relay node that the node relay status is completed. It then deletes the corresponding information to be distributed, including the linked recipient application software, the information to be distributed, its information distribution scope type, and the list requirements. The local relay node's information distribution relay is completed and ends directly.

[0061] (3.4.5) Information distribution completion report for the entire network. On the sending node, the local node is the starting edge communication node, notifying the upper-layer sending application software that information distribution has been completed. It then deletes the corresponding information to be distributed, including the linked receiving application software, the information to be distributed, its information distribution scope type, and the list requirements. The information distribution of the local starting edge communication node is completed and ends directly;

[0062] (3.5) Relay node relay unfinished processing:

[0063] (3.5.1) Determine the next round of relay nodes and their scope. At the relay node, determine the next round of uplink relay nodes, downlink relay nodes, and neighbor relay nodes, as well as the information distribution scope type and list requirements for each next round of relay nodes, based on the information distribution scope type and list requirements.

[0064] (3.5.2) Relay Pending Distribution Item Status Update. On the relay node, the next round relay node confirmation status of the corresponding information pending distribution item in the information pending distribution item list is updated to confirmed. The node IDs of the next round uplink relay node, next round downlink relay node, and next round friendly relay node in the next round relay node relay status list are updated, as well as the information distribution range type and list requirements for each next round relay node. The node relay status of each next round relay node is initialized to not started.

[0065] (3.5.3) Relay information to be distributed at an appropriate time. On the relay node, query and follow up the communication status between the local node and the next round of uplink relay nodes, the next round of downlink relay nodes, and the next round of friendly relay nodes. When the communication with the next round of uplink relay nodes, the next round of downlink relay nodes, or the next round of friendly relay nodes is normal, based on the UDP connectionless transmission protocol applicable to edge high-mobility environments and its packet sending and response timeout retransmission mechanism, deliver the recipient application software, the information to be distributed, its information distribution range type, and the list requirements to the corresponding next round of relay nodes, and update the node relay status of each next round of relay nodes to "accepted";

[0066] (3.5.4) Relay node distribution relay completion waiting. On the relay node, wait for the local relay node's information distribution relay to be completed.

Claims

1. A method for efficient distribution and sharing of edge information in a highly mobile environment, characterized by: The following steps are involved: S1. Receive and cache the receiving application software, the information to be distributed, its information distribution range type, and the target node list submitted by the upper-layer sending application software at any starting edge communication node; wherein the target node list is the designated node list of the upper-layer sending application software in the directional designation mode, including the node IDs of all nodes designated by the upper-layer sending application software; S2. Determine the next round of relay nodes and their corresponding information distribution range types and target node lists based on the information distribution range type and target node list, and transmit the recipient application software, the information to be distributed, its information distribution range type, and target node list to the next round of relay nodes when communication conditions are met; S3. After the relay node receives and caches the information, it delivers the information to be distributed to the local recipient application software and determines whether to continue relaying based on the information distribution range type: if necessary, repeat S2 to determine a new relay node and transmit, otherwise terminate the relay process.

2. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 1, characterized in that: In step S1, the information distribution range types include: full network node mode, covering all nodes in the edge address book; hierarchical expansion mode, including all upper nodes and all lower nodes; topological association mode, including the same direct friendly node and the direct upper friendly node; directed designation mode, accurately specifying the target node through the target node list.

3. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 2, characterized in that: Step S1 includes the following steps: S1-1 Create an information to be distributed item at the starting edge connection node, and associate and store the recipient application software and the information to be distributed; S1-2 record distribution parameters include source node identification, relay status mark and relay node list; S1-3 adds the information to be distributed to the node task queue. The relay status mark includes two states: to be determined and confirmed. The relay node list records the communication status of the relay nodes in each direction.

4. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 3, characterized in that: The relay node list includes: an upstream relay node group, which points to the upstream node at a higher level; a friendly relay node group, which points to the parallel nodes at the same level; and a downstream relay node group, which points to the downstream nodes under direct jurisdiction. Each relay node entry includes a node ID, information distribution range type, a target node list, and a transmission status mark.

5. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 1, characterized in that: In step S2, the logic for determining relay nodes includes: when the distribution range is the entire network of nodes, the relay nodes in the uplink, downlink and friendly directions are activated simultaneously; when the distribution range is a specified node, the optimal relay path is selected according to the topological position of the target node; after each relay transmission, the target node list is updated to exclude the covered nodes.

6. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 5, characterized in that: The relay node selection strategy includes: prioritizing the directly superior node as the first-hop relay in the upstream direction; using broadcast to cover all nodes at the same level in the friendly direction; selecting the directly subordinate node step by step according to the jurisdiction relationship in the downstream direction; and automatically switching to the backup relay node when encountering a communication interruption to maintain data integrity.

7. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 1, characterized in that: The communication transmission in step S3 adopts: a connectionless transmission mechanism based on the UDP protocol; a data packet sending and response confirmation mechanism; a dynamically adjusted packet size and a retransmission timeout mechanism.

8. The method for efficient distribution and sharing of edge information in a highly mobile environment according to claim 1, characterized in that: Step S3 includes a status feedback mechanism: after each relay node completes local distribution, it sends a status confirmation message to the source node; the source node maintains a global distribution status table and updates the task progress of each relay node in real time; when an unconfirmed node is detected, automatic rerouting or local cache retransmission is initiated.

9. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores a computer program, and when the program is executed by the processor, the steps of the method according to any one of claims 1 to 8 are implemented.

10. A computer-readable storage medium, characterized in that A computer program is stored, and when the program is executed, the steps of the method according to any one of claims 1 to 8 are implemented.

Images