A directional escape routing method based on node address book difference operation

Through node address book difference operation and information update package, combined with link quality evaluation, the directional escape routing of node seismometers in wireless ad hoc network is realized, which solves the routing hole problem in the geographic routing algorithm, and reduces network delay and Power consumption provides a fast and efficient routing solution.

CN113923803BActive Publication Date: 2024-12-03JILIN UNIVERSITY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111191909.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-10-13
Publication Date
2024-12-03
Estimated Expiration
2041-10-13

AI Technical Summary

Technical Problem

In wireless self-organized networks, when the node seismometer is lost or inaccurate in geolocation information, traditional geographical routing algorithms are prone to routing hole problems, resulting in increased network delay and power consumption, and traditional bypass strategies will increase the number of packet forwarding times. Reduce the network survival cycle.

Method used

Using a directional escape routing method based on node address book difference set operation, through the comparison of node address book and data packet history path, select effective nodes for forwarding, and use information update packets and link quality evaluation to achieve the acquisition and routing decision of relative location information. , avoids detour forwarding, and uses flood-type routing to deal with routing failure.

Benefits of technology

It realizes routing decisions without accurate geolocation information, reduces packet delivery time and hop count, significantly reduces network latency and power consumption, and provides a fast and efficient routing solution for wireless ad hoc networks with linear distribution of nodes. .

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113923803B_ABST
    Figure CN113923803B_ABST
Patent Text Reader

Abstract

The present invention belongs to the field of wireless self-organizing network communication and routing, and in particular, relates to a directional escape routing method based on node address book difference set operation. The method comprises: comparing the own address book with the current data packet historical path according to each contact node in the current node address book in the node where the current data packet is located, selecting the nodes that exist in the address books of each contact node but do not exist in the current data packet historical path as valid nodes, and selecting the node with the largest number of valid nodes in the address books of each contact node as the next forwarding node, wherein the nodes are arranged in a survey line at equal intervals to form a survey line and form a complete wireless self-organizing network. The limitations of the traditional geographic routing algorithm are overcome, and the wireless self-organizing network and routing communication problems of node seismometers in complex field environments are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of wireless self-organizing network communication and routing, and in particular relates to a directional escape routing method based on node address book difference set operation. Background Art

[0002] A wireless ad hoc network is a communication network without a central structure formed by a group of mobile nodes that are self-organized and connected through wireless communication. Compared with traditional wireless networks with base stations, the nodes in a self-organizing network are equal and can all serve as terminals and forwarding nodes. The network has the advantages of strong anti-destruction and high robustness. At the same time, the network relies on multi-hop data transmission, and has strong flexibility and scalability. Therefore, wireless self-organizing network technology is widely used in wireless sensor measurement systems, which can connect a large number of mobile measurement sensor nodes to the network to build regional data collection and monitoring systems.

[0003] Cable-free node seismometers are a typical application scenario of wireless ad hoc networks. Compared with wireless ad hoc networks built by ordinary wireless sensors, node seismometer wireless ad hoc networks have the following characteristics:

[0004] 1. The seismograph nodes are arranged equidistantly along the seismic exploration line, and the node position distribution is regular.

[0005] Second, due to the needs of seismic exploration, seismograph nodes need to be laid close to the surface or even buried shallowly. The surface environmental interference has a great impact on wireless signals, and the network link has obvious time-varying properties.

[0006] 3. Due to the needs of seismic exploration, seismograph nodes need to be rolled out and replaced at any time. Therefore, nodes in the network can randomly join, move, and exit.

[0007] Therefore, the topology of the node seismometer self-organizing network may need to change at any time to adapt to environmental changes, that is, the network needs a dynamically adaptive topology. Traditional geographic routing is a routing algorithm that only needs the destination location of the data packet, the node's own location, and the location of the surrounding nodes to make routing decisions. Because there is no need to maintain the global topology, geographic routing is suitable for large-scale wireless network data transmission with changing node locations. However, when the node location information is lost or the location information is inaccurate, the routing hole problem of geographic routing will occur. The current method to eliminate the routing hole of geographic routing is mainly the detour strategy. The detour strategy includes methods such as optimizing the detection of routing hole boundaries, reducing the area of ​​routing holes by increasing the transmission power, and multi-path forwarding detour. However, the detour method will undoubtedly increase the number of packet forwarding times and cause network congestion for nodes at the edge of the routing hole, which will lead to increased network delays and power consumption, further reducing the life cycle of the overall network. Summary of the invention

[0008] Aiming at the networking and routing problems caused by the inability of node seismometers to obtain location information, a directional escape routing method based on node address book difference operation is proposed, which overcomes the limitations of traditional geographic routing algorithms and solves the wireless ad hoc networking and routing communication problems of node seismometers in complex field environments.

[0009] The present invention is achieved in this way.

[0010] A directional escape routing method based on node address book difference set operation, the method comprising: comparing the address book of each contact node in the address book of the current node in the node where the current data packet is located with the current data packet historical path, selecting the nodes that exist in the address book of each contact node but do not exist in the historical path of the current data packet as valid nodes, and selecting the node with the largest number of valid nodes in the address book of each contact node as the next forwarding node, wherein the nodes are arranged in a line at equal intervals to form a line and form a complete wireless self-organizing network.

[0011] Furthermore, the node address book includes a set of nodes including the node itself and nodes that establish wireless direct communication connections with the node in the same measurement line.

[0012] Furthermore, each node periodically generates and sends an information update package, which includes the node's current address book, the list of nodes received in the previous period, and the link quality evaluation values ​​of the contact nodes in the address book. The node address book of the node is periodically updated according to the information update package.

[0013] Furthermore, the previous period receiving node list is a collection of source nodes of other information update packets received by the node in the previous update period.

[0014] Furthermore, the historical path of the data packet includes the union of the historical path carried by the data packet before arriving at the current forwarding node and the address book of the current forwarding node, and the historical path of the data packet is updated each time it is forwarded.

[0015] Furthermore, it also includes eliminating nodes whose forwarding times exceed the limit by counting the number of forwarding times of the nodes passed through, so as to limit the size of the historical path of the data packet.

[0016] Furthermore, when the calculation of the number of valid nodes fluctuates and the most non-unique value occurs, the link quality between each candidate node and the current forwarding node is evaluated, and the number of packet transmission times is used as the link quality evaluation value. The node with the smallest number of packet transmission times is selected as the final candidate forwarding node.

[0017] Furthermore, when the forwarding node makes a forwarding decision and transmits the data packet to the subsequent node, if the subsequent forwarding node cannot be found to forward the data packet due to routing failure, flood routing is adopted, regardless of the routing direction, and the data packet with a hop limit is forwarded indiscriminately to the surrounding communicative nodes, so that the data packet can leave the routing failure area.

[0018] Compared with the prior art, the present invention has the following beneficial effects:

[0019] The method of the present invention fully considers the characteristics of the regular arrangement of node seismographs, and specifically designs a directional escape route based on the difference operation of the node address book. This routing method does not require network nodes to obtain accurate geographical location information. It obtains the relative position information of the nodes through the difference operation of the address book to make routing decisions, so that network data packets can be transmitted directionally along the survey line. Compared with traditional geographic routing, the directional escape routing method designed by the present invention will not produce geographical routing holes, and there is no need to design a detour plan, which can achieve the purpose of fast routing. According to actual measurements, the data packet delivery rate, number of hops, and data transmission time of this routing algorithm are significantly lower than those of traditional geographic routing, and the network delay and power consumption are significantly reduced, providing a targeted routing solution for wireless self-organizing networks with linear node distribution. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1 This is a schematic diagram of the routing of the wireless self-organizing network of node seismometers;

[0021] Figure 2 This is a schematic diagram of the data frame structure of the information update package;

[0022] Figure 3 Schematic diagram of node address book, where (1), (2) and (3) are different network connection forms;

[0023] Figure 4 This is a schematic diagram of the process of periodically updating node information;

[0024] Figure 5 It is a schematic diagram of the historical path record of the data packet;

[0025] Figure 6 This is a schematic diagram of routing decision for directional escape mode;

[0026] Figure 7 The figure is a schematic diagram of routing failure and its handling method. DETAILED DESCRIPTION

[0027] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0028] See also Figure 1 As shown, the present invention provides a directional escape routing method based on node address book difference set operation, the method comprising: comparing the own address book with the current data packet historical path according to each contact node in the current node address book in the node where the current data packet is located, selecting the nodes that exist in the address books of each contact node but do not exist in the current data packet historical path as valid nodes, and selecting the node with the largest number of valid nodes in the address books of each contact node as the next forwarding node, wherein the nodes are arranged in a line at equal intervals to form a line and form a complete wireless self-organizing network.

[0029] The method of the present invention can make routing decisions by obtaining the relative positions of network nodes. When it is impossible to obtain accurate node location information and geographic routing cannot be used, obtaining the relative positions of nodes can also achieve routing decisions. Due to the regularity of node seismograph distribution, the directional escape routing designed by the present invention using node address book difference set operation is to obtain the relative position of the node in the network, make forwarding decisions without relying on the accurate location information of the node, and allow data packets to be directionally forwarded along the seismic exploration line.

[0030] The wireless network composed of node seismometers is arranged along the seismic survey line, so the data packets in the network can only be transmitted forward and backward along the survey line. If a node knows its front-to-back relationship with nearby nodes, it is equivalent to obtaining relative position information, and the node can use directional escape routing to forward data without obtaining absolute position information. Based on this idea, the routing method of the present invention mainly includes the following contents: 1) periodic update of node information, 2) data packet historical path record, 3) directional escape routing decision, and 4) routing failure processing.

[0031] First, in the periodic update of node information, each node periodically generates and sends information update packets. The information update packet is sent in broadcast mode, and the node that receives the information update packet no longer forwards it. The information update packet contains the node address book and the node's previous cycle receiving node list. The node address book is a collection of nodes that can communicate directly near the node. The previous cycle receiving node list is a collection of source nodes of other information update packets received by the node in the previous update cycle, referred to as the receiving list. At the same time, in order to assist the directional escape route in making decisions, the information update packet will also add the wireless communication link quality evaluation value between each contact node in the node address book and the current forwarding node. The receiving list, node address book and link quality are all updated once every broadcast cycle. The main purpose of this part is to use the periodic broadcast mechanism to complete the update of the node address book and link quality evaluation without introducing network ACK response, provide support for directional escape routing, and reduce network data volume and delay.

[0032] Second, in the data packet history path recording part, the data packet in the network is designed to record the transmission path during the transmission process, that is, to record the set of nodes that the data packet passes through during transmission and forwarding in the network, which is called the data packet history path in the present invention. Due to the need for directional escape routing, the data packet history path also needs to include the node address book of the current forwarding node of the data packet.

[0033] Third, in the directional escape routing decision part, the routing decision process designed by the present invention is that the current data packet forwarding node first obtains the relative position of the nearby nodes in the network through a difference set operation based on the address book maintained by itself and the historical path carried by the data packet, and then makes a routing decision with the assistance of the link quality evaluation value, including selecting the next forwarding node and the corresponding forwarding path. The directional escape routing method designed in this way enables the wireless self-organizing network to forward data packets in a directional manner along the survey line when encountering a scenario where the node geographic location information is missing or determined to be unreliable, rather than forwarding by detour of geographic routing.

[0034] Fourth, in the routing failure processing part, the main problem is that the subsequent data packet forwarding path may not be found due to the time-varying quality of the wireless network link in the directional escape routing mode. That is, when the forwarding node makes a forwarding decision, the communication link of the destination node is still unblocked, but when the data packet arrives at the destination node, the communication link of the destination node is suddenly disconnected for a short time, resulting in the directional escape routing being unable to make the next forwarding decision, so that the data packet cannot continue to be forwarded. The present invention uses a flooding routing protocol that limits the number of data packet hops to solve this problem. Through flooding routing, data packets are forwarded to the surrounding nearby nodes without selection, thereby leaving the problem node, allowing the data packet to go out of the routing failure area of ​​the directional escape routing and continue to be forwarded.

[0035] Specific:

[0036] The main purpose of periodically updating node information is to update the address book of each node, and also to update the link quality estimation value for use in the directional escape routing mode. The node address book is designed to be periodically maintained and updated. This is due to the time-varying characteristics of the network, and the connection relationship between nodes is time-varying. In order to track changes and update the address book of each node, the present invention designs each node to periodically generate and send an information update package. The information update package mainly contains the node's current address book and the list of nodes received in the previous period, as well as the link quality evaluation value of the contact node in the address book. The data format of the information update package is as follows: Figure 2 The information update packet is sent in broadcast mode, that is, it is not in the same channel as the data packet, and the node that receives the information exchange packet will not forward it again.

[0037] First, the concept of the receiving list is explained. The receiving list refers to the list of receiving nodes in the previous cycle, which is the collection of source nodes of other information update packets received by the node in the previous update cycle. The receiving list counts the communicable nodes near the node to update the node address book.

[0038] Link quality is common knowledge to those skilled in the art, and there are many existing methods for calculating link quality in the prior art, which will not be described in detail here. It should be noted that the present invention is not limited to any specific link quality evaluation method.

[0039] The node address book of the present invention refers to a collection of nodes including the node itself and nodes with which the node has established a stable direct wireless communication connection in the same measurement line. The above definition has two key conditions, one is wireless direct communication, and the other is the same measurement line.

[0040] First, let's explain the concept of direct communication. Figure 3 In the network shown in (1), node a and node b establish a direct connection, so nodes a and node b are in each other's address book. Similarly, nodes b and node c, and nodes a and node c can all establish direct connections, so nodes a, b, and c are in each other's address book. Define the address book as C, then the address book C of nodes a, b, and c is a =C b =C c ={a,b,c}. Figure 3 In the network shown in (2), nodes a and c establish a connection and communicate through node b, that is, nodes a and c cannot communicate directly, so nodes a and c are not in each other's address book. a ={a,b}, address book C of node c c ={b,c}. Node b can communicate directly with nodes a and c, so the address book of node b is C. b ={a,b,c}.

[0041] Let's explain the concept of the same measurement line. In node seismograph exploration, node seismographs are often used to measure the Figure 1 The multiple survey lines shown are organized in a parallel manner. In order to meet the needs of seismic exploration data processing, the node seismometer self-organizing network should also be constructed in the form of survey lines. Seismometer nodes in different survey lines cannot be networked with each other. The main purpose of the routing algorithm designed by the present invention is to rely on the survey line structure to pass through the routing hole when the data packet encounters a routing hole. Therefore, the address book described in the present invention is limited to nodes in the same survey line, and does not include nodes in other survey lines. Figure 3In the network shown in (3), there are two measurement lines 1 and 2. The nodes in measurement lines 1 and 2 are labeled with different sequences because of the different measurement lines, so as to identify whether the communicating nodes are on the same measurement line. In the figure, although nodes 1a and 1b can communicate directly with node 2a, they are not on the same measurement line, so the node address book does not include each other.

[0042] The following is a detailed description of the node address book update method. As mentioned above, the node address book is maintained and updated by periodically updating node information. The specific process of periodically updating node information is as follows: Figure 4 As shown. Assume that nodes a, b, and c are within each other's signal range and can communicate directly, and the broadcast period is T. Select t0, t1, and t2 as the start time of the broadcast of nodes a, b, and c, respectively, and limit t0, t1, and t2 to be in the same period (since the broadcast period of each node is the same, broadcast packets of all nodes in the network will inevitably appear within a period of T). Assume that node a starts broadcasting information update packets at time t0, and this is the starting point of time. At this time, the address books of each node and the acceptance list of the previous period are both empty sets. At time t1, node b starts broadcasting. At this time, node b has received the broadcast packet of node a, so node a exists in the acceptance list of node b's broadcast. At time t2, node c starts broadcasting. At this time, node c has received the broadcast packets of nodes a and b, so nodes a and b exist in the acceptance list of node c's broadcast. At t0+T, node a has gone through a cycle of T time and started to update the address book. In the previous cycle, node a received broadcast packets from nodes b and c. At the same time, it was found from the received broadcast packets that node a was in the receiving list of the broadcast packets of nodes b and c, proving that a and b and c completed direct communication with each other in the previous cycle. At this time, node a will put nodes b and c into its own address book. After completing the update of the address book, node a starts the next cycle of broadcasting. In addition to filling its own address book into the broadcast packet, since node a received the broadcast packets of nodes b and c in the previous cycle, node a will fill in the receiving list of the broadcast with nodes b and c. Similarly, nodes b and c will complete the update of their own address books and send broadcast packets at t1+T and t2+T respectively.

[0043] As can be seen from the above, the node relies on the information update packets received from other nodes in the current cycle to verify the nearby communicable nodes, thereby updating its own address book. Therefore, the update cycle of the node address book is also the information update packet sending cycle. This method completes the update of the node address book without introducing the network ACK response, and uses the method of querying the node's periodic acceptance list in the broadcast packet to verify whether the node interconnection is successful. Although it increases the CPU overhead, it reduces the amount of data transmission in the network and reduces network latency and power consumption.

[0044] Data packet historical path: The purpose of recording the historical forwarding path of a data packet is to cooperate with the node address book to determine the relative network position of the node, so as to provide support for subsequent directional escape routing decisions. In order to accurately obtain the relative position of the data packet, the data packet historical path cannot only record the nodes that have forwarded the data packet, but must include all nodes passed through in the forwarding path, including the communication nodes that did not participate in the forwarding. Therefore, the definition of the data packet historical path of the present invention should be expressed as follows: The data packet historical path is the union of the set of nodes passed through by the data packet transmission path and the current forwarding node address book set.

[0045] As in Figure 5 In the example, it is assumed that each node can directly communicate with two nearby nodes on the left and right. From the explanation of the node address book, we can see that the address book of node e is C e ={c, d, e, f, g}. If a data packet is transmitted along the measurement line in the directional escape routing mode, assuming that the data packet starts from node a and passes through forwarding node c to node e. Then the historical path of the data packet at node e is the set of nodes h = {a, b, c, d, e} and the address book C of node e. e The historical path obtained by union is h e ={a,b,c,d,e,f,g}.

[0046] In fact, the set of nodes h is the historical path of the data packet before it reaches the forwarding node e. That is to say, the definition of the historical path of the data packet can be expressed in the following way according to the flow of the program loop statement: the current historical path of the data packet is the union of the historical path carried by the data packet before it reaches the current forwarding node and the address book of the current forwarding node.

[0047] This leads to the specific process of updating the historical path of a data packet. Generally, the historical path of a data packet is updated each time it is forwarded. The historical path carried before is combined with the address book of the current forwarding node, and then forwarded. This also leads to an equivalent definition of the historical path of a data packet, that is, the historical path of a data packet is the union of the address book sets of each forwarding node through which the data packet passes. In other words, Figure 5 In the example, the historical path of a data packet starting from node a and forwarding through node c to node e is actually obtained by the union of the address books of nodes a, c, and e.

[0048] According to the above definition, as the number of times a data packet is forwarded increases, the number of node elements in the historical path of the data packet increases until the upper limit of the data packet capacity is reached. This undoubtedly increases the network burden. In order to avoid this situation, the size of the historical path of the data packet is limited by recording the number of forwarding times of the nodes passed. That is, when the historical path of the data packet is updated, the forwarding times of the node elements in the updated historical path are also recorded.

[0049] For the communication nodes in the historical path carried by the data packet before, the forwarding times of this type of nodes are all increased by 1 during the update. This indicates that these nodes will undergo one more data forwarding in the historical path carried by the data packet before. For the communication nodes in the address book of the current forwarding node, this type of node is added to the new historical path when the historical path is updated, so the forwarding times are initialized to 0. This indicates that these nodes are newly added to the historical path during this forwarding. As the data packet is continuously forwarded, the forwarding times recorded for the nodes that the data packet is gradually moving away from will continue to increase. At this time, eliminating the nodes with too many forwarding times can limit the data packet capacity while retaining the historical path of the data packet in the vicinity of the forwarding node, without affecting the routing decision.

[0050] like Figure 5 As shown in Figure 1, assuming that the number of forwarding times of each node in the historical path of the data packet is limited to less than three, the historical path and forwarding times of the data packet forwarded from node a to node g can be obtained from the definition of the historical path of the data packet mentioned above. When the data packet is at node a, the historical path is h a ={a,b,c}, the forwarding times of each node in the historical path are all 0. The historical path at node c is h c ={a,b,c,d,e}, the forwarding times of each node in the historical path are 1,1,1,0,0. The historical path at node e is h e ={a,b,c,d,e,f,g}, the forwarding times of each node are 2,2,2,1,1,0,0. When the data packet arrives at node g, the updated historical path is h g ={a,b,c,d,e,f,g,h,i}, the forwarding times of each node are 3,3,3,2,2,1,1,0,0,0. Since the forwarding times are limited to less than three, nodes a,b,c will be removed from the historical path of the data packet. That is to say, the updated historical path of the data packet of node g becomes h g ={d,e,f,g,h,i}, and the number of forwarding times of each node is 2, 2, 1, 1, 0, 0 respectively.

[0051] The directional escape routing decision principle of the present invention is as follows Figure 6 This routing uses the historical path of the data packet and the node address book to find the current forwarding node.

[0052] The nodes are arranged in a line at equal intervals to form a complete wireless self-organizing network. The rule for the node where the current data packet is located to determine the next forwarding node is as follows: each contact node in the current node address book compares its own address book with the historical path of the current data packet. The nodes that exist in the address book of each contact node but do not exist in the historical path of the current data packet are called valid nodes. The node with the largest number of valid nodes in the address book of each contact node is selected as the next forwarding node.

[0053] Specific examples include Figure 6 As shown in Figure 2, it is also assumed that each node can directly communicate with two nearby nodes on the left and right, and the data packet has been delivered to node e, and node e will decide the next relay node. At this time, according to the historical path update method of the data packet, the new historical path of the data packet includes the address book of node e, which is h e ={a,b,c,d,e,f,g}. At this time, the historical path covers a continuous area, such as Figure 6 The address book of node e is C e ={c, d, e, f, g}, node e needs to select a node other than itself as the subsequent forwarding node to achieve directional escape routing. That is, make a choice among {c, d, f, g}, and the rules are as described above.

[0054] For node c, its address book is as follows Figure 6 The dotted area in the middle sector is shown as C c ={a,b,c,d,e}. All the address book nodes are in the historical path of the data packet, and the number of valid nodes is 0; for node d, its address book is C d ={b,c,d,e,f}, the number of valid nodes is 0; for node f, the address book is C f ={d,e,f,g,h}, where node h does not belong to the historical path of the data packet, and the number of valid nodes is 1; for node g, its address book is C g ={e,f,g,h,i}, where node h and node i do not belong to the historical path of the data packet, indicating that the number of valid nodes of node g is 2. Therefore, according to the rule, node g is more suitable as the next forwarding node of node e.

[0055] The above is extended to the general case of n nodes, which can be expressed as follows: the other nodes in the address book of the current forwarding node n, except itself, use their own address book C i (i≠n) first performs an intersection operation with the historical path H of the current data packet, and then performs a difference operation on the obtained set with its own address book. Finally, the node with the largest number of elements in the obtained set is the forwarding node.

[0056] The specific implementation method is as follows: Assuming that the data packet has been delivered to node n, node n will determine the next forwarding node. At this time, the first step is to update the historical path of the data packet. According to the updating method of the historical path of the data packet, the new historical path H of the data packet can be calculated by the following formula:

[0057] H=H∪C n

[0058] The right side of the equation H is the historical path of the data packet before it reaches node n, and C n is the address book of node n.

[0059] After updating the history path, you need to traverse C n The address book of all nodes except node n in the table, and then perform set operations according to the general rules mentioned above to obtain a set consisting of the valid node numbers of each node:

[0060] N={e|e=|C i -C i ∩H|,i∈C n ,i≠n}

[0061] Generally, the number of elements in a set N is not 0. Let the value of the largest element be max and not 0. If the set C n The mapping from 1 to N is f, and according to the mapping, the candidate forwarding node list set A can be obtained as follows:

[0062] A={a|a∈C n ,f(a)=max}

[0063] In general, the max value is uniquely determined, that is, the next forwarding node is uniquely determined in set A. However, due to the instability of the network wireless link, the node address book is changing and fluctuating, which may cause fluctuations in the calculation of the number of valid nodes, resulting in a non-unique max value.

[0064] Still Figure 6 For example, if other conditions remain unchanged, only node g has its address book changed to C due to a sudden change in wireless communication. g ={e,f,g,h}, then the number of valid nodes in the address book of node g also becomes 1, and the number of valid nodes of node f is also 1. At this time, there will be two candidate forwarding nodes in set A. Either one of them can be selected to forward and the data packet can continue to be transmitted.

[0065] However, in order to help improve forwarding decisions and enhance network performance, the present invention also introduces a wireless self-organizing network communication link quality estimation method to assist routing decisions. The principle of using link quality evaluation to assist routing decisions is that when there are non-unique candidate nodes in the candidate forwarding node list A, the link quality between each candidate node and the current forwarding node is evaluated respectively, and the node with better link quality is selected for forwarding.

[0066] Each node needs to actively evaluate the link quality corresponding to each contact node in the address book in each information update packet broadcast cycle. The present invention uses the number of data packet transmissions as the link quality evaluation value. The number of data packet transmissions is calculated by taking the inverse of the data packet transmission success rate of the wireless communication device physical layer parameter, and the calculation formula is as follows:

[0067]

[0068] where r in Indicates the success rate of data packet sending between nodes i and n.

[0069] Specifically, assuming that nodes a and b are both in the candidate forwarding node list of the current forwarding node n, the number of data packet transmissions between nodes a, b and node n is calculated respectively, and then the node with the smaller number of data packet transmissions is compared to be the final candidate forwarding node.

[0070] After the final candidate forwarding node is selected, the forwarding path selection problem still needs to be solved. Due to the time-varying nature of wireless ad hoc networks and the interference caused by the near-surface environment, wireless communication links are complex and volatile. In many cases, data transmission completed by two or more hops may be faster and more stable than data transmission completed by one hop. The forwarding path is also selected by link quality estimation.

[0071] Assume that the current forwarding node is i and the candidate forwarding node is k. There are two options for the transmission path from node i to node k in the network: direct forwarding and forwarding through node j. When the number of packet transmissions is used to estimate the link quality, the evaluation values ​​of the two paths can be calculated according to the following formula:

[0072]

[0073]

[0074] Where r ik The success probability of node i transmitting a data packet to node k, parameter r ij With parameter r jk Similarly, by comparing the calculation results, the path with fewer data packet transmission times is selected as the forwarding path from node i to node k.

[0075] When routing failure occurs. Routing failure is caused by the unstable and easily mutated nature of wireless communication transmission links. Specifically, there is a delay between the network information such as the address book and link quality estimation value currently maintained by the node and the actual network transmission link, which may cause Figure 7 The routing failure situation shown in . After forwarding node a makes a forwarding decision and transmits the data packet to node c, node c deletes subsequent nodes d and e from its own address book due to network instability and other reasons. This results in that after the data packet reaches node c, the directional escape route will not find a subsequent forwarding node to forward the data packet.

[0076] In this case, the forwarding node c is obviously at the edge of the area covered by the historical path. This problem is solved by using a flooding routing protocol that limits the number of packet hops. That is, regardless of the routing direction, packets are sent indiscriminately to surrounding nodes. After the data packet is forwarded through flooding, it will be able to return to node a, and b will restart the directional escape route. If the communication link of node c is a short-term sudden network failure, the data packet forwarded by node a will be able to be transmitted again. If the communication link of node c is difficult to recover in a short time, the data packet forwarded by node b will be able to be transmitted to the subsequent nodes, thus solving the routing failure problem.

[0077] Flooding routing does not consider the routing direction and forwards data packets indiscriminately to the surrounding communicable nodes, which will make the data packets go out of the invalid routing area. Of course, this kind of routing has no fixed direction, and it also causes data packets to be forwarded between nodes, resulting in a large number of redundant data packets. Therefore, it is necessary to limit the number of data packet forwarding in the flooding routing mode, that is, the number of data packet hops. In this way, through a limited number of data packet flooding forwarding, the data packet can go out of the invalid routing area, and the number of hops is limited so that the data packet will only be repeated a limited number of times in a small area, so as not to generate a large number of duplicate data packets and affect the overall network performance.

[0078] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A directional escape routing method based on node address book difference operation, It is characterized in that The method comprises: comparing the contact list of each contact node in the current node address book in the node where the current data packet is located with the current data packet historical path, selecting the nodes existing in the address book of each contact node but not in the historical path of the current data packet as valid nodes, and selecting the node with the largest number of valid nodes in the address book of each contact node as the next forwarding node, wherein the nodes are arranged in a measuring line at equal intervals to form a measuring line and form a complete wireless self-organizing network; The node address book includes a set of nodes including the node itself and nodes that establish a wireless direct communication connection with the node in the same measurement line; Each node periodically generates and sends an information update package, wherein the information update package includes the node's current address book, a list of nodes received in the previous period, and link quality evaluation values ​​of the contact nodes in the address book, and the node address book of the node is periodically updated according to the information update package; When there is no unique candidate node in the candidate forwarding node list, the link quality evaluation value between each candidate node and the current forwarding node is evaluated respectively, and the node with the high link quality evaluation value is selected for forwarding; Each node needs to actively evaluate the link quality corresponding to each contact node in the address book in each information update packet broadcast cycle, and use the number of data packet transmissions as the link quality evaluation value. The number of data packet transmissions is calculated by taking the inverse of the data packet transmission success rate of the physical layer parameter of the wireless communication device. The calculation formula is as follows: where r in represents the success rate of data packet transmission between nodes i and n; The information update packet is sent in broadcast mode, not in the same channel as the data packet, and the node that receives the information exchange packet will not forward it; The node verifies nearby communicable nodes based on the information update packets received from other nodes in the current cycle, thereby updating its own address book; the data packet history path includes the union of the history path carried by the data packet before it reaches the current forwarding node and the address book of the current forwarding node, and the data packet history path is updated each time it is forwarded; For the communication nodes in the historical path previously carried by the data packet, the forwarding times of this type of nodes are increased by 1 during the update. For the communication nodes in the address book of the current forwarding node, this type of nodes are added to the new historical path when the historical path is updated, and the forwarding times are initialized to 0, indicating that these nodes are newly added to the historical path during this forwarding. When the data packet is continuously forwarded, the forwarding times recorded for the nodes that the data packet is gradually moving away from will continue to increase. At this time, eliminating the nodes with too many forwarding times can limit the data packet capacity while retaining the historical path of the data packet within the vicinity of the forwarding node; Nodes with forwarding times exceeding the limit are eliminated by using the number of forwarding times of the nodes passed through to limit the size of the historical path of the data packet; When the calculation of the number of valid nodes fluctuates and the most non-unique value occurs, the link quality between each candidate node and the current forwarding node is evaluated, and the number of packet transmission times is used as the link quality evaluation value. The node with the smallest number of packet transmission times is selected as the final candidate forwarding node; When a forwarding node makes a forwarding decision and transmits a data packet to a subsequent node, and cannot find a subsequent forwarding node to forward the data packet due to routing failure, flood routing is adopted. Regardless of the routing direction, the data packet with a hop limit is forwarded indiscriminately to the surrounding communicative nodes, so that the data packet can leave the routing failure area.

2. The method according to claim 1, It is characterized in that The previous period receiving node list is a collection of source nodes of other information update packets received by the node in the previous update period.