MX2008006093A - Route selection in wireless networks - Google Patents

Abstract

A system and method for discovering a route between a source node and a destination node in a wireless network including setting an intermediate reply flag of a route request message by the source node, flooding the wireless network with the route request message and responding to the route request message with route reply message by a first intermediate node having a valid route to the destination node, are described. Also described are a system and method for discovering a best route in which case the route reply message becomes a first route reply message. The sytem and method for discovering a best route includes selecting by the destination on the best route between itself and the source node based on cumulative metrics received in route request messages received by the destination node, creating a further route reply message and unicasting the further route reply message to the source node.

Description

SELECTING ROUTE IN WIRELESS NETWORKS Field of the Invention The present invention relates to wireless networks and in particular to wireless mesh networks. Very specifically, the present invention relates to the processing of route solitude messages in on-demand routing protocols.

BACKGROUND OF THE INVENTION On-demand routing protocols, for example, the Ad-Hoc Distance to Demand Vector (AODV) routing protocol defined by the MAN ET workgroup in I ETF, utilizes a route request mechanism and of route response to establish routes between two nodes in wireless mesh / ad hoc networks. When a source node wishes to send data packets / frames to a destination node, the source node discovers the route to the destination when inserting a route solitude message (RREQ) on the network when the source node does not have it and You need a valid route for the destination node. An inverted route back to the source is created by the nodes in the network, as they receive and send the RREQs. When a node receives an RREQ, the receiving node responds to this request by generating a route response message (RREP) when any of the following occurs: (1) the receiving node is itself, the destination, or (2) the receiving node has a valid route to the destination and the label "destination only" ("D") in the RREQ is not set. The RREP is sent in a unicast to the source node through the established inverted route and a re-send route is created to the destination in the intermediate nodes and eventually in the source node. The established routes expire when they are not used within a certain route lifetime. In the AODV; the "destination only" label of the RREQ message is set by the source node and is not changed by the intermediate nodes. When the "destination only" tag is set in the RREQ by the source node, the intermediate node does not respond to the RREQ with an RREP message even when the intermediate / receiver node has a valid route to the destination node. Re-send / re-flood the RREQ to its neighbors. Only the destination node responds to this RREQ. In this mode of operation, the route discovery latency may be sufficiently large although the best route to date between the source node and the destination node is eventually discovered in the process. Low latency is very important for real-time applications, such as voice and video communications. When the "destination only" tag is not set by the source node, then any intermediate node with a valid route to the destination node responds to the RREQ with an RREP message. The RREP message is sent back to the unicast source node and establishes a forwarding path to the destination node. When the label "Free RRE P (" G ") is set in the RREQ, this intermediate node also unicates a free RREP to the destination node, so that the destination node learns the routes to the source node. When the intermediate node generates an RREP (because the intermediate node has a valid route to the destination node) then the intermediate node discards the RREQ With this measure, the source node can discover the route to the destination node more quickly because the The source node does not have to wait for the destination node's response, however, the best end-to-end route may not be discovered, because the route copied to the intermediate node may not be the best route to the destination node. the dynamics of wireless networks, which makes the copied route less convenient, that is, due to changes in the topology of the network, the routing metric, etc., it is possible that the route copied in the intermediate node worsens or that other routes with better end-to-end metrics may be available by making other routes more desirable. The problem solved by the present invention is the way to use the RREQ mechanism and the RREP to quickly discover the best route between the source node and one or more destination nodes.

Brief Descri ption R nvención The present invention describes a method and system for processing / resending messages route request (RREQ) and generating messages route reply (RREP) routing protocols to demand, the which the AODV is an example, so that the best route can be discovered without incurring a delay / latency of route discovery in wireless mesh / ad hoc networks. Specifically, cuado a source node wants to discover the route to the destination node, the source node floods the network with a RREQ message to the specified destination node in the destination list and the metric field started to 0. The RREQ message contains a new ETIQ ueta "Intermediate Response (IR)" for each destination node. The source node adjusts the label corresponding to the destination node in the RREQ when the RREQ flood starts to discover the route to the destination node. During the RREQ flood, the first intermediate node with a valid route to the destination node responds to the RREQ with an RREP message. The RREP message is sent in unicast to the source node and thus quickly establishes a temporary resend route to the destination. In this way, the source node can use this temporary re-routing path to send data packets / frames with a low latency / route discovery delay. The first intermediate node resets / clears the "I R" tag in the RREQ message and sends the updated RREQ message downstream to the destination node. Since the label "I R" in the RREQ has been reset, the current intermediate nodes below do not respond to this RREQ and only propagate it even when the current below intermediate nodes have a valid route to the destination node. The RREQ eventually reach the destination node. The destination node can select the best route / path based on the end-to-end metrics and send a new regre RREP to the source node to establish the best route between the source node and this destination node. When the best trajectory is different than the re-shipment time path that was established through the RREP from the intermediate node, the source node will switch to the best trajectory once the best trajectory is established. A system and method for discovering a route between a source node and a destination node in a wireless network are described which include setting an intermediate response label of a route request message by the source node, flooding the wireless network with the message route request and responding to the route request message with a route response message by a first intermediate node having a valid route to the destination node. The system and the method then update the route request message and re-enter the wireless network with the route request message. The act of responding thus establishes a temporary route of re-sending between the source node and the destination node of the wireless network. A system and method for discovering the best route are also described, in which case, the route response message becomes the first route response message. The system and the method to discover the best route includes selecting by the destination node, the best route between itself and the source node based on the accumulated metrics received in the route request messages, received by the destination node, creating another route response message and unicast the other route response message to the source node. When the temporary re-routing route is the best route, then the route response message serves as a confirmation and when the temporary re-routing route is not the best route, then the other route response message serves to establish the best route after receiving the other route response message by the source node.

BRIEF DESCRIPTION OF THE DRAWINGS The present invention will be better understood from the following description when read together with the accompanying drawings. The drawings include the following Figures: Figure 1 is an exemplary RREQ message format. Figure 2 is a schematic diagram of a wireless mesh network in accordance with the principles of the present invention. Figure 3 is a schematic diagram of a wireless mesh network in accordance with the principles of the present invention. Figure 4 is a flow diagram of a demand routing protocol where the present invention can be used. Figure 5 is a flow chart of the method of the present invention. Figure 6 is a block diagram of a node in accordance with the principles of the present invention.

Detailed description of the invention When a source / mesh point node wishes to send data / frame packets to some destination node, it verifies its routing table for a route. When a valid route exists, it transmits the packets / frames to the next hop set in the routing table for this destination node. When there is no valid route, the source node initiates the route discovery by inserting a route request message (RREQ) over the mesh network / ad hoc network. The data packets / frames may have originated at the node or from the stations associated with the node, when the node is a wireless access point. It is possible that a source node needs to discover routes / paths to multiple destination nodes. The source node can disseminate the RREQ for each destination or to reduce the routing header, flooding the network with a single RREQ message that has a list of destination node addresses embedded in it. Figure 1 is an exemplary RREQ message format with other possible formats. The RREQ message contains, for example, the source address / source node, the sequence number of the originator, the address of the destination node and the destination sequence number (or the number of destinations and the list of destination addresses and their destinations). sequence numbers), RREQ ID, message ID, message length, time of life (TTL), hop count, routing metric, tags and other information. In addition to the "only destinof D" tags, and the "free RREP" ("G") tags, a new tag, called the "intermediate response" tag ("I R"), is contained in the RREQ message. The "D" and "G" labels are carried as a legacy of the conventional AODV. These two tags are not adjusted / used by the source node and ignored by the intermediate and destination nodes. An alternative mode is that the RREQ message does not contain the "D" and "G" tags. When the RREQ message carries a list of destination addresses, then multiple "intermediate response" tags are included in the RREQ message, each corresponding to a destination address. When the source node wishes to discover a route to one or more destination addresses, the "intermediate response" ("I R") tag corresponding to the destination address is set. It should be noted that the addresses of the destination node can be Internet protocol addresses (I P) or stratum 2 addresses (MAC access control). To adapt the changes in the conditions of the network and to maintain the best metric route between the nodes, each active source node can optionally flood the ad hoc wireless network / network with a periodic RREQ message (RREQ maintenance) for the destination addresses with which you are in communication. The "I R" label on the maintenance RREQ does not fit. The intermediate and destination nodes process the maintenance RREQ following the same rules used to process a non-maintenance RREQ in the discovery phase. In this way, it can be seen that the dissemination of maintenance and non-maintenance RREQ messages in an ad hoc wireless network / network results in establishing / updating an inverted route for the originator (source node) of the RREQ in the intermediate nodes and the destination nodes. The dissemination of non-maintenance RREQ messages also activates RREP messages from the destination nodes and, probably, from the intermediate nodes. The dissemination of RREQ messages activates the RREP messages from the destination nodes. When an intermediate node or destination receives an RREQ message, it creates an inverted route for the source node or updates its current inverted route when the RREQ message passed through the route / path that offered the best metric as the current inverted route to the source node . It should be noted that each node can receive multiple copies of the same RREQ message (originated with the same source node and having the same I D of the RREQ), each RREQ message traverses a different path from the source node to the receiver / intermediate / destination node. When an inverted route is created or modified or is the "first copy" of an RREQ message, the RREQ message is re-sent (re-flood). A "first copy" as used herein means that this copy of the RREQ message is the first copy or time that this receiving / intermediate / destination node receives or sees this particular RREQ message, identified by its source address and the ID of the destination. RREQ. When an intermediate node re-sends a RREQ message, the metric field in the RREQ message is updated to reflect the accumulated metric of the route for the source node of the RREQ from the intermediate node. In addition, when the "IR" tag is set for the destination node in the destination node list of the received RREQ message, and the intermediate node has a valid route to the destination node, the intermediate node responds to the RREQ message with a response RREP message Route. This route response message is sent to the source node in unidusion and establishes the re-send path to the destination node. The source node can then use this route to send data packets / frames to a destination node immediately. When the intermediate node responds to the RREQ message with an RREP message, for a destination node in the destination node list of RREQ, it resets / clears the "IR" label for this destination node in the RREQ message before re-flooding the network with the current RREQ message hoisted. The reason for resetting the "I R" tag after the RREP message is sent is to suppress any RREP message from the downstream intermediate nodes. Only the first intermediate node with a valid route to the destination node along the route traversed by the flooded RREQ message responds with an RREP message for this destination node. When the "I R" label for the destination is reset / deleted in the RREQ message, an intermediate node must not respond with an RREP message even when it has a valid route to the destination node. After creating / establishing or updating an inverted route to the source node, the destination node sends a unicast RREP message back to the source node. The intermediate nodes create re-routing routes to the destination node after receiving the RREP message and also send the RREP message to the source node. When a source node receives the RREP message, it creates a re-send route to the destination node. When the destination node receives more RREQ messages with better metrics, then the destination node updates its route to the source node with the new route and also sends a new RREP message back to the source node along the updated route. The new RREP message establishes a better (updated) re-routing path from the source node to the destination node in the intermediate nodes and eventually to the source node. Once this best re-routing path is established, the source node uses it to send data. Finally, a route with better end-to-end, bidirectional metric between the source node and the destination node is established. With the use of this measure, the source node can quickly obtain a route to the destination node that is established with the RREP message answered by the intermediate node with a valid route to the destination node. When this route is not the best route with end-to-end metrics, between the source node and the destination node, the route is updated with the best route afterwards. Referring now to Figure 2, which illustrates the flooding of the wireless network / ad hoc network with the route request message (RREQ) and the intermediate node B, with a valid route to the destination node E, which responds to the RREQ message with an RRE message Q. An example should be considered where the source node A tries to discover the route to the destination node E. The source node A floods with route request messages (RREQ) with an "IR" tag set to the wireless network in mesh / ad hoc network. It is assumed that the intermediate node B already has a valid route B-C-D-E to the destination node E. When the intermediate node B receives the RREQ, creates an inverted route to the so node from which it receives the RREQ as the next balance (so node A) of the path / inverted route. The intermediate node B responds to the RREQ with a unicast RREP, since it has a valid route to destination E and the label "I R" in the RREQ is adjusted. The RREP establishes a re-routing route to the destination node E in the node To source. As soon as the source node A creates a route / path to the destination node with the RREP from the intermediate node B, the source node A can start sending data packets / frames to the destination node via the route ABCDE . The intermediate node B readjusts the label "I R" in the RREQ message and sends it afterwards. The reason for resetting the "I R" tag is to limit the responses to the flooded RREQ to only the first intermediate node with a valid path to the destination node. The other downstream intermediate nodes, for example, C and D, do not need to answer this RREQ with an RREP, since the "I R" tag is not set. Suppose that the intermediate F, G and H nodes have no valid routes to the destination node E. When the intermediate F, G and H nodes receive the flooded RREQ messages, they create an inverted route to the source node A with the node from which each of the nodes F, G and H receive the RREQ as the next hop of the inverted route . Each or no of the intermediate nodes F, G and H then sends RREQ messages afterwards. In this example, the destination node E receives two copies of this RREQ, each traversing a different path: A-B-C-D-E, A-F-G-H-E. Assuming that the two RREQs reached the destination node E in the following order: ABCDE and then AFFGE, the destination node E first creates a route to the source node A through the intermediate node D, as soon as the destination node E receives the RREQ at along the path / path ABCDE. At this point, the inverted route to source node A has been established at intermediate nodes B, C and D. The destination node E sends a RREP along the route E-D-C-B-A. The RREP renews the route -A-B-C-D-E-. When there are other destination nodes in the list of RREQ destinations, for example, node I, the destination node E removes itself from the list of destinations and then re-sends another RREQ (for example, to node I). When there are no other destination nodes in the destination list of the RREQ, then the RREQ is not re-sent. With reference to Figure 3, which illustrates a bad wireless local area network, which shows the response of the destination E node to the RREP (1) after receiving the RREQ through ABCDE- and sends a new RREP (2) to establish a better route / path of re-shipment after receiving the RREQ through AFGHE. When the destination node E receives the RREQ that arrived along -AFGHE-, the destination node E determines that this RREQ came along a trajectory with a better metric than A, then the route / trajectory -ABCDE- of re -from poral shipment. Therefore, the destination node E modifies / updates the next hop from the intermediate node D to the intermediate node H and updates the metric. The destination node E then sends a unicast RREP to source node A through the intermediate node H, as well as updates and re-sends the RREQ when there are one or more other destination nodes in the list of destinations of the RREQ. The RREP establishes the route for the source node A through the intermediate H, G and F nodes. When the source node A receives the RREP, it modifies / updates the next hop for the destination node E from the intermediate node B for the intermediate node F. The route to the destination node E is changed to A-F-G-H-E. Reference is now made to Fig. 4, which is a flow chart for processing an RREQ message. When the node receives an RRE P message, it first creates / sets or updates an inverted route to the previous hop from which the node received the RREQ message, when necessary at 41 0. The intermediate node / receiver can then create or update the inverted route to the originator of the RREQ as follows: when an inverted route to the originator of the RREQ message does not exist in the routing table or is invalid in 41 5 and 420, it is created or updated. The next hop in the routing table for the inverted route for the RREQ originator becomes the previous hop (the node from which the RREQ message was received). When there is a valid route to the RREQ originator, the source sequence number in the RREQ message is compared to the sequence entry number of the route entry in the routing table in 425, for the inverted route. When the sequence number in the RREQ message is older, it is dropped and no further processing is performed on the 445. Otherwise, the current inverted route to the originator is modified when the new metric is better than the metric from the current route to the originator in the routing table in 430. The new metric is defined as the metric in the RREQ message plus the metric of the link between the node from which the RREQ message was received and itself. When the new metric is not better than the metric of the current inverted route in the routing table entry, but the sequence number of the source in the RREQ is larger (newer) than the sequence number in the table Routing for the inverted route in 435, the intermediate node checks whether other optional hysteresis processing and copy of best candidate route are supported by the mesh network in the 450. When these optional processing functions are not supported , the inverted route to the originator of the RREQ is updated in 455. When an inverted route is created or modified, the sequence number in the routing table for the inverted route is adjusted with the source sequence number in the RREQ message, the next hop becomes the node from which the RREQ message was received, the metric is adjusted with the new metric and the hop count is set to one more than the hop count in the message e RREQ. When an inverted route to the source node is created or modified, or the RREQ message was the first copy of the new RREQ message (the RREQ ID was not seen from the source before) on the 420 and 440, the routine of The RREQ and RREP generation described here is executed in 475. There may be other cases where the routing routine of RREP and generation of RREP described here is executed by a node. For example, in the best candidate route copying method, RREQ messages can be stored in a waiting queue with a timer during the copying of the candidate route. When the waiting time expires, the RREQ re-routing and RREP generation routine is executed. The source node can send periodic maintenance RREQ messages to renew its re-shipping and inverted routes. Each time the source sends a maintenance RREQ message, it is called a route renewal rounding. It is possible that nodes that already have the best route invested to the source node receive an RREQ message with a newer sequence number, but with a route with worse metric to the source node before receiving the RREQ message through the current route with better metrics In addition, the copy of the RREP message that propagates along the current route with better metrics may be lost during the flood. These events can result in overlapping routes. In order to network the route overlap and select the best route during each round of route renewal, a type of hysteresis mechanism and copy of the best candidate route can be used. When at 460 it is determined that the hysteresis option and copy of the best candidate route is implemented by a mesh network, an intermediate node updates the routing table and modifies the inverted route when the source sequence number in the RREQ message is greater (newer) than the sequence number in the routing table entry by a value greater than a threshold. Otherwise, the inverted route can be copied as an alternative candidate route, potential in the 365. When the node later learns that the current inverted route has degraded and becomes worse than the candidate inverted route, it has the ability to change the candidate route learned earlier in the same round of renewal. The present invention describes a method and system for re-sending a RREQ message and generating a RREP message to discover the best route without incurring a large delay / latency of route discovery in wireless mesh networks. The method of the present invention works with or without hysteresis and with or without a copy of the best alternative route / candidate. With reference now to Figure 5, which is a flow diagram illustrating a method for the re-sending of RREQ and generation of RREP of the present invention, a determined node if it is a destination node, that is, when one or more node addresses (auto_address ) match the addresses of the requested destination in the destination list of the RREQ rreq.dest message in 505. It should be noted that a node itself can have multiple addresses or can be an attachment for other nodes. For example, a node can be an access point and generate / handle routing messages for the benefit of legal stations associated with it (an attachment of the stations). The functionality for this case is similar to the situation when a node has multiple addresses. The destination addresses of the associated stations can be treated as empowered addresses for the access point. A node is a destination node when one or more of the addresses specified in the destination list of the RREQ message belong to it or one of the nodes uses them as an adjunct. When a node receives an RREQ message where the destination node is that node attached by it, it must process the RREQ message as if the address of the destination node were its own address. In addition, a node may be a destination node for a requested address in the destination list of the RREQ message, but the intermediate node for another requested address in the destination list of the RREQ message. When one or more addresses of the node coincide with the destination addresses requested in the destination list of the RREQ message, the node generates and sends a unicast RREP message to the originator of the RREQ message for these destination addresses to coincide in 51 0. The destination node removes its own address / address attached to the destination list of the RREQ message at 51 5. After that, when there are no remaining requested addresses in the destination list of the RREQ message at 520, the RREQ message is discarded at 525. When the node is not a destination node for any requested address in the destination list of the RREQ message (505) or there are other destination addresses requested in the destination list of the RREQ message other than the node addresses, that is, the node is an intermediate node for one or more addresses in the destination list of the RREQ message, the node verifies that the remaining addresses in the destination list of the RREQ message as follows. Suppose rreq.dest (i) represents the address (i + 1) in the destination list of the RREQ message. The node starts an index (for example, i) on 545 and verifies rreq. dest (i), that is, the first address in the destination list of the RREQ message to determine if there is an active re-send route to the destination node represented by rreq. dest (i) in the 550. When an intermediate node has an active route to the destination, the route to the destination node is valid (555), the sequence number is at least as large as that indicated in the original RREQ message ( 560) and the RREQ tag "IR intermediate response" is set (570), the intermediate node generates the RREP message for this destination address requested in the 575 and sends the RREP message generated in unicast to the originator of the RREQ message throughout of the current inverted route The IR label for this destination requested in the RREQ message is readjusted in 580. The node increases the index (for example, by one) and verifies if there are additional addresses in the destination list of the RREQ message at 590. When there are additional addresses in the destination list of the RREQ message, then the cycle described above is repeated, starting with 550. That is, the cycle is repeated when an RREP message needs to be sent for the next requested destination The cycle is repeated until all the addresses in the destination list of the RREQ message have been verified. The original incoming RREQ message is checked to determine whether the value of life time (TTL) is greater than 1 in 530. When the TTL value is greater than one, then the information in the original RREQ message is updated, including the decrease of the TTL value in the outgoing RREQ message, for example, by one in 533. The source sequence number, the metric and the hop count are also adjusted with the corresponding information in the updated route entry for the source in 535. The updated RREQ message is re-sent in 540.It should be noted that the destination node can have / be attached to one or more addresses and an intermediate node can have a valid route to one or more destination addresses. An RREQ message can carry one or more destination addresses in its destination address list. A processing / intermediate / desti node can not satisfy the above conditions and send an RREP message for multiple requested addresses in the destination list of the RREQ message. When a node sends an RREP message to multiple destinations, it can send multiple RREP messages, one for each destination or it can send a single aggregate RREP message with multiple destination addresses in the address list. Figure 6 is a block diagram illustrating the details of a node 600 of the present invention. The node includes a link quality and load measurement module 605, a route metric calculation module 61 0, a route selection module 61 5, and a communication module 620. The link quality and load measurement module 605 measures the quality and load of the link / channel for each of its neighbors. It provides the measurement results to the routing measurement calculation module 61 0 so that the routing metric calculation module 61 0 can determine the cost / metric of the link for each of its neighbors. It should be noted that a node can have multiple neighbors, multiple radio interfaces and multiple channels / logical / physical links. All of them need to be measured. The routing metric calculation module 610 of each node uses the measurements made by the link quality and load measurement module together with other information to calculate the routing metric for each node with which it is communicating. The routing metric is updated periodically. The route selection module 5 5 determines / selects a route / path to re-send / communicate data to a destination node based on the calculated routing metrics. The route selection module 5 5 exchanges the routing control messages and the data with other nodes in the mesh network through the communications module 620. It should be noted that a node may have one or more communication interfaces by radio and other communication interfaces. It should be understood that the route selection module, in fact, may be formed of several smaller units or be combined with other modules described herein. Also, it should be understood that the processes described herein (specifically with respect to Figures 3 and 4) may be software, hardware, firmware or any combination thereof executed in or by the route selection module. It should be understood that the present invention can be implemented in various forms of hardware, software, hardware, special purpose processors or a combination thereof for example, within a mobile terminal, an access point and / or a cellular network. . Preferably, the present invention is implemented as a combination of hardware and software. In addition, the software of preference is implemented as an application program tangibly incorporated in a program storage device. The application program can be loaded and executed by a machine comprising any appropriate architecture. Preferably, the machine is implemented on a computer platform having hardware such as one or more central processing units (CPU), a random access memory (RAM), an input / output (I / O) interface. The computer platform also includes an operating system and a microinstructions code. The different processes and functions described here can be part of the microinstruction code or part of the application program (or a combination thereof), which are executed through the operating system. In addition, other peripheral devices can be connected to the computer platform as an additional data storage device and a printing device. It should also be understood that some of the system components and method steps illustrated in the accompanying figures may be implemented in the software., the actual connections between the components of the system (or the steps of the process) may differ after the manner in which the present invention is programmed. Given these teachings, those skilled in the art will be able to contemplate these and other similar implementations or configurations of the present invention.

Claims (28)

1 . A method for discovering a route between a source node and a destination node in a wireless network, the method is characterized in that it comprises: setting an intermediate response tag of a route request message by the source node; flood the wireless network with the route request message; and responding to the route request message with a route response message by a first intermediate node having a valid route to the destination node. The method according to claim 1, characterized in that it further comprises: updating the route request message; and re-flooding the wireless network with the route request message.

3. The method according to claim 2, characterized in that the act of responding in this way establishes a temporary resending route between the source node and the destination node of the wireless network.

4. The method according to claim 2, characterized in that the act of updating also comprises deleting the intermediate response label and updating a metric in the route request message with an accumulated metric of the route between the source node and the intermediate node.

5. The method according to claim 1, characterized in that the wireless network is a wireless mesh network.

6. The method according to claim 1, characterized in that the response path message of the act of responding is unicast to the source node.

The method according to claim 1, characterized in that the destination node address is one of an Internet protocol address and an access control address to the media.

8. The method according to claim 1, characterized in that the destination node includes destined nodes that are associated with one of an adjunct and an access point.

9. The method according to claim 1, characterized in that it further comprises flooding the wireless network with a maintenance route request message in order to maintain the best route metric between the nodes and to adapt the changes in the conditions of the network .

The method according to claim 9, characterized in that it also comprises responding to the maintenance route request message as if it were the route request message. eleven .

The method according to claim 3, characterized in that the temporary resending route is available for the transmission of data packets / frames after the reception of the route response message by the source node. 1 2.

The method of conformity with claim 2, characterized in that the route is the best route and also where the route response message in a first route response message.

The method according to claim 1 2, characterized in that it further comprises: selecting by the destination node the best route between itself and the source node, based on the accumulated metrics received in the route request message received by the destination node; create another route response message; and unicast the other route response message to the source node.

14. The method according to claim 1 3, characterized in that when the temporary re-routing route is the best route then the other route response message serves as a confirmation and when the temporary re-routing route is not the best route, then the other route response message serves to establish the best route after receiving the other route response message by the source node. 1 5.

A system for discovering a route between a source node and a destination node in a wireless network, the system is characterized in that it comprises: means for adjusting an intermediate response tag of a route request message by the source node; a media to flood the wireless network with the route request message; and means for responding to the route request message with a route response message by a first intermediate node having a valid route to the destination node.

The system according to claim 1 5, characterized in that it further comprises: means for updating the route request message; and a means to re-flood the wireless network with the route request message.

The system according to claim 1, characterized in that the means for responding in this manner establishes a temporary re-routing path between the source node and the destination node of the wireless network.

The system according to claim 1 6, characterized in that the means for updating also comprises a means for erasing the intermediate response tag and a means for updating a metric in the route request message with a cumulative metric of the route between the source node and the intermediate node. 9.

The system according to claim 15, characterized in that the wireless network is a wireless mesh network.

The system according to claim 1 5, characterized in that the path response message of the means to respond is unicast to the source node. twenty-one .

The system according to claim 1, characterized in that the address of the destination node is one of an Internet protocol address and an access control address to the media.

22. The system according to claim 1 5, characterized in that the destination node includes destination nodes that are associated with one of an attachment and an access point.

The system according to claim 1, characterized in that it further comprises means for flooding the wireless network with a maintenance route request message in order to maintain the best route metric between the nodes and to adapt the changes in the conditions of the network.

24. The system according to claim 23, characterized in that it also comprises a means for responding to the maintenance route request message as if it were the route request message.

25. The system according to claim 16, characterized in that the temporary re-routing path is available for the transmission of data packets / frames after receipt of the route response message by the source node.

26. The system according to claim 1 6, characterized in that the route is the best route and also where the route response message in a first route response message.

27. The system according to claim 26, characterized in that it further comprises: means for selecting by the destination node the best route between itself and the source node, based on the accumulated metrics received in the route request message received by the destination node; a means to create another route response message; and a means for unicasting the other route response message to the source node.

28. The system according to claim 27, characterized in that when the temporary re-routing route is the best route then the other route response message serves as a confirmation and when the temporary re-routing route is not the best route , then the other route response message serves to establish the best route after receiving the other route response message by the source node.