TW200926690A - A routing method with back-path-affirmed dynamic source - Google Patents

Abstract

A routing method with back-path-affirmed dynamic source comprises the steps of: sending a RREQ packet received by at least one middle node through a source node; affirming whether there is a bidirectional path between the middle node and the source node sending the RREQ packet or not by a bidirectional link test; rebroadcasting the RREQ packet till an objective node is found; according to the RREQ packet, finding a forwarding path and a back path so as to complete path building of a wireless network.

Description

200926690 IX. Description of the Invention: [Technical Field of the Invention] - The present invention relates to a reverse path confirmation dynamic source routing method, in particular, whether a two-way path exists between two nodes using a two-way connection detection, In order to establish a "wireless network" method.思深硌 [Prior Art] The non-basic architecture network (MANET) is a network formed by several wireless devices. Generally speaking, the non-basic architecture network can be roughly divided into towns. Several types of mosquito feeding: 1, active routing agreement (pr〇active (7) said 丨 ton: also known as table-driven (table_driven), such as DSDv or other agreements, the principle is in the network without infrastructure Between each node, the routing table is established by periodically exchanging resources. When the data needs to be transmitted, the data is transmitted by referring to the routing table to select an appropriate path. The advantage is that the material transfer speed is faster, but the defect is lacking. It is easy to consume power, must waste the hidden space to store the routing table, and easily cause the control overhead of the network to be filled and changed, which leads to excessive bandwidth consumption. 2 Reactive r〇uting pr〇t〇c〇i: Again - called demand-oriented (〇n-demand), such as A0DV, DSR, LMR ^BRP, etc. The principle is that there is no basis a section of the architecture network to be transmitted At the time of the material, the party made a request, and then established a road control with the point and point of the data to be received. The advantage is that it saves power and does not cause the network to flood the control information of 200926690. The disadvantage is that if there is no basic architecture network When the frequency of transmitting data in the road is too high, it is still easy to find the path action too frequently, and the power of the relevant node is lost. 3. Hybrid routing protocol: Proactive routing is adopted. A combination of the above two protocols, such as a protocol) and a reactive routing protocol. Combining the characteristics of the two, the non-basic architecture network can be further divided into a local area and an area. In the region, a proactive bypass protocol is adopted, and a reactive bypass agreement is adopted outside the region.

进行 The communication, message exchange, data transmission or reception between any two nodes (wireless devices) in the aforementioned basic network (MANET) must rely on the transmit power of the node (transmissi〇n power) And the receiving sensitivity of the antenna to determine whether the two nodes can exchange messages with each other. In addition, the transmission capability and antenna receiving sensitivity of different brands of wireless devices are also different, so that there is still a relationship of "representative transmission capability" between nodes and nodes. Therefore, a non-basic architecture network that is established by several different brands of secret devices may cause a one-way path between nodes and nodes. For a general infrastructure network, nodes must rely on nodes and Nodes communicate with each other under the condition of _ _ silk, which has a significant impact from time to time. .1 only produces a soap-direction transmission path, such as computer 12' personal: - Γ usually has a higher transmission capacity, while notebook computer personally activates digital assistant 13 (PDA) and mobile phone 14

• I 200926690 has a relatively small transmission capacity. Between 12 will generate a single-way path from the base station 11 to the notebook computer than the mobile digital assistant notebook computer 12 also has a one-way path due to transmission capacity. The whole =! "14", the one-way path between the two will also be produced, it is easy to body = target: _ asymmetric transmission capacity" Fan's coffee (such as the rule of the enemy 11 nodes can only transmit Unable to receive the response message ear. Ά .f leads to the establishment of the wrong result, and the efficiency of the network operation has a considerable impact. i then use the two commonly used wireless network to circumvent the second party. The one-way path situation caused by the wireless transmission of the asymmetric transmission capability' is a description of many possible problems: 1 AODV (Ad Hoc On Demand Destination Vector) A〇DV疋 A demand-oriented (〇 N-demand), which includes three kinds of packets: RREQ, RREp, and rrer. The routing protocol mainly searches for available paths to facilitate data transmission when a source node needs communication. When the source node When the data is to be transmitted, firstly, the routing table of the source node belongs to check whether there is path information reaching a destination end node. When the path information is available, the related information is directly transmitted according to the routing path table. If the path information is not available, the Route Discovery mechanism is started. At this time, the source node sends a 200926690 record to the neighboring node in the flooding mode. Record the path to the road and the routing table to establish a pair of end node path information, ^ "Whether the road location table has reached the destination, if the right and left no longer broadcast the RREQ packet out of the node to collect money Nasha packet is given to the source node 'until the destination end spoon i two Q packets after the 'fine reverse path is sent back to the RREP seal == node' when the source end node and the destination end node

"Package time" can establish the arrival end node = routing information, until the source end node receives the RREP packet, the system does not successfully establish the path, and then can start transmitting data ^ "Additional 'A〇DV is the utilization node The path is maintained by sending the heUo message to each other. Each node periodically broadcasts hdi〇message to each other, and the neighboring node responds with a message to determine whether the previously established path is interrupted. For example: When the response message is received, the connection path between the representative and the node may be interrupted. At this time, the RRER packet is used to notify other nodes that the path is interrupted, and a new path must be re-established to achieve the maintenance path. As shown in FIG. 2, a basic infrastructure network includes a source end node 21 (S), a first intermediate node 22 (a), a second intermediate node 23 (B), and a third intermediate node 24. (C) and a destination end node 25 (D). When the source end node 21 initiates a Route Discovery mechanism to establish a path, the calculus according to the aforementioned A〇Pv edge delivery protocol may be used. The destination end node 25 is found. When the destination end node 25 receives the RREQ packet sent from various places, it is assumed that the destination pin node 200926690 25 obtains the path pinch as "s-c-D" and "s-Αχr" respectively. S—»·Β—^C-^-Γ» a* _ υ” and “special three paths, according to the A〇DV shortest path (^•test Path) algorithm, the destination end node 25 will select the number of hops 〇P Count) The least path carries the RREp packet, so "〇-c_s" is the path to return the RREp packet to the source node 2. However, if the transmission capability of the third intermediate node 24 reaches the source node 21, a unidirectional path exists between the source node 21 and the third intermediate node ‘point 24. Therefore, the third node 24 cannot forward the pulse p packet to the source end node 21, and the source end node 21 also directly determines that it cannot receive the coffee packet from the third node 24. Interrupt the connection and restart the Route & Lookup (RGUte Dise() vei^) mechanism. In fact, j such as "S-A~>C~D" is still a usable bidirectional path, but it is not selected because it is not the most ^ path. On the whole, when the "face-to-face _ month b force" situation of the network is serious, such situations may also increase, resulting in ❹ the source end node 21 constantly restarting the path search (R〇ute

The Discovery mechanism, which causes a large number of control packets to flow through the network, causes broadcast storms and affects the transmission of normal packets, thus seriously affecting network performance. ί 2, DSR (Dynamic Source Routing): DSR is also a demand-oriented (on_(iemand) routing protocol, which is the source end section; when the communication is needed, the available path is sought to facilitate the transmission of the data, and the same package &lt; RREQ, RREP and RRER, etc. The difference between DSR and A〇d is that the routing tabie is not used as the basis for the selection of the road 4 200926690, but the route cache record is available separately. Path. When the source node wants to transmit data to another node, the source node first searches for the path information of the destination node from the route cache, and if so, directly uses the path. The transmission data 'If no, the Route Discovery mechanism is started, and the rreq packet is sent to the neighboring node in a flooding manner. When the other node receives the RREQ packet, it can first confirm whether it is the destination node. If yes, then return the RREP packet to the source node. If not, then use the route cache to find the path to the destination node. If the path information is available, the path information of the binding point is added to the RREP packet and returned to the source node. If the path information is not available, the path of the node itself is added. The information is sent to the RREQ packet, and the rREq packet is broadcasted by the broadcaster. Since the path information of the RREQ packet is recorded in the route cache, the path recorded by each node is The complete path information from the source end node to the node itself, until the 10 destination end node receives the packet, and then sends back the RRep packet to the source end node v according to the path information in the RREQ seal. Indicates that the path has been successfully established, and then the data can be transmitted. - In addition, when the DSR maintains the path, each node must detect whether the path between itself and the next node is interrupted. When the node transmits the data to the next node, Listening to the next node if there is no forwarding packet, directly determining that the path between the user and the next node may have been interrupted and then issuing the RRER packet to the source node, and Delete the information about the path cache (200926690 mute cache), the above is a passive acknowledgment (PassiveAek_ledgement) way to the second point 'a basic architecture network also contains - Ο =::21(S) - a - node (10), a second node 23 (), a third node 24 (C) and - a destination node 25 (D). When the source node 21 needs to transmit data, it will cache from the path ( nJe de) find out whether there is path information that can reach the end point and point 25 of the destination. If not, then the county secret (flQGding) κ (four) coffee q packet to find the path 'for example: the obtained path is "S-C- D". In addition, if the transmission capability of the third node 24 cannot reach the source end node, 1 the destination end node 25 can find the available path in a flooding manner, for example, the obtained path is “ The D-c-A4S two path is used as the response path. Therefore, the DSR can establish two non-bidirectional paths 'allowing the data packet to be sent out differently from the response path. However, when the source node 21 and the destination node 25 Each performs a Route Discovery mechanism to establish an asymmetric two-way ^, which can solve the one-way miscellaneous problem of the money AODV, but the county source node 21 and the destination node 25 each perform the broadcast reduction, which is also quite easy. The problem of the broadcast storm is caused by the network. In summary, the aforementioned AODV and DSR are affected by the one-way path in the network environment with "asymmetric transmission capability". Among them, AODV is easy to make a path establishment error due to the selection of the shortest path. Although two unidirectional asymmetric paths are allowed, if the network has a serious degree of 'asymmetry transmission capacity', the path establishment cost will increase by 200926690. This in turn seriously affects network performance and also creates difficulties in path maintenance. SUMMARY OF THE INVENTION The main object of the present invention is to provide a reverse path confirmation dynamic source routing method, which improves the conventional wireless network routing method (AODV and the method by detecting whether there is a bidirectional path between the two nodes in advance). DSR) The disadvantage of excessive path establishment cost makes the invention have the effects of improving path establishment efficiency and reducing network control messages. Another object of the present invention is to provide a reverse path acknowledgment dynamics ❿ source routing method, which is a bidirectional path between nodes of a response path, so as to detect a path interruption situation, so that the present invention has a lifting path The effect of the convenience of the bird. According to the reverse path confirmation dynamic source routing method of the present invention, a RREQ packet is sent by a source end node for at least one intermediate point reception; and the intermediate node is used to confirm the intermediate node and issue the RREQ. Whether there is a bidirectional path in the node of the packet, and cooperates with the RREQ packet to be broadcasted until a destination end node is found; finally, according to the RREQ packet, the _delivery and _response path is found to be a wireless network. Path creation work. The above and other objects, features and advantages of the present invention will become more <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; 4, the reverse path confirmation dynamic source routing method of the present invention is used to establish a connection path of a network without a basic architecture. Step 12 - 200926690 Steps include - path requirement step s - packet forwarding step S2 And a path establishing step S3. The present instructor is required to detect whether there is a two-way path between the two nodes (wireless setting) through the "two-way connection detection" in the packet forwarding step S2, so as to facilitate the - wireless network establishment - the outgoing path (f_arding path) and - The response path (baek path) is then available for wireless transmission of related data. The reverse path confirmation dynamic source routing method of the present invention mainly determines whether there is a bidirectional path (bi_directional path) between any two (MIMO devices) of a non-basic architecture network (MANET) by prior judgment. As an important basis for the establishment of subsequent transmission paths. The method of judging whether there is a bidirectional path between two nodes is called "bibi-direction path test" BL test). The bidirectional connection test mainly uses the transmission power of the two nodes (ni, nj) to indicate that the 'receiving sensitivity is represented by Si and Sj, respectively, and the path between the two nodes (ni, nj) is attenuated (―1(10)). Then, it is represented by Pl&lt;i,j&gt;, and it is assumed that the path attenuation of the two points is equal (ie, _, 卜网)>). Thereby, 7 can satisfy the following two conditions at the same time, that is, the two nodes (called, ^) have a bidirectional path between each other. • (1) .(2) TJ~pi&lt;j,i&gt;&gt;Si. Hawthorn More 5' When a node (nj) receives a packet sent by another node (η〖), it represents a node (4) When the node « is in the step of determining whether the path of the node (9) to the node ur exists. As shown in FIG. 5, a transmission power block (Tpower), a receiving sensitivity block (Rsense), and a contact value block (Ulink) may be additionally added to the _Feng-13-200926690 package to judge two. Whether there is a bidirectional path (bi_directional path) between nodes (Πί, η). In addition, the RREQ packet includes the basic fields such as the package type (pktType), the jump number (Hop Count), the path (Path), and the like in addition to the above-mentioned three additional fields of the present invention (the basic column) Within

The valley is set for the conventional wireless communication standard and will not be described here. When the node (%) sends an RREQ packet, the transmission power (Ti) and the receiving sensitivity (Si) of the node (ni) can be simultaneously filled into the transmission power block (

Tpower) and the receiving sensitivity interception (Rsense), when the node (%) receives the RREQ packet, it cooperates to measure the signal strength (R) of the rreq packet, and simultaneously obtains the transmission power of the node (ni) (Ti) ) and g sensitivity (8). At this time, if the third is not, the bamboo § 异 is the point (7) li to the node (珥) path attenuation (ρκ, j &gt; = Ti_Rj), assuming that the path attenuation between the two nodes Ui, nj) is equal ( That is, pl&lt;i, ,i&gt;), if T-wide Plcj, then, the path representing the node, (n) to the node (called), exists, that is, between the two nodes (called, .) In addition to the two-way path 1, the contact value block (UHnk) is used to record whether the two nodes (ni, nj) have a bidirectional path, for example, 200926690 to request the establishment of the hybrid 'and the transmission power of the (four) RREQ packet. The Tpower and the receiving sensitivity interceptor (Rsense) respectively fill in the transmission power and receiving sensitivity of the source end node and preset the U value to meet the condition of the bidirectional path (for example, set to 〇 ). The RREQ packet may be received by at least one intermediate node adjacent to the source end node, so that the intermediate node can cooperate with the subsequent packet relaying step S2 to find a destination end node. Please refer to FIG. 4 and FIG. 7 , which are flowcharts of the packet forwarding step S2 of the preferred embodiment of the present invention, which are received by an intermediate node in advance from other nodes (eg, the source node or other intermediate nodes). Etc.) The RREQ packet sent (S11); it is confirmed whether the intermediate node is the destination end point (S12); when the intermediate node is the destination end node, the response path is directly selected (back path) (SI3); or when the intermediate node is not the end node of the destination, the aforementioned "bi-directional path test (BL test)" is used to confirm the intermediate node and issue the RREQ packet. Whether there is a bidirectional path in the node (S14); when there is no bidirectional path, the rreq packet is put into a pending list, and the link value field (Ulink) in the RREQ packet is It is set to conform to the one-way path condition (for example, set to i) (S15); when there is a bidirectional path, the intermediate node directly rebroadcasts the zero RREQ packet (rebroadcast}, and also fills the middle in the Rreq borrowing Node transmission power And the receiving sensitivity, and does not change the content of the contact value field (Ulink) (S16); in addition, the intermediate node also checks the pending list (S17); and cooperates with the search - 15 - 200926690 Finding whether there is an RREQ packet previously reserved from other nodes (S18): if an eligible RREQ packet is found in the temporary storage string, the intermediate node retrieves the RREQ packet from the temporary storage sequence and simultaneously broadcasts ( Rebroadcast) (S19). Thereby, the RREQ packet can be relayed according to the foregoing steps through each intermediate node to find the destination end point.

Referring to FIG. 4, the path establishment step S3 of the preferred embodiment of the present invention, after receiving the RREQ packet, the destination end node may refer to the related content of the RREQ packet to establish a delivery path ( Forwarding path and a back path, the sending &amp; path is the path from the source end node to the destination end node, and the response path is a path from the destination end node to the source end node. The setting condition of the sending route is to select a path with the smallest Hop Count as the sending path, and put the related information of the sending path into a RREP packet; and, the condition for establishing the response path, At least, the "Hop Count" is required to be at least "The contact value field (uu^)a is in accordance with the bidirectional path condition (for example, the shape is 〇)". When the U-link conforms to the bi-directional path condition, there must be a path to the source end node, so that the RREP packet can be used to transfer the response path to the U.S. The source end node, thereby completing the path establishment of the network. 1 Please refer to FIG. 8 for the establishment of the foregoing response path. The node that can include the "response path must cover the conditions of the household that sent the route, in order to facilitate the related maintenance work. When the node of the route is sent, the node f"

D) is included in the section of the response path ^ (points of S - 16 _ 200926690 ^ 皆 are bidirectional paths, when the path is sent or the path of the response path is interrupted, the Tanabe node can find and path The information is transmitted to the source end. For example, it is assumed that the network is interrupted due to the node (7) leaving. ^ Although the node (C) is affected by the one-way path, it is impossible to know the fact that the section leaves, but it can still borrow (4) The conditional point only knows the fact that the path is interrupted' and returns the message of the path interruption to the source end node (8). At this time, the source node (s) can be fast

The path of the interrupt is built, so the convenience of path maintenance is provided. Please refer to Figure 9, which is based on the example of the application of this judgment to the establishment of a network without a basic architecture. The uncut network includes a source end node 31 (S). A first intermediate node ^ 32 A), a second intermediate node S 33 (B), and a destination end node 34 are properly configured. When the source end node 31 (s) issues an RREQ packet, it is assumed that The first intermediate node 32 (A) and the second intermediate node 33 (B) can respectively receive the ship Q packet (RREQO) sent by the source end node 31, and the first intermediate node 32 &amp; After node 33 (B) also confirms that it is not the destination end node %(7)), the bidirectional connection detection is initiated to determine the first intermediate node 32 (eight) and the second intermediate node 33 (B) and the source end node. 31 (s) Whether there is a two-way path between each other. It is assumed that the first intermediate node 32 (A) and the source end node 31 (8) have a bidirectional path through the detection result, and the pending list does not currently have any previously secured RREQ packets. The RREQ packet's contact value field (UHnk) — 17 — 200926690 does not make any changes (for example, set to 〇, which represents a two-way path), and the first intermediate node 32 (A) is also in the path (path). The block is added to its own address and the RREQ packet (RREQ&lt;2&gt;) is broadcasted (rebroadcast).

In addition, it is assumed that the second intermediate node 33 (B ) and the source end node 31 (S) do not have a bidirectional path through the detection result, and the uiink is set to 1 in the RREQ packet ( The second intermediate node 33 (B) also adds its own address in the path (the path) and adds the RREQ packet (RREQ &lt; 3 &gt;) to the temporary storage sequence ( Pending list). Moreover, when the second intermediate node 33 (B) also receives the RREQ packet (RREQ &lt; 2 &gt;) previously broadcast by the first intermediate node 32 (A), the second intermediate node is detected by the bidirectional connection detection result. When the two intermediate nodes 33 (B) and the first intermediate node 32 (A) have a bidirectional path, the value of the contact value field (Uiink) does not need to be changed (still set to 〇), and the path is also The Path field is added to its own address, and the RREQ packet content is RREQ&lt;4&gt; © as shown in FIG. Thereby, the second intermediate node 33 (B) not only broadcasts the RREQ packet (RREQ &lt; 4 &gt; ), but also finds whether the pending list has previously reserved RREQ packets from other nodes. 'Further, the previously reserved RREQ packet (RREQ&lt;3&gt;) can be found. Therefore, the second intermediate node 33 (B) simultaneously rebroadcasts the two RREQ packets (RREQ &lt; 3 &gt;, RREQ &lt; 4 &gt;). Finally, the destination end node 34 (D) can receive two RREQ packets from different paths (RREQ&lt;3&gt;, RREQ&lt;4&gt;) 〇^ 200926690, as shown in Figures 1 and 11, when the destination end node 34 (D) After receiving the two RREQ packets (RREQ&lt;3&gt;, rreQ&lt;4&gt;), the destination node 34 (D) also adds its own address to the path (Path), so the destination The scale collected by the node 34 (D) is £ (the content of the three packets is RREQ &lt;5&gt;, RRjgQa> as shown in Fig. 9. Thus, the two RREQ packets are referred to (RREQ&lt;5&gt;, rreQ&lt;6&gt;), and the path that meets the condition of "hop C0Unt" is used as the forwarding path. For example, the obtained path is "$-BD" and the message is sent out. The path is stored in the _ packet. In addition, the path that meets the condition of having the minimum number of hops (hQp and _ lm ( (Ulmk) set to G (bidirectional path) is selected as the back path. For example: Get The path is, A-S", to be transmitted back to the I source node 3US through the response path _j^p packet) The source end node 31 (8) refers to the content of the coffee packet, and then transmits the data to the destination node (D) through the delivery route. Further, the selection of the response path may also be added to the section of the response path. The condition of sending all the nodes on the path, for example, the response path "DHW" covers the response path | - B - D" to facilitate subsequent maintenance operations. As described above, compared to the conventional wireless network routing Method (AODV Valley is vulnerable to the influence of __"face-named Wei Li", but it is necessary to wait for the phase _ point to establish a two-way time between each other, so there is a way to sneak money, "X, increase shortcomings And another learned wireless network routing method (DSR), when the outgoing path cannot be used as the 200926690 path to transmit the RREP packet, then the destination node must start the path finding mechanism to obtain another available Response path, and &quot; has the disadvantage of greatly improved path establishment time and low path maintenance efficiency. ^ The invention is in the network environment with "asymmetric transmission capability", ^ in the process of finding the path 'Pre-detecting whether there is two-way controllable between the two nodes, as the main moxibustion test for the subsequent broadcast of the RREQ packet, and using the path with the least hop count as the 'out path, the outgoing path A one-way path may be allowed to exist, and each node of the i-path must be a bidirectional path to facilitate the % backhaul and path maintenance. In addition, although the delivery path may contain a single path, the hopcoum is less and better: value transmission efficiency. X 'When the node of the response path covers the sending path ^ node, it is more convenient for the nodes of the response path to perform the maintenance operation for the bidirectional characteristic, so that the road front guard is more efficient, the present invention is substantially The advantages are as follows: 1. All nodes of the response path are two-way (10), and the response road clearing ship RREP is sealed (four), and the big __ opportunity receives the RREP packet. Large 2, available for selection with the minimum number of hops (h〇pc path as the send path and response path, ', the cattle I Μ 鈥 鈥 for better transmission efficiency. Point, two paths: all the faster Know if there is a path interruption: to 200926690. 4. By conditionally transmitting the RR£q packet, in the "Asymmetric Wheeling Capability" network environment, the path can be established more quickly and reduced. Controlling the present invention. The present invention has been disclosed by the above-described preferred embodiments, and is not intended to limit the invention, and those skilled in the art can be made without departing from the spirit and scope of the invention. The various modifications and variations are still within the technical scope of the present invention, and the scope of the present invention is defined by the scope of the appended claims.

—21 — 200926690 [Simple description of the diagram] Fig. 1. A schematic diagram of a wireless network with asymmetric transmission capability. Figure 2: Schematic diagram of the path of the conventional wireless network routing method (AODV). Figure 3: Schematic diagram of the path establishment of the conventional wireless network routing method (DSR). Ο

Figure 4 is a block diagram showing the steps of the reverse path confirmation dynamic source routing method of the present invention. Figure 5 is a schematic diagram of a packet interception architecture sent by the reverse path confirmation dynamic source routing method of the present invention. Fig. 6 is a schematic diagram showing the conditions for establishing the bidirectional connection detection applied by the reverse path confirmation dynamic source routing method of the present invention. Figure 7 is a flow chart showing the detailed steps of the step S2 of the reverse path confirmation dynamic source routing method of the present invention. Figure 8 is a schematic diagram of the reverse path confirmation dynamic source routing method of the present invention for path maintenance. Figure 9 is a schematic diagram of the path establishment of the wireless path in the reverse path confirmation dynamic source routing method of the present invention. Figure 10: Schematic diagram of various packets used in the reverse path confirmation dynamic source routing method of the present invention. Figure 11 is a schematic diagram showing the sending path and the response path of the reverse path ball recognition dynamic source routing method of the present invention. 200926690 [Description of main component symbols] 11 Base station 12 Notebook computer 13 Personal action digital assistant 14 Mobile phone 21 Source node 22 First intermediate node 23 Second intermediate node 24 Third intermediate node 25 Destination end node 31 Source node 32 First intermediate node 33 second intermediate node 34 destination end node 13⁄43⁄4

twenty three

Claims (1)

200926690 X. Patent application scope: A reverse miscellaneous confirmation wire transfer method, by which a source Q node sends a coffee Q packet for supply: two '=receive' the Cong Q packet is filled in the source _ == And the receiving sensitivity 'and the Duning-contact value of the position match = confirm whether the intermediate node is a - destination node, and when the destination end node directly selects a response path, the middle is _ Ο 2 the destination end node When using the two-way link to detect the second two: Whether there is a two-way port for the node that sends the RREQ packet ^ When there is no double (four) (four) coffee 9 packets to put two; the contact value of the packet is numb to make a change, and the transmission power of the intermediate node is also provided for the _ the Cong Q packet, another (4) Transfer (4) to find the RREQ packet from other nodes and transmit it at the same time, and after receiving the Q packet from the SSI point, refer to the _ ^ select the minimum number of bribes for the number of clerk - send the path to the - face ^ package, Also select the path that meets the minimum number of hops and the side of the contact that meets the bidirectional path condition as the -reaction path =~ for the RREP packet to be forwarded to the hacker point to complete the path establishment operation. :ί ^ The method for the dynamic path source of the reverse path phase described in the scope of the patent application is as follows: the condition for establishing the path of the towel rib should include the response path—24-2 2 200926690 The node of the path must cover all the nodes of the delivery path and protect the operation. The dynamic source routing method is confirmed according to the reverse path described in claim 1 or 2 of the patent scope, wherein the bidirectional connection detection system transmits the power of the two nodes to Ti, respectively, and receives The sensitivity is represented by Si and Sj respectively, and the path attenuation between the unloading points is represented by ρκ, 』&gt;, assuming that the path attenuation of the two nodes is equal (ie pl&lt;i,, i>), if both Γ, - The p/c, 2 and 7}-2 conditions and the two conditions indicate that the two nodes have a bidirectional path between each other. 4. The reverse path confirmation method according to claim 1 or 2 of the claim patent range, wherein the RREQ packet's contact value field is set to 0 when the two-way path condition is met. The dynamic source bypass method is confirmed by the reverse path described in item 1 or 2 of the patent application scope, wherein the RREQ packet's contact value field is set to 1 'being the one-way path condition. —25 —