MESH networking method and device based on PC5 communication and storage medium

Abstract

The invention relates to an MESH networking method and device based on PC5 communication and a storage medium, and belongs to the technical field of communication, and the method comprises the steps: determining a neighbor node list of a relay node based on a neighbor discovery protocol; constructing a global network topological graph based on the link state between the relay node and the neighbor node; based on an optimal path algorithm, determining an optimal path between the relay node and the core node in the global network topological graph; and performing data transmission between the relay node and the core node based on the optimal path. According to the MESH networking method based on PC5 communication, the neighbor node list of the relay nodes is determined through the neighbor discovery protocol, the link state between the relay nodes and the neighbor nodes is measured, the optimal path from each relay node to the core node is calculated by adopting the optimal path algorithm, and the optimal path of each relay node to the core node is calculated. Therefore, the data is transmitted from the relay node to the core node, and efficient and reliable MESH networking in a PC5 communication network is realized.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a MESH networking method, device and storage medium based on PC5 communication. Background Art

[0002] With the development of Internet of Things and Internet of Vehicles technologies, large-scale wireless communication networks are increasingly being used in smart transportation, smart cities and other fields. Traditional vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications mostly use direct communication modes based on the PC5 protocol. However, in larger-scale networks, direct communication alone cannot meet the needs of efficient data transmission between multiple nodes.

[0003] Existing MESH network solutions, such as ZigBee and BLE Mesh, are mostly used in low-speed, low-power scenarios and are not suitable for high-speed mobility and high real-time requirements in the Internet of Vehicles. MESH networking technology using the PC5 protocol can effectively expand the coverage of the network and provide multi-hop communication capabilities, thereby achieving efficient data relay and transmission.

[0004] However, the current PC5 communication technology is mainly used for short-distance direct communication between vehicles or between vehicles and roadside equipment, and lacks mature solutions for multi-hop MESH networking. Although traditional multi-hop network protocols such as AODV and OLSR can achieve dynamic routing selection, they perform poorly when dealing with highly dynamic network topologies and link quality fluctuations, which can easily lead to communication interruptions or data transmission delays.

[0005] The existing PC5 communication technology is mainly used for point-to-point direct communication between vehicles. However, it has the following major defects in large-scale, multi-node complex network applications: the communication distance is limited, resulting in the inability to effectively transmit data. The effective distance of PC5 communication is usually within 1 km. When the distance between nodes exceeds this range, direct communication cannot be achieved, resulting in the inability to transmit data to the core nodes. This problem is particularly obvious in wide-area scenarios (such as lakes and mining areas). Summary of the invention

[0006] In view of this, it is necessary to provide a MESH networking method, device and storage medium based on PC5 communication to solve the problem of how to improve the communication distance of PC5 communication.

[0007] In order to solve the above problems, the present invention provides a MESH networking method based on PC5 communication, comprising: Based on a neighbor discovery protocol, determining a neighbor node list of the relay node; the neighbor node list includes multiple neighbor nodes; Based on the link status between the relay node and the neighbor node, construct a global network topology graph; the link status includes link delay and packet loss rate; Based on an optimal path algorithm, determining an optimal path between the relay node and the core node in the global network topology graph; Based on the optimal path, data is transmitted between the relay node and the core node.

[0008] In a possible implementation, determining a neighbor node list of a relay node based on a neighbor discovery protocol includes: The neighbor node list is determined based on a first message sent by the relay node to the neighbor node and a second message responded by the neighbor node; the first message includes a node ID, a timestamp and a transmission power.

[0009] In a possible implementation, constructing a global network topology graph based on the link status between the relay node and the neighboring node includes: Determine the link delay and the packet loss rate based on the heartbeat packet sent by the relay node and the response packet returned by the neighbor node; Determining a link weight based on the link delay and the packet loss rate; Constructing the global network topology graph with the relay nodes as nodes and the link weights as edges; The expression of the link weight is as follows:

[0010] in, represents the link weight, , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

[0011] In a possible implementation, after determining the link delay and the packet loss rate based on the heartbeat packet sent by the relay node and the response packet returned by the neighbor node, the method further includes: Determining link quality based on the link delay and the packet loss rate; When the link quality is greater than a preset value, it is determined that a link failure occurs, and an optimal path is re-determined or data is retransmitted; The expression of the link quality is as follows:

[0012] in, Indicates link quality. , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

[0013] In a possible implementation, each node corresponds to a preset cache space, and the preset cache space is used to store unconfirmed data packets; When the link quality is greater than a preset value, determining that a link failure occurs and retransmitting data includes: Based on the node corresponding to the failed link, a retransmission mechanism is used to retransmit the data packet; the retransmission mechanism includes retransmission priority control and retransmission number limit.

[0014] In a possible implementation, determining the optimal path between the relay node and the core node in the global network topology graph based on the optimal path algorithm includes: Determine the shortest path from the relay node to the core node based on the Dijkstra algorithm, link delay and packet loss rate; The shortest path is determined as the optimal path.

[0015] In a possible implementation manner, before performing data transmission between the relay node and the core node based on the optimal path, the method further includes: Determining a path weight based on the link status and the node load; Dynamically allocating traffic to nodes based on the path weights; The expression of the path weight is as follows:

[0016] in, represents the path weight, , , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate, Indicates the node load.

[0017] The present invention also provides a MESH networking device based on PC5 communication, comprising: A first determination module is used to determine a neighbor node list of the relay node based on a neighbor discovery protocol; the neighbor node list includes multiple neighbor nodes; A construction module, configured to construct a global network topology map based on the link status between the relay node and the neighboring node; the link status includes link delay and packet loss rate; A second determination module, configured to determine an optimal path between the relay node and the core node in the global network topology map based on an optimal path algorithm; A transmission module is used to transmit data between the relay node and the core node based on the optimal path.

[0018] On the other hand, the present invention also provides an electronic device, including a memory and a processor, wherein: The memory is used to store programs; The processor is coupled to the memory and is used to execute the program stored in the memory to implement the MESH networking method based on PC5 communication described in any of the above implementations.

[0019] On the other hand, the present invention also provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the MESH networking method based on PC5 communication described in any of the above implementations is implemented.

[0020] The beneficial effects of the present invention are as follows: the MESH networking method, device and storage medium based on PC5 communication provided by the present invention determine the neighbor node list of the relay node through the neighbor discovery protocol, and measure the link status between the relay node and the neighbor node, and calculate the optimal path from each relay node to the core node by adopting the optimal path algorithm, thereby realizing the transmission of data from the relay node to the core node, and sending commands from the core node to the relay node, thereby realizing efficient and reliable MESH networking in the PC5 communication network, which can effectively improve the coverage, stability and reliability of data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0022] Figure 1 One of the method flow charts of an embodiment of the MESH networking method based on PC5 communication provided by the present invention; Figure 2 A second method flow chart of an embodiment of a MESH networking method based on PC5 communication provided by the present invention; Figure 3 A flow chart of the method for relay node provided by the present invention; Figure 4 A flowchart of the method for the core node provided by the present invention; Figure 5 A schematic diagram of the structure of an embodiment of a MESH networking device based on PC5 communication provided by the present invention; Figure 6 A schematic structural diagram of an embodiment of an electronic device provided by the present invention. DETAILED DESCRIPTION

[0023] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0024] In the description of the embodiments of the present invention, unless otherwise specified, "multiple" means two or more than two. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" may mean: A exists alone, A and B exist at the same time, and B exists alone.

[0025] The descriptions of "first", "second", etc. involved in the embodiments of the present invention are only for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the technical features defined as "first" or "second" may explicitly or implicitly include at least one of the features.

[0026] First, the nouns of relevant technical terms in the embodiments of the present invention are explained: PC5 communication: A direct communication protocol for vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I), mainly used in connected vehicle applications.

[0027] MESH network: A mesh network structure in which nodes transmit data through multi-hop mode to improve network coverage and redundancy.

[0028] Relay node: A child node in a MESH network. It can be a leaf node (i.e., no child nodes downstream) or a parent node (i.e., there are child nodes downstream).

[0029] Core node: The final intersection of relay node information. For example, when the relay node cannot connect to the Internet, only this node can connect to the Internet. At this time, this node can collect status information of other relay nodes and forward it to the platform. Similarly, the platform can also issue instructions to the designated relay node through this node.

[0030] Dijkstra algorithm: A classic algorithm for calculating the shortest path from a single source, widely used in network routing and graph theory.

[0031] Figure 1 One of the method flow charts of an embodiment of the MESH networking method based on PC5 communication provided by the present invention is as follows Figure 1 As shown, the MESH networking method based on PC5 communication includes: S101. Determine a neighbor node list of a relay node based on a neighbor discovery protocol; the neighbor node list includes multiple neighbor nodes; S102, constructing a global network topology map based on the link status between the relay node and the neighboring node; the link status includes link delay and packet loss rate; S103, determining an optimal path between the relay node and the core node in the global network topology map based on an optimal path algorithm; S104: Based on the optimal path, perform data transmission between the relay node and the core node.

[0032] Compared with the prior art, the MESH networking method based on PC5 communication provided in the embodiment of the present invention determines the neighbor node list of the relay node through the neighbor discovery protocol, measures the link status between the relay node and the neighbor nodes, and calculates the optimal path from each relay node to the core node by adopting the optimal path algorithm, thereby realizing the transmission of data from the relay node to the core node, and sending commands from the core node to the relay node, thereby realizing efficient and reliable MESH networking in the PC5 communication network, and can effectively improve the coverage, stability and reliability of data transmission.

[0033] In some embodiments of the present invention, determining a neighbor node list of a relay node based on a neighbor discovery protocol includes: The neighbor node list is determined based on a first message sent by the relay node to the neighbor node and a second message responded by the neighbor node; the first message includes a node ID, a timestamp and a transmission power.

[0034] Figure 2 The second method flow chart of an embodiment of the MESH networking method based on PC5 communication provided by the present invention is as follows: Figure 3 A flow chart of the method for relay node provided by the present invention, Figure 4 The method flow chart of the core node provided by the present invention. Figures 2 to 4 The MESH networking method based on PC5 communication provided by the present invention and its reverse description are described in detail.

[0035] Each relay node periodically sends a first message, which may be a "Hello" message, and the message format includes information such as node ID, timestamp, and transmission power. The message sending frequency may be dynamically adjusted according to network density and node movement speed, such as once per second or once every 5 seconds.

[0036] After receiving the "Hello" message, the neighbor node records the ID of the sending node and the receiving time, and returns a second message, which may be an acknowledgment message (ACK).

[0037] When receiving a "Hello" message, the neighbor node determines whether to reply ACK based on the received link quality. If the delay is large (such as more than 100ms, which can be adjusted according to the actual communication status), no reply is given to reduce neighbor information with unstable connections.

[0038] At the same time, each node periodically sends heartbeat packets to known neighbor nodes to measure link status. The heartbeat packet contains information such as node ID, timestamp, and heartbeat sequence number.

[0039] The receiving node returns a response packet containing the same information, and the sending node determines the link delay by calculating the round-trip time (RTT). It also calculates the packet loss rate within a period of time through the sequence number of the heartbeat packet, such as the ratio of the number of heartbeat packets lost per minute to the total number of heartbeat packets sent.

[0040] The link quality can then be calculated using the following formula:

[0041] in, Indicates link quality. , Respectively represent weight coefficients, which can be adjusted according to actual needs. Indicates delay, Indicates the packet loss rate.

[0042] Therefore, according to the link quality information of neighboring nodes, if the link status deteriorates, the relay node needs to request the core node to recalculate the optimal path. When the link quality drops below the preset threshold (such as the packet loss rate is higher than 10%, or the RTT is greater than 100ms), the re-routing or neighbor discovery process is triggered.

[0043] The PC5 communication-based MESH networking method provided in the embodiment of the present invention introduces an efficient neighbor discovery and link status measurement mechanism, which can dynamically discover adjacent nodes in the PC5 communication network and measure the status of the links between nodes in real time (such as detecting delay and packet loss rate through heartbeat packets).

[0044] In some embodiments of the present invention, constructing a global network topology graph based on the link status between the relay node and the neighboring node includes: Determine the link delay and the packet loss rate based on the heartbeat packet sent by the relay node and the response packet returned by the neighbor node; Determining a link weight based on the link delay and the packet loss rate; Constructing the global network topology graph with the relay nodes as nodes and the link weights as edges; The expression of the link weight is as follows:

[0045] in, represents the link weight, , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

[0046] In some embodiments of the present invention, determining the optimal path between the relay node and the core node in the global network topology graph based on the optimal path algorithm includes: Determine the shortest path from the relay node to the core node based on the Dijkstra algorithm, link delay and packet loss rate; The shortest path is determined as the optimal path.

[0047] The core node collects neighbor information of all relay nodes and builds a global network topology graph. Each node in the global network topology graph represents a relay node, and the weight of the edge is measured based on the link delay (RTT) and packet loss rate.

[0048] The shortest path from each relay node to the core node can be calculated using the Dijkstra algorithm.

[0049] The expression of link weight is as follows:

[0050] in, represents the link weight, , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

[0051] Therefore, the optimal path is dynamically selected according to the link status (RTT and packet loss rate), and the path with the lowest combined score of link delay and packet loss rate is given priority to ensure the reliability and timeliness of data transmission.

[0052] Each relay node maintains a routing table to the core node, recording the next hop node of the current optimal path. When the link status (RTT, packet loss rate) changes beyond the preset threshold, the routing table update is triggered.

[0053] When the link delay RTT exceeds 100ms, or the packet loss rate is higher than 10%, the node reports the link status change information to the core node, and the core node triggers path recalculation.

[0054] When the load on a certain path is too high, data traffic distribution is dynamically adjusted to avoid overloading a single path.

[0055] When a link is interrupted, the fault detection mechanism is triggered, the core node recalculates the paths of all affected nodes, and updates the routing table of the entire network in a timely manner.

[0056] In path selection, priority is given to factors such as link quality (RTT, packet loss rate), node load, and data type to ensure that critical data is transmitted first.

[0057] The PC5 communication-based MESH networking method provided by the embodiment of the present invention provides a path selection algorithm based on global topology information, which can dynamically calculate the optimal path according to the status of nodes and links. At the same time, the routing table can be updated in real time through the routing management mechanism to achieve adaptive adjustment of the path in the network.

[0058] In some embodiments of the present invention, after determining the link delay and the packet loss rate based on the heartbeat packet sent by the relay node and the response packet returned by the neighbor node, the method further includes: Determining link quality based on the link delay and the packet loss rate; When the link quality is greater than a preset value, it is determined that a link failure occurs, and an optimal path is re-determined or data is retransmitted; The expression of the link quality is as follows:

[0059] in, Indicates link quality. , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

[0060] In some embodiments of the present invention, each node corresponds to a preset cache space, and the preset cache space is used to store unconfirmed data packets; When the link quality is greater than a preset value, determining that a link failure occurs and retransmitting data includes: Based on the node corresponding to the failed link, a retransmission mechanism is used to retransmit the data packet; the retransmission mechanism includes retransmission priority control and retransmission number limit.

[0061] Timeout detection: Each node periodically sends a heartbeat packet to its neighbor node and records the response time. If no response is received within the preset timeout period, the node or link is considered to be faulty. The timeout period can be dynamically adjusted based on the network scale and link quality, for example, the timeout period can be appropriately extended in a high-load environment.

[0062] Link quality monitoring regularly measures the link delay (RTT) and packet loss rate (Packet Loss). If the link status indicators exceed the preset threshold (such as RTT greater than 100ms, packet loss rate exceeds 10%), the link quality is considered to have degraded and a fault may occur.

[0063] Faulty node detection is cross-validated through the heartbeat packet detection results of multiple nodes. If multiple neighboring nodes simultaneously detect that a node cannot communicate, the node is confirmed to be faulty.

[0064] Alternative path pre-calculation,In each global routing calculation, the core node calculates at least two alternative paths for each node and stores them in the routing table.When the main path fails, the node can immediately switch to the alternative path.

[0065] Real-time path switching: When a path failure or link quality degradation is detected, the node immediately switches to an alternative path and broadcasts a path switching message in the network to notify related nodes to update the routing table.

[0066] Timing control mechanism: When a link is restored or a faulty node is restored, path switching should follow a certain timing control strategy to avoid frequent switching that causes network fluctuations. The switching frequency can be controlled by setting a recovery stabilization period (e.g. 10 seconds) and recovery conditions (e.g. RTT returns to the normal range).

[0067] Data caching strategy,During data transmission, nodes temporarily cache unconfirmed data packets to prevent data loss due to link interruption.,Cache management includes cache space limit and timeout strategy.

[0068] Retransmission mechanism: When the path switching is completed, the node will retry to transmit the cached data packet to the new path. The retransmission mechanism includes retransmission priority control (such as retransmission according to the importance of the data packet) and retransmission number limit (such as discarding after three failed retransmissions).

[0069] Packet loss handling,When retransmission fails, the node sends a packet loss message to the source node.,The source node decides whether to resend the data or abandon the transmission,based on the loss message.

[0070] Cache space management,Cache allocation,A fixed cache space is allocated to each node to store unconfirmed data packets.,The cache space size can be dynamically adjusted according to the node's memory capacity and,network transmission requirements.

[0071] Data storage and retrieval mechanism, data packets are stored in sequence number order to facilitate fast retrieval during retransmission.

[0072] Each data packet records information such as sending time, destination node, and number of retransmissions.

[0073] Expired data packet processing: when the cache space is insufficient, data packets that have exceeded the upper limit or have timed out will be discarded first.

[0074] Cache priority: important data packets (such as emergency information) are assigned higher priority to ensure priority caching and transmission.

[0075] Link status monitoring: monitors link status (such as latency, packet loss rate) in real time. When the link status deteriorates to the set threshold (such as RTT increases by more than 100ms), data retransmission is initiated.

[0076] Timeout judgment: set a transmission timeout threshold (such as 3 seconds) for each data packet. If no confirmation is received after the threshold, retransmission is triggered.

[0077] Path switching, when a node experiences path switching or link failure recovery, it triggers the retransmission of cached data packets.

[0078] Priority rules set different retransmission priorities based on the importance and type of data packets (such as control information and sensor data).

[0079] Retransmission queue management: high-priority data packets are placed at the front of the retransmission queue and are retransmitted first.

[0080] Retransmission limit: Set the maximum number of retransmissions for each data packet (e.g. 3 times). Data packets that have not been successfully transmitted after exceeding the maximum number of retransmissions will be discarded and the exception will be recorded.

[0081] Retransmission time interval adjustment: dynamically adjust the retransmission time interval according to the link status. When the link status is poor, the retransmission time interval is appropriately extended to avoid congestion.

[0082] The MESH networking method based on PC5 communication provided by the embodiment of the present invention can quickly identify the fault location and execute the path switching strategy when a node or link fails, thereby ensuring the continuity and stability of data transmission. In order to cope with the problem of data loss in a complex network environment, the present invention designs a data caching and retransmission mechanism. The node caches during the data transmission process and retransmits when necessary to ensure that the data reaches the target node reliably.

[0083] In some embodiments of the present invention, before performing data transmission between the relay node and the core node based on the optimal path, the method further includes: Determining a path weight based on the link status and the node load; Dynamically allocating traffic to nodes based on the path weights; The expression of the path weight is as follows:

[0084] in, represents the path weight, , , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate, Indicates the node load.

[0085] When constructing the global topology, multiple independent available paths are calculated for each source node to the destination node (core node). Each node maintains a redundant routing table to record all available paths.

[0086] Path redundancy: Set redundancy for critical data transmission (such as 2 or 3 paths). The higher the redundancy, the stronger the fault tolerance.

[0087] Switching threshold: Set the link status (such as RTT, packet loss rate) and load threshold. When the threshold is exceeded, path switching is triggered and the path is automatically switched to the redundant path.

[0088] Redundant path selection should take link independence into consideration to avoid too many shared nodes or links, thereby improving network fault tolerance.

[0089] Traffic distribution strategy based on link status, link status monitoring, real-time monitoring of the link status (RTT, packet loss rate) and node load (such as CPU utilization, queue length) of each path.

[0090] Traffic distribution strategy uses weighted round robin or hash-based strategy to dynamically distribute traffic according to path weights.

[0091] The expression of path weight is as follows:

[0092] in, represents the path weight, , , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate, Indicates the node load.

[0093] Node load balancing strategy, load perception, nodes regularly report load information, such as CPU utilization, memory usage, etc.

[0094] Dynamic adjustment, based on node load information, core nodes adjust data traffic distribution, transferring traffic from high-load nodes to low-load nodes, reducing the load pressure on hot nodes.

[0095] The PC5 communication-based MESH networking method provided in the embodiment of the present invention can automatically switch to other available paths when the network is congested or the path fails through multi-path redundancy design. At the same time, through the load balancing mechanism, traffic is dynamically allocated to different paths to improve the overall network performance.

[0096] That is, the present invention proposes a MESH networking technology based on PC5 communication, aiming to achieve efficient and stable data transmission through multi-hop transmission and dynamic routing management. The specific purposes are as follows: (1) Realize multi-hop data transmission and improve communication coverage: Introduce MESH networking in the PC5 network. Through the multi-hop transmission mechanism, data can be transmitted from any relay node to the core node, breaking through the distance limitation of single-hop communication.

[0097] (2) Supporting fleet collaboration and complex scenario communications: Realizing efficient data transmission and coordination during fleet operation. Through optimized path selection algorithms, data can be quickly transmitted in multi-hop networks, improving the real-time and stability of fleet management.

[0098] (3) Fault recovery and path optimization: Through dynamic routing management and multi-path redundancy mechanism, the transmission path can be adjusted in time when the link status deteriorates or a node fails, ensuring the reliability and low latency of data transmission.

[0099] Through the present invention, the overall communication capability of the PC5 network can be improved, and it is suitable for application scenarios such as fleets and remote monitoring that require large-scale and efficient data transmission.

[0100] The overall process of the system of the present invention includes the following stages: network topology discovery, path selection and optimization, data transmission, fault detection and path recovery. The general steps are as follows: (1) Network topology discovery: When the system is initialized, each relay node builds a list of neighbor nodes through the neighbor discovery mechanism and measures the link status (such as latency, packet loss rate, etc.) between the neighbor nodes.

[0101] (2) Path selection and optimization: After the neighbor list and link status information are uploaded to the core node, the core node uses the optimal path algorithm (such as the Dijkstra algorithm) based on the global network topology graph to calculate the optimal path from each relay node to the core node, and distributes the path information to each node.

[0102] (3) Data transmission: Each relay node transmits data to the core node according to the optimal path recorded in the routing table; the core node sends commands to the target relay node based on the path information.

[0103] (4) Fault detection and path recovery: When a node or link fails, the node reports the link status change, the core node recalculates the path, and notifies the relevant nodes of the updated path information to ensure the continuity and reliability of data transmission.

[0104] Based on the overall process, the technical solution of the present invention can be further refined into the following four core modules: (1) Network topology discovery and path selection.

[0105] Neighbor discovery and link status measurement: When each relay node starts, it sends a "Hello" message to discover its neighbor nodes and measures the link quality (such as latency and packet loss rate) with the neighbor nodes. Link quality data is used to calculate link weights.

[0106] Uploading of neighbor lists and construction of global topology: Each relay node uploads its neighbor list to the core node, which aggregates all neighbor information and builds a global network topology map.

[0107] Path calculation: The core node uses the Dijkstra algorithm to calculate the optimal path from each relay node to the core node, and sends the path information to each relay node. Each relay node updates the local routing table based on the received path information.

[0108] (2) Dynamic routing adjustment and fault recovery.

[0109] Link status monitoring and dynamic path update: Each relay node monitors the link status with the upstream node in real time. When the link quality deteriorates, the node will report the change information to the core node, which will recalculate the optimal path based on the global topology and update the routing table of the relevant nodes.

[0110] Fault recovery mechanism: When a relay node or link fails, the relay node will automatically switch to the backup path and report the fault information to the core node. The core node updates the status of the faulty node and notifies the entire network to adjust the path selection.

[0111] (3) Multipath redundancy and load balancing.

[0112] Multi-path routing: Assign multiple available paths to core nodes to each relay node, and dynamically select paths based on link status and node load to ensure the stability of data transmission.

[0113] Load balancing: The core node dynamically adjusts the data traffic distribution of each path according to the traffic distribution of the entire network to avoid overloading of a single path or node and improve the overall network performance.

[0114] (4) Data caching and retransmission mechanism.

[0115] Data caching: During the data upload process, each relay node will cache the data to be transmitted for a period of time, waiting for confirmation from the upstream node. If no confirmation is received, the data will be retransmitted to ensure the success rate of data reaching the core node.

[0116] Retransmission mechanism: When the link status deteriorates or the path is interrupted, the relay node caches and retransmits the unconfirmed data until the data is successfully delivered to the upstream node or the path is restored.

[0117] The present invention realizes efficient and reliable MESH networking in PC5 communication network. The technology can effectively improve the coverage, stability and reliability of data transmission, especially in a dynamically changing network environment, and has the ability of rapid recovery and adaptive adjustment.

[0118] The present invention has the following advantages: (1) Improving data transmission efficiency. The present invention calculates the optimal path through global topology information and selects the shortest path in a multi-hop network to avoid unnecessary detours of data packets during transmission, thereby greatly improving data transmission efficiency.

[0119] (2) Enhance network stability and reliability. By introducing dynamic routing management and path switching mechanisms, the route can be quickly adjusted when the link status changes or a node fails, so that data can continue to be transmitted efficiently, ensuring the stability and reliability of the network.

[0120] (3) Achieve effective load balancing by dynamically allocating data traffic to different paths through multi-path redundancy design and load balancing strategies, reducing the load pressure on a single path and improving resource utilization and network response speed.

[0121] In addition, the present invention can also adopt different path selection algorithms, such as AODV, OLSR, etc. to replace the Dijkstra algorithm to adapt to different network environments and requirements. The present invention can also adopt different link status measurement methods, such as calculating link weights based on parameters such as channel bandwidth and delay jitter. (3) Different data transmission strategies can also be adopted, such as priority queues, data fragmentation and reorganization, etc., to further improve transmission efficiency and reliability.

[0122] In order to better implement the MESH networking method based on PC5 communication in the embodiment of the present invention, on the basis of the MESH networking method based on PC5 communication, the embodiment of the present invention also provides a MESH networking device based on PC5 communication. Figure 5 A structural diagram of an embodiment of a MESH networking device based on PC5 communication provided by the present invention, as shown in FIG. Figure 5 As shown, the MESH networking device 500 based on PC5 communication includes: A first determining module 510 is used to determine a neighbor node list of a relay node based on a neighbor discovery protocol; the neighbor node list includes a plurality of neighbor nodes; A construction module 520, configured to construct a global network topology map based on the link status between the relay node and the neighboring node; the link status includes link delay and packet loss rate; A second determination module 530, configured to determine an optimal path between the relay node and the core node in the global network topology map based on an optimal path algorithm; The transmission module 540 is used to transmit data between the relay node and the core node based on the optimal path.

[0123] The MESH networking device 500 based on PC5 communication provided in the above embodiment can implement the technical solution described in the above embodiment of the MESH networking method based on PC5 communication. The specific implementation principles of the above modules or units can refer to the corresponding contents in the embodiment of the MESH networking method based on PC5 communication, which will not be repeated here.

[0124] like Figure 6 As shown, the present invention also provides an electronic device 600. The electronic device 600 includes a processor 601, a memory 602 and a display 603. Figure 6 Only some components of the electronic device 600 are shown, but it should be understood that it is not required to implement all of the components shown, and more or fewer components may be implemented instead.

[0125] In some embodiments, the processor 601 may be a central processing unit (CPU), a microprocessor or other data processing chip, used to run program codes or process data stored in the memory 602, such as the MESH networking method based on PC5 communication in the present invention.

[0126] In some embodiments, the processor 601 may be a single server or a server group. The server group may be centralized or distributed. In some embodiments, the processor 601 may be local or remote. In some embodiments, the processor 601 may be implemented in a cloud platform. In some embodiments, the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, an internal cloud, a multi-cloud, etc., or any combination thereof.

[0127] In some embodiments, the memory 602 may be an internal storage unit of the electronic device 600, such as a hard disk or memory of the electronic device 600. In other embodiments, the memory 602 may also be an external storage device of the electronic device 600, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc., equipped on the electronic device 600.

[0128] Furthermore, the memory 602 may include both an internal storage unit of the electronic device 600 and an external storage device. The memory 602 is used to store application software installed in the electronic device 600 and various data.

[0129] In some embodiments, the display 603 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an organic light-emitting diode (OLED) touch device, etc. The display 603 is used to display information on the electronic device 600 and to display a visual user interface. The components 601-603 of the electronic device 600 communicate with each other via a system bus.

[0130] In one embodiment, when the processor 601 executes the MESH networking program based on PC5 communication in the memory 602, the following steps may be implemented: Based on a neighbor discovery protocol, determining a neighbor node list of the relay node; the neighbor node list includes multiple neighbor nodes; Based on the link status between the relay node and the neighbor node, construct a global network topology graph; the link status includes link delay and packet loss rate; Based on an optimal path algorithm, determining an optimal path between the relay node and the core node in the global network topology graph; Based on the optimal path, data is transmitted between the relay node and the core node.

[0131] It should be understood that: when the processor 601 executes the MESH networking program based on PC5 communication in the memory 602, in addition to the above functions, other functions can also be implemented. For details, please refer to the description of the corresponding method embodiment above.

[0132] Furthermore, the embodiment of the present invention does not specifically limit the type of the electronic device 600 mentioned, and the electronic device 600 may be a portable electronic device such as a mobile phone, a tablet computer, a personal digital assistant (PDA), a wearable device, a laptop computer, etc. Exemplary embodiments of portable electronic devices include but are not limited to portable electronic devices equipped with IOS, Android, Microsoft or other operating systems. The above-mentioned portable electronic device may also be other portable electronic devices, such as a laptop computer with a touch-sensitive surface (e.g., a touch panel). It should also be understood that in some other embodiments of the present invention, the electronic device 600 may not be a portable electronic device, but a desktop computer with a touch-sensitive surface (e.g., a touch panel).

[0133] Correspondingly, an embodiment of the present invention also provides a computer-readable storage medium, which is used to store computer-readable programs or instructions. When the program or instructions are executed by a processor, it can implement the steps or functions of the MESH networking method based on PC5 communication provided in the above-mentioned method embodiments.

[0134] Those skilled in the art will appreciate that all or part of the processes of the above-mentioned embodiments can be implemented by instructing related hardware (such as a processor, a controller, etc.) through a computer program, and the computer program can be stored in a computer-readable storage medium, wherein the computer-readable storage medium is a disk, an optical disk, a read-only storage memory, or a random access memory, etc.

[0135] The MESH networking method, device and storage medium based on PC5 communication provided by the present invention are introduced in detail above. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for technical personnel in this field, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A MESH networking method based on PC5 communication, characterized in that: include: Based on the neighbor discovery protocol, determine the neighbor node list of the relay node; The neighbor node list includes multiple neighbor nodes; Based on the link status between the relay node and the neighbor node, construct a global network topology map; The link status includes link delay and packet loss rate; Based on an optimal path algorithm, determining an optimal path between the relay node and the core node in the global network topology graph; Based on the optimal path, data is transmitted between the relay node and the core node.

2. The method for forming a MESH network based on PC5 communication according to claim 1, characterized in that: The step of determining a neighbor node list of a relay node based on a neighbor discovery protocol includes: The neighbor node list is determined based on a first message sent by the relay node to the neighbor node and a second message responded by the neighbor node; the first message includes a node ID, a timestamp and a transmission power.

3. The MESH networking method based on PC5 communication according to claim 1, characterized in that: The constructing a global network topology graph based on the link status between the relay node and the neighboring node includes: Determine the link delay and the packet loss rate based on the heartbeat packet sent by the relay node and the response packet returned by the neighbor node; Determining a link weight based on the link delay and the packet loss rate; Constructing the global network topology graph with the relay nodes as nodes and the link weights as edges; The expression of the link weight is as follows: in, represents the link weight, , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

4. The method for forming a MESH network based on PC5 communication according to claim 3, characterized in that: After determining the link delay and the packet loss rate based on the heartbeat packet sent by the relay node and the response packet returned by the neighbor node, the method further includes: Determining link quality based on the link delay and the packet loss rate; When the link quality is greater than a preset value, it is determined that a link failure occurs, and an optimal path is re-determined or data is retransmitted; The expression of the link quality is as follows: in, Indicates link quality. , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate.

5. The method for forming a MESH network based on PC5 communication according to claim 4, characterized in that: Each node corresponds to a preset cache space, and the preset cache space is used to store unconfirmed data packets; When the link quality is greater than a preset value, determining that a link failure occurs and performing data retransmission includes: Retransmitting the data packet using a retransmission mechanism based on the node corresponding to the failed link; The retransmission mechanism includes retransmission priority control and retransmission number limit.

6. The method for forming a MESH network based on PC5 communication according to claim 1, characterized in that: Determining the optimal path between the relay node and the core node in the global network topology graph based on the optimal path algorithm includes: Determine the shortest path from the relay node to the core node based on the Dijkstra algorithm, link delay and packet loss rate; The shortest path is determined as the optimal path.

7. The method for forming a MESH network based on PC5 communication according to claim 3, characterized in that: The method further includes, before performing data transmission between the relay node and the core node based on the optimal path: Determining a path weight based on the link status and the node load; Dynamically allocating traffic to nodes based on the path weights; The expression of the path weight is as follows: in, represents the path weight, , , They represent weight coefficients respectively, Indicates delay, Indicates the packet loss rate, Indicates the node load.

8. A MESH networking device based on PC5 communication, characterized in that: include: A first determination module, configured to determine a neighbor node list of a relay node based on a neighbor discovery protocol; The neighbor node list includes multiple neighbor nodes; A construction module, used to construct a global network topology map based on the link status between the relay node and the neighbor node; The link status includes link delay and packet loss rate; A second determination module, configured to determine an optimal path between the relay node and the core node in the global network topology map based on an optimal path algorithm; A transmission module is used to transmit data between the relay node and the core node based on the optimal path.

9. An electronic device, characterized in that: comprising a memory and a processor, wherein: The memory is used to store programs; The processor is coupled to the memory and is used to execute the program stored in the memory to implement the MESH networking method based on PC5 communication as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by the processor, the MESH networking method based on PC5 communication as described in any one of claims 1 to 7 is implemented.

Images