Search Images Maps Play YouTube News Gmail Drive More »
Sign in

Patents

  1. Advanced Patent Search
Publication numberUS7058018 B1
Publication typeGrant
Application numberUS 10/091,035
Publication date6 Jun 2006
Filing date6 Mar 2002
Priority date6 Mar 2002
Fee statusPaid
Also published asCA2476516A1, CA2476516C, EP1481499A1, EP1481499A4, US7672246, US20060159038, WO2003077452A1
Publication number091035, 10091035, US 7058018 B1, US 7058018B1, US-B1-7058018, US7058018 B1, US7058018B1
InventorsWilliam Vann Hasty, Jr., Peter J. Stanforth
Original AssigneeMeshnetworks, Inc.
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
System and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer II routing in a wireless communication network
US 7058018 B1
Abstract
A system and method for evaluating at least one communication link between a transmitting node and a receiving node in a communications network, such as a wireless ad-hoc communications network in accordance with the 802.11 standard. The system and method perform the operation of assigning respective link quality values to the respective communication links based on a transmit power level (TPL) value at which the respective data packets were transmitted by the transmitting node over the respective links, a received sensitivity (RS) value of the receiving node receiving the data packets, and a receive signal strength indication (RSSI) value provided by the network for each respective link. The system and method can examine a content of a data packet being sent between the two nodes to determine the TPL, and can receive the RSSI value from a physical layer of the communications network. Accordingly, the system and method can determine which link that additional data packets are to be sent by the transmitting node to the receiving node via the communication link based on the link quality values. Specifically, the link having the highest link quality value is selected.
Images(6)
Previous page
Next page
Claims(48)
1. A system, adapted for use in a communications network, for evaluating at least one communication link between a transmitting node and a receiving node in the communications network, the system comprising:
a processor for assigning a link quality value to said communication link based on a transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving said data packet, and a receive signal strength indication (RSSI) value provided by said network; and
wherein said processor calculates said link quality value as a link quality ratio (LQR) represented by the equation

LQR=1−(TPL−RSSI)/(TPL−RS).
2. A system as claimed in claim 1, further comprising:
a packet analyzer for examining a content of a data packet being sent between said two nodes to determine said TPL.
3. A system as claimed in claim 1, wherein:
said processor receives said RSSI value from a physical layer of said communications network.
4. A system as claimed in claim 1, wherein:
said processor determines whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
5. A system as claimed in claim 1, wherein:
said network includes an ad-hoc wireless communications network; and
said processor assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
6. A system as claimed in claim 1, wherein:
said network includes an 802.11-type network; and
said processor assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
7. A system as claimed in claim 1, wherein:
said processor assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
8. A system as claimed in claim 7, wherein:
said processor selects one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
9. A system as claimed in claim 8, wherein:
said processor selects as said selected route one of said communications links having the highest link quality value.
10. A system as claimed in claim 1, wherein:
said processor assigns said link quality value on a per packet basis.
11. A method for evaluating at least one communication link between a transmitting node and a receiving node in a communications network, the method comprising:
assigning a link quality value to said communication link based on a transit power level (TPL) value at which said data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving said data packet, and a receive signal strength indication (RSSI) value provided by said network; and
wherein said assigning calculates said link quality value as a link quality ratio (LQR) represented by the equation

LQR=1−(TPL−RSSI)/(TPL−RS).
12. A method as claimed in claim 11, further comprising:
examining a content of a data packet being sent between said two nodes to determine said TPL.
13. A method as claimed in claim 11, further comprising:
receiving said RSSI value from a physical layer of said communications network.
14. A method as claimed in claim 11, further comprising:
determining whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
15. A method as claimed in claim 11, wherein:
said network includes an ad-hoc wireless communications network; and
said assigning signs said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
16. A method as claimed in claim 11, wherein:
said network includes an 802.11-type network; and
said assigning assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
17. A method as claimed in claim 11, wherein:
said assigning assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
18. A method as claimed in claim 17, further comprising:
selecting one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
19. A method as claimed in claim 18, wherein:
said selecting selects as said selected route one of said communications links having the highest link quality value.
20. A method as claimed in claim 11, wherein:
said assigning assigns said link quality value on a per packet basis.
21. A computer-readable medium of instructions, adapted for use with a communications network for evaluating at least one communication link between a transmitting node and a receiving node in the communications network, the instructions comprising:
a first set of instructions for assigning a link quality value to said communication link based on a transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving said data packet, and a receive signal strength indication (RSSI) value provided by said network; and
wherein said first set of instructions calculates said link quality value as a link quality ratio (LQR) represented by the equation

LQR=1−(TPL−RSSI)/(TPL−RS).
22. A computer-readable medium of instructions as claimed in claim 21, further comprising:
a second set of instructions for examining a content of a data packet being sent between said two nodes to determine said TPL.
23. A computer-readable medium of instructions as claimed in claim 21, further comprising:
a third set of instructions for obtaining said RSSI value from a physical layer of said communications network.
24. A computer-readable medium of instructions as claimed in claim 21, further comprising:
a fourth set of instructions for determining whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
25. A computer-readable medium of instructions as claimed in claim 21, wherein:
said network includes an ad-hoc wireless communications network; and
said first set of instructions assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
26. A computer-readable medium of instructions as claimed in claim 21, wherein:
said network includes an 802.11-type network; and
said first set of instructions assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
27. A computer-readable medium of instructions as claimed in claim 21, wherein:
said first set of instructions assigns a respective said link quality value to each respective one of said communication links between sad transmitting and receiving nodes.
28. A computer-readable medium of instructions as claimed in claim 27, further comprising:
a fifth set of instructions for selecting one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
29. A computer-readable medium of instructions as claimed in claim 28, wherein:
said fifth set of instructions selects as said selected route one of said communications links having the highest link quality value.
30. A computer-readable medium of instructions as claimed in claim 21, wherein:
said first set of instructions assigns said link quality value on a per packet basis.
31. A system as claimed in claim 1, wherein:
said processor is employed in said receiving node.
32. A system as claimed in claim 31, wherein:
said receiving node is a mobile wireless node in said communications network.
33. A system as claimed in claim 5, wherein:
said processor is employed in said receiving node.
34. A system as claimed in claim 33, wherein:
said receiving node is mobile.
35. A system as claimed in claim 6, wherein:
said processor is employed in said receiving node.
36. A system as claimed in claim 35, wherein:
said receiving node is mobile.
37. A method as claimed in claim 11, wherein:
said receiving node performs said assigning step.
38. A method as claimed in claim 37, where:
said receiving node is a mobile wireless node in said communications network.
39. A method as claimed in claim 15, wherein:
said receiving node performs said assigning step.
40. A method as claimed in claim 39, wherein:
said receiving node is mobile.
41. A method as claimed in claim 16, wherein:
said receiving node performs said assigning step.
42. A method as claimed in claim 41, wherein:
said receiving node is mobile.
43. A computer-readable medium of instructions as claimed in claim 21, wherein:
said first set of instructions controls said receiving node to assign a link quality value to said communication link based on a transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node riving said data packet, and a receive signal strength indication (RSSI) value provided by said network.
44. A computer-readable medium of instructions as claimed in claim 43, wherein:
said receiving node is a mobile wireless node in said communications network.
45. A computer-readable medium of instructions as claimed in claim 25, wherein:
said first set of instructions controls said receiving node to assign a link quality value to said communication link based on a transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving said data packet, and a receive signal strength indication (RSSI) value provided by said network.
46. A computer-readable medium of instructions as claimed in claim 45, wherein:
said receiving node is mobile.
47. A computer-readable medium of instructions as claimed in claim 26, wherein:
said first set of instructions controls said receiving node to assign a link quality value to said communication link based on a transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving said data packet, and a receive signal strength indication (RSSI) value provided by said network.
48. A computer-readable medium of instructions as claimed in claim 47, wherein:
said receiving node is mobile.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a system and method for using a receive signal strength indication and a transmit power level to determine the integrity of a link for use in Layer II routing in a network, such as an 802.11 network. More particularly, the present invention relates to a system and method for using indications of per-packet receive signal strengths and per-packet transmit power levels to compute path losses for links between nodes in a communication network, such as an 802.11 network, in order to select the most suitable link over which to send data packets between the nodes.

2. Description of the Related Art

In recent years, a type of mobile communications network known as an “ad-hoc” network has been developed. In this type of network, each user terminal (hereinafter “mobile node”) is capable of operating as a base station or router for the other mobile nodes, thus eliminating the need for a fixed infrastructure of base stations. Accordingly, data packets being sent from a source mobile node to a destination mobile node are typically routed through a number of intermediate mobile nodes before reaching the destination mobile node. Details of an ad-hoc network are set forth in U.S. Pat. No. 5,943,322 to Mayor, the entire content of which is incorporated herein by reference.

More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in a conventional ad-hoc network, further enable the mobile nodes to access a fixed network and thus communicate with other types of user terminals, such as those on the public switched telephone network (PSTN) and on other networks such as the Internet. Details of these types of ad-hoc networks are described in U.S. patent application Ser. No. 09/897,790 entitled “Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks”, filed on Jun. 29, 2001, in U.S. patent application Ser. No. 09/815,157 entitled “Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel”, filed on Mar. 22, 2001, and in U.S. patent application Ser. No. 09/815,164 entitled “Prioritized-Routing for an Ad-Hoc, Peer-to-Peer, Mobile Radio Access System”, filed on Mar. 22, 2001, the entire content of each of said patent applications being incorporated herein by reference.

As can be appreciated by one skilled in the art, when a node sends packetized data to a destination node, the node typically checks its routing table to determine whether the destination node is contained in its routing table. If the destination node is contained in the node's routing table, the data is transmitted via a path that leads to the destination node. If the destination node is not listed in the node's routing table, then the packet is sent to one or more other nodes listed in the node's routing table, and those other nodes determine if the destination table is listed in their routing tables. The process continues until the data packet eventually reaches the destination node.

In these types of ad-hoc networks, the algorithms that are used to determine the path of intermediate nodes via which the data packets are routed between source and destination nodes are typically based on the shortest distance between the source and destination nodes or, assuming that the data packet transport medium is wireless, the least power required to perform the routing. However, such algorithms do not necessarily produce a predictable delivery of data packets. For example, routing of data packets can be delayed due to congestion in intermediate nodes. Also, delivery failure of data packets can occur on noisy radio links between nodes. Moreover, because many of the nodes are mobile, the conditions of the links can be constantly changing.

In addition, other factors such as the signal strength at which a data-packet is received by a node over a link, as well as the power level at which the node finds it necessary to transmit a data-packet over the link, provide an indication of the integrity of the link. Currently, ad-hoc wireless communications networks, and especially those employing terminals which operate in accordance with 802.11 standards, do not take into account the received signal strength or the transmitted power level when determining the suitability of a link for use in sending data packets between nodes. Details of the 802.11 standards are set forth in ISO/IEC 8802-11, ANSI/IEEE 802.11 “Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Network Specific Requirements”, Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications, the entire contents of which being incorporated herein by reference. Also, a description of the 802.11 standard is found in a book by Bob O'Hara and Al Petrick entitled IEEE 802.11 Handbook: A Designer's Companion, IEEE, 1999, the entire contents of which being incorporated herein by reference.

Accordingly, a need exists for a system and method which enables wireless ad-hoc communications network, such as an 802.11 network, to evaluate the integrity of a link between nodes based on the strength at which a signal is received over the link and transmission power level at which a signal is transmitted over the link, in order to determine whether to use the link for data packet routing between the nodes.

SUMMARY OF THE INVENTION

An object of the present invention is to provide a system and method for computing the path loss along a link between nodes in a wireless ad-hoc communications network using transmitted power level information contained in a received data packet and the receive signal strength indication (RSSI) at which the data packet is received.

Another object of the present invention is to provide a system and method for enabling a node, such as a mobile user terminal, in a wireless communications network, such as an 802.11 network, to compute the path loss along a link between itself and another node using the per-packet RSSI and the per-packet transmitted power level of data packets received and transmitted over that link, to thus determine the suitability of that link.

A further object of the present invention is to provide a system and method that provides for improved communication between nodes in an ad-hoc wireless communications network, in particular, an 802.11 network, by allowing the nodes to select the path having the least loss as a medium for transporting packets.

These and other objects are substantially achieved by providing a system and method for evaluating at least one communication link between a transmitting node and a receiving node in a communications network, such as a wireless ad-hoc communications network in accordance with the 802.11 standard. The system and method perform the operation of assigning respective link quality values to the respective communication links based on a transmit power level (TPL) value at which the respective data packets were transmitted by the transmitting node over the respective links, a received sensitivity (RS) value of the receiving node receiving the data packets, and a receive signal strength indication (RSSI) value provided by the network for each respective link. The system and method can examine a content of a data packet being sent between the two nodes to determine the TPL, and can receive the RSSI value from a physical layer of the communications network. Accordingly, the system and method can determine which link that additional data packets are to be sent by the transmitting node to the receiving node via the communication link based on the link quality values. Specifically, the link having the highest link quality value is selected.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which:

FIG. 1 is a block diagram of an example of an ad-hoc wireless communications network employing a system and method for evaluating the integrity of links between nodes according to an embodiment of the present invention;

FIG. 2 is a block diagram illustrating an example of components of a node employed in the network shown in FIG. 1;

FIG. 3 is a block diagram depicting a comparison of path loss for two routes between nodes in the ad-hoc wireless communications network shown in FIG. 1 according to an embodiment of the present invention; and

FIGS. 4 and 5 are timing diagrams illustrating an example of operations performed for computing a quality value for a link between nodes in the network shown in FIG. 1 according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 is a block diagram illustrating an example of an ad-hoc packet-switched wireless communications network 100 employing an embodiment of the present invention. Specifically, the network 100 includes a plurality of mobile wireless user terminals 102-1 through 102-n (referred to generally as nodes or mobile nodes 102), and a fixed network 104 having a plurality of access points 106-1, 106-2, . . . 106-n (referred to generally as nodes or access points 106), for providing the nodes 102 with access to the fixed network 104. The fixed network 104 includes, for example, a core local access network (LAN), and a plurality of servers and gateway routers, to thus provide the nodes 102 with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet. The network 100 further includes a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes or fixed routers 107) for routing data packets between other nodes 102, 106 or 107.

As can be appreciated by one skilled in the art, the nodes 102, 106 and 107 are capable of communicating with each other directly, or via one or more other nodes 102, 106 or 107 operating as a router or routers for data packets being sent between nodes 102, as described in U.S. Pat. No. 5,943,322 to Mayor and in U.S. patent application Ser. Nos. 09/897,790, 09/815,157 and 09/815,164, referenced above. Specifically, as shown in FIG. 2, each node 102, 106 and 107 includes a transceiver 108 which is coupled to an antenna 110 and is capable of receiving and transmitting signals, such as packetized data signals, to and from the node 102, 106 or 107, under the control of a controller 112. The packetized data signals can include, for example, voice, data or multimedia.

Each node 102, 106 and 107 further includes a memory 114, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes 102, 106 or 107 in the network 100. The nodes 102, 106 and 107 exchange their respective routing information, referred to as routing advertisements or routing table information, with each other via a broadcasting mechanism periodically, for example, when a new node 102 enters the network 100, or when existing nodes 102 in the network 100 move. A node 102, 106 or 107 will broadcast its routing table updates, and nearby nodes 102, 106 or 107 will only receive the broadcast routing table updates if within broadcast range (e.g., radio frequency (RF) range) of the broadcasting node 102, 106 or 107. For example, assuming that nodes 102-1, 102-2 and 102-7 are within the RF broadcast range of node 102-6, when node 102-6 broadcasts its routing table information, that information is received by nodes 102-1, 102-2 and 102-7. However, if nodes 102-3, 102-4 and 102-5 through 102-n are out of the broadcast range, none of those nodes will receive the broadcast routing table information from node 102-6.

An example of the manner in which the integrity of a link is evaluated in accordance with an embodiment of the present invention will now be discussed with reference to FIGS. 1–4. Specifically, an embodiment of the present invention uses the available per-packet receive signal strength indication (RSSI) from an 802.11 physical layer combined with the per-packet transmitted power level to evaluate the path loss along a link for a packet sent within the network 100, which in this example is an 802.11 wireless network as discussed in the Background section above.

The per-packet path loss is used as a metric that determines the integrity of a link between two 802.11-compliant nodes 102, 106 or 107, as well as the probability that future packets will be successfully transmitted on the link between the two nodes. Routing algorithms in Layer II of the network 100, which is known as the switching layer as can be appreciated by one skilled in the art, can use this probability to eliminate links that have a low probability of successful packet delivery.

Referring to FIG. 3, four nodes 102-1, 102-2, 102-3 and 102-4, which are also identified as nodes N0, N1, N2 and N3, respectively, are depicted as forming two routes. The first route comprises nodes N0, N1 and N3, while the second route comprises nodes N0, N2 and N3. In this example, node N0 is the origination node and node N34 is the destination node, while nodes N1 and N2 are intermediate nodes. An example of the manner in which an embodiment of the present invention computes path loss will now be discussed in detail with respect to FIGS. 3–5.

As shown in FIGS. 4 and 5, each node N0 through N3 in the network 100 periodically broadcasts routing advertisements to other nodes within its broadcast range. In this example, node N3 broadcasts routing advertisements to nodes N2 and N1 which are within the broadcast range of node N3. A broadcast routing advertisement includes information in its header pertaining to the transmit power level (TPL) in Decibels (Dbm). That is, prior to transmitting a packet, the controller 112 of node N3 causes this information to be included in the header of the packet. The RSSI is available from the 802.11 physical layer implementation Also, each node knows its receive sensitivity (RS), which is the lowest level signal strength at which a received signal containing a data packet can be received in order for the node to be able to successfully recover data from the received data packet. In other words, any signal received with a value less than the threshold RS value will be viewed as noise. The following equation represents an example of the manner in which the value of the link quality ratio (LQR) of the link from node N3 to node N2, and from node N3 to node N1, can be calculated that yields a ratio which can be used to measure the per packet link quality between wireless nodes in the network 100:
LQR=1−(TPL(Dbm)−RSSI(Dbm))/(TPL(Dbm)−RS(Dbm))

In this example, each node N0 through N3 in FIG. 3 has a TPL value of 20 Dbm. Node N0 has an RS value of −90 Dbm, nodes N1 and N2 each have an RS value of −85 Dbm, and node N3 has an RS value of −95 Dbm. In this example, the RSSI for the link from node N3 to node N2 is −70 Dbm, and the RSSI for the link from node N3 to node N1 is −80 Dbm. Accordingly, applying the LQR equation to the TPL, RS and RSSI values at node N2, a LQR value can be calculated by the controller 112 of node N2 as follows:
1−[((20 Dbm−(−70 Dbm))/(20 Dbm−(−85 Dbm))]=0.142 LQR

The RSSI value for the link between nodes N3 and N2 is −80 Dbm. Applying the LQR equation as shown results in:
1−[((20 Dbm−(−80 Dbm))/(20 Dbm−(−85 Dbm))]=0.048 LQR

As indicated, the route from node N3 to node N1 has a higher LQR value that the route from node N3 to node N2, which indicates that the route from node N3 to node N1 has a higher integrity level and there is thus a higher probability that future packets taking this route will have better success than if they took the route from node N3 to node N2. As further shown in FIGS. 4 and 5, node N1 broadcasts a routing advertisement to nodes N0 and N3 which are in the broadcast range of node N1. Nodes N0 and N3 calculate the respective LQR based on these received routing advertisements in the manner described above. It is further noted that the routing advertisements broadcast by node N1 includes information pertaining to the calculated LQR for the link from node N3 to node N1. Node N2 also broadcasts a routing advertisement to nodes N0 and N3 which are in the broadcast range of node N2. It is further noted that the routing advertisements broadcast by node N2 includes information pertaining to the calculated LQR for the link from node N3 to node N2.

The respective controllers 112 of nodes N0 and N3 thus calculate the respective LQR based on these received routing advertisements in the manner described above. It is also noted that node N0 is not shown as broadcasting any routing advertisements to any of the nodes within its broadcast range because, as discussed above, node N0 in this example is an origination node that sends a data packet to a destination node N3, and thus its routing advertisements are irrelevant for purposes of this description. However, like all nodes, node N0 would broadcast routing advertisements to the nodes in its broadcast range.

Furthermore, because node N0 is the origination node in this example, and is sending a data packet to destination node N3, the controller 112 of node N0 also calculates the aggregate link quality ratio (ALQR) for the two paths, namely, the path including nodes N0, N1 and N3, and the path including nodes N0, N1 and N3. Hence, node 0 calculates the ALQR for the path including nodes N0, N1 and N3 by adding the LQRs for the links N3 to N1 and NI to N0 as calculated above. The ALQR for this path is calculated to be 0.135 as shown in FIG. 5. Similarly, node 0 calculates the ALQR for the path including nodes N0, N2 and N3 by adding the LQRs for the links N3 to N2 and N2 to N0 as calculated above. The ALQR for this path is calculated to be 0.324 as shown in FIG. 5. Assuming that all other variables are equal, the controller 112 of node N0 chooses the path having the highest ALQR, namely, the path including nodes N0, N2 and N3

As noted before, the check for LQR is done with the delivery of each packet. Thus, the technique according to the embodiment of the present invention described above provides a means of determining the best route on a continuous basis. Therefore, the mobility of the nodes 102 does not have a major effect on the quality of packet transmission for the wireless network 100. Furthermore, a running average of the LQR can be maintained by the source node N0 to determine the probable link reliability and can be used in determining which potential route to select. That is, over time, the LQR of the respective links can be accumulated to provide a more statistically meaningful measure of the quality of the links.

It can be assumed that future packets taking the selected route will also have a higher LQR value. However, as noted above, the check for LQR values is done continuously. Therefore, future selected routes can change based on the LQR values changing for presently used routes. For example, presently used routes can have LQR values that diminish. In another example, presently used routes can maintain the same LQR value, but unused routes can have an increase in LQR value.

It will also be appreciated by those skilled in the art that although the technique is described above in relation to 802.11 protocols, the technique invention can be modified to include other protocols and still fall within the scope of the present invention. For example, the techniques described above can be employed in other types of wireless mediums, such as Home RF, Bluetooth, and so on.

Although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined in the following claims.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US449419221 Jul 198215 Jan 1985Sperry CorporationHigh speed bus architecture
US46176562 Jan 198614 Oct 1986Tokyo Shibaura Denki Kabushiki KaishaInformation transmission system with modems coupled to a common communication medium
US473637129 Dec 19865 Apr 1988Nec CorporationSatellite communications system with random multiple access and time slot reservation
US474235717 Sep 19863 May 1988Rackley Ernie CStolen object location system
US474713017 Dec 198524 May 1988American Telephone And Telegraph Company, At&T Bell LaboratoriesResource allocation in distributed control systems
US49105213 Aug 198120 Mar 1990Texas Instruments IncorporatedDual band communication receiver
US50349613 Jun 198823 Jul 1991Software Sciences LimitedArea communications system
US506891629 Oct 199026 Nov 1991International Business Machines CorporationCoordination of wireless medium among a plurality of base stations
US523163418 Dec 199127 Jul 1993Proxim, Inc.Medium access protocol for wireless lans
US523360428 Apr 19923 Aug 1993International Business Machines CorporationMethods and apparatus for optimum path selection in packet transmission networks
US524154223 Aug 199131 Aug 1993International Business Machines CorporationBattery efficient operation of scheduled access protocol
US531756618 Aug 199331 May 1994Ascom Timeplex Trading AgLeast cost route selection in distributed digital communication networks
US53924508 Jan 199221 Feb 1995General Electric CompanySatellite communications system
US5412654 *10 Jan 19942 May 1995International Business Machines CorporationHighly dynamic destination-sequenced destination vector routing for mobile computers
US54247479 Apr 199313 Jun 1995Thomson-CsfProcess and system for determining the position and orientation of a vehicle, and applications
US5491837 *7 Mar 199413 Feb 1996Ericsson Inc.Method and system for channel allocation using power control and mobile-assisted handover measurements
US55027221 Aug 199426 Mar 1996Motorola, Inc.Method and apparatus for a radio system using variable transmission reservation
US55174913 May 199514 May 1996Motorola, Inc.Method and apparatus for controlling frequency deviation of a portable transceiver
US55554257 Mar 199010 Sep 1996Dell Usa, L.P.Multi-master bus arbitration system in which the address and data lines of the bus may be separately granted to individual masters
US555554017 Feb 199510 Sep 1996Sun Microsystems, Inc.ASIC bus structure
US557252820 Mar 19955 Nov 1996Novell, Inc.Mobile networking method and apparatus
US561521211 Sep 199525 Mar 1997Motorola Inc.Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes
US56180458 Feb 19958 Apr 1997Kagan; MichaelInteractive multiple player game system and method of playing a game between at least two players
US562173218 Apr 199515 Apr 1997Nec CorporationAccess method and a relay station and terminals thereof
US562349515 Jun 199522 Apr 1997Lucent Technologies Inc.Portable base station architecture for an AD-HOC ATM lan
US562797620 Mar 19956 May 1997Advanced Micro Devices, Inc.Crossing transfers for maximizing the effective bandwidth in a dual-bus architecture
US56318971 Oct 199320 May 1997Nec America, Inc.Apparatus and method for incorporating a large number of destinations over circuit-switched wide area network connections
US564457616 May 19951 Jul 1997International Business Machines CorporationMedium access control scheme for wireless LAN using a variable length interleaved time division frame
US565275126 Mar 199629 Jul 1997Hazeltine CorporationArchitecture for mobile radio networks with dynamically changing topology using virtual subnets
US568039216 Jan 199621 Oct 1997General Datacomm, Inc.Multimedia multipoint telecommunications reservation systems
US568479425 Jan 19964 Nov 1997Hazeltine CorporationValidation of subscriber signals in a cellular radio network
US568719422 Apr 199311 Nov 1997Interdigital Technology CorporationSubscriber RF telephone system for providing multiple speech and/or data signals simultaneously over either a single or a plurality of RF channels
US569690329 Apr 19949 Dec 1997Norand CorporationHierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking
US5697056 *8 May 19959 Dec 1997Motorola, Inc.Communication system in which radio subscriber units mitigate interference
US57012942 Oct 199523 Dec 1997Telefonaktiebolaget Lm EricssonSystem and method for flexible coding, modulation, and time slot allocation in a radio telecommunications network
US570642814 Mar 19966 Jan 1998Lucent Technologies Inc.Multirate wireless data communication system
US571768910 Oct 199510 Feb 1998Lucent Technologies Inc.Data link layer protocol for transport of ATM cells over a wireless link
US5732077 *28 Feb 199624 Mar 1998Lucent Technologies Inc.Resource allocation system for wireless networks
US574548329 Sep 199528 Apr 1998Ricoh Company, Ltd.Wireless computer network communication system and method having at least two groups of wireless terminals
US5768684 *26 Aug 199616 Jun 1998Motorola, Inc.Method and apparatus for bi-directional power control in a digital communication system
US577487626 Jun 199630 Jun 1998Par Government Systems CorporationManaging assets with active electronic tags
US578154030 Jun 199514 Jul 1998Hughes ElectronicsDevice and method for communicating in a mobile satellite system
US57870803 Jun 199628 Jul 1998Philips Electronics North America CorporationMethod and apparatus for reservation-based wireless-ATM local area network
US579415426 Jul 199611 Aug 1998Motorola, Inc.Communications system and method of operation
US579673228 Mar 199618 Aug 1998Cisco Technology, Inc.Architecture for an expandable transaction-based switching bus
US57967415 Mar 199618 Aug 1998Nippon Telegraph And Telephone CorporationATM bus system
US580559326 Sep 19958 Sep 1998At&T CorpRouting method for setting up a service between an origination node and a destination node in a connection-communications network
US580584226 Sep 19958 Sep 1998Intel CorporationApparatus, system and method for supporting DMA transfers on a multiplexed bus
US58059771 Apr 19968 Sep 1998Motorola, Inc.Method and apparatus for controlling transmissions in a two-way selective call communication system
US580951820 May 199615 Sep 1998Dallas Semiconductor CorporationCommand/data transfer protocol for one-wire-bus architecture
US582230915 Jun 199513 Oct 1998Lucent Technologies Inc.Signaling and control architecture for an ad-hoc ATM LAN
US58449059 Jul 19961 Dec 1998International Business Machines CorporationExtensions to distributed MAC protocols with collision avoidance using RTS/CTS exchange
US58450973 Jun 19961 Dec 1998Samsung Electronics Co., Ltd.Bus recovery apparatus and method of recovery in a multi-master bus system
US58570842 Oct 19965 Jan 1999Klein; Dean A.Hierarchical bus structure access system
US5862345 *15 Aug 199619 Jan 1999Nec CorporationSystem for location multicasting and database management for mobile sessions in any computer subnetworks without using a home router of a home subnetwork
US587035021 May 19979 Feb 1999International Business Machines CorporationHigh performance, high bandwidth memory bus architecture utilizing SDRAMs
US587772425 Mar 19972 Mar 1999Trimble Navigation LimitedCombined position locating and cellular telephone system with a single shared microprocessor
US58810951 May 19979 Mar 1999Motorola, Inc.Repeater assisted channel hopping system and method therefor
US58813721 Dec 19959 Mar 1999Lucent Technologies Inc.Radio communication device and method
US588699215 Apr 199723 Mar 1999Valtion Teknillinen TutkimuskeskusFrame synchronized ring system and method
US589656123 Dec 199620 Apr 1999Intermec Ip Corp.Communication network having a dormant polling protocol
US590355920 Dec 199611 May 1999Nec Usa, Inc.Method for internet protocol switching over fast ATM cell transport
US59096515 May 19971 Jun 1999Lucent Technologies Inc.Broadcast short message service architecture
US593695318 Dec 199710 Aug 1999Raytheon CompanyMulti-mode, multi-channel communication bus
US594332224 Apr 199624 Aug 1999Itt Defense, Inc.Communications method for a code division multiple access system without a base station
US5960335 *18 Jul 199628 Sep 1999Kabushiki Kaisha ToshibaDigital radio communication apparatus with a RSSI information measuring function
US5987011 *30 Aug 199616 Nov 1999Chai-Keong TohRouting method for Ad-Hoc mobile networks
US59870338 Sep 199716 Nov 1999Lucent Technologies, Inc.Wireless lan with enhanced capture provision
US59912794 Dec 199623 Nov 1999Vistar Telecommunications Inc.Wireless packet data distributed communications system
US6021125 *8 Oct 19981 Feb 2000Sony CorporationCellular wireless communications system and base station
US60288536 Jun 199722 Feb 2000Telefonaktiebolaget Lm EricssonMethod and arrangement for radio communication
US60292173 Oct 199422 Feb 2000International Business Machines CorporationQueued arbitration mechanism for data processing system
US603454214 Oct 19977 Mar 2000Xilinx, Inc.Bus structure for modularized chip with FPGA modules
US6035183 *9 Dec 19977 Mar 2000Nortel Networks CorporationBasestation RSSI and BER feedback signal quality display and transmit diversity
US60440626 Dec 199628 Mar 2000Communique, LlcWireless network system and method for providing same
US604733020 Jan 19984 Apr 2000Netscape Communications CorporationVirtual router discovery system
US605259430 Apr 199718 Apr 2000At&T Corp.System and method for dynamically assigning channels for wireless packet communications
US605275214 Nov 199618 Apr 2000Daewoo Telecom Ltd.Hierarchical dual bus architecture for use in an electronic switching system employing a distributed control architecture
US6058107 *8 Apr 19982 May 2000Motorola, Inc.Method for updating forward power control in a communication system
US606462631 Jul 199816 May 2000Arm LimitedPeripheral buses for integrated circuit
US606729123 Sep 199723 May 2000Lucent Technologies Inc.Wireless local area network with enhanced carrier sense provision
US607856628 Apr 199820 Jun 2000Genesys Telecommunications Laboratories, Inc.Noise reduction techniques and apparatus for enhancing wireless data network telephony
US610471222 Feb 199915 Aug 2000Robert; Bruno G.Wireless communication network including plural migratory access nodes
US610873810 Jun 199722 Aug 2000Vlsi Technology, Inc.Multi-master PCI bus system within a single integrated circuit
US61155808 Sep 19985 Sep 2000Motorola, Inc.Communications network having adaptive network link optimization using wireless terrain awareness and method for use therein
US612269017 Apr 199819 Sep 2000Mentor Graphics CorporationOn-chip bus architecture that is both processor independent and scalable
US613088120 Apr 199810 Oct 2000Sarnoff CorporationTraffic routing in small wireless data networks
US613230629 Mar 199617 Oct 2000Cisco Systems, Inc.Cellular communication system with dedicated repeater channels
US613799316 Jan 199824 Oct 2000Telefonaktiebolaget Lm EricssonMethod and apparatus for estimating path loss in a radio communications system
US6138024 *23 Oct 199724 Oct 2000Allen Telecom Inc.Dynamic channel selection in a cellular communication system
US61479752 Jun 199914 Nov 2000Ac Properties B.V.System, method and article of manufacture of a proactive threhold manager in a hybrid communication system architecture
US6157616 *31 May 19965 Dec 2000Lucent TechnologiesAdaptive methods for packet transmission over wireless networks
US616369915 Sep 199719 Dec 2000Ramot University Authority For Applied Research And Industrial Development Ltd.Adaptive threshold scheme for tracking and paging mobile users
US6175745 *24 Dec 199716 Jan 2001Telefonaktiebolaget Lm EricssonInitial transmit power determination in a radiocommunication system
US617833719 Jun 199723 Jan 2001Qualcomm IncorporatedWireless telecommunications system utilizing CDMA radio frequency signal modulation in conjuction with the GSM A-interface telecommunications network protocol
US61920537 Sep 199520 Feb 2001Wireless Networks, Inc.Enhanced adjacency detection protocol for wireless applications
US619223027 Sep 199320 Feb 2001Lucent Technologies, Inc.Wireless data communication system having power saving function
US62088701 Jun 199927 Mar 2001Lucent Technologies Inc.Short message service notification forwarded between multiple short message service centers
US622324031 Jan 200024 Apr 2001Lsi Logic CorporationBus bridge architecture for a data processing system capable of sharing processing load among a plurality of devices
US624029430 May 199729 May 2001Itt Manufacturing Enterprises, Inc.Mobile radio device having adaptive position transmitting capabilities
US624687526 Mar 199912 Jun 2001Bell Atlantic Network Services, Inc.Use of cellular digital packet data (CDPD) communications to convey system identification list data to roaming cellular subscriber stations
US624951627 Jan 200019 Jun 2001Edwin B. BrownriggWireless network gateway and method for providing same
US62757078 Oct 199914 Aug 2001Motorola, Inc.Method and apparatus for assigning location estimates from a first transceiver to a second transceiver
US628589224 Nov 19984 Sep 2001Philips Electronics North America Corp.Data transmission system for reducing terminal power consumption in a wireless network
US630455624 Aug 199816 Oct 2001Cornell Research Foundation, Inc.Routing and mobility management protocols for ad-hoc networks
US6307843 *17 Jul 199823 Oct 2001Nec CorporationAd hoc network of mobile hosts using link table for identifying wireless links and destination addresses
US632730025 Oct 19994 Dec 2001Motorola, Inc.Method and apparatus for dynamic spectrum allocation
US63490917 Nov 200019 Feb 2002Itt Manufacturing Enterprises, Inc.Method and apparatus for controlling communication links between network nodes to reduce communication protocol overhead traffic
US63492103 Nov 200019 Feb 2002Itt Manufacturing Enterprises, Inc.Method and apparatus for broadcasting messages in channel reservation communication systems
US6498932 *18 Dec 199624 Dec 2002Nokia Telecommunications OyMethod and an apparatus for determining the pathloss between a base transceiver station and a mobile station in a mobile radio network
US6498934 *24 Mar 199924 Dec 2002Telefonaktiebologet Lm Ericsson (Publ)Channel allocation using enhanced pathloss estimates
US6512935 *24 Mar 200028 Jan 2003Gte Internetworking IncorporatedEnergy conserving network protocol
US6519236 *18 Sep 199811 Feb 2003Telefonaktiebolaget Lm Ericsson (Publ)Automatic power control in uncoordinated frequency-hopping radio systems
US6678252 *28 Oct 199913 Jan 2004Verizon Laboratories Inc.Method and apparatus for dynamic source routing in ad hoc wireless networks
US6735448 *7 Nov 200011 May 2004Hrl Laboratories, LlcPower management for throughput enhancement in wireless ad-hoc networks
US6829226 *4 Apr 19977 Dec 2004Ericsson Inc.Power control for a mobile terminal in a satellite communication system
US200100536996 Feb 200120 Dec 2001Mccrady Dennis D.Method and apparatus for determining the position of a mobile communication device
US20020071395 *8 Dec 200013 Jun 2002Redi Jason KeithMechanism for performing energy-based routing in wireless networks
US20040059825 *7 Feb 200325 Mar 2004Edwards Paul C.Medium access control in a wireless network
CA2132180A115 Sep 199416 Mar 1996Victor PierobonMassive array cellular system
EP0513842A118 May 199219 Nov 1992Samsung Electronics Co., Ltd.Power supply apparatus for magnetron driving
EP0627827A211 May 19947 Dec 1994CSELT Centro Studi e Laboratori Telecomunicazioni S.p.A.Method of controlling transmission on a same radio channel of variable-rate information streams in radio communication systems, and radio communication system using this method
EP0924890A215 Dec 199823 Jun 1999The Whitaker CorporationAdaptive error correction for a communication link
Non-Patent Citations
Reference
1Ad Kamerman and Guido Aben, "Net Throughput with IEEE 802.11 Wireless LANs".
2Andras G. Valko, "Cellular IP: A New Approach to Internet Host Mobility", Jan. 1999, ACM Computer Communication Review.
3Benjamin B. Peterson, Chris Kmiecik, Richard Hartnett, Patrick M. Thompson, Jose Mendoza and Hung Nguyen, "Spread Spectrum Indoor Geolocation", Aug. 1998, Navigation: Journal of the Institute of Navigation, vol. 45, No. 2, summer 1998.
4C. David Young, "USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol".
5Chip Elliott and Bob Heile, "Self-Organizing, Sef-Healing Wireless Networks", 2000 IEEE.
6George Vardakas and Wendell Kishaba, "QoS Networking With Adaptive Link Control and Tactical Multi-Channel Software Radios".
7J.J. Garcia-Luna-Aceves and Asimakis Tzamaloukas, "Reversing the Collision-Avoidance Handshake in Wireless Networks".
8J.J. Garcia-Luna-Aceves and Ewerton L. Madruga, "The Core-Assisted Mesh Protocol", Aug. 1999, IEEE Journal on Selected Areas in Communications, vol. 17, No. 8.
9J.J. Garcia-Luna-Aceves and Marcelo Spohn, "Transmission-Efficient Routing in Wireless Networks Using Link-State Information".
10J.R. McChesney and R.J. Saulitis, "Optimization of an Adaptive Link Control Protocol for Multimedia Packet Radio Networks".
11Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta Jetcheva, "A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols", Oct. 25-30, 1998, Proceedings of the 4<SUP>th </SUP>Annual ACM/IEEE International Conference on Mobile Computing and Networking.
12Martha E. Steenstrup, "Dynamic Multipoint Virtual Circuits for Multimedia Traffic in Multihop Mobile Wireless Networks".
13Ram Ramanathan and Martha E. Steenstrup, "Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support".
14Ram Ramanathan and Regina Rosales-Hain, "Topology Control of Multihop Wireless Networks using Transmit Power Adjustment".
15Richard North, Dale Bryan and Dennis Baker, "Wireless Networked Radios: Comparison of Military, Commercial, and R&D Protocols", Feb. 28-Mar. 3, 1992, 2<SUP>nd </SUP>Annual UCSD Conference on Wireless Communications, San Diego CA.
16Wong et al., "A Pattern Recognition System for Handoff Algorithms", Jul. 2000, IEEE Journal on Selected Areas in Communications, vol. 18, No. 7.
17Wong et al., "Soft Handoffs in CDMA Mobile Systems", Dec. 1997, IEEE Personal Communications.
18Zhenyu Tang and J.J. Garcia-Luna-Aceves, "Collision-Avoidance Transmission Scheduling for Ad-Hoc Networks".
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7215928 *10 Oct 20038 May 2007Nortel Networks LimitedPath selection in wireless networks
US850924512 Nov 201013 Aug 2013The Boeing CompanyPolymorphic routing for dynamic networks
US8547982 *23 Nov 20111 Oct 2013King Fahd University Of Petroleum And MineralsWireless sensor network with energy efficient protocols
US8780763 *13 Jan 201215 Jul 2014Trilliant Networks, Inc.Communication and message route optimization and messaging in a mesh network
US9179244 *6 Feb 20133 Nov 2015Apple Inc.Proximity and tap detection using a wireless system
US9503992 *12 Jan 200922 Nov 2016Blackberry LimitedDetermining a target transmit power of a wireless transmission
US9769598 *1 Jul 201619 Sep 2017Apple Inc.Proximity and tap detection using a wireless system
US9801218 *9 Jun 201524 Oct 2017Delta Electronics, Inc.Establishing method for self-organization network of wireless nodes
US20040219922 *10 Oct 20034 Nov 2004William GagePath selection in wireless networks
US20050152283 *8 Jan 200414 Jul 2005David RitzenthalerWireless device discovery
US20080159133 *27 Dec 20063 Jul 2008Ka Ki YeungMethod of providing wireless signal strength and congestion data of an access point
US20090111504 *12 Jan 200930 Apr 2009Research In Motion LimitedDetermining a target transmit power of a wireless transmission
US20120140678 *13 Jan 20127 Jun 2012Michel VeilletteCommunication and Message Route Optimization and Messaging in a Mesh Network
US20130128786 *23 Nov 201123 May 2013King Fahd University Of Petroleum And MineralsWireless sensor network with energy efficient protocols
US20140064116 *6 Feb 20136 Mar 2014Apple Inc.Proximity and tap detection using a wireless system
US20160192241 *9 Jun 201530 Jun 2016Delta Electronics, Inc.Establishing method for self-organization network of wireless nodes
Classifications
U.S. Classification370/250, 370/331, 455/450, 370/349
International ClassificationH04B7/26, H04B7/005, H04L12/28, H04L12/56, H04B7/212, H04B17/00, H04W40/24, H04W40/28, H04W40/12, H04W40/08, H04W40/00, H04W84/12, H04W84/18, H04W52/24
Cooperative ClassificationY02B60/50, H04L45/00, H04W84/18, H04W52/24, H04W40/28, H04W84/12, H04W40/08, H04B17/318, H04W40/12, H04W40/00, H04W40/248
European ClassificationH04L45/00, H04B17/00B1R, H04W40/00, H04W40/12, H04W40/08, H04W52/24
Legal Events
DateCodeEventDescription
6 Mar 2002ASAssignment
Owner name: MESHNETWORKS, INC., FLORIDA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HASTY, JR, WILLIAM VANN;STANFORTH, PETER J.;REEL/FRAME:012671/0639
Effective date: 20020306
20 Nov 2009FPAYFee payment
Year of fee payment: 4
27 Sep 2010ASAssignment
Owner name: MOTOROLA INC., DISTRICT OF COLUMBIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MESH NETWORKS, INC.;REEL/FRAME:025039/0630
Effective date: 20100730
15 Mar 2012ASAssignment
Owner name: MOTOROLA MOBILITY, INC., ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MOTOROLA, INC.;REEL/FRAME:027935/0808
Effective date: 20120302
2 Oct 2012ASAssignment
Owner name: MOTOROLA MOBILITY LLC, ILLINOIS
Free format text: CHANGE OF NAME;ASSIGNOR:MOTOROLA MOBILITY, INC.;REEL/FRAME:029216/0282
Effective date: 20120622
26 Nov 2013FPAYFee payment
Year of fee payment: 8
26 Nov 2014ASAssignment
Owner name: GOOGLE TECHNOLOGY HOLDINGS LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MOTOROLA MOBILITY LLC;REEL/FRAME:034474/0001
Effective date: 20141028