US20110128918A1

US20110128918A1 - Method for discovering high throughput routes in wireless mesh networks

Info

Publication number: US20110128918A1
Application number: US13/056,466
Authority: US
Inventors: Hongqiang Zhai
Original assignee: Koninklijke Philips Electronics NV
Current assignee: Koninklijke Philips NV
Priority date: 2008-07-30
Filing date: 2009-07-08
Publication date: 2011-06-02
Also published as: EP2319268B1; JP5767110B2; TWI495300B; TW201021476A; CN102124783B; WO2010013154A1; KR20110050653A; EP2319268A1; KR101588043B1; CN102124783A; JP2011529654A

Abstract

A method (300) for discovering a route between a source node and a destination node in mesh wireless media (WiMedia) based networks. The method comprises upon receiving a route request (RREQ) by an intermediate node between the source node and the destination node, saving, in the RREQ, at least the identification (ID) number of the intermediate node and a transmission channel rate of a link on which the RREQ is received on (S320); computing a new route price (S330); determining if the new route price is larger than a price included in the received RREQ (S340); updating the received RREQ to include the new route price when the new route price is larger than the route price in the received RREQ (S350); and forwarding the updated RREQ to one or more neighbors of the intermediate node (S370).

Description

This application claims the benefit of U.S. Provisional Application No. 61/084,709 filed on Jul. 30, 2008.
The invention generally relates to the discovery of routes in mesh networks.
The WiMedia specification for ultra-wideband (UWB) systems defines a fully distributed medium access control (MAC) protocol for wireless personal area networks (WPANs). Due to regulatory restrictions the transmission power and transmission range of nodes in a WPAN is now limited. The WiMedia specification supports a number of different channel rates, including 53.3 Mbps, 80 Mbps, 106.7 Mbps, 160 Mbps, 200 Mbps, 320 Mbps, 400 Mbps, and 480 Mbps.
To extend the communication range of WiMedia based WPANs, a mesh-enabled MAC protocol can be utilized in such networks. The mesh-enabled MAC protocol enables a node in the network to reach another node out of its direct communication range through other intermediate nodes. The intermediate nodes forward/relay the packets from a source node towards a destination node. The operation of the mesh MAC protocol is illustrated in FIG. 1. In a mesh WiMedia based WPAN 100 a node 110-A cannot directly communicate with a node 110-F as they are out of each other's transmission range. However, the node 110-A can send packets to the node 110-F through mesh-enabled nodes 110-B and 110-D. Therefore, the route for transmitting data from the source node 110-A to a destination node 110-F includes the forwarding nodes 110-B and 110-D. The mesh-enabled nodes are nodes that implement the mesh MAC protocol.
Existing route discovery and routing protocols include, for example, a dynamic source routing (DSR) protocol and an ad hoc on demand distance vector (AODV) protocol. These protocols find a route only when there is a demand of traffic delivery, thus facilitating low routes maintenance overhead. As illustrated in FIG. 2A, in order to discover a route, a source node 210-A broadcasts a route discovery request (RREQ) packet that is received by nodes 210-B and 210-C, which then forward the RREQ to their neighboring device(s). For example, as shown in FIG. 2B, the node 210-B forwards a received RREQ to a node 210-C, 210-D, and 210-E, while the node 210-A forwards a received RREQ to a node 210-B and 210-D. The same process is carried out by the nodes 210-E and 210-D (see FIG. 2C). After receiving a RREQ packet, the destination node sends back a route discovery response (RREP) packet to the source node along the route that a received RREQ travelled through. This is illustrated in FIG. 2D where a node 210-F is the destination node. Based on the RREP the source node 210-A determines the route to send packets to the destination node 210-F.
The DSR and AODV protocols typically find routes with the smallest hop count, i.e., routes travelling through the smallest number of intermediate nodes. Consequently, each hop along the route has a hop distance close to the largest communication range. Thus, discovered routes can support only low transmission rates. As a result, the benefits of higher rates are not fully utilized.
It would be therefore advantageous to provide an efficient route discovery solution in WiMedia mesh networks.
Certain embodiments of the invention include a method for discovering a route between a source node and a destination node in mesh wireless media (WiMedia) based networks. The method comprises upon receiving a route request (RREQ) by an intermediate node between the source node and the destination node, saving, in the RREQ, at least the identification (ID) number of the intermediate node and a transmission channel rate of a link on which the RREQ is received on; computing a new route price; determining if the new route price is larger than a price included in the received RREQ; updating the received RREQ to include the new route price when the new route price is larger than the route price in the received RREQ; and forwarding the updated RREQ to one or more neighbors of the intermediate node.
Certain embodiments of the invention also include a computer readable medium having stored thereon computer executable code, when executed causing a processor to perform the process of discovering a route between a source node and a destination node in mesh wireless media (WiMedia) based networks. The process comprises upon receiving a route request (RREQ) by an intermediate node between the source node and the destination node, saving, in the RREQ, at least the identification (ID) number of the intermediate node and a transmission channel rate of a link on which the RREQ is received on; computing a new route price; determining if the new route price is larger than a price included in the received RREQ; updating the received RREQ to include the new route price when the new route price is larger than the route price in the received RREQ; and forwarding the updated RREQ to one or more neighbors of the intermediate node.
The subject matter that is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other features and advantages of the invention will be apparent from the following detailed description taken in conjunction with the accompanying drawings.

FIG. 1 is a schematic diagram of a mesh WiMedia WPAN.

FIGS. 2A, 2B, 2C, and 2D are schematic diagrams of networks useful in demonstrating the operation of the existing discovery protocols.

FIG. 3 is a flowchart describing the route discovery method implemented in accordance with an embodiment of the invention.

FIG. 4 is a flowchart describing the step of computing a route price implemented in accordance with an embodiment of the invention.

FIGS. 5A, 5B, 5C, 5D, 5E, 5F and 5G are schematic diagrams of networks useful in demonstrating the operation of the discovery protocol implemented in accordance with an embodiment of the invention.

It is important to note that the embodiments disclosed by the invention are only examples of the many advantageous uses of the innovative teachings herein. In general, statements made in the specification of the present disclosure do not necessarily limit any of the various claimed inventions. Moreover, some statements may apply to some inventive features but not to others. In general, unless otherwise indicated, singular elements may be in plural and vice versa with no loss of generality. In the drawings, like numerals refer to like parts through several views.
The discovery process disclosed herein finds a route between a source node and a destination node with the highest throughput. In accordance with the principles of the invention a route discovery request (RREQ) is a packet constructed to carry at least identification (ID) numbers of nodes that the RREQ travels through, channel rates used by links along the route to transmit the RREQ, a price of the route that the RREQ travelled through, and a last-node-neighbors list. The route price is a reciprocal sum of the effective rates calculated for links in a route. The last-node-neighbors list keeps a record of nodes on the route which are also the neighbors of the last node that the RREQ travelled through. Each node in the network maintains a neighbor table including an ID number of each of its neighboring nodes and a cache memory for storing recently received RREQs.
FIG. 3 shows an exemplary and non-limiting flowchart 300 describing the method for discovering routes in wireless mesh networks implemented in accordance with an embodiment of the invention. The method is initiated by a source node which broadcasts a RREQ carrying at least the information mentioned above. The method is executed by each intermediate node, (i.e., a node in a path between the source node and destination node) receiving a RREQ. When transmitted from the source node the RREQ includes the source node's ID. At S310, an intermediate node receives a RREQ. At S320, an intermediate node inserts into the RREQ its ID and the rate of a link on which the RREQ is received. At S330, a price of route on which the RREQ travelled, i.e., a route between the source node and the intermediate node, is computed.
Reference is now made to FIG. 4, where the execution of S330 is shown in greater detail. At S410, a route R, which the received RREQ has travelled through, is retrieved from the RREQ. The route R is represented as:
R(S, F1, F2, F3, . . . , Fk),
where the node S is the source node and nodes F1, F2, . . . , Fk−1 are the nodes that the RREQ already travelled through. At S420, the channel rates used by links along the route are obtained from the received RREQ. The channel rates are represented as (R1, R2, . . . , Rk−1), where R1 is the effective channel rate used by the link from nodes S to F1, and Ri (2≦i≦k−1) are the channel rates used by the links from nodes Fi−1 to Fi (2≦i≦k−1). At S430, an effective transmission channel rate of the link between the nodes that transmitted the RREQ and the node that received the RREQ is computed. The effective channel rate of the link from a transmitting node (Fk−1) to a receiving node (Fk) is referred to as ‘Rk’, and Li (1≦i≦k) denotes links between these nodes. An effective channel rate is the effective channel throughput computed by excluding the PHY/MAC protocol overhead for a given raw channel rate. The effective channel rate is different from a raw channel rate, which is defined by the WiMedia specification. In accordance with one embodiment the effective channel rate Rk is computed, by the receiving node (Fk), as follows:
$Rk = \frac{P}{T_{p}}$ $T_{p} = T_{rts} + T_{cts} + T_{data} + T_{ack} + T_{ifs}$ $or T_{p} = T_{data} + T_{ack} + T_{ifs}$ $T_{data} = T_{preamble} + \frac{H_{p} + P}{R_{C}}$
In the above equations, the parameter P is a payload size of a data packet, and the parameter T_pis the total time for completing a transmission of a data packet. The parameter T_pincludes the transmission times of data (T_data) packet and ACK (T_ack) frames as well as any interframe spacing (T_ifs) between these frames. The time T_pmay also include the transmission time of RTS/CTS (T_rts/T_cts) if such are used. A transmission time of a data frame is based on the transmission time of the preamble (T_preamble) which is fixed regardless of the selected channel rate R_C, a frame header (H_p) which is transmitted at the channel rate R_C, the payload size P, and the raw channel rate R_Cused to transmit the data frame. The payload size P may be an average payload size or any value adopted by the source node. The raw channel rate R_Cmay be a fixed channel rate used by the link or can be determined using known link adaptation algorithms.
At S440, the intermediate node (Fk) creates an updated last-node-neighbors list consisting of nodes on the route which are also the neighbors of node (Fk). As mentioned hereinabove, the node Fk receives a RREQ transmitted by the node Fk−1. At S450, a links list is created to include all links having at least one end-node being included in the last-node-neighbors list in the received RREQ or being a neighbor of node (Fk). For example, if the route is R(S, F1, F2, F3 and F4) and the last-node-neighbors list in the RREQ received by a node F4 includes only node F2, then the links list includes links F1->F2, F2->F3 and F3->F4. At S460, a route price of the node (Fk) is computed by summing the reciprocals of the effective channel rate of all links in the links list. That is, the price is calculated as follows:
${price}_{new} = \sum_{i, j = 1}^{1} \frac{1}{R_{ij}}$
where Rij are the effective rates calculated for links Lij (1≦j≦n) in the links list, ‘n’ is the total number of links in the list.
Reference is now made back to FIG. 3, where at S340 a check is made to determine if the computed price is larger than the price included in the received RREQ. If so, at S350 the RREQ is updated to include the new computed value; otherwise, execution continues with S360.
At S360, the intermediate node checks whether its cache memory includes other RREQs related to the same source-destination pair as of the received RREQ. If so, at S365, another check is made to determine if the received RREQ (with or without the updated price) has a route price smaller than those indicated in the cached RREQs. If so, at S370 the intermediate node forwards the received RREQ to its neighbors; otherwise, execution ends. In some embodiments the last-node-neighbors list may be updated at S370, in the same fashion as described with respect to S440. If S360 results in a negative answer, execution proceeds to S370.
The selection of the optimal route is performed by the destination node based on the route price. Specifically, if a destination node receives multiple RREQs for the same source-destination pair, the node selects the route travelled by a RREQ with the smallest route price among all the RREQs. The destination node sends a RREP on the selected route. The source and intermediate nodes update their route cache/table after receiving the RREP.
It should be noted that the existing routes discovery protocols, such as DSR and AODV can be adapted to implement the route discovery method disclosed herein. For example, existing routing protocols are required to wait a predefined amount of time to check whether additional RREQs are received during that time before the destination node can send back a RREP.
As another example, if a routing protocol is required to record a route and the route's price between all or some pairs of nodes that RREQs travelled through, the RREQ can be adapted to indicate the list of neighbors that the RREQ travelled through for all or some intermediate nodes (i.e., not only for the last node that the RREQ travelled through).
Referring to FIGS. 5A-5G where a non-limiting example demonstrating the operation of the route discovery process implemented in accordance with an embodiment of the invention is provided. FIG. 5A shows a network including six nodes 510-A though 510-F. The effective channel rates of links are shown on the edges between two nodes. For sake of simplicity and demonstration the effective channel rates are the same as raw channel rates.
FIG. 5B through FIG. 5G show the travel route of RREQ sent from a source node 510-A to a destination node 510-F. The source node 510-A starts the route discovery process by sending a RREQ to nodes 510-B and 510-C (see FIG. 5B). The route price calculated by the node 510-B is 1/160 and the route price calculated by node 510-C is 1/53.3. Then, the nodes 510-B and 510-C broadcasts the RREQ. The node 510-C also receives the RREQ sent by the node 510-B, and thereafter calculates the route price for that RREQ, which is 2/160. The new route price is less than previous calculated value 1/53.3. Thus, the node 510-C rebroadcasts the RREQ again with a new route (510-A, 510-B, 510-C) and a new price 2/160 to nodes 510-D and 510-E (see FIG. 5C). Other nodes in the network 500 follow the same rule, see FIGS. 5E and 5F.
The destination node 510-F receives a RREQ with a route (510-A, 510-B, 510-C, 510-D, 510-E, 510-F) with a price 4/160, a RREQ with a route (510-A, 510-C, 510-E, 510-F) with a route price 2/53.3+1/160, and some other RREQs. The node 510-F compares all the route prices, and selects the route with the smallest price, which is the route (510-A, 510-B, 510-C, 510-D, 510-E, 510-F). Subsequently, the destination node 510-F sends back a RREP along the selected route to the source node 510-A (see FIG. 5G). The source node 510-A updates its route cache/table, and the route from nodes 510-A to 510-F is established.
It should be appreciated that routes discovered using the method described above have better throughput than shortest-hop routes discovered by existing protocols. For example such protocols would select routes (510-A, 510-C, 510-E, 510-F), (510-A, 510-B, 510-D, 510-F), or (510-A, 510-C, 510-D, 510-F). All these three routes have the same price 2/53.3+1/160≈1/22.8, which has an approximate throughput of 22.8 Mbps. For the network, the disclosed method selects the route (510-A, 510-B, 510-C, 510-D, 510-E, 510-F) with a price of 1/40 and an approximate throughput of 40 Mbps. Therefore, the improvement for this example is about 75% in the end-to-end throughput. If there are more nodes and higher rates are available, the improvement can be even higher.
The disclosed method can be implemented in communication systems including, but not limited to, UWB based WPANs, WiMedia based wireless networks and WPANs, or any time division multiple access (TDMA) or super-frame based wireless networks.
The principles of the invention are implemented as a combination of hardware, firmware and software. Moreover, the software is preferably implemented as an application program tangibly embodied on a program storage unit or computer readable medium. The application program may be uploaded to, and executed by, a machine comprising any suitable architecture. Preferably, the machine is implemented on a computer platform having hardware such as one or more central processing units (“CPUs”), a memory, and input/output interfaces. The computer platform may also include an operating system and microinstruction code. The various processes and functions described herein may be either part of the microinstruction code or part of the application program, or any combination thereof, which may be executed by a CPU, whether or not such computer or processor is explicitly shown. In addition, various other peripheral units may be connected to the computer platform such as an additional data storage unit and a printing unit.
The foregoing detailed description has set forth a few of the many forms that the invention can take. It is intended that the foregoing detailed description be understood as an illustration of selected forms that the invention can take and not as a limitation to the definition of the invention. It is only the claims, including all equivalents that are intended to define the scope of this invention.

Claims

1. A method (300) for discovering a route between a source node and a destination node in mesh wireless media (WiMedia) based networks, comprising:

upon receiving a route request (RREQ) by an intermediate node between the source node and the destination node, saving, in the RREQ, at least the identification (ID) number of the intermediate node and a transmission channel rate of a link on which the RREQ is received on (S320);

computing a new route price (S330);

determining if the new route price is larger than a price included in the received RREQ (S340);

updating the received RREQ to include the new route price when the new route price is larger than the route price in the received RREQ (S350); and

forwarding the updated RREQ to one or more neighbors of the intermediate node (S370).

2. The method of claim 1, further comprising determining if there are one or more RREQs cached in the intermediate node (S360); finding a RREQ having a smaller route price value among the one or more cached RREQs, the updated RREQ, and the received RREQ (S365); and forwarding the RREQ determined to have the smallest route price to the one or more neighbors of the intermediate node (S370).

3. The method of claim 1, where the route price is a reciprocal sum of effective transmission rates calculated for links in a route.

4. The method of claim 3, wherein computing the route price further comprises:

retrieving a route on which the received RREQ has travelled through (S410);

obtaining the transmission channel rates used by links along the route, wherein each link is between a node transmitting RREQ and a node receiving RREQ (S420);

computing an effective transmission channel rate for each link (S430);

creating a links list (S450); and

summing the reciprocals of the effective transmission channel rates of all links in the links list (S460).

5. The method of claim 4, wherein the links list includes all links having at least one end-node designated in a last-node-neighbors list or at least one end-node which is a neighbor of the intermediate node.

6. The method of claim 5, wherein the last-node-neighbors list includes nodes on the route which are neighbors of a node that transmitted the received RREQ to the intermediate node.

7. The method of claim 6, further comprising creating the last-node-neighbors list to include node on the route which are also neighbors of the intermediate node (S440); and saving the updated last-node-neighbors list in the received RREQ.

8. The method of claim 5, wherein the last-node-neighbors list, transmission channel rates and the route on which the RREQ travelled through are maintained in the RREQ.

9. The method of claim 4, wherein the effective channel transmission rate of a link is computed by dividing a payload size of a data packet by a time required to complete transmission of a data packet over the link.

10. The method of claim 9, wherein the time to complete transmission of a data packet equals a sum of at least transmission times of a data frame (T_data), acknowledge (T_ack) frames, and interframe spacing (T_ifs) between acknowledge and data frames.

11. The method of claim 10, wherein the transmission time T_datais computed by:

T_{data} = T_{preamble} + \frac{H_{p} + P}{R_{C}}

wherein T_preambleis a transmission time of a preamble of the frame; H_pis a size of a frame header, P is a size of a payload, and R_Cis the transmission channel rate of the link.

12. The method of claim 2, wherein the route between the source node and the destination node is selected to be the route travelled by the RREQ with the smallest route price among all RREQs received by the destination node.

13. The method of claim 1, further comprising generating a route response (RREP) by the destination node; and sending the RREP to the source node on the selected route.

14. A computer readable medium having stored thereon computer executable code, when executed casing a processor to perform the step of discovering a route between a source node and a destination node in mesh wireless media (WiMedia) based networks, comprising:

computing a new route price (S330);

15. The computer readable medium of claim 14, wherein the computing the route price further comprises:

retrieving a route on which the received RREQ has travelled through (S410);

computing an effective transmission channel rate for each link (S430);

creating a links list (S450); and

summing the reciprocals of the effective transmission channel rate of all links in the link list (S460).