1. Field
This application relates generally to distance ranging, and to distance ranging verification.
2. Background
Distance ranging involves determining a distance between two locations. In a typical scenario a device such as a rangefinder measures a distance from the rangefinder to another object. A distance ranging device may employ a variety of technologies such as laser, radar, sonar, and various forms of radio-frequency (“RF”) signaling. For convenience, the term distance ranging will be referred to herein simply as ranging.
Ranging may be employed in a communication system through the use of RF signaling. For example, in a wireless communication system a ranging device may determine the amount of time it takes for a signal to travel from the ranging device to another device, the amount of time it takes for a signal to travel from the other device to the ranging device, or both. The ranging device may then calculate the distance between the devices based on any of these times and the known propagation speed of the RF signals (e.g., the speed of light).
Some systems employ a two-way message exchange mechanism to measure the relative distance between two devices. For example, a first device may send a ranging packet to second device. The second device may then send a reply packet back to the first device whereby the reply packet indicates the amount of time it took the second device to transmit the reply packet after receiving the ranging packet (i.e., second device's turnaround time). The first device may then use this turnaround time to determine the actual propagation time of the packets. Here, the first device calculates the total round-trip time as the amount of time that elapsed from the time it transmitted the ranging packet to the time it received the reply packet. The first device may then determine the actual propagation time by subtracting the turnaround time from the total round-trip time.
In practice, this form of two-way message exchange ranging is susceptible to being compromised by the second device. For example, the second device may send false information to the first device in the reply packet to make it appear to the first device that the second device is closer than it actually is. For example, the second device may report that it received the ranging packet from the first device earlier than it actually did and also report that it transmitted the reply packet at a later time than it actually did.
One approach for addressing this problem is to authenticate the second device to the first device using a public/private key exchange and an authentication server. Once authenticated, the first device may then trust the information reported by the second device. In practice, however, ranging authentication also may be needed for devices that can not be trusted in this manner. Accordingly, a need exists for more reliable ranging techniques.
A summary of sample aspects of the disclosure follows. For convenience, one or more aspects of the disclosure may be referred to herein simply as “some aspects.”
The disclosure relates in some aspects to ranging techniques. For example, ranging techniques may be employed to verify or determine a distance between two wireless communication devices.
The disclosure also relates in some aspects to verified ranging. For example, verified ranging may be used to determine whether the distance between two devices is valid or is within an allowable range. Verified ranging also may be used to verify the accuracy of a determined distance between two devices. Here, verified ranging may be used to ensure that the distance between a ranging device and a responding device is less than or equal to a given distance.
In some aspects a distance may be verified based on whether a device (e.g., a responding device) is capable of performing a certain action. Here, the action may be defined such that the device can only perform the action (e.g., generate a particular result) if the device is within a certain range of another device (e.g., a ranging device). For example, in a system employing two-way message exchange ranging a responding device may (e.g., may be required to) transmit a signal in response to a received ranging signal within a defined amount of time (e.g., a defined turnaround time). Here, the defined turnaround time may be defined to be relatively insignificant with respect to the true round-trip propagation time associated with an expected measured distance. The ranging device may then verify the distance between the devices by determining whether the total measured round-trip time is less than or equal to the expected round-trip time plus the defined turnaround time. In this way, the distance the spoofing device may spoof is limited by the defined turnaround time.
In some aspects a ranging signal may comprise a random, pseudorandom, or deterministic sequence. For example, a ranging signal may comprise a sequence of pulses where each pulse has a randomly selected value. In this case, a proper response signal from a responding device will correspond to the sequence of the ranging signal.
In some aspects a responding device generates a response signal by operating on a ranging signal in accordance with a function that is based on a known signal response scheme. For example, the responding device may utilize the function to operate on information represented by (e.g., sent in) the ranging signal. The responding device then transmits the processed information to a ranging device that has knowledge of the signal response scheme, and hence the function. The ranging device may thus verify that the information it receives from the responding device has been properly processed using the function, and is not been spoofed in some manner.
In some aspects a ranging device determines the likelihood (e.g., a probability) that the responding device properly operated on a ranging signal that the ranging device sent to the responding device. For example, the ranging device may employ statistical analysis to process the response signal received from the responding device to obtain a level of confidence as to whether the responding device is actually responding to the ranging signal or is attempting to spoof a response to the ranging signal.
These and other features, aspects and advantages of the disclosure will be more fully understood when considered with respect to the following detailed description, appended claims and accompanying drawings, wherein:
In accordance with common practice the various features illustrated in the drawings may not be drawn to scale. Accordingly, the dimensions of the various features may be arbitrarily expanded or reduced for clarity. In addition, some of the drawings may be simplified for clarity. Thus, the drawings may not depict all of the components of a given apparatus (e.g., device) or method. Finally, like reference numerals may be used to denote like features throughout the specification and figures.
Various aspects of the disclosure are described below. It should be apparent that the teachings herein may be embodied in a wide variety of forms and that any specific structure, function, or both being disclosed herein is merely representative. Based on the teachings herein one skilled in the art should appreciate that an aspect disclosed herein may be implemented independently of any other aspects and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, such an apparatus may be implemented or such a method may be practiced using other structure, functionality, or structure and functionality in addition to or other than one or more of the aspects set forth herein. For example, some aspects may involve verifying a determined distance based on characteristics of a plurality of signals while other aspects may involve verifying a determined distance based on characteristics of a plurality of signals and determining whether at least one signal is received within a defined period of time.
The devices 102 and 104 in the example of
Sample operations of the system 100 will be described in more detail in conjunction with the flowchart of
As represented by block 202 in
In the example of
The ranging device may verify a distance between the devices 102 and 104 in an attempt to determine whether the distance between two devices is valid or is within an allowable range. In some aspects this may involve verifying a determined distance (e.g., ensuring that a determined distance is accurate). Here, the ranging device may perform appropriate operations to ensure that the responding device or some other device has not compromised the ranging operation of the ranging device.
In some aspects the ranging device may verify a distance by causing the responding device to take some action that generates a result that is achievable only if the responding device is at most a given distance from the ranging device. An example of such an operation involves a two-way message exchange operation where verification of the distance is predicated upon the responding device transmitting a responsive signal within a defined period of time after it receives an appropriate signal from the ranging device.
Between time T1 and time T2 the responding device processes the received signal 306. This processing time is thus represented by a time interval 310.
At time T2, the responding device transmits a processed signal 312 to the ranging device as represented by a line 314. This signal arrives at the ranging device at time T3 as represented by the signal 316. Thus the propagation time of the signal transmitted from the responding device to the ranging device is represented by a time interval 318.
The total time between transmission of the pulse 302 and reception of the pulse 316 is represented by a time period 320. As will be discussed in more detail below, the ranging device may verify a distance based on a round-trip time as represented by time period 320 and knowledge of a defined time period associated with the time period 310, where the defined time period is appropriately restricted. It should be appreciated that the time periods discussed above (e.g., round-trip time) may be defined in various ways. For example, a start time of a given time period may be defined by a time (e.g., a beginning time, a middle time, an ending time, or a zero-crossing time, etc.) associated with a pulse, a symbol, a message, or some other type of signal, or the start time may be defined in some other suitable manner. Similarly, an end time of a given time period may be defined by a time (e.g., a beginning time, a middle time, an ending time, or a zero-crossing time, etc.) associated with a pulse, a symbol, a message, or some other type of signal, or the end time may be defined in some other suitable manner.
Referring again to
As represented by block 206, the ranging device transmits the ranging signal to the responding device. To this end, the transceiver (e.g., an ultra-wideband transceiver) 140 includes a transmitter component 114 and a receiver component 116. Similarly, the device 104 includes a transceiver 118 having a receiver component 120 and a transmitter component 122.
As represented by block 208, the responding device processes the ranging signal that was received from the ranging device. For example, the responding device may utilize a function known to both devices to operate on the received signal. In some implementations this may involve scrambling the received information so that the responsive signal to be transmitted by the second device is distinguishable from a reflection of the original ranging signal. In some aspects the known function may utilize or otherwise operate on a known sequence or some other information. This information may be generated in various ways including, for example, a random, pseudorandom, or deterministic manner.
In some implementations the information is generated based on cryptographic keys possessed by the ranging and responding devices. For example, the devices may exchange the keys during a pairing process involving a Diffie-Hellman key exchange or some other suitable procedure. Through the use of a sequence generated from such a key or keys, the distance-based verification operations described herein also may provide a mechanism for authenticating any key that was exchanged with the same device for which the distance is being verified.
Referring again to
In this example, the function 404A comprises an XOR function. It should be appreciated, however, that a variety of other types of functions may be employed in accordance with the teachings herein. For example, a time varying function may be used, whereby the result of the function is a function of time and the values of the input or inputs.
The above operations may then be repeated for subsequent signals 402B, 402C, and 402D of the sequence from the ranging device and subsequent values 406B, 406C, and 406D of the known sequence. For convenience,
Referring again to the operations of
As represented by block 212, the ranging device may verify the distance between the devices 102 and 104 based on the characteristics of the received processed signal and the ranging signal. For example, the ranging device may determine whether the received processed signal was received within a defined period of time after the transmission of the ranging signal at block 206 (e.g., a total round-trip time). In addition, the ranging device may perform a statistical analysis or some other suitable operation to determine whether the responding device operated on the ranging signal using the known sequence. To perform these and other related operations, the device 102 in
In some aspects verifying a distance between the devices 102 and 104 may involve determining whether the distance is allowable or is valid. As an example of the former scenario, the distance verifier 128 may verify that the distance is within a defined range that is deemed acceptable for the performance of an associated operation or operations. As an example of the latter scenario, the distance verifier 128 may determine whether the information that is being used to verify the distance has been compromised in some way or is unreliable for some other reason.
In some aspects verifying a distance between the devices 102 and 104 may involve processing the received processed signal to obtain information relating to this distance. For example, the distance verifier 128 may determine whether the processed signal was received by the device 102 within a defined time interval after transmission of the ranging signal at block 206. Here, given that the propagation times of the signals are effectively known, and making an assumption about the turnaround time of the device 104, this round-trip timing may be used to verify that the devices 102 and 104 are within a given range. Alternatively, the distance verifier may use the round-trip time information to calculate an estimate (e.g., taking the turnaround time into account) of the actual distance between the device 102 and 104.
In some aspects verifying a distance between the devices 102 and 104 may involve verifying the accuracy of a previously determined distance. Here, the distance between the devices 102 and 104 may be determined in some manner (e.g., as discussed above in conjunction with block 202). The operations of block 212 may then be used to verify this distance. For example, the operations of block 212 may be used to determine an upper bound within which the determined distance must fall for a proper verification. In other words, the determined distance is verified if the determined distance falls below that upper bound.
As represented by block 214, in the event the ranging device verifies that the distance between two devices is valid or is within an allowable range (e.g., that a determined distance is accurate), the ranging device may take one or more actions based on the verified distance. For example, one or more operations may be enabled (e.g., invoked), disabled (e.g., terminated), or performed (e.g., modified in functionality) based on the distance. To this end, the device 102 of
It should be appreciated that the operations of
Additional details of an example of a distance verification operation that employs a two-way message exchange scheme will be discussed in conjunction with the flowcharts of
In some aspects a distance verification operation may employ one or more defined parameters. For example, a turnaround time may be defined relating to a maximum amount of time within which the second device (e.g., a responding device) should respond to a signal that was received from the first device (e.g., a ranging device). Through the use of such a timing scheme, the first device may be effectively protected from any attempt by the second device or some other device to compromise a distance determination operation that is based on a message exchange between the first and second devices. For example, the first device may calculate a round-trip time or a one-way-trip time between the first and second devices by transmitting a ranging signal to the second device and having the second device transmit a responsive signal that indicates the second device's turnaround time. Here, the second device's turnaround time relates to the period of time from the time the second device received the ranging signal to the time the second device transmitted the responsive signal.
Assuming the second device reports a correct turnaround time, the first device may calculate the actual signal propagation time between the first and second devices by subtracting the turnaround time from the total round-trip time. Here, the total round-trip time may be the amount of time that elapsed from the time the first device transmitted the ranging signal to the time it received the responsive signal. However, in the event the second device does not report a correct turnaround time, any distance-related determination based on this turnaround time may be inaccurate.
As will be discussed in more detail below, through the use of a defined turnaround time for the second device a substantially accurate distance determination may be made even if the second device reports a false turnaround time. For example, the defined turnaround time may be defined to be within a range of acceptable error for a given range of measured distances. Consequently, any attempt by the second device to report a spoofed turnaround time period may have little effect on the determined distance. Moreover, the first device may reject (e.g., ignore) any reported turnaround time that exceeds the defined turnaround time. As an example, a period of time of 1 nanosecond may roughly equate to a signal propagation distance on the order of 1 foot. Hence, if the defined turnaround time is defined as 1 nanosecond, any attempt by the second device to spoof its turnaround time will cause, at most, an error on the order of 1 foot in the determined distance. Here, any reported turnaround time exceeding 1 nanosecond may be ignored by the first device. For greater security the assumed turnaround time may be defined to be zero seconds to ensure that the device being authenticated (e.g., the second device) is within a prescribed range. Here, since the actual turnaround time will be non-zero, the second device will in actuality be closer than the prescribed range.
Moreover, in the event the turnaround time provided by the second device is not trusted, the first device may simply use the total measured round-trip time and an assumed turnaround time to determine the distance between the first and second devices. In other words, the first device need not rely on any turnaround information provided by the second device. Such an implementation may employed where any error associated the use of an assumed turnaround time (as opposed to the real turnaround time) is within an acceptable range of tolerance. As an example, a period of time of 10 nanoseconds may roughly equate to a signal propagation distance on the order of 10 feet. Thus, by assuming that the turnaround time is 5 nanoseconds when the defined turnaround time period is 10 nanoseconds, the error associated with the distance measurement will be at most on the order of five feet.
In some aspects the first device may use the defined turnaround time to verify a determined distance between the devices that was provided in some other manner (e.g., by some other ranging mechanism). For example, a secondary indication of the distance between the first and second devices may be obtained by determining whether the total measured round-trip time is, within a degree of tolerance, less than or equal to the expected true round-trip time plus the defined turnaround time (or the reported turnaround time if it is trusted). Here, the expected true round-trip time corresponds to the initial determined distance between the devices (e.g., determined by some other ranging mechanism). As discussed above, some measure of error may be associated with the use of the defined turnaround time in the event the turnaround time provided by the second device is not trusted. Thus, the initial determined distance may be verified if the secondary indication of distance does not exceed the initial determined distance by some threshold amount.
Various values may be assigned to the defined periods of time discussed above. In some aspects the value of a defined period of time may relate to a range of distances associated with an expected distance between the first and second devices. For example, if the devices operate in a body area network having a range on the order of 10 meters, the total round-trip time may be on the order of a typical propagation time associated with that range (e.g., on the order of 30 nanoseconds). Similarly, if the devices operate in a personal area network having a range on the order 30 meters, the total round-trip time may be related to that range (e.g., on the order of 100 nanoseconds). It should be appreciated that other round-trip times may be defined for other networks and/or may be based on other criteria.
The turnaround time may be defined in a similar manner. For example, if the devices operate in a body area network having a range on the order or 10 meters, an acceptable turnaround time may relate to the typical propagation time associated with that range (e.g., less than 30 nanoseconds). In addition, the turnaround time may relate to some acceptable distance error within that range. For example, if the acceptable distance error is one meter (e.g., 10% error), the turnaround time may be defined to be on the order of 2 or 3 nanoseconds. Similarly, if the devices operate in a personal area network having a range on the order 30 meters, the turnaround time may be related to that range (e.g., less than 100 nanoseconds, or 10 nanoseconds). It should be appreciated that other turnaround times may be defined for other networks and/or may be based on other criteria.
In some aspects a signal response scheme may be defined whereby the signal response scheme will be used by the second device to operate on information received from the first device. For example, the signal response scheme may relate to application of a known function to received information. Information (e.g., a sequence) to be used in conjunction with the signal response scheme also may be defined. In some aspects, such information may be defined to be generated in a random, pseudorandom, deterministic manner. In some aspects the information may be defined based on one or more cryptographic keys. For example, the information may be a function of one or more cryptographic keys known to (e.g., maintained by) the first device, the second device, or both.
As will be discussed in more detail below, through the use of a known signal response scheme, the first device may verify that the second device properly operated on information received from the first device. For example, the second device could attempt to compromise the distance determining operation of the first device by transmitting a spoofed responsive signal to the first device at an earlier point in time. Here, since the spoofed responsive signal would be received earlier than a genuine responsive signal, the first device could potentially be tricked into determining that the second device is closer to the first device than it actually is.
The use of a known signal response scheme, however, may make it more difficult for the second device to spoof the responsive signal. For example, the information (e.g., a sequence) transmitted from the first device to the second device may not be known to second device. To compromise the distance determination operation, however, a second device must transmit a spoofed responsive signal at a point in time that is earlier than the point in time that the second device would transmit a genuine responsive signal. Consequently, to spoof the responsive signal, the second device would need to correctly guess the contents of the information being transmitted by the first device. Accordingly, provisions may be made to transmit information that is more difficult to spoof and provisions may be made to determine whether the second device is attempting to spoof this information. These and other operations will now be discussed in more detail in conjunction with the sample operations of
As represented by block 502 in
Referring now to the operations of
As represented by block 506, in some aspects a determination may be made as to whether the distance determined at block 504 is within an acceptable range. For example, the purpose of the distance determining operation may be to determine whether some action should be taken based on whether the second device is close enough to the first device. In this case, if the determined distance is not within an acceptable range there may be no need to verify (e.g., authenticate) the determined distance since the action in question may not be performed anyway. To this end, the distance determiner 108 of
As represented by block 508, the first device generates a first set of at least one first signal to be used for verifying a distance between the devices. In general, the signal set represents some form of information that may be used to verify that the second device has processed this signal set. To this end, the signal set may comprise a single signal, several signals, a group of signals, a sequence of signals, or some other combination of signals.
In some aspects the signal set may be defined in a manner that makes it more difficult for the second device to guess the information represented by the signal set. For example, the signal set may be generated in a deterministic manner that is not known by the second device. Alternatively, the signal set may be generated in a random or pseudorandom manner. Thus, in some aspects, the signal set may be based on or comprise a random sequence, a pseudorandom sequence, or a deterministic sequence.
In some aspects the signal set may be modulated in some manner. For example, the first device may vary one or more characteristics associated with the signal set including, for example, time, frequency, phase, and amplitude. As discussed above, these characteristics may be varied in a random manner, a pseudorandom manner, or a deterministic manner.
Various modulation schemes may be employed to provide a modulated signal set. For example, in some aspects a modulation scheme may employ phase shift keying, on/off keying, frequency shift key, or time shift keying. Thus, a given input signal (e.g., an ultra-wideband pulse stream) may be modulated using one of these schemes based on, for example, a random, pseudorandom, or deterministic sequence, or other information.
The first device includes various components to implement these and other operations associated with generating the signal set. Referring to the example of
Referring again to
Referring now to the sample operations of the second device represented by
In some aspects the second device may be required to transmit a responsive signal within a defined turnaround time period after receipt of the first signal set. For example, in the event the second device does not transmit a responsive signal within the defined turnaround time, the first device may terminate or ignore the results of any distance determining-related operations associated with the responsive signal. Accordingly, the second device may be configured to perform its functions in a manner that attempts to ensure that the defined turnaround time period is met. For example, other operations (e.g., transmissions) of the second device may be suspended until the responsive signal is sent. To this end, as represented by block 606 the second device may define the time of receipt of the signal set at block 604 as a first time. For example, receipt of a specified signal from the first signal set may be defined as a first time (e.g., first point in time). The second device may then use this first time to determine a second time when the responsive signal needs to be transmitted. For example, transmission of a specified signal from a second signal set may be defined as a second time (e.g., second point in time). In the example of
As represented by block 608, the second device generates the responsive signal in the form of a second set of at least one second signal. This second signal set may comprise a single signal, several signals, a group of signals, a sequence of signals, or some other combination of signals. In the example of
In some aspects the second device generates the second signal set by applying a function to data represented by the first signal set in accordance with a signal response scheme that is known to the first and second devices. For example, the second device 104 in
The signal response scheme and associated function may take any suitable form to accomplish these and other similar objectives. For example, in some aspects the function involves altering (e.g., determining) whether or not a signal (e.g., a pulse) is to be transmitted. In some aspects the function involves altering a phase of a signal in a known manner. In the example of
In some aspects a signal response scheme may involve operating on information in addition to the first signal set. Such information may include, for example, a defined sequence, a known set of phase adjustments, or some other suitable information that is known to the first and second devices. This information (e.g., a defined sequence 146) may be stored in a data memory.
In some aspects the signal response scheme module 144 may comprise a function module 148 adapted to operate on the first signal set (e.g., on data represented by the first signal set) and the information that is known to the first and second devices to generate the second signal set. In some aspects the function provided by the function module 148 may comprise an XOR operation (e.g., as described in conjunction with
As represented by block 610, the second device transmits the second signal set to the first device. For example, the signal generator 124 may generate a signal set (e.g., one or more signals) that is modulated according to the results of the signal response scheme. The transmitter 122 then transmits the modulated signal set over the communication link 106.
As discussed above the second device may transmit the second signal set at a second time that is within a defined time period after the first time (e.g., within the defined turnaround time). As an example, if the defined time period is 10 microseconds, the second time may be any point in time after the first time up to, but not exceeding, 10 microseconds after the first time. Thus, the second device may transmit the second signal 2 nanoseconds after the first time, 10 nanoseconds after the first time, 1 microsecond after the first time, and so on.
Referring again to
As represented by block 514, the first device (e.g., the distance verifier 128 of
As represented by block 516, the second device determines whether the second signal set is received with a defined time period after transmission of the first signal set. In the example of
In some aspects the defined time period of block 516 may comprise a time period associated with a maximum acceptable distance between the first and second devices. Here, if the measured total round-trip time exceeds the defined time period, the second device may be deemed to be too far away from the first device. In contrast, if the measured total round-trip time is within the defined time period, the first and second devices may be deemed to be with an acceptable range of one another.
Alternatively, in some aspects the defined time period at block 516 may be associated with a previously determined distance. For example, the defined time period may be a period of time that was expected for the total round-trip time in view of the previously determined distance. In this case, if the measured total round-trip time exceeds the defined time period (e.g., including some range of tolerance), the first device may determine that the distance (e.g., a previously determined distance) is not verified. In contrast, in the event the measured total round-trip time is within (less than or equal to) the defined time period, the first device may determine that the distance is verified.
Based on the above determination(s), any of the operations that were to be performed based on an acceptable distance between the first and second devices may be impacted in an appropriate manner. For example, an operation may be or may not be invoked, an operation may be or may not be terminated, or an operation may be impacted in some other manner.
As represented by block 518, the first device may determine whether the second signal set corresponds to an expected result of a defined signal response scheme being applied to the first signal set, and optionally to a defined sequence. To this end, the device 102 of
In addition, given that the signal sets may be transmitted through a relatively noisy or lossy communication medium (e.g., link 106), provisions may be made to analyze the received second signal set in a manner that accounts for potential errors in the received signal caused by the communication medium. For example, the second device may transmit a sequence (e.g., based on a sequence from the first device) that is long enough to enable the first device to properly analyze the received sequence even if there are errors in the received sequence.
In some aspects the first device may analyze the received information to determine whether the second device actually operated on information sent by the first device or randomly guessed the information sent by the first device. For example, this process may involve performing a statistical hypothesis test between the expected result of the function and information actually received from the second device (e.g., data derived from the second signal set). The first device may then generate a confidence interval relating to the probability as to whether the second device actually processed the information or made a guess.
In some aspects the first device may employ statistical analysis (e.g. via the statistical analyzer 132) to determine whether the received information is statistically correct. This process may involve, for example, deciding between a hypothesis that the second device actually operated on information sent by the first device and a hypothesis that the second device randomly guessed the information sent by the first device. For example, the statistical analyzer 132 may generate binomial sequences relating to these hypotheses and compare the hypotheses to one or more thresholds. In some implementations the statistical analyzer 132 employs a statistical test between a random Bernoulli(0.5) process and a random process with probability less that 0.5 based on the error rates of the channel (e.g., the wireless communication link). Through the use of these or other techniques, the statistical analyzer 132 may make a determination as to whether the number of correctly received bits is greater than a threshold.
The first device will then take appropriate action based on the results of the verification of the second signal set. For example, if it is determined that the second device guessed, the current distance determining operation may be aborted and a new distance determination operation commenced. Moreover, as discussed above, one or more distance-based operations (e.g. associated with the operations processor 136) may be or may not be invoked, may be or may not be terminated, or may be impacted in some other manner depending upon the results the verification.
With the above in mind, a sample ranging verification operation that may be employed in a system such as an impulse-based system (e.g., an ultra-wideband system) will be briefly treated. In essence, this operation involves a first node performing a traditional ranging procedure with a second node to determine a distance D between the two devices. The first node then verifies the distance to the second node by requiring that the second node perform actions that could only be done if the second node is at most a distance D from the first node. Initially, at a given interval (e.g., X nanoseconds), the first node randomly determines whether to transmit a pulse over a given communication medium. Concurrently, the second node scans the communication medium to determine whether it has received a pulse from the first node. In the event the second node has received a pulse, the second node transmits a pulse to the first node within a defined period of time (e.g., T nanoseconds). In the event the second node had not received a pulse, the second device does not transmit a pulse to the first node. In some implementations the second node may scramble the received pulses according to a pseudorandom sequence or based on some other criteria. For example, depending on the current value of the sequence, the second node may or may not transmit a pulse in response to a received pulse, or the second node may or may not transmit a pulse when it does not receive a pulse.
The first node also scans the channel to determine whether it has received any pulses from the second node. If so, the first node measures the delay between the time at which the first node transmitted a pulse and the time at which the first node received the pulse from the second node. In addition, the first node measures a correlation between the pulses it transmitted and the pulses it received. The first node may then generate a conservative estimate of the distance between the two nodes by taking the measured delay and multiplying that by the speed of light. The first device then compares the correlation to a confidence interval in an attempt to determine whether the second node actually processed the pattern that the first node transmitted or whether the second node attempted to randomly guess the pattern. In some aspects, the number agreement, to a first-order, may be substantially higher than 50%. In the event the correlation check passes, the first node may verify that the second node is within distance D of the first node.
The teachings herein may be incorporated into (e.g., implemented within or performed by) various types of devices. For example, one or more aspects taught herein may be incorporated into a phone (e.g., a cellular phone), a personal data assistant (“PDA”), an entertainment device (e.g., a music or video device), a headset (e.g., headphones, an earpiece, etc), a microphone, a medical device (e.g., a biometric sensor, a heart rate monitor, a pedometer, an EKG device, etc.), a user I/O device (e.g., a watch, a remote control, a switch, a keyboard, a mouse, etc.), a tire pressure monitor, an entertainment device, a point-of-sale device, a computer, a point-of-sale device, a hearing aid, a set-top box, or some other suitable device with wireless signaling capabilities. Moreover, these devices may have different power and data requirements. In some aspects, the teachings herein may be adapted for use in low power applications (e.g., through the use of a pulse-based signaling scheme and low duty cycle modes) and may support a variety of data rates including relatively high data rates (e.g., through the use of high-bandwidth pulses).
The devices 102 and 104 described herein or other suitable devices may support or otherwise use various wireless communication links and wireless network topologies. For example, in some aspects the devices 102 and 104 may comprise or form part of a body area network or a personal area network. In addition, in some aspects the devices 102 and 104 may comprise or form part of a local area network or a wide area network. The devices 102 and 104 also may support or otherwise use one or more of a variety of wireless communication protocols or standards including, for example, CDMA, WiMAX, Wi-Fi, and other wireless technologies. Accordingly, the devices 102 and 104 may include appropriate components (e.g., air interfaces) to establish one or more communication links using various wireless technologies.
Any of the devices 102 and 104 may include various components that perform functions bases on signals transmitted or received via the wireless communication link. For example, a headset may include a transducer adapted to provide an audible output based on a signal received via a receiver. A watch may include a display adapted to provide a visual output based on a signal received via a receiver. A medical device may include a sensor adapted to generate sensed data to be transmitted via a transmitter.
In some aspects the devices 102 and 104 or other suitable devices may communicate via or form an ultra-wideband network. For example, communication may be achieved through the use of ultra-wideband pulses that have a relatively short length (e.g., on the order of a few nanoseconds in some implementations) and a relatively wide bandwidth. Ultra-wideband signaling may be particularly well suited for ranging operations in implementations that employ relatively narrow pulses. In some aspects each ultra-wideband pulse may have a fractional bandwidth on the order of approximately 20% or more and/or a bandwidth on the order of approximately 500 MHz or more. The ultra-wideband network may take various forms including, for example, a body area network or a personal area network.
The components described herein may be implemented in a variety of ways. Referring to
As noted above,
In some aspects the apparatus 702 or the apparatus 704 may comprise an integrated circuit. Thus, the integrated circuit may comprise one or more processors that provide the functionality of the processor components illustrated in
In addition, the components and functions represented by
Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two, which may be designed using source coding or some other technique), various forms of program or design code incorporating instructions (which may be referred to herein, for convenience, as “software” or a “software module”), or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented within or performed by an integrated circuit (“IC”), an access terminal, or an access point. The IC may comprise a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, electrical components, optical components, mechanical components, or any combination thereof designed to perform the functions described herein, and may execute codes or instructions that reside within the IC, outside of the IC, or both. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
It is understood that any specific order or hierarchy of steps in any disclosed process is an example of a sample approach. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged while remaining within the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.
The steps of a method or algorithm described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module (e.g., including executable instructions and related data) and other data may reside in a data memory such as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of computer-readable storage medium known in the art. A sample storage medium may be coupled to a machine such as, for example, a computer/processor (which may be referred to herein, for convenience, as a “processor”) such the processor can read information (e.g., code) from and write information to the storage medium. A sample storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in user equipment. In the alternative, the processor and the storage medium may reside as discrete components in user equipment. Moreover, in some aspects any suitable computer-program product may comprise a computer-readable medium comprising codes relating to one or more of the aspects of the disclosure. In some aspects a computer program product may comprise packaging materials.
The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
This application claims the benefit of and priority to U.S. Provisional Patent Application No. 60/793,189, filed Apr. 18, 2006, and assigned to the assignee hereof, the disclosure of which is hereby incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
4006477 | Yost et al. | Feb 1977 | A |
5382957 | Blume | Jan 1995 | A |
5687169 | Fullerton | Nov 1997 | A |
5764696 | Barnes et al. | Jun 1998 | A |
5812081 | Fullerton | Sep 1998 | A |
5832035 | Fullerton | Nov 1998 | A |
5907427 | Scalora et al. | May 1999 | A |
5952956 | Fullerton | Sep 1999 | A |
5960031 | Fullerton et al. | Sep 1999 | A |
5963581 | Fullerton et al. | Oct 1999 | A |
5969663 | Fullerton et al. | Oct 1999 | A |
5970148 | Meier | Oct 1999 | A |
5995534 | Fullerton et al. | Nov 1999 | A |
6025795 | Hulderman et al. | Feb 2000 | A |
6031862 | Fullerton et al. | Feb 2000 | A |
6091374 | Barnes | Jul 2000 | A |
6111536 | Richards et al. | Aug 2000 | A |
6133876 | Fullerton et al. | Oct 2000 | A |
6177903 | Fullerton et al. | Jan 2001 | B1 |
6218979 | Barnes et al. | Apr 2001 | B1 |
6295019 | Richards et al. | Sep 2001 | B1 |
6297773 | Fullerton et al. | Oct 2001 | B1 |
6300903 | Richards et al. | Oct 2001 | B1 |
6304623 | Richards et al. | Oct 2001 | B1 |
6332193 | Glass et al. | Dec 2001 | B1 |
6351652 | Finn et al. | Feb 2002 | B1 |
6354946 | Finn | Mar 2002 | B1 |
6400307 | Fullerton et al. | Jun 2002 | B2 |
6400329 | Barnes | Jun 2002 | B1 |
6421389 | Jett et al. | Jul 2002 | B1 |
6430208 | Fullerton et al. | Aug 2002 | B1 |
6437756 | Schantz | Aug 2002 | B1 |
6462701 | Finn | Oct 2002 | B1 |
6466125 | Richards et al. | Oct 2002 | B1 |
6469628 | Richards et al. | Oct 2002 | B1 |
6483461 | Matheney et al. | Nov 2002 | B1 |
6489893 | Richards et al. | Dec 2002 | B1 |
6492904 | Richards | Dec 2002 | B2 |
6492906 | Richards et al. | Dec 2002 | B1 |
6501393 | Richards et al. | Dec 2002 | B1 |
6504483 | Richards et al. | Jan 2003 | B1 |
6512455 | Finn et al. | Jan 2003 | B2 |
6512488 | Schantz | Jan 2003 | B2 |
6519464 | Santhoff et al. | Feb 2003 | B1 |
6529568 | Richards et al. | Mar 2003 | B1 |
6538615 | Schantz | Mar 2003 | B1 |
6539213 | Richards et al. | Mar 2003 | B1 |
6549567 | Fullerton | Apr 2003 | B1 |
6552677 | Barnes et al. | Apr 2003 | B2 |
6556621 | Richards et al. | Apr 2003 | B1 |
6560463 | Santhoff | May 2003 | B1 |
6571089 | Richards et al. | May 2003 | B1 |
6573857 | Fullerton et al. | Jun 2003 | B2 |
6577691 | Richards et al. | Jun 2003 | B2 |
6585597 | Finn | Jul 2003 | B2 |
6593886 | Schantz | Jul 2003 | B2 |
6606051 | Fullerton et al. | Aug 2003 | B1 |
6611234 | Fullerton et al. | Aug 2003 | B2 |
6614384 | Hall et al. | Sep 2003 | B2 |
6614387 | Deadman | Sep 2003 | B1 |
6621462 | Barnes | Sep 2003 | B2 |
6636566 | Roberts et al. | Oct 2003 | B1 |
6636567 | Roberts et al. | Oct 2003 | B1 |
6636573 | Richards et al. | Oct 2003 | B2 |
6642903 | Schantz | Nov 2003 | B2 |
6650894 | Berstis et al. | Nov 2003 | B1 |
6661342 | Hall et al. | Dec 2003 | B2 |
6667724 | Barnes et al. | Dec 2003 | B2 |
6670909 | Kim | Dec 2003 | B2 |
6671310 | Richards et al. | Dec 2003 | B1 |
6674396 | Richards et al. | Jan 2004 | B2 |
6677796 | Brethour et al. | Jan 2004 | B2 |
6700538 | Richards | Mar 2004 | B1 |
6710736 | Fullerton et al. | Mar 2004 | B2 |
6717992 | Cowie et al. | Apr 2004 | B2 |
6748040 | Johnson et al. | Jun 2004 | B1 |
6750757 | Gabig, Jr. et al. | Jun 2004 | B1 |
6759948 | Grisham et al. | Jul 2004 | B2 |
6760387 | Langford et al. | Jul 2004 | B2 |
6762712 | Kim | Jul 2004 | B2 |
6763057 | Fullerton et al. | Jul 2004 | B1 |
6763282 | Glenn et al. | Jul 2004 | B2 |
6774764 | Ghosh et al. | Aug 2004 | B2 |
6774846 | Fullerton et al. | Aug 2004 | B2 |
6774859 | Schantz et al. | Aug 2004 | B2 |
6778603 | Fullerton et al. | Aug 2004 | B1 |
6781530 | Moore | Aug 2004 | B2 |
6782048 | Santhoff | Aug 2004 | B2 |
6788730 | Richards et al. | Sep 2004 | B1 |
6822604 | Hall et al. | Nov 2004 | B2 |
6823022 | Fullerton et al. | Nov 2004 | B1 |
6836223 | Moore | Dec 2004 | B2 |
6836226 | Moore | Dec 2004 | B2 |
6844816 | Melton et al. | Jan 2005 | B1 |
6845253 | Schantz | Jan 2005 | B1 |
6847675 | Fullerton et al. | Jan 2005 | B2 |
6862575 | Anttila et al. | Mar 2005 | B1 |
6879878 | Glenn et al. | Apr 2005 | B2 |
6882301 | Fullerton | Apr 2005 | B2 |
6895034 | Nunally et al. | May 2005 | B2 |
6895236 | Shuster | May 2005 | B2 |
6900732 | Richards | May 2005 | B2 |
6906625 | Taylor et al. | Jun 2005 | B1 |
6907244 | Santhoff et al. | Jun 2005 | B2 |
6912240 | Kumar et al. | Jun 2005 | B2 |
6914949 | Richards et al. | Jul 2005 | B2 |
6917284 | Grisham et al. | Jul 2005 | B2 |
6919838 | Santhoff | Jul 2005 | B2 |
6922166 | Richards et al. | Jul 2005 | B2 |
6922177 | Barnes et al. | Jul 2005 | B2 |
6925109 | Richards et al. | Aug 2005 | B2 |
6933882 | Fullerton | Aug 2005 | B2 |
6937639 | Pendergrass et al. | Aug 2005 | B2 |
6937663 | Jett et al. | Aug 2005 | B2 |
6937667 | Fullerton et al. | Aug 2005 | B1 |
6937674 | Santhoff et al. | Aug 2005 | B2 |
6947492 | Santhoff et al. | Sep 2005 | B2 |
6950485 | Richards et al. | Sep 2005 | B2 |
6954480 | Richards et al. | Oct 2005 | B2 |
6959031 | Haynes et al. | Oct 2005 | B2 |
6959032 | Richards et al. | Oct 2005 | B1 |
6961285 | Niemiec et al. | Nov 2005 | B2 |
6961541 | Overy et al. | Nov 2005 | B2 |
6963727 | Shreve | Nov 2005 | B2 |
6980613 | Krivokapic | Dec 2005 | B2 |
6989751 | Richards | Jan 2006 | B2 |
7002473 | Glick et al. | Feb 2006 | B2 |
7003289 | Kolls | Feb 2006 | B1 |
7010290 | Dent | Mar 2006 | B2 |
7015793 | Gabig, Jr. et al. | Mar 2006 | B2 |
7020224 | Krivokapic | Mar 2006 | B2 |
7027425 | Fullerton et al. | Apr 2006 | B1 |
7027483 | Santhoff et al. | Apr 2006 | B2 |
7027493 | Richards | Apr 2006 | B2 |
7030806 | Fullerton | Apr 2006 | B2 |
7039392 | McCorkle et al. | May 2006 | B2 |
7042417 | Santhoff et al. | May 2006 | B2 |
7046187 | Fullerton et al. | May 2006 | B2 |
7046618 | Santhoff et al. | May 2006 | B2 |
7058414 | Rofheart et al. | Jun 2006 | B1 |
7069111 | Glenn et al. | Jun 2006 | B2 |
7075476 | Kim | Jul 2006 | B2 |
7079827 | Richards et al. | Jul 2006 | B2 |
7098769 | Ott | Aug 2006 | B2 |
7099367 | Richards et al. | Aug 2006 | B2 |
7099368 | Santhoff et al. | Aug 2006 | B2 |
7116266 | Vesel et al. | Oct 2006 | B1 |
7119659 | Bonalle et al. | Oct 2006 | B2 |
7129886 | Hall et al. | Oct 2006 | B2 |
7132975 | Fullerton et al. | Nov 2006 | B2 |
7139647 | Larsen | Nov 2006 | B2 |
7145954 | Pendergrass et al. | Dec 2006 | B1 |
7148791 | Grisham et al. | Dec 2006 | B2 |
7151490 | Richards | Dec 2006 | B2 |
7167525 | Santhoff et al. | Jan 2007 | B2 |
7170408 | Taylor et al. | Jan 2007 | B2 |
7178719 | Silverbrook et al. | Feb 2007 | B2 |
7181192 | Panasik et al. | Feb 2007 | B2 |
7184938 | Lansford et al. | Feb 2007 | B1 |
7188244 | Matsuno | Mar 2007 | B2 |
7190722 | Lakkis et al. | Mar 2007 | B2 |
7190729 | Siwiak | Mar 2007 | B2 |
7206334 | Siwiak | Apr 2007 | B2 |
7209724 | Richards et al. | Apr 2007 | B2 |
7209753 | Raith | Apr 2007 | B2 |
7230980 | Langford et al. | Jun 2007 | B2 |
7239277 | Fullerton et al. | Jul 2007 | B2 |
7245900 | Lamb et al. | Jul 2007 | B1 |
RE39759 | Fullerton | Aug 2007 | E |
7256727 | Fullerton et al. | Aug 2007 | B2 |
7271779 | Hertel | Sep 2007 | B2 |
7308356 | Melaku et al. | Dec 2007 | B2 |
7310532 | Knauerhase et al. | Dec 2007 | B2 |
7363494 | Brainard et al. | Apr 2008 | B2 |
7366509 | Akgun et al. | Apr 2008 | B2 |
7383984 | Silverbrook et al. | Jun 2008 | B2 |
7398392 | Weber | Jul 2008 | B2 |
7505443 | McNew et al. | Mar 2009 | B2 |
7554979 | Ikeda | Jun 2009 | B2 |
7581113 | Smith et al. | Aug 2009 | B2 |
7724705 | Erola et al. | May 2010 | B2 |
7739157 | Bonner et al. | Jun 2010 | B2 |
7783532 | Hsu et al. | Aug 2010 | B2 |
7818762 | Liu et al. | Oct 2010 | B2 |
7870021 | Mankoff | Jan 2011 | B2 |
7870229 | Spector | Jan 2011 | B2 |
20010014870 | Saito et al. | Aug 2001 | A1 |
20010042010 | Hassell | Nov 2001 | A1 |
20020010627 | Lerat | Jan 2002 | A1 |
20020046084 | Steele et al. | Apr 2002 | A1 |
20020065713 | Awada et al. | May 2002 | A1 |
20020091569 | Kitaura et al. | Jul 2002 | A1 |
20020091571 | Thomas et al. | Jul 2002 | A1 |
20020107738 | Beach et al. | Aug 2002 | A1 |
20020111140 | Kim | Aug 2002 | A1 |
20020111907 | Ling | Aug 2002 | A1 |
20020116271 | Mankoff | Aug 2002 | A1 |
20020128903 | Kernahan | Sep 2002 | A1 |
20020138345 | Dickson et al. | Sep 2002 | A1 |
20020138346 | Kodaka et al. | Sep 2002 | A1 |
20020169892 | Miyaoku et al. | Nov 2002 | A1 |
20020178060 | Sheehan | Nov 2002 | A1 |
20020194303 | Suila et al. | Dec 2002 | A1 |
20030004808 | Elhaoussine et al. | Jan 2003 | A1 |
20030004821 | Dutta et al. | Jan 2003 | A1 |
20030074259 | Slyman, Jr. et al. | Apr 2003 | A1 |
20030093314 | Leung et al. | May 2003 | A1 |
20030115152 | Flaherty | Jun 2003 | A1 |
20030117635 | Roberts | Jun 2003 | A1 |
20030158796 | Balent | Aug 2003 | A1 |
20030195806 | Willman et al. | Oct 2003 | A1 |
20030217153 | Rao et al. | Nov 2003 | A1 |
20040054592 | Hernblad | Mar 2004 | A1 |
20040054732 | Carter et al. | Mar 2004 | A1 |
20040064351 | Mikurak | Apr 2004 | A1 |
20040117250 | Lubow et al. | Jun 2004 | A1 |
20040137886 | Ross et al. | Jul 2004 | A1 |
20040143500 | Lopez et al. | Jul 2004 | A1 |
20040158492 | Lopez et al. | Aug 2004 | A1 |
20040203963 | Shivaram et al. | Oct 2004 | A1 |
20040218574 | Sata et al. | Nov 2004 | A1 |
20040222302 | Matsumori | Nov 2004 | A1 |
20040233621 | Maeoka et al. | Nov 2004 | A1 |
20040240565 | Santhoff et al. | Dec 2004 | A1 |
20040243519 | Perttila et al. | Dec 2004 | A1 |
20040254836 | Emoke Barabas et al. | Dec 2004 | A1 |
20050027984 | Saito et al. | Feb 2005 | A1 |
20050038574 | Gila et al. | Feb 2005 | A1 |
20050040230 | Swartz et al. | Feb 2005 | A1 |
20050114213 | Smith et al. | May 2005 | A1 |
20050131761 | Trika et al. | Jun 2005 | A1 |
20050132234 | Dawson | Jun 2005 | A1 |
20050135304 | Wentink et al. | Jun 2005 | A1 |
20050138576 | Baumert et al. | Jun 2005 | A1 |
20050184145 | Law et al. | Aug 2005 | A1 |
20050184908 | Richards | Aug 2005 | A1 |
20050204152 | Breitbach | Sep 2005 | A1 |
20050230473 | Fajkowski | Oct 2005 | A1 |
20050237270 | Adams et al. | Oct 2005 | A1 |
20060003776 | Natori et al. | Jan 2006 | A1 |
20060014532 | Seligmann et al. | Jan 2006 | A1 |
20060015404 | Tran | Jan 2006 | A1 |
20060026070 | Sun | Feb 2006 | A1 |
20060030341 | Pham | Feb 2006 | A1 |
20060068822 | Kalhan | Mar 2006 | A1 |
20060073851 | Colando et al. | Apr 2006 | A1 |
20060074784 | Brown | Apr 2006 | A1 |
20060111967 | Forbes | May 2006 | A1 |
20060177030 | Rajagopalan et al. | Aug 2006 | A1 |
20060178932 | Lang | Aug 2006 | A1 |
20060180664 | Barrett et al. | Aug 2006 | A1 |
20060194569 | Hsueh | Aug 2006 | A1 |
20070017259 | Cho et al. | Jan 2007 | A1 |
20070057051 | Bortolin et al. | Mar 2007 | A1 |
20070061302 | Ramer et al. | Mar 2007 | A1 |
20070087732 | Hsueh | Apr 2007 | A1 |
20070131759 | Cox et al. | Jun 2007 | A1 |
20070136657 | Blumenthal et al. | Jun 2007 | A1 |
20070138270 | Reblin | Jun 2007 | A1 |
20070150339 | Retter et al. | Jun 2007 | A1 |
20070173266 | Barnes, Jr. | Jul 2007 | A1 |
20070174116 | Keith et al. | Jul 2007 | A1 |
20070174259 | Amjadi | Jul 2007 | A1 |
20070200671 | Kelley et al. | Aug 2007 | A1 |
20070203792 | Rao | Aug 2007 | A1 |
20070249288 | Moallemi et al. | Oct 2007 | A1 |
20070259690 | Julian et al. | Nov 2007 | A1 |
20070270129 | Luo | Nov 2007 | A1 |
20070276537 | Walker et al. | Nov 2007 | A1 |
20070287386 | Agrawal et al. | Dec 2007 | A1 |
20080040229 | Gholston | Feb 2008 | A1 |
20080052169 | O'shea et al. | Feb 2008 | A1 |
20080072066 | Vogler et al. | Mar 2008 | A1 |
20080074264 | Sharpe et al. | Mar 2008 | A1 |
20080120186 | Jokinen et al. | May 2008 | A1 |
20080133366 | Evans et al. | Jun 2008 | A1 |
20080154827 | Connors | Jun 2008 | A1 |
20080167991 | Carlson et al. | Jul 2008 | A1 |
20080189170 | Ramachandra | Aug 2008 | A1 |
20080208688 | Byerley et al. | Aug 2008 | A1 |
20080221984 | Abhyanker | Sep 2008 | A1 |
20080238615 | Carpenter | Oct 2008 | A1 |
20080240440 | Rose et al. | Oct 2008 | A1 |
20080262928 | Michaelis | Oct 2008 | A1 |
20080300984 | Li | Dec 2008 | A1 |
20090061884 | Rajan et al. | Mar 2009 | A1 |
20090076911 | Vo et al. | Mar 2009 | A1 |
20090076912 | Rajan et al. | Mar 2009 | A1 |
20090088182 | Piersol et al. | Apr 2009 | A1 |
20090098903 | Donaldson et al. | Apr 2009 | A1 |
20090108064 | Fernandes et al. | Apr 2009 | A1 |
20090178144 | Redlich et al. | Jul 2009 | A1 |
20090233575 | Morrison | Sep 2009 | A1 |
20100153205 | Retter et al. | Jun 2010 | A1 |
20100185504 | Rajan et al. | Jul 2010 | A1 |
20100241574 | Salazar | Sep 2010 | A1 |
20100257020 | Bryant et al. | Oct 2010 | A1 |
20100280960 | Ziotopoulos et al. | Nov 2010 | A1 |
20100289640 | Annamalai | Nov 2010 | A1 |
20100299224 | Borom et al. | Nov 2010 | A1 |
20110028160 | Roeding et al. | Feb 2011 | A1 |
20110119132 | Morton et al. | May 2011 | A1 |
20110215138 | Crum | Sep 2011 | A1 |
20110276385 | Keller | Nov 2011 | A1 |
20120239500 | Monahan | Sep 2012 | A1 |
Number | Date | Country |
---|---|---|
1672382 | Sep 2005 | CN |
1716223 | Jan 2006 | CN |
1926335 | May 2008 | EP |
11353555 | Dec 1999 | JP |
2000275328 | Oct 2000 | JP |
2002074131 | Mar 2002 | JP |
2002109237 | Apr 2002 | JP |
2002149945 | May 2002 | JP |
2002525641 | Aug 2002 | JP |
2002251555 | Sep 2002 | JP |
2002279274 | Sep 2002 | JP |
2002291047 | Oct 2002 | JP |
2002374261 | Dec 2002 | JP |
2003006543 | Jan 2003 | JP |
2003023367 | Jan 2003 | JP |
2003051771 | Feb 2003 | JP |
2003067606 | Mar 2003 | JP |
2003187140 | Jul 2003 | JP |
2003208381 | Jul 2003 | JP |
2003256705 | Sep 2003 | JP |
2003263582 | Sep 2003 | JP |
2004094543 | Mar 2004 | JP |
2004220522 | Aug 2004 | JP |
2004236166 | Aug 2004 | JP |
2004248215 | Sep 2004 | JP |
2004272463 | Sep 2004 | JP |
2004326303 | Nov 2004 | JP |
2004328542 | Nov 2004 | JP |
2004362470 | Dec 2004 | JP |
2005011318 | Jan 2005 | JP |
2005011318 | Jan 2005 | JP |
2005020350 | Jan 2005 | JP |
2005045756 | Feb 2005 | JP |
2005128903 | May 2005 | JP |
2005128903 | May 2005 | JP |
2005128965 | May 2005 | JP |
2005141686 | Jun 2005 | JP |
2005209114 | Aug 2005 | JP |
2005528016 | Sep 2005 | JP |
2005533316 | Nov 2005 | JP |
2006018511 | Jan 2006 | JP |
2006018824 | Jan 2006 | JP |
2006020004 | Jan 2006 | JP |
2006091355 | Apr 2006 | JP |
2006129000 | May 2006 | JP |
2006139431 | Jun 2006 | JP |
2006-197458 | Jul 2006 | JP |
2006227901 | Aug 2006 | JP |
2006295249 | Oct 2006 | JP |
2007502087 | Feb 2007 | JP |
2007201851 | Aug 2007 | JP |
2007213276 | Aug 2007 | JP |
2008225540 | Sep 2008 | JP |
2008293123 | Dec 2008 | JP |
2009516989 | Apr 2009 | JP |
2009188922 | Aug 2009 | JP |
2010515168 | May 2010 | JP |
1020020068945 | Aug 2002 | KR |
20020096946 | Dec 2002 | KR |
20040069122 | Aug 2004 | KR |
20060014942 | Feb 2006 | KR |
20060064222 | Jun 2006 | KR |
20060124430 | Dec 2006 | KR |
20070016301 | Feb 2007 | KR |
2150790 | Jun 2000 | RU |
2267156 | Dec 2005 | RU |
20050100782 | Feb 2006 | RU |
2301450 | Jun 2007 | RU |
I228364 | Feb 2005 | TW |
I252324 | Apr 2006 | TW |
I252628 | Apr 2006 | TW |
I252639 | Apr 2006 | TW |
I252671 | Apr 2006 | TW |
WO9613920 | May 1996 | WO |
WO0178423 | Oct 2001 | WO |
WO0221478 | Mar 2002 | WO |
WO0225823 | Mar 2002 | WO |
0250732 | Jun 2002 | WO |
WO02054353 | Jul 2002 | WO |
WO03107289 | Dec 2003 | WO |
WO2004008276 | Jan 2004 | WO |
2005122483 | Dec 2005 | WO |
WO2006030341 | Mar 2006 | WO |
WO2006092772 | Sep 2006 | WO |
2007026745 | Mar 2007 | WO |
WO2008027965 | Mar 2008 | WO |
2008146576 | Dec 2008 | WO |
WO2008157806 | Dec 2008 | WO |
Entry |
---|
International Search Report—PCT/US07/066903—International Search Authority, European Patent Office—Sep. 25, 2007. |
Written Opinion—PCT/US07/066903—International Search Authority, European Patent Office—Sep. 25, 2007. |
International Preliminary Report on Patentability—PCT/US07/066903—The International Bureau of WIPO, Geneva, Switzerland—Oct. 22, 2008. |
Blundo, C. et al.: “Secure E-Coupons,” Electronic Commerce Research, vol. 5, No. 1, pp. 117-139, Kluwer, Dordrecth, NL, (Jan. 1, 2005), XP002380651, ISSN: 1389-5753, Section 8.4. |
Taiwan Search Report—TW096113703—TIPO—Jun. 4, 2011. |
Bardia Alavi, et al., “Indoor Geolocation Distance Error Modeling using UWB Channel Measurements”, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications, Sep. 11-14, 2005. |
“Examples of Judging whether Business-Related Inventions are Patentable” http://www.jpo.go.jp/tetuzuki/t—tokkyo/bijinesu/biz—pat—case.htm. |
“Examples of Judging whether Business-Related Inventions are Patentable” , http://www.jpo.go.jp/tetuzuki/t—tokkyo/bijinesu/biz—pat—case.htm, Apr. 18, 2003. |
Okazaki, “Eight Methods for Capitalizing on Access Log Analysis, which are Essential to SEO, Marketing and Redesign”, Web Creators, NdN Corporation, Japan, Mar. 1, 2005, vol. 39, pp. 148-155. |
Co-pending U.S. Appl. No. 13/048,060, filed Mar. 15, 2011. |
Co-pending U.S. Appl. No. 13/363,580, filed Feb. 1, 2012. |
Number | Date | Country | |
---|---|---|---|
20070285306 A1 | Dec 2007 | US |
Number | Date | Country | |
---|---|---|---|
60793189 | Apr 2006 | US |