Relative distance routing selection method, device and equipment based on multi-hop network structure
By obtaining and updating relative distance information in a multi-hop network, forming a MAP table to formulate an optimal path, the problem of high routing complexity in emergency communications in blind environments is solved, and effective communication and nodes are realized at underground construction sites position.
Patent Information
- Application Number
- CN202210034848.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-01-13
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2042-01-13
AI Technical Summary
In blind environments such as underground construction sites, it is difficult for the existing technology to achieve effective emergency communication, especially when positioning satellite signals such as GPS cannot be covered, and the node location cannot be quickly and effectively understood, resulting in high routing complexity and inability to work normally .
采用基于多跳网络结构的相对距离路由选择方法,通过每个节点获取相邻节点的相对距离信息,形成map信息并整合为MAP总表,根据MAP总表制定最优路径,随着节点增加、 Reduce or move, update map information and MAP total tables in a timely manner, and realize routing and data transmission in a blind environment.
In wireless multi-hop network, the complexity of routing is reduced, node positioning and data transmission are realized in blind environments, and is suitable for emergency communication scenarios such as underground construction, with ease of installation and resistance to destruction.
Smart Images

Figure CN114390628B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of wireless communications, particularly to emergency communications, and in particular to a relative distance routing selection method, device and computer equipment based on a multi-hop network structure. Background Art
[0002] Wireless multi-hop network technology is a network technology that uses multi-hop relay and algorithm self-organizing network. Its scalability and self-healing properties make it widely used today. Most of the routing protocols it uses are extensions and improvements of the Adhoc routing algorithm, which can be roughly divided into three categories: a priori routing protocols, reactive routing protocols, and hybrid routing protocols. Typical a priori protocols include DSDV, OLSR, etc.; reactive protocols include DSR, AODV, etc.; hybrid protocols include HWMP, ZRP, etc. This method combines the ideas of a priori and reactive protocols and should be classified as a hybrid routing protocol.
[0003] Common wireless positioning technologies include UWB, WiFi, RFID, etc. WiFi positioning technology requires the establishment of a database containing a large amount of received signal strength information in advance, and requires the support of pre-deployed signal access points, so it cannot be applied to blind environments; RFID positioning technology tags are small in size, do not require active communication, and are easily affected by multipath interference, so it is difficult to play a good role in the field of emergency communications; UWB technology uses extremely short signal pulses, has strong anti-interference, and has excellent positioning capabilities in non-line-of-sight scenarios.
[0004] At present, the most commonly used positioning method still relies on the Global Positioning Satellite System (GNSS). However, in actual communication environments, there are often environments where GNSS cannot be used, that is, blind environments, such as indoors, forests, tunnels, etc. Today, in the era of the concept of "smart construction sites", underground operations also face problems such as emergency communications in blind environments that need to be improved and solved. Summary of the invention
[0005] In view of the defects in the prior art, the technical problem to be solved by the present invention is: for blind environments such as underground construction, a relative distance routing selection method based on a multi-hop network structure is provided to realize a multi-hop networking working mode relying only on relative distance. The method reduces the complexity of traditional routing selection, is easy to install, and is resistant to destruction, and is suitable for emergency communication occasions such as construction sites.
[0006] To solve the above problems, the present invention is implemented through the following technical solutions:
[0007] The relative distance routing selection method based on a multi-hop network structure provided by the present invention comprises the following steps:
[0008] S1, each node in the multi-hop network obtains the relative distance information RD of the adjacent nodes;
[0009] S2: Each node forms a relative distance map information and forwards the map information to the adjacent nodes. Multiple map information is collected and integrated to form a MAP summary table.
[0010] S3: According to the MAP summary table, the initial node and the destination node of the transmission, the optimal path RT is formulated and the data transmission is completed;
[0011] S4: As nodes increase, decrease, and move, update map information and MAP summary table.
[0012] Furthermore, the selection condition of the adjacent node is: only when the ranging signal and the wireless transmission signal are received and received at the same time, can it be used as the adjacent node of the node; the relative distance between the two nodes is less than a preset threshold.
[0013] Furthermore, each node in the multi-hop network obtains the relative distance information of the adjacent nodes, specifically including: adopting a time slot allocation strategy, freely dividing into multiple time slots, and the current node allocates different time slots to the subsequent node, so that the subsequent nodes will not have conflicts during concurrency and reception; the subsequent node will know the time slot allocated to the previous node, and avoid allocating the same time slot to the subsequent node, so as to ensure that the allocated time slots of each node are different at the same time.
[0014] Furthermore, each node forms a relative distance map information and forwards the map information to adjacent nodes. Multiple map information are collected and integrated to form a final MAP summary table, which specifically includes: taking a node as the initial node, the initial node performs the first relative distance measurement and forwards it to the adjacent node, and the adjacent node that receives the forwarding then performs the relative distance measurement, and so on to the destination node, wherein each node will no longer forward to the previous node; when a node determines that the adjacent nodes are all previous nodes, it will be regarded as the destination node, and the destination node will forward the obtained MAP data along the original ranging path until it converges at the initial node.
[0015] Furthermore, the number of destination nodes is one or more. Based on the fact that the number of destination nodes is multiple, multiple MAP data are aggregated and de-duplicated to form a final MAP summary table. The MAP summary table includes relative distance information RD between all adjacent nodes. The initial node then forwards the MAP summary table to all nodes along the original path.
[0016] Furthermore, as nodes increase, decrease and move, updating the map information and MAP summary table specifically includes: when a node is added or a node moves, the newly added node or the moved node is set as a changed node, the changed node ranging is started, and the map information of the relative position information is forwarded to the adjacent nodes. The adjacent nodes will add or modify their own map information and MAP data; then the adjacent nodes will perform ranging again to determine whether the map information has changed. If the map information has changed, step S2 will be continued until it is found that the map information no longer changes after ranging, and the overall MAP data will be forwarded to the changed node.
[0017] Furthermore, as nodes increase, decrease, and move, updating the map information and MAP summary table specifically includes: when a node fails, the failed node is set as a failed node. If other nodes fail to find the failed node during the transmission process, all relative distance information RD related to the failed node will be cleared, and the latest MAP data will be forwarded to all nodes in the form of broadcast; when a node is actively removed, the node that is actively removed is set as a removed node, and a message is sent to the adjacent nodes before shutting down, so that the adjacent nodes delete the nodes related to the removed node, and spread to all nodes in the form of broadcast.
[0018] Furthermore, when the newly measured relative distance information RD is compared with the original value, if the difference is less than or equal to the threshold u, the map information is considered to have not changed; when the newly measured relative distance information RD is compared with the original value, if the difference is greater than the threshold u, the map information is considered to have changed.
[0019] Technical effects of the present invention:
[0020] The present invention proposes a relative distance routing selection method based on a multi-hop network structure. When the wireless multi-hop network works underground where positioning satellite signals such as GPS cannot be covered, the common routing algorithm based on geographic location will fail, and the specific location of each node cannot be quickly and effectively known in emergency communications. The method uses wireless positioning technology to obtain the distance information between adjacent nodes. Each time the relative distance information is shared, a map information with a relative distance weight will be formed in the data list of each node and finally a network MAP table will be formed. The current optimal routing path is formulated according to the final MAP table. With the increase, decrease and movement of nodes, the map information and MAP data will be updated in time. The present invention can achieve the selection of routing by relying on the optimal path between the initial node and the destination node in a blind environment and complete data transmission by mastering the relative distance between adjacent nodes and manually or automatically updating the MAP data, thereby effectively making up for the disadvantage that the routing algorithm based on geographic location cannot be used in blind environments such as underground. In a belt network such as a tunnel, it has extremely low complexity and can also achieve the positioning of the node. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] Other features, objects and advantages of the present invention will become more apparent from the detailed description of non-limiting embodiments made with reference to the following drawings:
[0022] Figure 1 A system flow chart of a relative distance routing selection method based on a multi-hop network structure in one embodiment of the present invention;
[0023] Figure 2 A schematic diagram of a flow chart of a distance measurement step in an embodiment of the present invention;
[0024] Figure 3 A schematic diagram of relative position weights in one embodiment of the present invention;
[0025] Figure 4 A schematic diagram of a process of adding a new node and moving a node in one embodiment of the present invention;
[0026] Figure 5 The figure is a schematic diagram of the process of removing a node in one embodiment of the present invention. DETAILED DESCRIPTION
[0027] The present invention is described in detail below in conjunction with specific embodiments. The following embodiments will help those skilled in the art to further understand the present invention, but are not intended to limit the present invention in any form. It should be noted that, for those of ordinary skill in the art, several variations and improvements may be made without departing from the concept of the present invention. These all belong to the protection scope of the present invention.
[0028] like Figure 1 FIG. 4 is a system flow chart of a relative distance routing selection method based on a multi-hop network structure provided by the present invention; Figure 1 As shown, the relative distance routing selection method based on a multi-hop network structure provided by the present invention comprises the following steps:
[0029] S1, each node in the multi-hop network obtains the relative distance information RD of the adjacent nodes;
[0030] S2: Each node forms a relative distance map information and forwards the map information to the adjacent nodes. Multiple map information is collected and integrated to form a MAP summary table.
[0031] S3: According to the MAP summary table, the initial node and the destination node of the transmission, the optimal path RT is formulated and the data transmission is completed;
[0032] S4: As nodes increase, decrease, and move, update map information and MAP summary table.
[0033] The present invention proposes a relative distance routing selection method based on a multi-hop network structure. When the wireless multi-hop network works underground where positioning satellite signals such as GPS cannot be covered, the common routing algorithm based on geographic location will fail, and the specific location of each node cannot be quickly and effectively known in emergency communications. The method uses wireless positioning technology to obtain the distance information between adjacent nodes. Each time the relative distance information is shared, a map information with a relative distance weight will be formed in the data list of each node and finally a network MAP table will be formed. The current optimal routing path is formulated according to the final MAP table. With the increase, decrease and movement of nodes, the map information and MAP data will be updated in time. The present invention can achieve the selection of routing by relying on the optimal path between the initial node and the destination node in a blind environment and complete data transmission by mastering the relative distance between adjacent nodes and manually or automatically updating the MAP data, thereby effectively making up for the disadvantage that the routing algorithm based on geographic location cannot be used in blind environments such as underground. In a belt network such as a tunnel, it has extremely low complexity and can also achieve the positioning of the node.
[0034] Optionally, in the above step S1, the relative distance acquisition method can be implemented by wireless positioning technology. Taking the TOF ranging method as an example, the specific implementation principle is described:
[0035] Multi-hop device A sends a Poll packet to B at T1, and B receives the Poll packet at T2. After a delay, B sends a Response to A at T3, and A receives the Response packet at T4. Therefore, the relative distance formula between A and B is:
[0036] Distance A,B =((T4-T1-Delay) / 2)*c, where c is the speed of light
[0037] In one embodiment of the present invention, further, the selection condition of the adjacent node is: only when the ranging signal and the wireless transmission signal are received and received at the same time, can it be regarded as an adjacent node of the node, that is, if there is only a ranging signal but no wireless signal, or only a wireless signal but no ranging signal, they will not be regarded as adjacent nodes. The relative distance between the two nodes is less than the preset threshold, that is, when the relative distance is greater than the preset threshold, the two nodes will no longer be regarded as adjacent nodes. In the networking, we will also try our best to avoid the situation of wall obstruction, and try to propagate in a visible range environment.
[0038] In one embodiment of the present invention, further, each node in the multi-hop network obtains the relative distance information of the adjacent nodes, specifically including: adopting a time slot allocation strategy, freely dividing into multiple time slots, and the current node allocates different time slots to the subsequent node, so that the subsequent nodes will not have conflicts during concurrency and reception; the subsequent node will know the time slot allocated to the previous node, and avoid allocating the same time slot to the subsequent node, so as to ensure that the allocated time slots of each node are different at the same time.
[0039] In actual applications, in wireless ranging, there may be situations where devices send and receive concurrently, which will result in receiving multiple Poll packets or Response packets in the same time period, leading to measurement failure. Therefore, a time slot allocation strategy is adopted, the main principle of which is that the time slot can be freely divided into multiple time slots, and the current node allocates different time slots to the subsequent node, so that the subsequent nodes will not have conflicts during concurrency and concurrent reception. The subsequent node will know the time slot allocated to the previous node, and try to avoid allocating the same time slot to the subsequent node, so as to ensure that the time slots allocated to each node at the same time are different.
[0040] In one embodiment of the present invention, further, each node forms a relative distance map information and forwards the map information to the adjacent nodes. After a plurality of map information are collected and integrated to form a final MAP summary table, the following specifically includes: taking a node as the initial node, the initial node performs the first relative distance measurement and forwards it to the adjacent nodes. The adjacent nodes that receive the forwarding then perform the relative distance measurement, and so on to the destination node, wherein each node will no longer forward to the previous node; when a node determines that the adjacent nodes are all previous nodes, it will be regarded as the destination node, and the destination node will forward the obtained MAP data along the original ranging path until it converges at the initial node.
[0041] Specifically, in the above step S2, there are three roles in the forwarding rules of relative distance, the initial node, the adjacent node and the destination node: a node is taken as the initial node, and the first relative distance measurement is performed by the node, and all relative distance information related to the node is forwarded to all adjacent nodes. The adjacent node that is forwarded starts the measurement again, and so on to the last node. Each node will no longer forward to all previous nodes. If a node determines that the adjacent nodes within the range are all previous nodes, it will be determined as the destination node, and the task is to integrate all the relative position information obtained into MAP data and forward it to the previous node via the original path.
[0042] In one embodiment of the present invention, further, the number of destination nodes is one or more, and based on the fact that the number of destination nodes is multiple, multiple MAP data are aggregated and then de-duplicated and integrated to form a final MAP summary table, which includes the relative distance information RD between all adjacent nodes, and then the initial node forwards the MAP summary table to all nodes along the original path. Specifically, there may be more than one destination node, and multiple MAP data are aggregated to the initial node and then de-duplicated and integrated to form a final MAP summary table, which includes the relative distance information RD between all adjacent nodes, and finally the final MAP summary table is forwarded to each node along the original path.
[0043] In one embodiment of the present invention, further, in the above step S3, the selection of the optimal path is to bring the relative distance as a weight or parameter into the existing algorithm. Taking the Dijkstra algorithm as an example, the specific rules are described: when a node as an initial node wants to transmit information, the node obtains the shortest path RT based on the Dijkstra algorithm, thereby establishing a connection and completing the transmission, and saves the RT to the database for later connection establishment. If the position of the node on the RT path changes, the path information related to it will be deleted and recalculated.
[0044] In one embodiment of the present invention, further, as nodes are added, reduced and moved, updating the map information and the MAP summary table specifically includes: when a node is added, or a node is moved, the newly added node or the moved node is set as a changed node, the changed node ranging is started, and the map information of the relative position information is forwarded to the adjacent nodes, and the adjacent nodes will add or modify their own map information and MAP data; then the adjacent nodes will perform ranging again to determine whether the map information has changed. If the map information has changed, step S2 will continue to be executed until it is found that the map information no longer changes after ranging, and the overall MAP data will be forwarded to the changed node.
[0045] Furthermore, as nodes increase, decrease, and move, updating the map information and MAP summary table specifically includes: when a node fails, the failed node is set as a failed node. If other nodes fail to find the failed node during the transmission process, all relative distance information RD related to the failed node will be cleared, and the latest MAP data will be forwarded to all nodes in the form of broadcast; when a node is actively removed, the node that is actively removed is set as a removed node, and a message is sent to the adjacent nodes before shutting down, so that the adjacent nodes delete the nodes related to the removed node, and spread to all nodes in the form of broadcast.
[0046] Furthermore, when the newly measured relative distance information RD is compared with the original value, if the difference is less than or equal to the threshold u, the map information is considered to have not changed; when the newly measured relative distance information RD is compared with the original value, if the difference is greater than the threshold u, the map information is considered to have changed.
[0047] In a specific embodiment, specifically, in the above step S4, the coping method after adding a new node is as follows:
[0048] S4.1.1: For newly added nodes, they will be considered as artificially added nodes, and the ranging function of the node will be enabled;
[0049] S4.1.2: The newly added node forwards the acquired relative position information to all adjacent nodes;
[0050] S4.1.3: After the adjacent nodes are compared, the newly added relative distance information RD is added to the map information and MAP data;
[0051] S4.1.4: According to the above step S2, the neighboring nodes that receive the ranging message will continue to measure and forward the distance. In order to avoid useless ranging, a threshold u is set. If the absolute value of the difference between the original data and the neighboring node is less than or equal to the threshold u after the neighboring node measures the distance again, it is considered that the map information has not changed, and the measurement value will no longer be forwarded; if the absolute value of the difference between the original value and the neighboring node is greater than the threshold u, it is considered that the map information has changed, and the measurement value will continue to be forwarded according to the rules of step S2 until the map information has not changed;
[0052] S4.1.5: The newly added nodes have been updated.
[0053] In another specific embodiment, specifically, in the above step S4, the method for dealing with the node after it moves is as follows:
[0054] S4.2.1: The movement of a node will be considered as human movement. If it is found to be disconnected or the network signal is poor, it can automatically start re-ranging. At this time, the node will be considered as the initial node;
[0055] S4.2.2: relative position information that the node will obtain after the movement;
[0056] S4.2.3: This information will be compared with the original information. If the absolute value of the difference is greater than the threshold u, the updated relative distance information RD will be sent to the neighboring nodes with changes;
[0057] S4.2.4: After the adjacent nodes are compared, the changed relative distance information RD is added to the map information and MAP data;
[0058] S4.2.5: According to the above step S2, the neighboring nodes that receive the ranging message will continue to measure and forward the distance. In order to avoid useless ranging, a threshold u is set. If the absolute value of the difference between the original data and the neighboring node is less than or equal to the threshold u after the neighboring node measures the distance again, the map information is considered to be unchanged and the measured value will no longer be forwarded; if the absolute value of the difference between the original data and the neighboring node is greater than the threshold u, the map information is considered to be changed, and the measured value will continue to be forwarded according to the rules of the above step S2 until the map information is unchanged;
[0059] S4.2.6: Mobile node update completed.
[0060] In another specific embodiment, specifically, in the above step S4, the method for dealing with a node after it is removed comprises the following steps:
[0061] S4.3.1: Node removal is divided into active removal and passive removal;
[0062] S4.3.2: When a node is passively removed, it will be considered that the node has failed, such as freezing, power failure, moving out of the receiving range, etc. If other nodes fail to find the removed node during the link establishment process, all relative distance information RD related to the node will be cleared and the latest MAP data will be forwarded to all nodes in the form of broadcast.
[0063] S4.3.3: When a node is actively removed, it will be considered as a situation where it is not automatically or manually shut down in the form of a fault. Before shutting down, it will send a status message of "I am shutting down" to the adjacent nodes, allowing the adjacent nodes to delete the relevant information in the MAP data and forward the latest MAP summary table to all nodes in the form of broadcast.
[0064] In a specific embodiment, the above steps S1 and S2 of the present invention can use the principle of wireless positioning technology to obtain the relative distance between nodes, such as Figure 2 As shown, the TOF ranging method in UWB technology is taken as an example for specific analysis:
[0065] S1.1: Node 1 starts ranging as the initial node. Within the specified range, there are nodes 2 and 3, which are neighboring nodes of node 1;
[0066] S1.2: Node 1 measures the relative position RD of node 2 and node 3 12 With RD 13 After that, save its own map information;
[0067] S1.3: After receiving the map information from node 1, nodes 2 and 3 start ranging at the same time using different time slots;
[0068] S1.4: Nodes 2 and 3 will no longer measure the distance to node 1. The rest is the same as S1, S2, and S3.
[0069] S1.5: After confirming that there is no adjacent node that can continue to forward the data, nodes 7, 8, and 9 will transmit their own MAP data along the original path as the destination node;
[0070] S1.6: Node 1, as the initial node, aggregates the MAP data of all destination nodes, forms the most complete MAP database after deduplication, i.e., the MAP master table, and sends it to all nodes in a broadcast transmission mode;
[0071] S1.7: All node MAP data are updated and the process goes to step S3.
[0072] Step S3 of the present invention adopts an algorithm that uses relative distance as a weight or parameter to obtain the optimal path from the initial node to the destination node. Figure 3 As shown, take the Dijkstra algorithm as an example for specific analysis:
[0073] S3.1: The MAP database can be visualized as follows Figure 3 As shown, the relative distance between two nodes can be regarded as the weight between the nodes;
[0074] S3.2: After receiving the transmission command, the initial node calculates the minimum path according to the MAP database. Figure 3 For example, the existing business information needs to be sent from node 1 to node 9. According to the minimum path principle, the transmission path of 1→2→5→6→9 can be obtained; if there are minimum paths with the same weight, such as 1→3→4→6→9, just randomly select one of them.
[0075] S3.3: The path will be stored in its own RT database to save future transmission delays; if the number of nodes along the way increases or decreases, the path will be deleted.
[0076] Step S4 of the present invention is the response strategy of the routing algorithm when encountering node changes, which is mainly divided into node changes and node no changes. The node change state is further divided into three situations: node addition, node movement, and node removal. Figure 4 and Figure 5 The specific analysis is shown below:
[0077] like Figure 4 As shown in the figure, when the node is added or moved, the processing steps are:
[0078] S4.1.1: Enable ranging for this node;
[0079] S4.1.2: The relative position information obtained by the newly added node is forwarded to all adjacent nodes;
[0080] S4.1.3: If the absolute value of the difference between the adjacent node and the original data is less than or equal to the threshold u after the adjacent node measures the distance again, the map information is considered unchanged and the measurement value will no longer be forwarded;
[0081] S4.1.4: If the absolute value of the difference compared to the original value is greater than the threshold u, the map information is considered to have changed, and the measurement value continues to be forwarded according to the rules of step S2 until the map information does not change.
[0082] like Figure 5 As shown in the figure, when the node is determined to be actively removed, the processing steps are as follows:
[0083] S4.2.1: It is deemed that the shutdown is not caused by an automatic or manual failure;
[0084] S4.2.2: Before shutting down, the state message "I am shutting down" will be sent to the adjacent nodes;
[0085] S4.2.3: Neighboring nodes delete related node information;
[0086] S4.2.4: Forward the latest MAP summary table to all nodes in the form of broadcast.
[0087] like Figure 5 As shown in the figure, when the node is determined to be passively removed, the processing steps are as follows:
[0088] S4.3.1: The node is considered to have a fault, such as a crash, power failure, or movement out of the receiving range;
[0089] S4.3.2: During the link establishment process, if other nodes fail to find the removed node, all relative distance information RD related to the node will be cleared;
[0090] S4.3.3: Forward the latest MAP summary table to all nodes in the form of broadcast.
[0091] The above description is only a specific embodiment of the present invention and is not intended to limit the present invention. It is only a further detailed description of the purpose, technical solution and beneficial effects of the present invention.
[0092] Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
[0093] The above describes the specific embodiments of the present invention. It should be understood that the present invention is not limited to the above specific embodiments, and those skilled in the art may make various modifications or variations within the scope of the claims, which do not affect the essence of the present invention.
Claims
1. A relative distance routing selection method based on a multi-hop network structure, characterized in that: The steps include: S1: Each node in the multi-hop network obtains the relative distance information RD of the adjacent nodes; S2: Each of the nodes forms a relative distance map information and forwards the map information to adjacent nodes. Multiple map information are collected and integrated to form a MAP master table. S3: according to the MAP summary table, the initial node of transmission and the destination node of transmission, an optimal path RT is formulated and data transmission is completed; S4: updating the map information and the MAP summary table as the nodes increase, decrease and move; The step of updating the map information and the MAP summary table as the nodes increase, decrease and move specifically includes: When a node is added or moved, the newly added node or the moved node is set as a changed node, the changed node ranging is started, and the map information of the relative position information is forwarded to the adjacent nodes, and the adjacent nodes will add or modify their own map information and MAP data; Then the neighboring node will perform a distance measurement again to determine whether the map information has changed. If the map information has changed, the step S2 will be continued until the map information is found to no longer change after the distance measurement, and the entire MAP data will be forwarded to the node where the change occurred. The updating of the map information and the MAP summary table as the nodes increase, decrease and move specifically includes: When a node fails, the node is considered a faulty node. If other nodes fail to find the faulty node during the transmission process, all relative distance information RD related to the faulty node will be cleared, and the latest MAP table data will be forwarded to all nodes in the form of broadcast; When a node is actively removed, the node that is actively removed is set as a removed node. Before shutting down, a message is sent to the adjacent nodes of the removed node to let the adjacent nodes delete the nodes related to the removed node, and the message is spread to all nodes in the form of broadcast.
2. The relative distance routing selection method based on a multi-hop network structure according to claim 1, characterized in that: The selection conditions of the adjacent nodes are: When the ranging signal and the wireless transmission signal are received and received simultaneously, the two nodes are defined as neighboring nodes of each other; The relative distance between two adjacent nodes is less than a preset threshold.
3. The relative distance routing selection method based on a multi-hop network structure according to claim 1, characterized in that: The step of each node in the multi-hop network acquiring the relative distance information RD of the adjacent node specifically includes: The time slot allocation strategy is adopted to freely divide into multiple time slots. The current node allocates different time slots to the subsequent nodes so that the subsequent nodes will not have conflicts when sending and receiving. The subsequent node will learn the time slots allocated to the previous node, and avoid allocating the same time slots to the subsequent nodes, so as to ensure that the time slots allocated to each node at the same time are different.
4. The relative distance routing selection method based on a multi-hop network structure according to claim 1, characterized in that: The steps of each of the nodes forming a relative distance map information and forwarding the map information to adjacent nodes, and aggregating and integrating a plurality of the map information to form a final MAP table specifically include: One of the nodes is used as the initial node. The initial node performs the first relative distance measurement and forwards it to the adjacent nodes of the initial node. The adjacent nodes receiving the forwarding perform relative distance measurement again, and so on to the destination node, wherein each node will no longer forward to the previous node; When a node determines that all adjacent nodes are previous nodes, it will be regarded as the destination node. The destination node forwards the obtained MAP summary table data along the original ranging path until it converges at the initial node.
5. The relative distance routing selection method based on a multi-hop network structure according to claim 4 is characterized in that: The number of the destination nodes is one or more. Based on the fact that the number of the destination nodes is multiple, the multiple MAP data are aggregated and de-duplicated to form a final MAP summary table. The MAP summary table includes the relative distance information RD between all adjacent nodes. The initial node then forwards the MAP summary table to all nodes along the original path.
6. The relative distance routing selection method based on a multi-hop network structure according to claim 1, characterized in that: The step of determining whether the map value has changed specifically includes: When the newly measured relative distance information RD is compared with the original value, if the difference is less than or equal to the threshold y, it is considered that the map information has not changed; When the newly measured relative distance information RD is compared with the original value, if the difference is greater than the threshold u, it is regarded as a change in the map information.
7. A relative distance routing selection device based on a multi-hop network structure, characterized in that: The device comprises: An acquisition unit, used for acquiring relative distance information RD of adjacent nodes at each node in the multi-hop network; A processing unit, configured to form a relative distance map information at each node, and forward the map information to adjacent nodes, and to aggregate and integrate a plurality of the map information to form a MAP master table; A transmission unit, configured to formulate an optimal path RT according to the MAP master table, an initial node of transmission and a destination node of transmission, and complete data transmission; An iteration unit is used to update the map information and the MAP total table as the nodes increase, decrease and move; the step of updating the map information and the MAP total table as the nodes increase, decrease and move specifically includes: When a node is added or moved, the newly added node or the moved node is set as a changed node, the changed node ranging is started, and the map information of the relative position information is forwarded to the adjacent nodes, and the adjacent nodes will add or modify their own map information and MAP data; Then the neighboring node will perform a distance measurement again to determine whether the map information has changed. If the map information has changed, the step S2 will be continued until the map information is found to no longer change after the distance measurement, and the entire MAP data will be forwarded to the node where the change occurred. The updating of the map information and the MAP summary table as the nodes increase, decrease and move specifically includes: When a node fails, the node is considered a faulty node. If other nodes fail to find the faulty node during the transmission process, all relative distance information RD related to the faulty node will be cleared, and the latest MAP table data will be forwarded to all nodes in the form of broadcast; When a node is actively removed, the node that is actively removed is set as a removed node. Before shutting down, a message is sent to the adjacent nodes of the removed node to let the adjacent nodes delete the nodes related to the removed node, and the message is spread to all nodes in the form of broadcast.
8. A computer device, characterized in that: The computer device comprises a processor, and the processor is used to implement the steps of the relative distance routing selection method based on a multi-hop network structure as claimed in any one of claims 1 to 6 when executing a computer program stored in a memory.
