US 7,912,982 B2Grant
Wireless routing selection system and method
Issue Date:2011-03-22
•5 Claims
•10 Drawing Sheets
Abstract
A technique involves untethered access points (UAPs) that can broadcast estimated transmission time (ETT) that represents an estimated time it would take for a packet to be transmitted from the first UAP to an AP that is wire coupled to a network. The proposed system can offer, among other advantages, accurate ETT values for use by UAPs of a wireless network.
Metadata
Assignee
- Trapeze Networks, Inc.
Inventors
- James Murphy
- Gary Morain
Application Information
Application Number:US 11/604,075
Filing Date:2006-11-22
Priority Date:2006-06-09
Art Unit:2447
Classifications
IPC:
G06F15/173H04W40/00
Patent Drawings (10 sheets)
Description
[0001] This application claims priority to U.S. Provisional Patent Application No. 60/812,403, filed Jun. 9, 2006, and entitled WIRELESS NETWORK ARCHITECTURE, which application is hereby incorporated by reference.
Background
[0002] Next hop selection in a wireless protocol is made by selecting a least cost hop. Historically, cost has been determined by hop count, signal strength, error rate, utilization, and other factors. One technique for wireless routing selection involves defining cost based on expected transmission time (ETT) for some link (ETTI).
[0003] For example, link cost may be determined by measuring the transmission time to send a 1 Mbps stream of packets across the link and measuring its transmission time for some number of bytes. An algorithm may measure for each available bandwidth across the link, and the transmission time is defined as the time from when the packet is scheduled (specifically, sent to the radio) and the time that an acknowledgement is received.
[0004] The improvement of algorithms for next hop selection are the subject of research. Any improvements may have significant repercussions on the relevant technologies. Accordingly, any improvement in next hop selection would be advantageous.
[0005] These are but a subset of the problems and issues associated with wireless routing selection, and are intended to characterize weaknesses in the prior art by way of example. The foregoing examples of the related art and limitations related therewith are intended to be illustrative and not exclusive. Other limitations of the related art will become apparent to those of skill in the art upon a reading of the specification and a study of the drawings.
Summary
[0006] The following embodiments and aspects thereof are described and illustrated in conjunction with systems, tools, and methods that are meant to be exemplary and illustrative, not limiting in scope. In various embodiments, one or more of the above-described problems have been reduced or eliminated, while other embodiments are directed to other improvements.
[0007] A wireless network system is typically coupled to a wired network at some point. Such a point is sometimes referred to as an access point (AP). A plurality of untethered APs (UAPs) may be coupled to one another, and eventually to the AP, to allow a wireless network to grow to practically any size. However, as the network grows in size using UAPs, it becomes more difficult to figure out a best path from a mobile station, through the UAPs to the AP in an optimal fashion.
[0008] Advantageously, UAPs can broadcast estimated transmission time (ETT) that represents an estimated time it would take for a packet to be transmitted from the first UAP to the AP. Thus, a UAP that is right next to the AP should be able to give a low ETT to the AP. As the advertised ETTs percolate through the wireless network, UAPs can eventually settle on optimal paths to the AP. The better the estimate, the more likely the optimally chosen paths are actually optimal.
[0009] The proposed system can offer, among other advantages, accurate ETT values for use by UAPs of a wireless network. This and other advantages of the techniques described herein will become apparent to those skilled in the art upon a reading of the following descriptions and a study of the several figures of the drawings.
Brief Description of the Drawings
[0010] Embodiments of the invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.
[0011] FIG. 1 depicts an example of a rate aware wireless system.
[0012] FIG. 2 depicts an example of a weighted graph of source, next hop, and destination nodes.
[0013] FIG. 3 depicts an example of a system in which an ETTp calculation includes time spent on an output queue.
[0014] FIG. 4 depicts a graph that provides a conceptual depiction of queue latency.
[0015] FIG. 5 depicts an example of a wireless network system that includes a plurality of untethered APs (UAPs).
[0016] FIG. 6 depicts a flowchart of an example of a method for selecting a next hop.
[0017] FIG. 7 depicts a flowchart of an example of a method for measuring ETTl to a node.
[0018] FIG. 8 depicts a flowchart of an example of a method for advertising an ETTp.
[0019] FIG. 9 depicts a flowchart of an example of a method for calculating NTT.
Detailed Description
[0020] In the following description, several specific details are presented to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or in combination with other components, etc. In other instances, well-known implementations or operations are not shown or described in detail to avoid obscuring aspects of various embodiments, of the invention.
[0021] FIG. 1 depicts an example of a rate aware wireless system 100. In the example of FIG. 1 , the system 100 includes a node 110, a node 120, and a node 130. For illustrative purposes, the node 110 and the node 130 are currently linked via active link 112, while the node 120 and the node 130 are not currently linked, as represented by the candidate link 122. In an embodiment, the candidate link 122 is periodically measured to determine if it is a better route than the active link 112. Optionally, if the node 130 is a next hop from a source node to a destination node, the node 130 may be linked to another node (not shown) through a next hop link 132.
[0022] In the example of FIG. 1 , the node 110 advertises an estimated transmission time (ETT) for the path (ETTp) to a destination. ETTp 114 is the sum of ETT for each link (ETTl) from the source (e.g., the node 110) to the destination (not shown). ETTp 124 is the sum of ETTl from the source (e.g., the node 120) to the destination (not shown). Optionally, the node 130 advertises an ETTp 134 that is the ETTp from the node 130 to the destination (passing through either the node 110 or the node 120). ETTp 134 is optional because it will only exist if the node 130 is a next hop node.
[0023] FIG. 2 depicts an example of a weighted graph 200 of source, next hop, and destination nodes. The weights of the edges in the graph 200 are ETTl between two nodes of the graph 200. ETTp is the sum of ETTl from a source node 202 to a destination node 206. Typically, there are multiple next hop nodes 204-1 to 204-N (referred to collectively as nodes 204) between the source node 202 and the destination node 206, though it is possible to have none. As is shown in FIG. 2 , the ETTl from the source node 202 to the node 204-1 has an ETTl0. In general each of the nodes 204 has an ETTlx to the next hop, where x=the ordinal position of the current node. For example, the ETTl1 is the ETTl from the node 204-1 to the node 204-2. As another example, the ETTlN is the ETTl from the node 204-N to the destination node 206.
[0024] In some embodiments, the ETTp calculation is for the time a packet is sent from a radio until the time an acknowledgement is received. This, however, does not include time spent on a queue waiting for the radio to become available. Advantageously, by including the time spent on the queue, the ETTp calculation can take into consideration the real time it takes to transmit a packet based on load and utilization.
[0025] FIG. 3 depicts an example of a system 300 in which an ETTp calculation includes time spent on an output queue. In the example of FIG. 3 , the system 300 includes a wireless device 302, an access point (AP) 304, and an AP 306, a wireless switch 308, and a wired network 310. It may be noted that the AP 304 is depicted as an untethered AP. In an embodiment, any number of untethered APs could be coupled together to reach the tethered AP 306.
[0026] In the example of FIG. 3 , the wireless device 302 includes a queue 312, with packets 314-1 to 314-N enqueued thereon. The packet 314-1 is presumably a first packet of a stream of packets tha the wireless device 302 is trying to send to the AP 304. However, the AP 304 may not be available, which results in the packet being enqueued in the queue 312, as shown. The packet 314-N is the last packet to be enqueued prior to the packet 314-1 finally being sent to the AP 304. Thus, the example of FIG. 3 illustrates the queue 312 just before the packet 314-1 is sent to the AP 304 (and dequeued). The time spent waiting may be referred to as radio availability latency because it measures the time it takes for a radio (at the AP 304, in this case) to become available.
[0027] The AP 304 has a comparable queue 316, which is coupled to an ETT engine 318. The wireless device 302 may or may not have an ETT engine to determine how long a packet is enqueued on the queue 312, but in the example of FIG. 1 , no such engine is present at the wireless device 302. The queue 316 functions in a manner quite similar to that described with reference to the queue 312. At the AP 304, however, the ETT engine 318 actually measures the amount of time a packet is enqueued. This radio availability latency can be added to an advertised ETTp, as described later with reference to FIG. 1 , to give a more accurate measure of ETT for a packet.
[0028] Advantageously, ETT can be used by a next hop selector to decide upon an optimal next hop. In an embodiment, each AP includes a next hop selector.
[0029] FIG. 4 depicts a graph 400 that provides a conceptual depiction of queue latency. In the example of FIG. 4 , the graph 400 includes (for illustrative purposes) a flat, or static, link rate 402 and a data rate 404 that increases over time. Where the link rate 402 is greater than the data rate 404, the link is under-utilized, as shown by the shaded link underutilization portion 406 of the graph 400. The link saturation point 408 is at a time where the link rate 402 and the data rate 404 are the same. At the link saturation point 408, the link is fully utilized. Where the link rate 402 is less than the data rate 404, the link is congested, as shown by the shaded link congestion portion 410 of the graph 410. When the link is congested, packets will arrive at an output queue, such as the queue 316 (FIG. 3 ) at a rate that is greater than the rate at which the packets are dequeued (and transmitted). Thus, the time spent waiting on the queue will grow as the link grows more congested. Advantageously, an ETT engine, such as the ETT engine 318 (FIG. 3 ) can measure this time spent waiting and incorporate the measurement into an ETT calculation.
[0030] From “A Radio Aware Routing Protocol for Wireless Mesh Networks” by Kulkarni et al. defines cost based on ETTl, and how ETTl can be aggregated to determine ETTp. However, the algorithm used by Kulkarni et al. can be improved in some specific cases. For example, the choice of 1 Mbps load rate for link cost calculation is arbitrary and may be significantly off. In an embodiment, expected load rate (ELR) is used instead. ELR is the load that a link would be subject to if it was selected as a next-hop.
[0031] Referring once again to the example of FIG. 1 , an ELR 10-30 136 and an ELR 30-10 138 are associated with the active link 112. The ELR 10-30 136 is intended to illustrate ELR from the node 110 to the node 130 and the ELR 30-10 138 is intended to illustrate ELR from the node 130 to the node 110. In an embodiment, the ETT of a link will vary greatly depending on how much traffic is inserted into it. The more traffic you insert into a link, the higher the probability for collisions on the link. Accordingly, the ELR 10-30 136 is calculated dynamically based on current load conditions of the active link 112 from the node 110 to the node 130, and the ELR 30-10 138 is calculated dynamically based on current load conditions of the active link 112 from the node 130 to the node 110. The calculated ELR may be averaged in an exponentially decaying fashion to allow route selection stabilization.
[0032] In the example of FIG. 1 , conceptually, the node 130 is trying to select the least cost link to some destination reachable through both the node 110 and the node 120. As shown in the system 100, the active link 112 has an ELR 10-30 136 and an ELR 30-10 138. The ELR 10-30 136 and the ELR 30-10 138 can be used to respectively calculate an effective data rate (EDR) 10-30 116 and an EDR 30-10 118.
[0033] EDR is the rate determined by a rate selection algorithm. In general, the rate selection algorithm should meet the following goals: 1) To the extent possible, the selected rate should produce optimal throughput of packets transmitted to a client. This is not necessarily the same thing as minimizing retries. For instance, retransmitting one time a large packet at 54 Mbps may result in better throughput than transmitting the same large packet at a 1 Mbps with no retries. 2) To the extent possible, the algorithm should be computationally light. That is, it should not consume a lot of CPU time to determine a rate to use.
[0034] An example of a rate selection algorithm is as follows (though any applicable known or convenient rate selection algorithm could be used): The rate selection algorithm seeks to minimize retransmissions. For each client it maintains a ‘best rate’ value. The rate selection algorithm is a control system that lowers the best rate when the rate of retransmissions exceeds 50% and raises the best rate when the rate of retransmissions is less than 50%. For each transmitted packet, there are one of three possible outcomes. 1) The packet is successfully transmitted with no retransmissions, 2) the packet is successfully transmitted with one or more retransmissions, 3) the packet transmission is unsuccessful after all retransmission attempts.
[0035] For each client, a counter is maintained. When a packet is successfully transmitted with no retransmissions, this counter is incremented by 3. When a packet is successfully transmitted but with retransmissions, the counter is decremented by 6. When a packet is not successfully transmitted, the counter is not changed. When the counter reached a value of −50, then the next lower rate is made the best rate. When the counter reaches a value of 100, the next higher rate is used as the best rate; however, the best rate is not increased if it has been increased in the past 60 seconds. This prevents the best rate from increasing too fast.
[0036] For each packet, transmissions are attempted using up to four rates.
-
- [0037] The best rate is tried 1 time. This is the initial transmission attempt, not a retransmission.
- [0038] The next best rate is tried for configured number of retransmissions minus 2. For example, the default value for the retry count is 5, and so by default the next best rate is tried 3 times.
- [0039] The next lower rate is tried 1 time.
- [0040] The lowest rate supported by the radio is tried 1 time.
[0041] This rate fall back schedule has the following properties. 1) If the best rate is successful, then there are no retries and the client's counter is increased. 2) If the best rate fails, then the next lower rate is used multiple times. The range of the next best rate is better than the best rate, and so the next best rate has a higher probability of success. The client's counter will be decremented in this case to reflect that the best rate was unsuccessful. 3) The radio's lowest rate has the best range, and so if it fails, then the client is not reachable or the failure is due to factors not related to distance. In this case, the client's counter is unchanged because the failure is not related to rate.
[0042] If the EDR is actually determined ELR, the algorithm further reduces the bandwidth required to compute ETTl, since the EDR need not be calculated through synthesized load. Notably, as shown in FIG. 1 , the EDR 20-30 126 uses the ELR 10-30 136, and the EDR 30-20 128 uses the ELR 30-10 138. Accordingly, for the candidate link 122 as well, a synthesized load is not used. Advantageously, in both cases, ELR is calculated based on existing traffic.
[0043] It should be noted that sensing all data rates is less efficient than using the techniques described herein. Advantageously, by using EDR, all possible rates need not be tested, making this technique more efficient. Moreover, selected rates may not be the rate actually selected by a radio transmission module. For example, if data rate selection does not yield an answer that matches an algorithm such as Kulkarni's, the actual ETTl will be different than the expected ETTl and the algorithm will make suboptimal decisions. So using EDR can lead to performance improvements as well.
[0044] In an embodiment, the ETTp calculation can be improved by considering the amount of time a packet spends being processed in intermediate nodes. This is the time it takes to receive a packet on some interface and queue it on its egress interface. This time is referred to as node transit time (NTT). Therefore, in a non-limiting embodiment, ETTp=ETTI+ETTp_nh +NTT, where ETTI is the link between a node and a next hop node, ETTp_nh is the ETTp advertised by the next hop node (e.g., the best advertised ETTp of potential next hop nodes), and NTT is the time a packet spends transiting a node. As was previously described, the ETT calculations include the time a packet spends in a queue waiting for a radio to become available. Conceptually, the NTT is the time a packet spends in a node waiting to be enqueued.
[0045] The techniques described herein work best when there are relatively few interesting destinations. Advantageously, this is exactly the case in most IP network environments. Most hosts are trying to communicate to their next hop IP router, which is typically eventually accessed over a wired network. Hence, the techniques described herein help answer the question “how do I get to the wired network?” Only a single destination need be evaluated and only a single value to ELR needs to be maintained.
[0046] FIG. 5 depicts an example of a wireless network system 500 that includes a plurality of untethered APs (UAPs). In the example of FIG. 5 , the system 500 includes a UAP 502, a UAP 504, a plurality of UAPs 506-1 to 506-N (referred to collectively as UAPs 506), and an AP 508. For illustrative purposes only, a path for wireless traffic from a station 510 to the AP 508 is depicted as a dashed line. Potential paths for wireless traffic from the station 510 to the AP 508 are depicted as dotted lines.
[0047] In the example of FIG. 5 , wireless traffic from the station 510 is directed to an AP with which the station 510 has associated. Typically, though not always, the AP with which the station associates is the one that is closest to the station 510 (or the one that detects the highest RSSI from the station 510). In the example of FIG. 5 , the closest station is presumed to be the UAP 502.
[0048] In the example of FIG. 5 , presumably, at some stage it was determined that the best path from the station 510 to the AP 508 was from the USP 502 to the UAP 504 and finally to the AP 508. However, the system 500 continuously or occasionally measures ETT for various nodes, as was described above. Thus, it may be determined that a different path (through one of the UAPs 506) is better. It should be noted that, depending upon the implementation and/or embodiment, a tethered AP could be rejected as a next hop in favor of a UAP, followed by an eventual hop to some other AP. This would be the case if ETTp from the UAP was better than the ETTp directly to the tethered AP. Presumably, this would be unusual, but not impossible.
[0049] At the UAP 502, the goal is to send traffic to the least expensive AP that is wired to a network. By least expensive, what is intended is that a weighted graph with edges that are ETT between nodes, would yield the smallest result possible (or practical). This AP may or may not be the AP closest to the UAP 502. The UAP 502, for illustrative purposes, is illustrated as a large circle with various components. However, the UAP 504, the UAPs 506, and/or the AP 508 may have similar components (not shown).
[0050] In the example of FIG. 5 , the UAP 502 includes an ingress interface 512, an ETTp engine 514, a next hop selector 516, and an egress interface 518. The ETTp engine 514 includes an ETTp_nh module 520, an NTT module 522, and an ETTl module 524. In operation, in a non-limiting embodiment, the UAP 504 and the UAPs 506 have broadcast advertised ETTp values that are associated with the path from the respective nodes to a destination, such as the wired network. The ETTp_nh module 520 receives each of the advertised ETTps.
[0051] Some time later (or concurrently) the station 510 sends packets to the UAP 502, which are received at the ingress interface 512. The NTT module 522 receives an indication, such as a first timestamp, that a first packet has been received. As much as is practical, it would probably be valuable to have the timestamp represent the exact time the first packet was received at the ingress queue 512, though an estimate may be used. At this point, the ETTp engine 514 knows only ETTp values for the UAP 504 and UAPs 506, but has no link information. It should be noted that in practice there will typically be link information as described later. Nevertheless, assuming for a moment that no link information is available, the ETTp engine 514 can provide the advertised ETTp values to the next hop selector 516, which picks an appropriate optimal path to the destination based on the advertised ETTp values. Specifically, the next hop selector 516 chooses the shortest (e.g., lowest weight) path to the destination.
[0052] The first packet is enqueued at the egress interface 518, as appropriate. It may be noted that the first packet may or may not need to be enqueued in a case where the relevant link is underutilized (or saturated but not congested). In any case, when the first packet is received at the egress interface 518, the NTT module 522 receives an indication, such as a second timestamp, that the first packet has been received at the egress interface 518. At this point, the NTT module 522, by comparing, for example, a first timestamp and a second timestamp, can calculate the amount of time that the first packet spent at the UAP 502. This information is useful for purposes that are described below.
[0053] The first packet is sent from the egress interface 518 to the UAP 504. For illustrative purposes, it is assumed that the UAP 504 is the next hop in an optimal path. In a non-limiting embodiment, the UAP 504 sends an acknowledgement, as soon as the first packet is received, that the first packet was received. The acknowledgement is received at an acknowledgement interface 526. It should be noted that the acknowledgement interface 526 may be part of a radio interface that includes the ingress interface 512 (or even the egress interface 518). In any case, the acknowledgement interface 526 provides the ETTl module 524 with an indication, such as a timestamp, that an acknowledgement was received from the next hop node. The ETTl module 524 uses the indication (e.g., second timestamp) that was generated when the first packet was enqueued on the egress interface 518 and the indication (e.g., third timestamp) that was generated upon receipt of the acknowledgement to provide an ETTl value.
[0054] At this point, the ETTp engine 514 has enough information to know ETTp from the UAP 502 to the destination. Specifically, ETTl+NTT+ETTp_nh=ETTp from the UAP 502 to the destination. This ETTp value can be provided to an ETTp broadcast engine 528. In the example of FIG. 5 , the broadcast engine 528 is not providing any value to the station 510 (unless the station 510 includes a means for making use of the broadcast ETTp). However, the UAP 504, for example, may have a broadcast engine that functions similarly. Such an engine could be used to provide the advertised ETTp to the ETTp_nh module 520, as described previously.
[0055] FIG. 6 depicts a flowchart 600 of an example of a method for selecting a next hop. In the example of FIG. 6 , the flowchart 600 starts at module 602 where ETTp is received from nodes that are within range. In an embodiment, the node at which a next hop is being selected listens for any node within range. In an alternative, the potential next hop nodes may be restricted in some manner.
[0056] In the example of FIG. 6 , the flowchart 600 continues to module 604 where ETTl is measured to each node within range. Since the ETTl is an actual measurement (rather than a guess), the ETTl is a relatively accurate representation of actual link characteristics. Any applicable known or convenient technique may be used to measure ETTl. An example of a method for measuring ETTl to a node is described later with reference to FIG. 7 .
[0057] In the example of FIG. 6 , the flowchart 600 continues to module 606 where ETTl is added to ETTp from each node to arrive at a node-specific path metric, and to module 608 where a next hop is selected that is associated with a minimum of the node-specific path metrics. Notably, the lowest ETTp plus a corresponding ETTl is not necessarily lower than some other ETTp plus a corresponding ETTl.
[0058] FIG. 7 depicts a flowchart 700 of an example of a method for measuring ETTl to a node. In the example of FIG. 7 , the flowchart 700 starts at module 702 where a packet is placed on an egress queue. Packets are placed on egress queues when they are ready to be transmitted to a next hop or destination.
[0059] In the example of FIG. 7 , the flowchart 700 continues to modules 704 where a first timestamp is taken. The first timestamp represents the approximate time at which the packet was placed on the egress queue. The packets may be left on an egress queue for a relatively long time if they are enqueued at a faster rate than they are dequeued (and transmitted). Typically, if a packet remains in the egress queue for a relatively long period of time, a link between the current queue and the next hop or destination is congested.
[0060] In the example of FIG. 7 , the flowchart 700 continues to module 706 where an acknowledgement is received that the packet was transmitted. The acknowledgement may be in the form of, by way of example but not limitation, an 802.11 ack. Other protocols may have other techniques or terminologies, but any applicable known or convenient means for acknowledging that the packet was received may be used, depending upon the implementation and/or embodiment.
[0061] In the example of FIG. 7 , the flowchart 700 continues to module 708 where a second timestamp is taken. The second timestamp represents the approximate time at which the packet that was placed on the egress queue, plus the time to reach the next hop, plus the time to receive the acknowledgement (which is normally sent immediately upon receipt of the packet). Alternatively, the second timestamp could be placed in the acknowledgement such that the time to receive the acknowledgement is omitted.
[0062] In the example of FIG. 7 , the flowchart 700 continues to module 710 where a difference between the first timestamp and the second timestamp is found. In a non-limiting embodiment, this entails calculating an exponentially decaying average of the difference. In any case, the value found may be used as an ETTl.
[0063] FIG. 8 depicts a flowchart 800 of an example of a method for advertising an ETTp. In the example of FIG. 8 , the flowchart 800 starts at module 802 where an advertised ETTp is calculated. ETTp is calculated by selecting an advertised ETTp from some other node and adding local NTT. NTT may be, by way of example but not limitation, an exponentially weighted average of the time it takes to transmit a packet from an ingress to an egress queue in a node. An example of a method for calculating NTT is described later with reference to FIG. 9 .
[0064] In the example of FIG. 8 , the flowchart 800 continues to module 804 where the advertised ETTp is broadcast. In an alternative embodiment, the ETTp may be multicast to a subset of nodes within broadcast range. Any nodes within range may use the advertised ETTp when selecting a next hop, if applicable.
[0065] FIG. 9 depicts a flowchart 900 of an example of a method for calculating NTT. In the example of FIG. 9 , the flowchart 900 starts at module 902 with receiving a packet on an ingress interface. The packet may be received from a wireless station, such as a mobile device or UAP.
[0066] In the example of FIG. 9 , the flowchart 900 continues to module 904 where a first timestamp is taken. The first timestamp represents the point in time when the packet is first received at the node.
[0067] In the example of FIG. 9 , the flowchart 900 continues to module 906 where the packet is forwarded to an appropriate egress interface. Techniques for forwarding packets to egress interfaces are well known in the relevant art, and are not described herein. It is assumed that some applicable known or convenient technique is used.
[0068] In the example of FIG. 9 , the flowchart 900 continues to module 908 where a second timestamp is taken. The second timestamp represents the point in time when the packet has been enqueued for sending to a next hop or destination.
[0069] In the example of FIG. 9 , the flowchart 900 continues to module 910 where a difference between the first timestamp and the second timestamp is found. In a non-limiting embodiment, an exponentially decaying average is used. In an y case, the derived value may be used as the local NTT.
[0070] As used herein, access point (AP) refers to receiving points for any known or convenient wireless access technology. Specifically, the term AP is not intended to be limited to 802.11 APs.
[0071] Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
[0072] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
[0073] The algorithms and techniques described herein also relate to apparatus for performing the algorithms and techniques. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
[0074] As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation.
[0075] It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present invention. It is intended that all permutations, enhancements, equivalents, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present invention. It is therefore intended that the following appended claims include all such modifications, permutations and equivalents as fall within the true spirit and scope of the present invention.
Claims
What is claimed is:
1. A method comprising:
receiving, at a current wireless node, an estimated transmission time (ETT) from each of a plurality of other wireless nodes that are within a range of the current wireless node, wherein each said ETT is a next-hop-to-destination-path ETT (ETTp) associated with one of said other wireless nodes, wherein each said ETTp is a function of a link ETT (ETTI), another ETTp and a node transition time (NTT) of one of said other wireless nodes;
at the current wireless node, measuring for each of said other wireless nodes an ETTI between the current wireless node and a corresponding one of said other wireless nodes;
at the current wireless node, adding for each of said other wireless nodes an ETTI to a corresponding ETTp to determine a node-specific path metric for a corresponding one of said other wireless nodes;
at the current wireless node, selecting a next hop based on the determined node-specific path metrics;
at the current wireless node, calculating an advertised ETTp for the current wireless node, based on at least one of the measured ETTI's, a corresponding at least one of the received ETTp's and a calculated NTT for the current wireless node; and
broadcasting the advertised ETTp from the current wireless node to a second wireless node.
2. The method of claim 1, wherein measuring an ETTI comprises:
placing a packet on an egress queue;
taking a first timestamp;
receiving acknowledgement that the packet was transmitted;
taking a second timestamp;
finding the difference between the first timestamp and the second timestamp.
3. The method of claim 2, wherein finding the difference between the first timestamp and the second timestamp includes taking an exponentially decaying average.
4. The method of claim 1, wherein the calculating the advertised ETTp comprises:
receiving a packet on an ingress interface;
taking a first timestamp;
forwarding the packet to an appropriate egress interface;
taking a second timestamp;
finding the difference between the first timestamp and the second timestamp.
5. The method of claim 4, wherein finding the difference between the first timestamp and the second timestamp includes taking an exponentially decaying average.
Patent Citations (270)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3641433(A) | 1972-02-01 | Mifflin et al. | Applicant |
| US4168400(A) | 1979-09-01 | De Couasnon et al. | Applicant |
| US4176316(A) | 1979-11-01 | DeRoas et al. | Applicant |
| US4247908(A) | 1981-01-01 | Lockart et al. | Applicant |
| US4291401(A) | 1981-09-01 | Bachmann | Applicant |
| US4291409(A) | 1981-09-01 | Weinberg et al. | Applicant |
| US4409470(A) | 1983-10-01 | Shepard et al. | Applicant |
| US4460120(A) | 1984-07-01 | Shepard et al. | Applicant |
| US4475208(A) | 1984-10-01 | Ricketts | Applicant |
| US4494238(A) | 1985-01-01 | Groth, Jr. | Applicant |
| US4500987(A) | 1985-02-01 | Hasegawa | Applicant |
| US4503533(A) | 1985-03-01 | Tobagi et al. | Applicant |
| US4550414(A) | 1985-10-01 | Guinon et al. | Applicant |
| US4562415(A) | 1985-12-01 | McBiles | Applicant |
| US4630264(A) | 1986-12-01 | Wah et al. | Applicant |
| US4635221(A) | 1987-01-01 | Kerr | Applicant |
| US4639914(A) | 1987-01-01 | Winters | Applicant |
| US4644523(A) | 1987-02-01 | Horwitz | Applicant |
| US4672658(A) | 1987-06-01 | Kavehrad | Applicant |
| US4673805(A) | 1987-06-01 | Shepard et al. | Applicant |
| US4707839(A) | 1987-11-01 | Andren et al. | Applicant |
| US4730340(A) | 1988-03-01 | Frazier | Applicant |
| US4736095(A) | 1988-04-01 | Shepard et al. | Applicant |
| US4740792(A) | 1988-04-01 | Sagey et al. | Applicant |
| US4758717(A) | 1988-07-01 | Shepard et al. | Applicant |
| US4760586(A) | 1988-07-01 | Takeda | Applicant |
| US4789983(A) | 1988-12-01 | Acampora et al. | Applicant |
| US4829540(A) | 1989-05-01 | Waggener et al. | Applicant |
| US4850009(A) | 1989-07-01 | Zook et al. | Applicant |
| US4872182(A) | 1989-10-01 | McRae et al. | Applicant |
| US4894842(A) | 1990-01-01 | Brockhaven et al. | Applicant |
| US4901307(A) | 1990-02-01 | Gilhousen et al. | Applicant |
| US4933952(A) | 1990-06-01 | Albrieux et al. | Applicant |
| US4933953(A) | 1990-06-01 | Yagi | Applicant |
| US4995053(A) | 1991-02-01 | Simpson et al. | Applicant |
| US5008899(A) | 1991-04-01 | Yamamoto | Applicant |
| US5029183(A) | 1991-07-01 | Tymes | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5103461(A) | 1992-04-01 | Tymes | Applicant |
| US5109390(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5142550(A) | 1992-08-01 | Tymes | Applicant |
| US5151919(A) | 1992-09-01 | Dent | Applicant |
| US5157687(A) | 1992-10-01 | Tymes | Applicant |
| US5187675(A) | 1993-02-01 | Dent et al. | Applicant |
| US5231633(A) | 1993-07-01 | Hluchyj et al. | Applicant |
| US5280498(A) | 1994-01-01 | Tymes et al. | Applicant |
| US5285494(A) | 1994-02-01 | Sprecher et al. | Applicant |
| US5329531(A) | 1994-07-01 | Diepstraten | Applicant |
| US5339316(A) | 1994-08-01 | Diepstraten | Applicant |
| US5371783(A) | 1994-12-01 | Rose et al. | Applicant |
| US5418812(A) | 1995-05-01 | Reyes et al. | Applicant |
| US5448569(A) | 1995-09-01 | Huang et al. | Applicant |
| US5450615(A) | 1995-09-01 | Fortune et al. | Applicant |
| US5465401(A) | 1995-11-01 | Thompson | Applicant |
| US5479441(A) | 1995-12-01 | Tymes et al. | Applicant |
| US5483676(A) | 1996-01-01 | Mahany et al. | Applicant |
| US5491644(A) | 1996-02-01 | Pickering et al. | Applicant |
| US5517495(A) | 1996-05-01 | Lund | Applicant |
| US5519762(A) | 1996-05-01 | Bartlett | Applicant |
| US5528621(A) | 1996-06-01 | Heiman et al. | Applicant |
| US5561841(A) | 1996-10-01 | Markus | Applicant |
| US5568513(A) | 1996-10-01 | Croft et al. | Applicant |
| US5584048(A) | 1996-12-01 | Wieczorek | Applicant |
| US5598532(A) | 1997-01-01 | Liron | Applicant |
| US5630207(A) | 1997-05-01 | Gitlin et al. | Applicant |
| US5640414(A) | 1997-06-01 | Blakeney et al. | Applicant |
| US5649289(A) | 1997-07-01 | Wang et al. | Applicant |
| US5668803(A) | 1997-09-01 | Tymes et al. | Applicant |
| US5715304(A) | 1998-02-01 | Nishida et al. | Examiner |
| US5774460(A) | 1998-06-01 | Schiffel et al. | Applicant |
| US5793303(A) | 1998-08-01 | Koga | Applicant |
| US5794128(A) | 1998-08-01 | Brockel et al. | Applicant |
| US5812589(A) | 1998-09-01 | Sealander et al. | Applicant |
| US5815811(A) | 1998-09-01 | Pinard et al. | Applicant |
| US5828960(A) | 1998-10-01 | Tang et al. | Applicant |
| US5838907(A) | 1998-11-01 | Hansen | Applicant |
| US5844900(A) | 1998-12-01 | Hong et al. | Applicant |
| US5875179(A) | 1999-02-01 | Tikalsky | Applicant |
| US5887259(A) | 1999-03-01 | Zicker et al. | Applicant |
| US5896561(A) | 1999-04-01 | Schrader et al. | Applicant |
| US5915214(A) | 1999-06-01 | Reece et al. | Applicant |
| US5920821(A) | 1999-07-01 | Seazholtz et al. | Applicant |
| US5933607(A) | 1999-08-01 | Tate et al. | Applicant |
| US5949988(A) | 1999-09-01 | Feisullin et al. | Applicant |
| US5953669(A) | 1999-09-01 | Stratis et al. | Applicant |
| US5960335(A) | 1999-09-01 | Umemoto et al. | Applicant |
| US5982779(A) | 1999-11-01 | Krishnakumar et al. | Applicant |
| US5987062(A) | 1999-11-01 | Engwer et al. | Applicant |
| US5987328(A) | 1999-11-01 | Ephremides et al. | Applicant |
| US5999813(A) | 1999-12-01 | Lu et al. | Examiner |
| US6005853(A) | 1999-12-01 | Wang et al. | Applicant |
| US6011784(A) | 2000-01-01 | Brown | Applicant |
| US6041240(A) | 2000-03-01 | McCarthy et al. | Applicant |
| US6078568(A) | 2000-06-01 | Wright | Applicant |
| US6088591(A) | 2000-07-01 | Trompower | Applicant |
| US6101539(A) | 2000-08-01 | Kennelly et al. | Applicant |
| US6118771(A) | 2000-09-01 | Tajika et al. | Applicant |
| US6119009(A) | 2000-09-01 | Baranger et al. | Applicant |
| US6160804(A) | 2000-12-01 | Ahmed et al. | Applicant |
| US6188694(B1) | 2001-02-01 | Fine et al. | Applicant |
| US6199032(B1) | 2001-03-01 | Anderson | Applicant |
| US6208629(B1) | 2001-03-01 | Jaszewki et al. | Applicant |
| US6208841(B1) | 2001-03-01 | Wallace et al. | Applicant |
| US6212395(B1) | 2001-04-01 | Lu et al. | Examiner |
| US6218930(B1) | 2001-04-01 | Katzenberg et al. | Applicant |
| US6240078(B1) | 2001-05-01 | Kuhnel et al. | Applicant |
| US6240083(B1) | 2001-05-01 | Wright | Applicant |
| US6256300(B1) | 2001-07-01 | Ahmed et al. | Applicant |
| US6256334(B1) | 2001-07-01 | Adachi | Applicant |
| US6262988(B1) | 2001-07-01 | Vig | Applicant |
| US6285662(B1) | 2001-09-01 | Watannabe | Applicant |
| US6304596(B1) | 2001-10-01 | Yamano et al. | Applicant |
| US6317599(B1) | 2001-11-01 | Rappaport et al. | Applicant |
| US6336035(B1) | 2002-01-01 | Somoza et al. | Applicant |
| US6336152(B1) | 2002-01-01 | Richman et al. | Applicant |
| US6347091(B1) | 2002-02-01 | Wallentin et al. | Applicant |
| US6356758(B1) | 2002-03-01 | Almeida et al. | Applicant |
| US6393290(B1) | 2002-05-01 | Ulfongene | Applicant |
| US6404772(B1) | 2002-06-01 | Beach et al. | Applicant |
| US6473449(B1) | 2002-10-01 | Cafarella et al. | Applicant |
| US6493679(B1) | 2002-12-01 | Rappaport et al. | Applicant |
| US6496290(B1) | 2002-12-01 | Lee | Applicant |
| US6512916(B1) | 2003-01-01 | Forbes, Jr. | Applicant |
| US6535732(B1) | 2003-03-01 | McIntosh et al. | Examiner |
| US6580700(B1) | 2003-06-01 | Pinard et al. | Applicant |
| US6587680(B1) | 2003-07-01 | Ata-Laurila et al. | Applicant |
| US6614787(B1) | 2003-09-01 | Jain et al. | Applicant |
| US6624762(B1) | 2003-09-01 | End, III | Applicant |
| US6625454(B1) | 2003-09-01 | Rappaport et al. | Applicant |
| US6631267(B1) | 2003-10-01 | Clarkson | Applicant |
| US6659947(B1) | 2003-12-01 | Carter | Applicant |
| US6661787(B1) | 2003-12-01 | O'Connell | Applicant |
| US6687498(B2) | 2004-02-01 | McKenna et al. | Applicant |
| US6697415(B1) | 2004-02-01 | Mahany | Applicant |
| US6725260(B1) | 2004-04-01 | Philyaw | Applicant |
| US6747961(B1) | 2004-06-01 | Ahmed et al. | Applicant |
| US6760324(B1) | 2004-07-01 | Scott et al. | Applicant |
| US6785275(B1) | 2004-08-01 | Boivie et al. | Applicant |
| US6839338(B1) | 2005-01-01 | Amara et al. | Applicant |
| US6839348(B2) | 2005-01-01 | Tang et al. | Applicant |
| US6879812(B2) | 2005-04-01 | Agrawal | Applicant |
| US6957067(B1) | 2005-10-01 | Iyer et al. | Applicant |
| US6973622(B1) | 2005-12-01 | Rappaport et al. | Applicant |
| US6978301(B2) | 2005-12-01 | Tindal | Applicant |
| US6996630(B1) | 2006-02-01 | Masaki et al. | Examiner |
| US7020438(B2) | 2006-03-01 | Sinivaara et al. | Applicant |
| US7020773(B1) | 2006-03-01 | Otway et al. | Applicant |
| US7024199(B1) | 2006-04-01 | Massie et al. | Examiner |
| US7024394(B1) | 2006-04-01 | Ashour et al. | Applicant |
| US7027773(B1) | 2006-04-01 | McMillin | Examiner |
| US7062566(B2) | 2006-06-01 | Amara et al. | Applicant |
| US7068999(B2) | 2006-06-01 | Ballai | Applicant |
| US7089322(B1) | 2006-08-01 | Stallmann | Examiner |
| US7110756(B2) | 2006-09-01 | Diener | Applicant |
| US7116979(B2) | 2006-10-01 | Backes et al. | Applicant |
| US7146166(B2) | 2006-12-01 | Backes et al. | Applicant |
| US7155518(B2) | 2006-12-01 | Forslow | Applicant |
| US7221927(B2) | 2007-05-01 | Kolar et al. | Applicant |
| US7224970(B2) | 2007-05-01 | Smith et al. | Applicant |
| US7263366(B2) | 2007-08-01 | Miyashita | Applicant |
| US7280495(B1) | 2007-10-01 | Zweig et al. | Applicant |
| US7317914(B2) | 2008-01-01 | Adya et al. | Applicant |
| US7324468(B2) | 2008-01-01 | Fischer | Applicant |
| US7324487(B2) | 2008-01-01 | Saito | Applicant |
| US7359676(B2) | 2008-04-01 | Hrastar | Applicant |
| US7370362(B2) | 2008-05-01 | Olson et al. | Applicant |
| US7376080(B1) | 2008-05-01 | Riddle et al. | Applicant |
| US7421248(B1) | 2008-09-01 | Laux et al. | Applicant |
| US7466678(B2) | 2008-12-01 | Cromer et al. | Applicant |
| US7489648(B2) | 2009-02-01 | Griswold | Applicant |
| US7509096(B2) | 2009-03-01 | Palm et al. | Applicant |
| US7529925(B2) | 2009-05-01 | Harkins | Applicant |
| US7551619(B2) | 2009-06-01 | Tiwari | Applicant |
| US7570656(B2) | 2009-08-01 | Raphaeli et al. | Applicant |
| US7573859(B2) | 2009-08-01 | Taylor | Applicant |
| US7577453(B2) | 2009-08-01 | Matta | Applicant |
| US7724704(B2) | 2010-05-01 | Simons et al. | Applicant |
| US2001/0024953(A1) | 2001-09-01 | Balogh | Applicant |
| US2002/0052205(A1) | 2002-05-01 | Belostofsky et al. | Applicant |
| US2002/0060995(A1) | 2002-05-01 | Cervello et al. | Applicant |
| US2002/0069278(A1) | 2002-06-01 | Forslow | Applicant |
| US2002/0095486(A1) | 2002-07-01 | Bahl | Applicant |
| US2002/0101868(A1) | 2002-08-01 | Clear et al. | Applicant |
| US2002/0176437(A1) | 2002-11-01 | Busch et al. | Applicant |
| US2002/0191572(A1) | 2002-12-01 | Weinstein et al. | Applicant |
| US2003/0014646(A1) | 2003-01-01 | Buddhikot et al. | Applicant |
| US2003/0018889(A1) | 2003-01-01 | Burnett et al. | Applicant |
| US2003/0055959(A1) | 2003-03-01 | Sato | Applicant |
| US2003/0107590(A1) | 2003-06-01 | Levillain et al. | Applicant |
| US2003/0134642(A1) | 2003-07-01 | Kostic et al. | Applicant |
| US2003/0135762(A1) | 2003-07-01 | Macaulay | Applicant |
| US2003/0174706(A1) | 2003-09-01 | Shankar et al. | Applicant |
| US2003/0227934(A1) | 2003-12-01 | White et al. | Applicant |
| US2004/0003285(A1) | 2004-01-01 | Whelan et al. | Applicant |
| US2004/0019857(A1) | 2004-01-01 | Teig et al. | Applicant |
| US2004/0025044(A1) | 2004-02-01 | Day | Applicant |
| US2004/0047320(A1) | 2004-03-01 | Eglin | Applicant |
| US2004/0053632(A1) | 2004-03-01 | Nikkelen et al. | Applicant |
| US2004/0062267(A1) | 2004-04-01 | Minami et al. | Applicant |
| US2004/0064560(A1) | 2004-04-01 | Zhang et al. | Applicant |
| US2004/0068668(A1) | 2004-04-01 | Lor et al. | Applicant |
| US2004/0095914(A1) | 2004-05-01 | Katsube et al. | Applicant |
| US2004/0095932(A1) | 2004-05-01 | Astarabadi et al. | Applicant |
| US2004/0120370(A1) | 2004-06-01 | Lupo | Applicant |
| US2004/0143428(A1) | 2004-07-01 | Rappaport et al. | Applicant |
| US2004/0165545(A1) | 2004-08-01 | Cook | Applicant |
| US2004/0208570(A1) | 2004-10-01 | Reader | Applicant |
| US2004/0221042(A1) | 2004-11-01 | Meier | Applicant |
| US2004/0230370(A1) | 2004-11-01 | Tzamaloukas | Applicant |
| US2004/0236702(A1) | 2004-11-01 | Fink et al. | Applicant |
| US2004/0255167(A1) | 2004-12-01 | Knight | Applicant |
| US2004/0259555(A1) | 2004-12-01 | Rappaport et al. | Applicant |
| US2005/0030929(A1) | 2005-02-01 | Swier et al. | Applicant |
| US2005/0037818(A1) | 2005-02-01 | Seshadri et al. | Applicant |
| US2005/0054326(A1) | 2005-03-01 | Rogers | Applicant |
| US2005/0058132(A1) | 2005-03-01 | Okano et al. | Applicant |
| US2005/0059405(A1) | 2005-03-01 | Thomson | Applicant |
| US2005/0059406(A1) | 2005-03-01 | Thomson et al. | Applicant |
| US2005/0064873(A1) | 2005-03-01 | Karaoguz et al. | Applicant |
| US2005/0068925(A1) | 2005-03-01 | Palm | Applicant |
| US2005/0073980(A1) | 2005-04-01 | Thomson et al. | Applicant |
| US2005/0097618(A1) | 2005-05-01 | Arling et al. | Applicant |
| US2005/0122977(A1) | 2005-06-01 | Lieberman | Applicant |
| US2005/0128989(A1) | 2005-06-01 | Bhagwat et al. | Applicant |
| US2005/0157730(A1) | 2005-07-01 | Grant et al. | Applicant |
| US2005/0180358(A1) | 2005-08-01 | Kolar et al. | Applicant |
| US2005/0181805(A1) | 2005-08-01 | Gallagher | Applicant |
| US2005/0193103(A1) | 2005-09-01 | Drabik | Applicant |
| US2005/0223111(A1) | 2005-10-01 | Bhandaru et al. | Applicant |
| US2005/0239461(A1) | 2005-10-01 | Verma et al. | Applicant |
| US2005/0240665(A1) | 2005-10-01 | Gu et al. | Applicant |
| US2005/0245269(A1) | 2005-11-01 | Demirhan et al. | Applicant |
| US2005/0259597(A1) | 2005-11-01 | Benedetotto et al. | Applicant |
| US2005/0276218(A1) | 2005-12-01 | Ooghe et al. | Applicant |
| US2006/0045050(A1) | 2006-03-01 | Floros et al. | Applicant |
| US2006/0104224(A1) | 2006-05-01 | Singh et al. | Applicant |
| US2006/0128415(A1) | 2006-06-01 | Horikoshi et al. | Applicant |
| US2006/0161983(A1) | 2006-07-01 | Cothrell et al. | Applicant |
| US2006/0174336(A1) | 2006-08-01 | Chen | Applicant |
| US2006/0189311(A1) | 2006-08-01 | Cromer et al. | Applicant |
| US2006/0200862(A1) | 2006-09-01 | Olson et al. | Applicant |
| US2006/0245393(A1) | 2006-11-01 | Bajic | Applicant |
| US2006/0248331(A1) | 2006-11-01 | Harkins | Applicant |
| US2006/0276192(A1) | 2006-12-01 | Dutta et al. | Applicant |
| US2007/0025265(A1) | 2007-02-01 | Porras et al. | Applicant |
| US2007/0064718(A1) | 2007-03-01 | Ekl et al. | Applicant |
| US2007/0070937(A1) | 2007-03-01 | Demirhan et al. | Applicant |
| US2007/0083924(A1) | 2007-04-01 | Lu | Applicant |
| US2007/0086378(A1) | 2007-04-01 | Matta et al. | Applicant |
| US2007/0091889(A1) | 2007-04-01 | Xiao et al. | Applicant |
| US2007/0189222(A1) | 2007-08-01 | Kolar et al. | Applicant |
| US2007/0260720(A1) | 2007-11-01 | Morain | Applicant |
| US2008/0002588(A1) | 2008-01-01 | McCaughan et al. | Examiner |
| US2008/0008117(A1) | 2008-01-01 | Alizadeh-Shabdiz | Applicant |
| US2008/0013481(A1) | 2008-01-01 | Simons et al. | Applicant |
| US2008/0056200(A1) | 2008-03-01 | Johnson | Applicant |
| US2008/0056211(A1) | 2008-03-01 | Kim et al. | Applicant |
| US2008/0096575(A1) | 2008-04-01 | Aragon et al. | Applicant |
| US2008/0107077(A1) | 2008-05-01 | Murphy | Applicant |
| US2008/0114784(A1) | 2008-05-01 | Murphy | Applicant |
| US2008/0117822(A1) | 2008-05-01 | Murphy et al. | Applicant |
| US2008/0151844(A1) | 2008-06-01 | Tiwari | Applicant |
| US2008/0162921(A1) | 2008-07-01 | Chesnutt et al. | Applicant |
| US2009/0031044(A1) | 2009-01-01 | Barrack et al. | Applicant |
| US2009/0198999(A1) | 2009-08-01 | Harkins | Applicant |
| WO94/03986 | 1994-02-01 | Applicant | |
| WO99/11003 | 1999-03-01 | Applicant | |
| WO3/085544(A1) | 2003-10-01 | Applicant | |
| WO2004/095192(A2) | 2004-11-01 | Applicant | |
| WO2004/095800(A1) | 2004-11-01 | Applicant |
Non-Patent Literature (115)
- Co-pending U.S. Appl. No. 10/778,901, filed Feb. 13, 2004.Applicant
- Co-pending U.S. Appl. No. 11/784,307, filed Apr. 5, 2007.Applicant
- Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
- Co-pending U.S. Appl. No. 12/401,073, filed Mar. 10, 2009.Applicant
- Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.Applicant
- Co-pending U.S. Appl. No. 12/500,392, filed Jul. 9, 2009.Applicant
- Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
- Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
- Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
- Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.Applicant
- Co-pending U.S. Appl. No. 12/491,201, filed Jun. 24, 2009.Applicant
- Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.Applicant
- Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.Applicant
- Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.Applicant
- Co-pending U.S. Appl. No. 12/603,391, filed Oct. 21, 2009.Applicant
- Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.Applicant
- Co-pending U.S. Appl. No. 12/489,295, filed Jun. 22, 2009.Applicant
- Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.Applicant
- Co-pending U.S. Appl. No. 11/643,329, filed Dec. 20, 2006.Applicant
- Co-pending U.S. Appl. No. 11/975,134, filed Oct. 16, 2007.Applicant
- Co-pending U.S. Appl. No. 11/966,912, filed Dec. 28, 2007.Applicant
- Co-pending U.S. Appl. No. 12/131,028, filed May 3, 2008.Applicant
- Co-pending U.S. Appl. No. 12/336,492, filed Dec. 16, 2008.Applicant
- Notice of Allowance Mailed Feb. 26, 2007 in Co-pending U.S. Appl. No. 10/778,901, filed Feb. 13, 2004.Applicant
- Non-Final Office Action Mailed Sep. 22, 2009 in Co-pending U.S. Appl. No. 11/784,307, filed Apr. 5, 2007.Applicant
- Notice of Allowance Mailed Feb. 27, 2009 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
- Final Office action Mailed Aug. 27, 2008 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
- Non-Final Office Action Mailed Jan. 8, 2008 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
- Notice of Allowance Mailed Jun. 11, 2009 in Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.Applicant
- Non-Final Office Action Mailed Nov. 10, 2008 in Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.Applicant
- Non-Final Office Action Mailed Aug. 6, 2009 in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
- Final Office Action Mailed Mar. 13, 2009 in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
- Non-Final Office Action Mailed Sep. 11, 2008 in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
- Non-Final Office Action Mailed Dec. 2, 2009 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
- Final Office Action Mailed Jun. 10, 2009 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
- Non-Final Office Action Mailed Oct. 28, 2008 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
- Notice of Allowance Mailed Feb. 23, 2010 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
- Non-Final Office Action Mailed Aug. 5, 2009 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
- Final Office Action Mailed Oct. 23, 2008 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
- Non-Final Office Action Mailed Jun. 13, 2008 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
- Notice of Allowance Mailed Jun. 16, 2009 in Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.Applicant
- Non-Final Office Action Mailed Feb. 17, 2009 in Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.Applicant
- Final Office Action Mailed May 28, 2009 in Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.Applicant
- Non-Final Office Action Mailed Nov. 14, 2008 in Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.Applicant
- Notice of Allowance Mailed Apr. 23, 2009 in Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.Applicant
- Non-Final Mailed Aug. 19, 2008 in Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.Applicant
- Final Office Action Mailed Jul. 20, 2009 in Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.Applicant
- Non-Final Office Action Mailed Jan. 14, 2009 in Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.Applicant
- Final Office Action Mailed Jan. 5, 2010 in Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.Applicant
- Non-Final Office Action Mailed Jul. 21, 2009 in Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.Applicant
- Non-Final Office Action Mailed Aug. 7, 2009 in Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.Applicant
- Notice of Allowance Mailed Mar. 19, 2010, in Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.Applicant
- International Search Report PCT/US05/004702 dated Aug. 10, 2006, pp. 1-3.Applicant
- Written Opinion PCT/US05/004702 dated Aug. 10, 2006, pp. 1-5.Applicant
- International Search Report PCT/US06/09525 dated Sep. 13, 2007, pp. 1-2.Applicant
- Written Opinion PCT/US06/09525, dated Sep. 13, 2007, pp. 1-7.Applicant
- International Search Report PCT/US06/40498 dated Dec. 28, 2007, pp. 1-2.Applicant
- Written Opinion PCT/US06/40498 dated Dec. 28, 2007, pp. 1-5.Applicant
- International Search Report PCT/US07/14847 dated Apr. 1, 2008, pp. 1-4.Applicant
- Written Opinion PCT/US07/14847 dated Apr. 1, 2008, pp. 1-4.Applicant
- International Search Report PCT/US07/089134 dated Apr. 10, 2008, pp. 1-3.Applicant
- Written Opinion PCT/US07/089134 dated Apr. 10, 2008, pp. 10-4.Applicant
- U.S. Appl. No. 11/326,966, filed Jan. 2006, Taylor.Applicant
- U.S. Appl. No. 11/330,877, filed Jan. 2006, Matta.Applicant
- U.S. Appl. No. 11/331,789, filed Jan. 2006, Matta, et al.Applicant
- U.S. Appl. No. 11/351,104, filed Feb. 2006, Tiwari.Applicant
- U.S. Appl. No. 11/377,859, filed Mar. 2006, Harkins.Applicant
- U.S. Appl. No. 11/400,165, filed Apr. 2006, Tiwari.Applicant
- U.S. Appl. No. 11/445,750, filed May 2006, Matta.Applicant
- U.S. Appl. No. 11/417,830, filed May 2006, Morain.Applicant
- U.S. Appl. No. 11/417,993, filed May 2006, Jar et al.Applicant
- U.S. Appl. No. 11/437,537, filed May 2006, Freund et al.Applicant
- U.S. Appl. No. 11/437,538, filed May 2006, Zeldin.Applicant
- U.S. Appl. No. 11/437,387, filed May 2006, Zeldin et al.Applicant
- U.S. Appl. No. 11/437,582, filed May 2006, Bugwadia et al.Applicant
- U.S. Appl. No. 11/451,704, filed Jun. 2006, Riley.Applicant
- U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.Applicant
- U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy, James.Applicant
- U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy, James.Applicant
- U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari, Manish.Applicant
- U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.Applicant
- U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.Applicant
- U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.Applicant
- U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast.Applicant
- U.S. Appl. No. 11/852,234, filed Sep. 2007, Gast et al.Applicant
- U.S. Appl. No. 11/944,346, filed Nov. 2007, Gast, Mathew S.Applicant
- U.S. Appl. No. 11/966,912, filed Dec. 2007, Chesnutt et al.Applicant
- U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast, Mathew S.Applicant
- U.S. Appl. No. 11/975,134, filed Oct. 2007, Aragon et al.Applicant
- U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast, Mathew S.Applicant
- Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).Applicant
- Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).Applicant
- Bing and Subramanian, IEEE, 1318-1322 (1997).Applicant
- Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.Applicant
- Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.Applicant
- Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, p. 58-68 (1995).Applicant
- Geier, Jim, Wireless Lans Implementing Interoperable Networks, Chapter 3 (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.Applicant
- Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propagation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.Applicant
- Kim et al., “Radio Propagation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Kleinrock and Scholl, Conference record 1977 ICC vol. 2 of 3, Jun. 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).Applicant
- LAN/MAN Standars Committee of the IEEE Computer Society, Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 802.11b (1999).Applicant
- Okamoto and Xu, IEEE, Proceeding so of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).Applicant
- Panjwani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.Applicant
- Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, Apr. 6-8, pp. 45-50 (1977).Applicant
- Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.Applicant
- Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus” IEEE ICUPC '96 Proceedings (1996).Applicant
- Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Puttini, R., Percher, J., Me, L., and de Sousa, R. 2004. A fully distributed IDS for MANET. In Proceedings of the Ninth international Symposium on Computers and Communications 2004 vol. 2 (Iscc04)—vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.Applicant
- Final Office Action mailed Apr. 22, 2010, in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
- Non-Final Office Action Mailed May 3, 2010, in Co-pending U.S. Appl. No. 11/604,075, filed Nov. 22, 2006.Applicant
- Co-pending U.S. Appl. No. 12/763,057, filed Apr. 19, 2010.Applicant
- Co-pending U.S. Appl. No. 12/785,362, filed May 21, 2010.Applicant
- LAN/MAN Standards Committee of the IEEE Computer Society, Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 801.11b (1999).Applicant
- Okamoto and Xu, IEEE, Proceedings of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).Applicant