TWI351855B - A routing method with back-path-affirmed dynamic s - Google Patents

Description

1351855 r si *. Nine, invention description: ... [Technical field of invention] ' ' The present invention relates to a reverse path confirmation dynamic source routing method, in particular to the use of a two-way connection detection to confirm two nodes (wireless devices) There is a two-way path between them to establish a connection path for the wireless network. [Prior Art] Calling, the infrastructure-free network (MANET) is a network formed by several wireless devices. In general, the routing path selection of the non-based infrastructure network can be roughly divided into the following. Several kinds of routing protocols: < 1. Proactive routing protocol (Proactive routing protoc〇i): called table-driven, such as DSDV or CGSR, the principle is that there is no basic Each node of the architecture network establishes the routing table through mutual exchange of information between the parents, and when the data needs to be transmitted, the appropriate routing is selected by referring to the routing table. The advantages are: • The data transfer speed is faster, but the disadvantage is that it is easy to consume power, it is necessary to waste the memory space to store the routing table, and the control overhead that is easy to cause the network to be filled with the data after the parent switch. This in turn leads to excessive bandwidth consumption. 2. Reactive routing agreement (ReaCtiVer〇utingpr〇t〇c〇l): again

- called demand-oriented (〇n-demand), such as AODV, DSR, LMR or ABRP. The principle is that when there is no section 2 of the infrastructure network to transmit > Then establish a road with μ 3 to receive the data. The advantage is that it saves power and does not cause the network to be flooded with more than one control message. The disadvantage is that if the frequency of data transmission in the infrastructure without the infrastructure is too high, it is still easy to find the path action too frequently. While depleting the power of the relevant node. 3. Hybrid routing protocol: A hybrid method of the above two protocols, such as a proactive routing protocol and a reactive routing protocol. Combined with the characteristics of the two, the non-basic architecture network can be further divided into local area and area, the active routing agreement is adopted in the area, and the reactive routing agreement is adopted outside the area. ^ 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 capacity and antenna receiving sensitivity of different brands of wireless devices are also different, so that there is still a relationship of "asymmetric transmission capability" between nodes and nodes. Therefore, a non-basic architecture network established by a number of different wireless devices with different cards may cause a one-way path between nodes and nodes. For a basic infrastructure network, nodes and nodes must be relied upon. Under the conditions of communication with each other, there will undoubtedly be a major impact. More detailed. Referring to Figure 1, "Asymmetric Transmission Capability" will result in only a single-direction transmission path between the two nodes. For example, the fixed base σ 11 usually has a higher transmission capacity. The notebook computer 12, the personal action digital assistant 13 (PDA) and the mobile phone 14 π are two in between: from the base station η to the notebook computer is larger than the action digital assistant ΰ 12 also _ loss ability to generate a one-way road phenomenon . Overall:! Word: The one-way path between the two will also be produced. ^Asymmetric wheel capacity", can be #^成目(4) need to pass the two-way path to the 2m line of wealth (if the job is defeated by 1) U S-RTS packet, responded or (four) coffee spoon end section f can only transmit and can not receive the response message. ea 1'4 is the result of another - terminal node can only connect = (four) (Dumb) state, resulting in the establishment of the wrong path, which has a considerable impact on the efficiency of the network operation. The omnidirectional (four) shape caused by the wireless devices that are commonly used by the wireless network, which is commonly used, is limited to the asymmetric transmission capability, and the following problems are exemplified: 1 AODV (Ad Hoc On Demand Destination Vector) DV疋_ A demand-oriented (〇n_demand) routing protocol that includes three packets, RREQ, RREP, and RRER. The routing protocol is mainly when a source node needs communication. Finding the available path to facilitate the transmission of the data. When the source node wants to transmit the data, it first checks whether there is a path information reaching the destination end node in the routing table to which the source ^^ Lang point belongs. Have the road In the case of the path information, the related data 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 end point is 、; 〇〇 ding ) method to send a j packet to the neighboring node _ other nodes in the field receive the _1 ^ 0 packet, will be recorded to the road - the road ^ in its own routing path table, in order to establish - double end 2: Check if the routing path table to which the point belongs has reached the destination. If there is a destination I path information, if the packet is not broadcasted to the right, then the RREP packet is received and the source is received. The node is sent back to the RREP sealing node by using the reverse path until the destination end package is $~Q, and when the source end node and the destination end node arrive at the curry packet, the node can be established to reach the destination end. The node table corpse 'until the source node receives the RREP packet, the system is successfully established, and then the data can be transmitted. In addition to the second sf, the A 〇 DV uses the nodes to send hell to each other. mess'age / To do the road maintenance, the nodes will meet each other. The period broadcasts the mouth of the heii〇3 to the neighboring node, and whether the neighboring node responds to the message to determine whether the established position is interrupted. If the response message is not received, the representative of the link to the section may have been Interrupted, at this time, the RRER packet is used to notify other festivals. The new path is established in the county, and the maintenance path is established. As shown in Fig. 2, the basic infrastructure network includes one. The source end node 21 (S), the first intermediate node 22 (A), the second intermediate node 23 (B), a third intermediate section 'point 24 (c), and a destination end section two 25 (D). When the source end node 21 initiates a path finding (R_Discovery) mechanism to establish a path, the destination end node 25 can be found in accordance with the aforementioned algorithm for the a〇dv routing protocol. When the destination end node 25 receives the RREQ packet sent from various places, it is assumed that the path obtained by the destination end node 1351855 V *1 25 is "S-C-^D" and "J§--" s-B -c-D" and other three paths 'according to the aodv most == . Sh〇 path) algorithm, the destination end node 25 will select the path with the lowest (Hop Count) to transmit the _ρ packet, thus "♦S That is to return the RB to the source node ^ to the path. However, assuming that the transmission capability of the third intermediate node 24 reaches the source end node 21, there will be a one-way acquisition between the source end node 21 and the three intermediate nodes 24. Therefore, the third node 24 correctly sends the ship's packet to the point 21, and the source node 21 also directly determines that the rrep packet from the third section = 24 cannot be received. Interrupt the connection path, and restart the path search (R〇ute Disc〇very) mechanism. In fact, such as "S-A-C_D" is still a two-way path available, but it is not used because it is not the most bean path. On the whole, when the "asymmetric transmission capability" of the network is serious, such a situation may also increase, and the source node 21 continuously restarts the path finding function (R〇ute Discovery) mechanism, so that A large number of control packets are logged in the network, which causes broadcast storms and affects the transmission of normal packets, thus seriously affecting network performance. 2, DSR (Dynamic Source Routing): DSR is also a kind of on-demand routing agreement, when the source node needs communication, it can find the available path to facilitate the transmission of data, and also contains RREQ ' Three kinds of packets, RREP and rrr. The DSR differs from the aforementioned a〇Dv in that it does not use a routing table as a path—9—and instead uses a route cache to record two paths k. When the source node wants to transmit data to another node, the source node first learns from the path cache (cae e ehehe) to find out if there is = the target, the festival road teacher, if it is difficult to use the path to pass / 贤^ If no, then the Route Discovery mechanism is issued to the neighboring node in a wide, (-) manner. ^^ The other point is that when the cookie packet is received, it can be confirmed first. For the destination end node, if it is _ the office p package to the source ▲ point 'if not, then from the route cache (route cache) to find the path to the end destination node if there is information about the path Adding the path information to the destination end node to the RRHP packet and _ to the source end node, if there is no such path (four), adding the path information of the node itself to the RREQ packet, and then encapsulating the packet (4) Broadcast by over-broadcasting. Since the path information of the RREQ packet is recorded in the path cache (nmte cache), the path recorded by each node is the complete path information from the source end node to the node itself until the destination end node receives After the RREQ packet is encapsulated, the RREP packet is sent back to the source end node according to the path information in the ship, and the path is successfully established, so that the data can be transmitted. In addition, when the DSR maintains the path, each node must detect whether the path of itself and the next node is interrupted. When the node transmits the data/nodes, that is, (4) the next node has a forwarding packet. If there is no dream, it is directly judged that the path between the user and the next node may have been interrupted, and then the RRER packet is sent to the (four) end node, and the related information of the path cache (1351855 route cache) is deleted, and the foregoing connection status is judged. The method is a passive acknowledgement (Passive Acknowledgement). As shown in FIG. 3, a basic infrastructure network also includes a source node 21 (S), a first node 22 (A), and a second node 23.

(B), a third node 24 (C) and a destination end node 25 (D). When the source end node 21 needs to transmit data, it will find out from the path cache (r〇ute cache) whether there is path information that can reach the destination end node 25. If not, the flooding mode is used to issue the rreq. The packet looks for a path, for example, the obtained path is "S-C-D". In addition, false

When the transmission capability of the third node 24 cannot reach the source end node 21, the destination end node 25 can further search for an available path by flooding, for example, the obtained path is "D- The c-A_^s path is used as the response path. Therefore, the DSR can establish two asymmetric paths, which allow the data packet to be sent out differently from the response path. However, when the source node 21 and the destination node 25 perform respectively The road (4) finds the (R_Discovery) mechanism to establish an asymmetric two-path basin. Although the unidirectional path problem of the aforementioned AODV can be solved, the source 21 and the destination end node 25 each perform a flood broadcast, and a broadcast storm is generated in the same way (Broadcast) Storm) and other issues. In the network, the above A0DV and DSR in the network environment of the "star power" will be subject to one-way increase = AODV is easy to choose because of the shortest path. Two one-way asymmetric roads #, (4) = wrong 'coffee transmission capacity' is serious, the health will cause the road ^ ^ symmetry - 11 - 1351855, which will seriously affect the network performance [invention] It also creates difficulties in path maintenance. The main purpose of the present invention is to improve the conventional wireless network routing method (A〇Dv and D heart) by pre-determining whether there is a path between two nodes. The shortcomings of the path establishment cost are too high, so that the (4) has the functions of improving the road rate and reducing the network control information. The other purpose of the invention is to provide a reverse path.

The source routing method 'by responding to the two-way path between the nodes of the path in order to make the invention have the effect of improving the convenience of the path.

The reverse path acknowledgement dynamic source routing method according to the present invention, wherein the source node sends a 臓Q packet for at least one intermediate node to receive; and the _ two-way secret _ confirms the financial point and issues the RREQ packet Whether there is a bidirectional path in the node, and cooperates to relay the packet until the destination node is found; finally, according to the RREQ_packet, the path is sent out and the response path is used to establish a path of the wireless network. . The above and other objects, features and advantages of the present invention will become more <RTIgt; : δ青 Refer to FIG. 4 'The reverse path confirmation dynamic source routing method of the present invention is used to establish a connection path without a basic architecture network. Step 12 - Step 1 includes a path requirement step S1, a packet The relaying step S2 and the path 7 are step S3. The present invention mainly detects whether the two nodes (wireless devices) have two paths k ' to facilitate a wireless network to establish a sending path Path) and a response path through the "two-way link detection" in the packet forwarding step S2. Back path), which can be used for wireless transmission of related data.

The reverse path confirmation dynamic source routing method of the present invention is based on judging whether there is a bidirectional path between two nodes (wireless devices) of a non-basic architecture network (MANET) (bi directi〇nal) The method of 'being as the follow-up transmission path is determined according to I. The second method is that the method of "two-way connection side ~ d-al path test 'BL coffee". The two-way connection detects the main,: 'The transmission power of the two nodes (ni, nj) is represented by D1, respectively, and the sensitivity is represented by Si and Sj, respectively, and the two nodes (ni, nj)

The path loss is pl &lt; i, indicating that the path attenuation of the second hypothesis is equal (ie, Pl &lt; i, 卜, i &gt;). By this, ): This U column two conditions, it can be said that the two nodes (η) have a two-way path between each other. (1) (2) More specifically 屮 / Na - when a node (Ilj) received After the RREQ packet from the node (4), the token is in the name, the a-point (call) to the node (n) path exists, when it is desired to further judge whether the path exists, such as the 5th (nj) to the defect (ni as shown in Figure 5 can be added directly to the RR! ~ 13 - 1351855 package with a transfer power block (Tpower), a receiver sensitivity bar ·-. (Rsense) and - contact value field ( Ulink), in order to determine whether there is a bidirectional path between the two nodes (11丨, rij). In addition, the RREQ packet contains the same three fields as the above-mentioned additional fields of the present invention. Basic fields such as pktType, Hop 'Count, Path, ... (the basic field is inside. When sending a RREQ packet, 'the transmission rate of the node (ni) can be simultaneously (received) and the receiving is sensitive. (Si) filling the power transmission field (

Tpower) and receiving sensitivity interception (Rsense), when the node (nj) receives the RREQ packet, it cooperates to measure the signal strength (Rj) of the rreq packet, and simultaneously obtains the transmission power (Ti) of the node (ni). And receiving sensitivity (Si). At this time, as shown in Fig. 6, the path attenuation of the node (ni) to the node (η) is calculated (pi&lt;i, j&gt; = Ti_Rj), assuming two points (ma, η) The path attenuation is equal (ie pl &lt; i, j &gt; == pl &lt; j , P), if Tj — pl &lt; j, i &gt; 2Si, then represents the path of the node (nj) to the node Φ point (Ili ) Existence, that is, between two nodes (ni, Hj) is in a bidirectional path. In addition, the contact value field (ulink) is used to record whether the two nodes (ni, nj) have a bidirectional path, for example, when set to 0, the system represents between two nodes (rii'iij). The path is a bidirectional path; when set to 1, it represents the path between two nodes (ni, nj) [unidirectional path] (5) and then refers to FIG. 4, which is preferred by the present invention. In the path of the embodiment, the step S1 is to issue an RRgQ packet by a source node in advance, -14 - 1351855 ' 1. to establish a path and cooperate with the transmission power column of the RREQ packet * bit (TP〇wer And the receiving sensitivity block (Rsense) respectively fill in the transmission power and receiving sensitivity of the source node, and preset the contact value (Ulink) 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 forwarding step S2 to find a destination end node. &gt; Referring to Figures 4 and 7, a flow chart of the packet forwarding step S2 of the preferred embodiment of the present invention is received from an intermediate node in advance by an intermediate node (e.g., the source node or The other intermediate node, etc.) sends the RREQ packet (S11); the secondary node confirms whether the intermediate node is the destination end node (S12); when the intermediate node is the destination end node, the system directly selects a response path (back) Path) (S13); 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 Whether there is a bidirectional path for the node that issued the RREQ packet (

Sl4); when there is no bidirectional path, the RREQ packet is placed into a pending list, and the contact value (Ulink) in the RREQ packet is set to conform to the one-way path condition ( For example, it is set to i ' ) (S15); when there is a bidirectional path, the intermediate node directly rebroadcasts the 窣-packet, and the RREQ packet also fills in the transmission power and receiving sensitivity of the intermediate node. And the content of the contact value (Ulink) is not changed (S16); in addition, the intermediate node also checks the pending list (S17); and then cooperates with -15 to find out if there is any ^Retain packets from other nodes (; if the RREQ listens to the temporary _ _ condition, the 兮 intermediate node takes the _Q packet from the temporary storage and simultaneously broadcasts (rebroadcast) (S19) By this, 3 Ώ ^ can be customized, the RREQ packet can be relayed by each intermediate node according to the foregoing steps to find the destination = node. % Please refer to FIG. 4 again, the present invention The step S3 of the preferred embodiment is attached to the destination node to the Q. After the packet, refer to the related content of the RREQ #package to establish a forwarding path and a backpath, and the sending is the path of the (4) node to the destination end node, and the response path ^ is the The path from the destination end node to the source end node. The establishment condition of the sending is 'selecting the number of hops (Ηϋρ c_t) at least ^ as the sending path' and putting the relevant information of the sending path into the _EP packet; and, the setting condition of the shouting, Navigation "Hop c〇unt" is the least" and "Contact value block (υι: ° meets the bidirectional path condition (for example, set to 〇)".} When the Ulink conforms to the bidirectional path condition, there must be a path. 1 to the source end node, so that the job p packet can be transmitted to the source according to the response path, thereby completing the path establishment of the network. Please refer to FIG. 8 for the foregoing response path. Create a bar. It may include "the node of the response path must cover all the mines of the delivery path to facilitate the related maintenance operations. When all the blackouts of the delivery path - C-F-D" are included in the node to which the response path belongs c-BA—S), and the connection path of the response path is a bidirectional path. When the =out way# corresponding road (four) raw path cap situation, it can be immediately found by the = node, and the path interruption information is transmitted to the source end. Node (8). For example: Assuming that the network is interrupted due to the node (F) leaving, although the node (c) is affected by the one-way path and cannot know the fact that the node (e) has left, it can still be used by the node that conforms to the two-way recording. Knowing the fact that the path is interrupted, and transmitting the message of the path interruption to the source node (8). At this time, the source node (s) can quickly establish the interrupt path, thus providing the convenience of path maintenance. Please refer to FIG. 9 for the description of the method for applying the invention to establish a network of unsense infrastructure networks. The non-basic network includes a source node 31(1) and a The first intermediate node &amp; a second intermediate node 33 (8) and the destination node 3: (d): Please refer to the description of the 1G®, when the polygon node 31 (8) issues an RREQ packet, the first intermediate is assumed The node 32 (A) and the second node 33 (8) can respectively receive the RREQ packet (RREQO) sent by the source node 31, and the first intermediate node 32 (a) and the second intermediate node 33 (B) also confirm After the % node of the destination is not used, the system initiates two-way link detection to determine Whether the first intermediate node 32) and the second intermediate node 33(8) and the source end node 31(8) are bidirectionally miscellaneous with each other. It is assumed that the inter-node 32(4) and the source end node 31(8) are bidirectionally determined by the result of the measurement. Road and, and the pending list (four) (pending list) is currently not in the RREQ package before the branch, the ship Q package contact value is placed (υι_ 1351855 does not make any changes (for example, set to

In addition, the false detection "the second intermediate node illusion" and the source end node 31 (S) do not have a bidirectional path ', then the RREQ packet towel age value (Ulink) is set to 〖 (representative The unidirectional path) 'and the second intermediate node 33 (B) is also represented as a bidirectional path in the path (Path), and the Path field is added to the present (EQ&lt;2&gt;) for rebroadcasting. The own address, and the rrEq packet is added to the pending list. Also, when the second intermediate node μ (B) is also received by the first intermediate node 32 (A) The RREQ packet (RREQ &lt; 2 &gt;), and if the first intermediate point 33 ( B ) and the first intermediate node 32 ( A ) have a bidirectional path through the bidirectional connection detection result, the RREQ packet does not need to be changed. The value of the value field (Ulink) is still set to 0 (and is also set to 0)' and the same address is added to the path of the path, the RREQ packet content is RREQ&lt;4&gt; as shown in Fig. 9. In this way, the second intermediate node 33 (B) not only broadcasts the RREQ packet (RREQ &lt; 4 &gt; ), but also searches for the temporary string. Whether the pending list has previously reserved RREQ packets from other nodes, and thus the previously reserved RREQ packets (RREQ &lt;3&gt;) can be found. Therefore, the second intermediate node 33 (B) simultaneously broadcasts the two RREQs. Packet (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; 4 &gt;) 〇 - 18 - see 10th and As shown in the figure u, after the destination end node 34 (D) receives the two RREQ packets (RREQ &lt; 3 &gt;, RREQ &lt; 4 &gt;), the destination end node 34 (D) is also in the path (PaUi) column. The bit is added to its own address, so the content of the RReq packet collected by the destination end node 34 (D) is RREQ &lt;5&gt;, RREQ &lt;6&gt; as shown in Fig. 9. The RREQ packet (RREQ&lt;5&gt;, RREQ&lt;6&gt;) is used as a forwarding path for the path that meets the condition of "the least hop count". For example, the obtained path is "s -B-D", and the delivery path is stored in a rrep packet. The number of hops (hop coUnt) »Γ" with the Value column (Ulink) is set to square (two-way path) "conditions do respond path path (back path). For example, the obtained path is "〇...A-S"' to pass the packet to the source node 31(S) through the response path, and the source node 31(S) checks the contents of the packet. And then the data is transmitted to the 5 mep point (D) through the delivery path. Furthermore, the selection of the aforementioned response path may also be "the node of the path of the response" shall cover all the intrusions on the outgoing path.

For example, the response path "D-B-A-s" covers the "1 condition" example - B-D" to facilitate subsequent maintenance operations. ° ', path "S As mentioned above, compared to the conventional wireless network around the party is vulnerable to no __ "non-difficult to carry the ability" aodv) wireless network routing method (dirty) can not be used Two: And another customary need to wait for the phase (four) points to have a two-way path between each other, the sound must be established, so it has the disadvantage of adding a road thief domain; can be completed in response to the road like Wei Wei (4) Start the path-finding mechanism to obtain a path-building time with ==Hai end node to significantly increase the 1-dimensional:: response path, and the fading! is based on the "========================================================= The path process π ^ network city 'can still be' as the subsequent RREQ packet broadcast ===: Dan Yan way out η hop count (hop count) path as the send way out path can be allowed The unidirectional path exists in the t path. Each node must be a bidirectional path to facilitate the RREP = key back and path maintenance. In addition, although the road _ may contain unidirectional transmission efficiency. i (hopc°unt) is less and has better pass. When the node of the response path covers the send All the paths of the path, which take up time, can be made by using the bidirectional path characteristic between the nodes of the response path, and it is also more efficient in the path protection. Therefore, the present invention is generally more efficient. The following advantages are summarized: 丄, all nodes of the response path are bidirectional paths, so when the response path passes through the RREP packet, the source node will have a greater chance of receiving the RREp packet. 2 &quot;T selects the path that meets the minimum hop count condition as the outgoing path and the response path to provide better transmission efficiency. 3. When the node of the response path covers all nodes of the outgoing path, Since each node of the response path is a bidirectional path, it is relatively quick to know whether there is a path interruption, so as to re-establish the path 1351855. 4. By conditionally transmitting the RRgQ packet, in the "non-shot" In the network environment of “sexual transmission capability”, the path and the controlling overhead can be established more quickly. While the present invention has been disclosed in its preferred embodiments, it is intended to be understood that the invention is not limited by the scope of the present invention. The technical scope of the present invention is protected by the scope of the invention, which is defined by the scope of the patent application.

21 1351855 * ·. [Simple description of the diagram] Figure 1: Schematic of a wireless network with asymmetric transmission capabilities. 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: Schematic diagram of the step 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. Figure 6: The reverse path confirmation dynamic source routing method of the present invention should be 屹 - one - a schematic diagram of the conditions for establishing the two-way connection detection. 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. Fig. 8 is a schematic diagram showing the path maintenance of the reverse path confirmation dynamic source routing method of the present invention. 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: The reverse path confirmation dynamic source routing method of the present invention establishes a schematic diagram of the sending path and the response path. —22 — 1351855 [Main component symbol description] 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 End node 32 first intermediate node 33 second intermediate node 34 destination end node

-twenty three -

Claims (1)

(3) i855 patent application scope: a reverse path confirmation dynamic source routing method, the step comprising: sending a coffee Q packet by the source node for at least two = receiving 'the transmission of the RREQ packet filling source node Work = and connect the sensitivity, and the setting - the contact value is in accordance with the two-way path, == whether it is a destination end node. When the intermediate node is the destination end, a response path is directly selected. For the destination end node, use the bidirectional connection_the == point and the node that issued the RREQ packet to have a bidirectional path; when there is no double __, the rrEq packet is placed in the temporary storage sequence, and the RREQ packet is The contact value field is set to conform to the one-way word. When there is a two-way path, the RREQ packet is linked to the wood to change the transmission power and receiving sensitivity of the intermediate (4) for conversion of the RREQ packet, and the temporary storage. (4) Finding first = Retaining RREQ packets from other nodes and simultaneously transmitting them; and after receiving the RKEQ packet, the destination end node selects the path with the least number of hops by referring to the dirty Q packet as a delivery path The outgoing path is a release-RREp packet, and the path that matches the minimum number of hops and the contact value is in accordance with the two-way path is used as a response path for the RREP packet to be transmitted to the source according to the response path. Click to complete the path creation job. .. Yishen. The reverse path confirmation dynamic source routing method described in item 1 of the monthly patent range, wherein the response path establishment condition further includes a response path. The node of the path must cover all nodes of the delivery path for maintenance work. . The dynamic source routing method is confirmed according to the reverse path described in Item 1 or 2 of the patent application scope, wherein the bidirectional connection detection system transmits the transmission powers of the two nodes as D, η and η, respectively, and the receiving sensitivity is respectively determined by Si. Sj indicates that the path attenuation between the two nodes is represented by pi &lt; i, j &gt; ' Assume that the path attenuation of the two nodes is equal (ie, pl &lt; i, j &gt; = pl &lt; j 'b), if Ti is simultaneously satisfied The pUuskSj and the two conditions ' indicate that the two nodes have a bidirectional path between each other. According to the reverse path described in item 1 or 2 of the patent application scope, the source bypass method is confirmed, wherein when the contact value field of the RREQ packet is set to 〇, the bidirectional path condition is met. Yi Shen. The reverse path confirmation dynamic land-sending method described in item 1 or 2 of the monthly profit range, in which the contact value field of the packet is set to 1, conforms to the one-way path condition.