Selection of route in wireless networks

FIELD: physics, communication.

SUBSTANCE: invention relates to wireless networks of cellular structure with processing of messages of route request in on-demand routing protocols. The technical result is achieved by the fact that location of the actual route is detected between a source unit and a destination unit on the basis of the first intermediate unit responding to the message of route request by means of the route response message, having the actual route to the unit of destination, besides, the intermediate unit responds to the message of route request on the basis of flag condition in the message route request, and the first intermediate unit resets the specified flag; a connection is established between the source unit and the destination unit using the actual route; location of a more optimal route is detected between the source unit and the destination unit, when the destination unit selects a more optimal route on the basis of summary through metrics of routing; and a connection is established between the source unit and the destination unit using the more optimal route.

EFFECT: technical result is detection of a route with an optimal metric without delay in route detection in wireless cellular/randomly organising networks.

2 cl, 6 dwg

Area of technology

The present invention relates to wireless networks and, in particular, to wireless networks cellular structure. More specifically, the present invention relates to the processing of request messages of the route in the routing protocols on-demand.

Prior art

Routing protocols on-demand, such as routing Protocol with a self-organising distance vector on demand (AODV), a specific working group in the IETF MANET uses the mechanism of route requests and route replies to install the routes between two nodes in wireless mesh/randomly organized (ad hoc) networks. When the source node wants to send packets/frames of data to the destination node, the source node discovers a route to the destination (broadcast avalanche message of route request (RREQ) over the network, if the source node does not and requires a valid route to the destination node. The return route back to the source are generated by the nodes in the network as they accept and forward RREQ. When a node receives RREQ, the receiving node responds to the request by generating a response message of the route (RREP) if: (1) any receiving node itself is the destination, (2) any receiving node has d�istically route to the destination node and the flag "only the destination node (D) in the RREQ is NOT installed. RREP is sent in unicast mode to the source node through the established return route, and thus creates a direct route to the destination node in the intermediate nodes and ultimately to the source node. The established routes are terminated with the expiration of the term if they are not used during the lifetime of the route.

In AODV-only flag node of the destination of the RREQ message is set by the source node and does not change the intermediate nodes. If the flag is "only the destination node" is set in the RREQ source node, the intermediate node does not respond to the RREQ RREP message, even if the intermediate/receiving node has a valid route to the destination node. He redirects/avalanche sends RREQ to its neighbors. Only the destination node will respond to this RREQ. In this operation mode, the delay of route discovery can be quite significant, although the actual optimal route between the source node and the destination node is eventually detected in the process. Low latency is very important for real time applications such as voice and video.

If the flag is "only the destination node is not installed on the source node, then any intermediate node with the correct route to the destination node responds to the RREQ RREP message. The RREP message is sent back to the node IP�of ecnica in unicast mode and establishes a direct route to the destination node. If the flag is "voluntary RREP" (G) in the RREQ is set, the intermediate node also sends in unicast mode gratuitous RREP to the destination node, the destination node has learned the routes to the source node. However, in AODV, if the intermediate node generates a RREP (since the intermediate node has a valid route to the destination node), then the intermediate node discards the RREQ. In this approach, the source node can detect a route to the destination node more quickly, since the source node does not need to wait for the response of the destination node. However, the optimal end-to-end route may not be detected because the route is cached in the intermediate node may not be the route with the best metric to the destination node. Metrics may have changed due to the dynamics of wireless networks, making the cached route is less desirable. I.e. due to changes in the network topology, the routing metric, etc. 's possible that the route is cached in the intermediate node may become worse, or what other through routes with the best metric may become available, making other routes more desirable.

The problem solved by the present invention, then, is how to use the mechanism of RREQ and RREP to quickly find the route with the best metric between.� source and one or more destination nodes.

Summary of the invention

The present invention discloses a method and system of processing/sending the message of route request (RREQ) and generate messages of route reply (RREP) to the routing protocols on-demand, exemplified by the AODV, the route with the best metric can be detected without the occurrence of significant delay/latency of route discovery in wireless mesh/arbitrarily organised networks. In particular, when the source node wants to discover a route to the destination node, the source node avalanche broadcasts to the network the RREQ message to the destination node specified in the destination list, and the metrics are initialized as 0. The RREQ message contains the new flag "intermediate response (IR) for each destination node. The source node sets a flag corresponding to the destination node in the RREQ when it initiates an avalanche newsletter RREQ to discover a route to node(s) of destination. During the avalanche distribution RREQ first intermediate node with a valid route to the destination node responds to the RREQ RREP message. The RREP message is transmitted in unicast mode to the source node and thereby quickly establishes temporary direct route to the destination. Thus, the source node can use this temporary direct�route for transmission of packets/frames of data with low latency/delay of route discovery. The first intermediate node resets/clears the IR flag in the RREQ message and sends the updated RREQ message further in the direction of the destination node. Since the IR flag in the RREQ is cleared, subsequent intermediate nodes do not need to respond to this RREQ and only spread it, even if the subsequent intermediate nodes have a valid route to node(s) of destination. RREQ to reach the end node(s) of destination. The node(s) of destination can choose the route/path with the optimal metric based on end-to-end metrics and pass a new RREP back to the source node to install the route with the best metric between the source node and the destination node. If the optimal path is different from the temporary direct path, which is set by RREP from the intermediate node, the source node switches to the optimal path once the optimal path is selected.

The described system and method for route discovery between the source node and the destination node in a wireless network, includes the installation of intermediate flag response to the request message of the route to the source node, avalanche newsletter in a wireless network a request message of route response to the request message of route response message route through the first intermediate node having a valid route to the destination node. System isposal then perform the update request message route and re-avalanche newsletter in a wireless network a request message route. The phase response of the mentioned phase response thereby establishes a temporary direct route between the source node and the destination node of the wireless network. Also described is a system and method of detection of the route with the best metric, wherein the response message of route becomes the first response message route. The system and method of detecting optimal route with metric includes selecting a destination node of the route with the best metric between itself and the source node based on the cumulative metrics adopted in the request messages of the route taken by the destination node, the creation of additional response message unicast route and additional transmission response message to the source node. If the temporal direct route is the route with the best metric, the additional response message route serves as a confirmation, and if the temporal direct route is not the route with the best metric, the additional response message route serves for defining the route with the best metric when receiving additional response message route to the source node.

Brief description of the drawings

The present invention is most easily understood from the following detailed description illustrated by the attached drawings, in which following�:

Fig.1 is an exemplary format of the RREQ message.

Fig.2 is a schematic representation of a wireless mesh network in accordance with the principles of the present invention.

Fig.3 is a schematic representation of a wireless mesh network in accordance with the principles of the present invention.

Fig.4 is a block diagram of the sequence of a method of routing Protocol on-demand, showing that, when the present invention is used.

Fig.5 is a block diagram of the sequence of operations of the method of the present invention.

Fig.6 is a block diagram of a node in accordance with the principles of the present invention.

Detailed description of preferred embodiments

When the source node/dot grid wants to forward packets/frames of data to some destination node, it checks its routing table for the route. If there is a valid route, it passes the packets/frames to next hop (relay) the land specified in the routing table for the destination node. If no valid route, the source node initiates the route discovery by an avalanche of messages to the distribution of route request (RREQ) for wireless mesh/randomly organized network. Packets/frames of data may come from the host or from stations associated with the node if the node is a m�is a wireless access point. It is possible that the source node needs to discover routes/paths to multiple destination nodes. The source node may propagate RREQ for each of the assignments or to reduce service load routing avalanche to send to the network one RREQ message with a list of the plurality of addresses of the destination nodes attached to it.

Fig.1 is an exemplary format of the RREQ message, when other formats. The RREQ message contains, for example, the node address of the beginning of the/source, the sequence number of the Creator, the address of the destination node and the sequence number of the destination (or the number of destinations and a list of assignments and their serial numbers), RREQ ID, message ID, message length, time-to-live (TTL), number of hops, the routing metric, flags, and other information. Besides flags "only the destination node (D) and "voluntary RREP (G), a new flag, called the flag "intermediate response" (IR) in this document is contained in the RREQ message. Flags D and G are contained in the quality inherited from the traditional AODV. These two flags are not set/used by the source node and ignored the intermediate nodes and the destination nodes. One alternative implementation is that the RREQ message contains no flags D and G. If the RREQ message carries the list and�destination addresses, several flags "intermediate response" included in the RREQ message, each of which corresponds to the destination address. When the source node wants to discover a route to one or more destination addresses, it sets a flag(and) "interim response" (IR) corresponding to the address(s) of destination. It should be noted that the address of the destination node may be the address(es) of the Internet Protocol (IP) or address(es) level 2 (control of access to the transmission medium transmission, MAC). To adapt to changes in network conditions and to maintain an optimal route with a metric between nodes, each active source node optional avalanche can be distributed in a wireless cellular/randomly organized network of periodic RREQ message (merchant RREQ) for the address(s) of the purpose with which(s) he communicates. The IR flag in the servicing RREQ is not installed. The intermediate nodes and the destination nodes process the merchant RREQ in accordance with the same rules as used for processing neobsluzhvane RREQ in the discovery phase.

Thus, it can be seen that the spread poslujivshih and maintenance RREQ messages in a wireless mesh/randomly organized network leads to build/update the reverse route to the Creator (the source node) in RREQ intermediate�x nodes and destination nodes. Distribution poslujivshih messages also initiates RREQ RREP message from the destination nodes, and possibly intermediate nodes. Distribution service message initiates RREQ RREP message from the destination nodes.

When an intermediate node or the destination node receives the RREQ message, it creates a reverse route to the source node or updates the current return path if the RREQ message transmitted by means of the route/path, which offered a better metric than the current return route to the source node. It should be noted that each node may receive multiple copies of the same RREQ message (starting with one source node and have the same RREQ ID), and each RREQ message goes a different path from the source node to the receiving node/intermediate node/destination node. If the reverse route is created or modified, or it is "the first copy of the RREQ message, the RREQ message is sent (avalanche is sent). "The first copy" is used herein to indicate that this copy of the RREQ message is the first copy or the time when the receiving unit/intermediate node/destination node received or seen this particular RREQ message identified by the address of the Creator and RREQ ID. When an intermediate node tselesoobraznee RREQ, field metrics in the RREQ message is updated to reflect the cumulative metric of the route to the source node RREQ from the intermediate node. In addition, if the IR flag for the destination node in the list of destination nodes received message RREQ is set, and the intermediate node has a valid route to the destination node, the intermediate node responds to the RREQ message, the reply message RREP route. This is the response message of the route is transmitted to the source node in unicast mode and establishes a direct path to the destination node. The source node can then use this route to send the frames/packets to the destination node directly. If the intermediate node replies to the message RREQ RREP message to a destination node in the list of destination nodes RREQ, it resets/clears the IR flag for the destination node in the RREQ message to re-avalanche distribution in the network is updated RREQ message. The reason for resetting the flag after IR transmission of RREP message is to suppress all messages RREP subsequent intermediate nodes. Only the first intermediate node with a valid route to the destination node along the route traversed by the avalanche distribution RREQ message, responds with a RREP message for that destination node. If the IR flag for appointment reset/cleared in the RREQ message, �romioconty node should not respond with a RREP message, even if it has a valid route to the destination node.

After creating/establishing or updates a reverse route to the source node, the destination node sends unicast RREP message back to the source node. Intermediate nodes create direct routes to the node(s) of destination when receiving the RREP message, and sends a RREP message to the source node. When the source node receives the RREP message, it creates a direct route to the destination node. If the destination node receives additional messages RREQ with the best metrics, the destination node updates its route to the source node in the new route, and sends a new message RREP back to the source node to the updated route. New message RREP more optimal sets (updated) direct route from the source node to the destination node in the intermediate nodes and eventually to the source node. After this more optimal direct route is selected, the source node uses its data. In the end, bidirectional end-to-end route with the best metric is established between the source node and the destination node. Using this approach, the source node can quickly get the route to the destination node, which is set using the RREP message that is answered by an intermediate node with days�conscious people route to the destination node. If this route is not a through route with the best metric between the source node and the destination node, the route is then updated to the route with the best metric.

Fig.2 illustrates the avalanche distribution in wireless cellular/randomly organized network message of route request (RREQ) and the intermediate node B with a valid route to the destination node E, and responding to the message RREQ RREP message. Consider the example in which the source node attempts to discover A route to the destination node E. Node A source avalanche sends message of route request (RREQ) with the IR flag set in wireless mesh/randomly organized network. Suppose that an intermediate node B already has a valid route B-C-D-E to the destination node E. When an intermediate node B receives the RREQ, it creates a reverse route to the source node from which it receives RREQ as the next hop (node source (A) reverse route/path. Intermediate node B responds to RREQ RREP in unicast mode, because it has a valid route to the destination E, and the IR flag in the RREQ is set.

RREP sets direct route to the destination node E in the source node A. once the source node creates A route/path to the destination node E using RREP from the intermediate node B, Uzes� source A may start the transmission of packets/frames of data to the destination node E via the route A-B-C-D-E. Intermediate node B resets the IR flag in the RREQ message and sends it on. The cause of the reset flag IR is to limit responses to avalanche newsletter RREQ only the first intermediate node with a valid route to the destination node. Other intermediate nodes further, for example, C and D should not respond to this RREQ using RREP because the IR flag is not set. Assume that the intermediate nodes F, G and H do not have a valid route to the destination node E. When the intermediate nodes F, G and H take the avalanche sent RREQ messages, they create a reverse route to the source node a with the node from which each of the intermediate nodes F, G and H receives RREQ as the next hop of the reverse route. Each of the intermediate nodes F, G and H then sends a RREQ message.

In this example, the destination node E receives two copies of this RREQ, each with a different path: A-B-C-D-E, A-F-G-H-E., provided that two RREQ has reached the destination node E in the following order: A-B-C-D-E and then A-F-G-H-E, the destination node E first creates a route to the source node through A smart host D, once the destination node E receives RREQ route/path A-B-C-D-E. At this point the route back to the source node A is installed in the intermediate nodes B, C and D. the destination Node E sends RREP route E-D-C-B-A. RREP pros�updates about the route A-B-C-D-E. If there is any node(s) of destination in the RREQ destination list, for example, a node I, the destination node E removes itself from the list of destination and then sends a RREQ further (for example, in node (I). If no other node(s) of the destination in the destination list RREQ, then the RREQ is not sent.

Fig.3 illustrates a wireless local wire mesh, indicating that the destination node E is responsible RREP (1) upon receiving an RREQ through A-B-C-D-E and transmits a new RREP, (2) to establish a more optimal direct route/path after receiving RREQ by A-F-G-H-E. When the destination node E receives RREQ, which passed on A-F-G-H-E, the destination node E determines that this RREQ was on the way with a better metric to A, than the temporary reference route/path A-B-C-D-E. Therefore, the destination node E modifies/updates the next hop intermediate node D to the intermediate node H and updates the metric. After that, the destination node E transmits the RREP mode unicast back to the source node through A smart host H, and updates and sends RREQ, if there are one or more other destination nodes in the list of destination RREQ. RREP sets a route to A source node through intermediate nodes H, G and F. When A source node receives this RREP, it modifies/updates the next hop to a destination node EOT intermediate node B to the intermediate node F. The route to the destination node E is changed to A-F-G-H-E.

Fig.4 shows a block diagram of a sequence of processing operations of the RREQ message. When a node receives a RREQ message, it first creates/installs or updates the route back to the previous transit the area from which the node received the RREQ message, if necessary, in step 410. Intermediate/receiving node can then create or update the route back to the Creator of the RREQ as follows. If the reverse route to the originator of RREQ message is not in the routing table or is invalid in step 415 and 420, it is created or updated. The next transit in the routing table for a reverse route to the Creator of the RREQ becomes previous transit station (the node from which the RREQ message received). If a valid route back to the Creator of the RREQ exists, the source sequence number in the RREQ message is compared with the sequence number of the route entry in the routing table in step 425 for a reverse route. If the sequence number in the RREQ message is older, he is discarded, and no additional processing is performed in step 445. Otherwise, the current route back to the Creator is modified, if the new metric is more optimal than the current route metric to the Creator in the routing table on the stage 30. The new metric is defined as the metric in the RREQ message plus linking metric between the node from which it received the RREQ message, and themselves. If the new metric is more optimal than the current metric of the reverse route in the routing table, but the source sequence number in RREQ is greater (newer) sequence number in the routing table for a reverse route in step 435, the intermediate node checks the supported optional feature, the hysteresis processing and caching of route candidate with the optimal metric through a mesh network, in step 450. If these optional processing functions are not supported, the return route to the Creator of the RREQ is updated in step 455. When a route is created or modified, the sequence number in the routing table for a reverse route installed on the source sequence number in the RREQ message, the next transit becomes a node from which the RREQ message received, the metric is set to the new metric, and the number of hops is set equal to one more than the number of hops the RREQ message.

If the reverse route to the source node is created or modified, or the RREQ message was the first copy of the RREQ message (RREQ ID is not visible from the source previously) in step 420 and 440, the procedure is redirected�I RREQ and the formation of the RREP, described in this document, shall be enforced in step 475. There may be other cases when the procedure of sending RREQ and the formation of the RREP described in this document, shall be enforced by the node. For example, in a method of caching route candidate with the optimal metric RREQ messages can be stored in the waiting queue with the timer during the caching of route options. When the timer turns out, the procedure of sending RREQ and the formation of the RREP is to be executed.

The source node can transmit periodic maintenance RREQ message to update your active direct and reverse the route. Each time the source sends the merchant RREQ message, called the update cycle route. It is possible that the nodes that already have a return route with the best metric to the source node, receive the RREQ message with new sequence number, but along with the worst metric to the source node until the reception of the RREQ message via the current route with the best metric. Additionally, a copy of the RREQ message distributed by the current route with the best metric may be lost in the avalanche distribution. These events can lead to the fluctuation of the route. To reduce the fluctuation of the route and the route with the best metric at each qi�La route updates, can be used some type of hysteresis mechanism and caching of routes candidates with an optimal metric. If at step 460 it is determined that variant of hysteresis and caching optimal route option is implemented via a cellular network, the intermediate node updates the routing table and modifies the return route, if the source sequence number in the RREQ message is greater (newer) sequence number to entries of the routing table to a value greater than the threshold value. Otherwise, the return route may be cached as a potential alternative route option in step 465.

If the node subsequently learns that the current route back got worse and worse options return route, it can change on an option route, defined earlier in the same update cycle. The present invention describes a method and system to send a RREQ message and generate a RREP message to detect the route with the best metric without any great delay/latency of route discovery in wireless mesh networks. The method of the present invention works with or without hysteresis and caching of optimal variants/alternative routes.

Fig.5 shows a block flow chart illustrating STRs�about sending RREQ and the formation of the RREP of the present invention, in which the node determines whether it is the destination node, i.e. whether one or more node addresses (self_addr) the requested destination address in the destination list messages RREQ rreq.dest, in step 505. It should be noted that the node can have multiple addresses or can act as a proxy (agent) for other nodes. For example, a node may be an access point and generate/manage message routing on behalf of legacy stations associated with it (proxy for stations). The functionality for this case is similar to the situation when a node has multiple addresses. The destination address associated stations can be considered as an address alias for access point. A node is a destination node, if one or more addresses specified in the assignment list of the RREQ message, belongs to him or one of the nodes that use it as a proxy. When a node receives a RREQ message in which the destination node is a node that uses it as a proxy, it needs to process the RREQ message, as if the address of the destination node was his address. Moreover, a node may be the destination node for the requested address in the list of destination of the RREQ message, the intermediate node to another of the requested address in the list of destination of the RREQ message.

If one or more addresses of a node corresponds to naproxennaproxen destination in the destination list of the RREQ message, the node generates and transmits the RREP message in unicast mode the Creator of the message RREQ for these matching destination addresses in step 510. The destination node removes its own/used to proxy address(es) from the list of destination of the RREQ message in step 515. After that, if there is no remaining requested address in the destination list of the RREQ message at step 520, the RREQ message is discarded in step 525. If the node is not the destination node for any of the requested address in the destination list of the RREQ message (505) or are there other requested destination in the destination list of the RREQ message, along with the addresses of the node, i.e. if the node is an intermediate node for one or more addresses in the destination list of the RREQ message, the node checks the remaining addresses in the destination list of the RREQ message as follows. Assume that the rreq.dest[i] represents the (i+1)-th address in the destination list of the RREQ message. The host initializes the index (for example, (i) in step 545 and rreq checks.dest[i], i.e. the first address in the destination list of the RREQ message to determine whether active direct route to the destination node, represented by a rreq.dest[i], in step 550. If the intermediate node has an active route to the destination, a route to the destination node is valid (555), the sequence number at least as big as specified in Isho�Mr. RREQ message (560), and the flag "intermediate response (IR)" is specified (570), the intermediate node generates a RREP message for the requested destination address in step 575, and transmits the generated RREP message in unicast mode the Creator of the message RREQ current reverse route. The IR flag for this requested destination in the RREQ message is reset in step 580. The node increments the index (for example, for one) and checks whether there are any additional addresses in the destination list of the RREQ message, in step 590. If there is any additional addresses in the destination list of the RREQ message, the execution of the above-described cycle is repeated starting with step 550. I.e. the cycle is repeated if the RREP message must be sent to the next requested destination. The cycle repeats until, until all addresses in the destination list of the RREQ message will not be checked.

Initial incoming RREQ message is checked to determine whether more 1 value time-to-live (TTL), in step 530. If the TTL value is greater than one, then the information in the original message RREQ is updated, including decreases the TTL value in the outgoing RREQ message, for example, one unit in step 535. Ordinal, metric and the number of hops of the source is also set equal to the corresponding information in the updated route entry for the source on the e�APE 535. The updated RREQ message is sent in step 540.

Note that the destination node can be used as a proxy for one or more addresses, and the intermediate node may have a valid(s) route(s) to one or more destination addresses. The RREQ message can carry one or more destination addresses in the destination address list. Processing unit/intermediate node/destination node can satisfy the aforesaid conditions and send the RREP message requested for multiple addresses in the destination list of the RREQ message. If a node sends a RREP message to several destinations, it can send multiple RREP messages, one for each destination, or it may send one aggregated message RREP with multiple destination addresses in the address list.

Fig.6 is a block diagram illustrating the details of the node 600 of the present invention. The node includes a module 605 for quality measurement and load line communication module 610 calculate metrics routing module 615 route selection and the communication module 620. The module 605 measuring the quality and the load line measures the communication quality and the load line connection/channel with each of its neighbors. It provides the measurement results to the module 610 compute routing metrics, so that the module 610 compute routing metrics could do�pouring the cost/metric line for each of its neighbors. Note that a node may have several neighbors, multiple radio interfaces and multiple physical/logical channel/communication lines. All of them have to be measured. The module 610 compute routing metrics for each node uses the measurement performed by the measurement module quality and load lines of communication, along with other information to compute the routing metric for each node with which it communicates. The routing metric is updated periodically. Module 615 route selection determines/selects the route/path / to send/to transmit data to the destination node, based on the calculated metrics of the routing. Module 615 routing messages for routing control and data with other nodes in a mesh network via the communication module 620. It should be noted that a node may have one or more interfaces radio and other communication interfaces. It should be understood that the module routing may actually be composed of several smaller units or combined with other modules described in this document. Additionally, it should be understood that the processes described in this document (especially in relation to Fig.3 and 4), can be software, hardware, firmware or any combination viseaza�military, enforced in or via the automatic route selection.

It should be understood that the present invention can be implemented in various forms of hardware, software, firmware, special purpose processors, or a combination of the above, for example, in the mobile terminal, an access point or a cellular network. Preferably the present invention is implemented as a combination of hardware and software. Moreover, the software is preferably implemented as an application program, the material implemented in the program store device. The application program can be loaded or executed by a machine containing any appropriate architecture. Preferably, the machine is implemented on a computing platform having hardware such as one or more Central processing units (CPU), random access memory (RAM) and interfaces I / o. Computing platform also includes an operating system and code of microinstructions. Various processes and functions described herein may either be part of the code of microinstructions or part of the application program (or a combination of the above), which is enforced by the operating si�topics. In addition, various other peripheral devices may be connected to a computing platform, such as an additional data storage device and printing device.

Additionally, it should be understood that because some of the constituent system components and steps of the method, shown in the accompanying drawings, is preferably implemented in software, the actual connections between the system components (or the process steps) may differ depending on the way that programmed the present invention. Taking into account proposed in this paper methods are specialists in the art will be able to consider these and similar implementations or configurations of the present invention.

1. Method of determining the location of the route between the source node and the destination node in a wireless network, comprising stages, in which:
locate a valid route between the source node and the destination node based on the first intermediate node, responding to the request message of the route through the response message of route that has a valid route to the destination node, and referred to the intermediate node responds to the request message of the route based on the state of FLA�and mentioned in the request message of the route, and over and above the first intermediate node discards the said flag;
establish a link between the source node and the destination node with the actual route.
locate more optimal route between the source node and the destination node when the said destination node selects the optimal route based on the total end-to-end routing metrics; and
establish a link between the source node and the destination node using these optimal route.

2. The device determining the location of the route between the source node and the destination node in a wireless network, comprising:
a means for determining the location of a valid route between the source node and the destination node based on the first intermediate node, responding to the request message of the route through the response message of route that has a valid route to the destination node, and referred to the intermediate node responds to the request message of the route, based on the state of the flag in the request message of the route, and over and above the first intermediate node discards mentioned flag
means for establishing communication between the source node and the destination node with the actual route.
a means for determining the location of a more optimal route between the source node and the destination node when the said destination node selects the optimal route based on the total end-to-end routing metrics; and
means for establishing communication between the source node and the destination node using mentioned more optimal route.