This disclosure generally relates to the field of automatic data collection (ADC), for example, data acquisition via radio frequency identification (RFID) tags and readers. More particularly but not exclusively, the present disclosure relates to communication between data carriers such as RFID tags.
The ADC field includes a variety of different types of ADC data carriers and ADC readers operable to read data encoded in such data carriers. For example, data may be encoded in machine-readable symbols, such as barcode symbols, area or matrix code symbols, and/or stack code symbols. Machine-readable symbols readers may employ a scanner and/or imager to capture the data encoded in the optical pattern of such machine-readable symbols. Other types of data carriers and associated readers exist, for example magnetic stripes, optical memory tags, and touch memories.
Other types of ADC carriers include RFID tags that may store data in a wirelessly accessible memory, and may include a discrete power source (i.e., an active RFID tag), or may rely on power derived from an interrogation signal (i.e., a passive RFID tag). RFID readers typically emit a radio frequency (RF) interrogation signal that causes the RFID tag to respond with a return RF signal encoding the data stored in the memory.
Identification of an RFID tag generally depends on RF energy produced by a reader or interrogator arriving at the RFID tag and returning to the reader. Multiple protocols exist for use with RFID tags. These protocols may specify, among other things, particular frequency ranges, frequency channels, modulation schemes, security schemes, and data formats.
Many ADC systems that use RFID tags employ an RFID reader in communication with one or more host computing systems that act as central depositories to store and/or process and/or share data collected by the RFID reader. In many applications, wireless communications is provided between the RFID reader and the host computing system. Wireless communications allow the RFID reader to be mobile, may lower the cost associated with installation of an ADC system, and permit flexibility in reorganizing a facility, for example a warehouse.
RFID tags typically include a semiconductor device having the memory, circuitry, and one or more conductive traces that form an antenna. Typically, RFID tags act as transponders, providing information stored in the memory in response to the RF interrogation signal received at the antenna from the reader or other interrogator. Some RFID tags include security measures, such as passwords and/or encryption. Many RFID tags also permit information to be written or stored in the memory via an RF signal.
RFID tags are generally used to provide information about the specific objects on which the RFID tags are attached. For example, RFID tags may store data that provide the identification and description of products and goods, the identity of an animal or an individual, or other information pertaining to the objects on which the RFID tags are attached.
Some types of RFID tags are capable of communicating with each other, thereby allowing formation of an RFID network. However, direct tag-to-tag communication in such RFID networks is currently possible only between specially designed battery-powered active RFID tags, such as the products available from Axcess Inc. and/or the devices used in the “Smart Dust: Autonomous sensing and communication in a cubic millimeter” project described in http://robotics.eecs.berkeley.edu/˜pister/SmartDust/. Such active RFID tags and devices can be unduly complex in design and expensive, especially in situations requiring a large number of tags where the batteries have to be continuously monitored, maintained, and replaced in order to ensure that sufficient power is available to meet operational requirements.
Moreover, traditional client-server applications and methods are not particularly suited for RFID networks that need to be capable of handling very large numbers of interconnected RFID tags in an ad hoc manner. In addition, the RFID tags may dynamically join or leave the RFID network due to a number of reasons, such as exhaustion or lost of power, signal attenuation, physical destruction, etc. The dynamic and generally random nature of the interconnection between and presence of RFID tags, combined with a potentially massive number of distributed RFID tags, as a practical matter preclude the use of traditional applications and methods for communications.
As an additional consideration, the routing table approach used in wired networks and in wireless networks (such as 802.11, ZigBee, Bluetooth, etc. wireless systems) requires a relatively large amount of memory, which is not readily available in RFID tags and therefore cannot be conveniently used in RFID networks. Furthermore, the traditional communication applications and methods are generally unsuitable in RFID networks where the complexity of interconnections between RFID tags requires such communication applications/methods to address scalability, pervasiveness, spatial distribution, power awareness, and/or other issues.
One aspect provides a method that includes forming coalitions of clusters of distributed data carriers. For each of said clusters, the method identifies a bridge data carrier that is capable to link with a bridge data carrier of another of said clusters, and enables communication between data carriers of the clusters. At least some of said data carriers include batteryless passive data carriers.
Non-limiting and non-exhaustive embodiments are described with reference to the following drawings, wherein like reference numerals refer to like parts throughout the various views unless otherwise specified. The sizes and relative positions of elements in the drawings are not necessarily drawn to scale. For example, the shapes of various elements and angles are not drawn to scale, and some of these elements are arbitrarily enlarged and positioned to improve drawing legibility. Further, the particular shapes of the elements as drawn, are not intended to convey any information regarding the actual shape of the particular elements, and have been solely selected for ease of recognition in the drawings.
In the following description, numerous specific details are given to provide a thorough understanding of embodiments. One skilled in the relevant art will recognize, however, that the embodiments can be practiced without one or more of the specific details, or with other methods, components, materials, etc. In other instances, well-known structures, materials, or operations associated with RFID tags and RFID readers, computer and/or telecommunications networks, and/or computing systems are not shown or described in detail to avoid obscuring aspects of the embodiments.
Unless the context requires otherwise, throughout the specification and claims which follow, the word “comprise” and variations thereof, such as, “comprises” and “comprising” are to be construed in an open, inclusive sense, that is as “including, but not limited to.”
Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
The headings provided herein are for convenience only and do not interpret the scope or meaning of the embodiments.
As an overview, data carriers (such as RFID tags) are formed into clusters of data carriers. Each cluster has at least one bridge data carrier that can communicate with a bridge data carrier of another cluster, thereby allowing data carriers in each cluster to communicate directly or indirectly with each other using a stochastic communication protocol method.
The clusters can be formed dynamically based on various criteria, such as the distance associated with candidate data carriers, such as a distance between a candidate data carrier and a centrally located data carrier in a cluster. Moreover, the size, shape, number of data carriers, etc. for each cluster can vary dynamically from one cluster to another.
Another embodiment relates to a synchronization of formed coalitions of clusters of distributed data carriers to sustain a collection of data of interest in a desired manner.
Embodiments further provide techniques for direct tag-to-tag communication between data carriers (such as passive RFID tags) in each cluster and/or between clusters. Such embodiments allow such data carriers to backscatter and modulate a carrier wave from a source, thereby using the backscattered and modulated carrier wave to convey data to each other.
The stochastic communication protocol method of one embodiment includes the following elements:
(a) forming stochastic coalitions of clusters from irregularly or otherwise randomly distributed RFID tags;
(b) identifying bridge tags for each cluster;
(c) synchronizing cluster formations; and
(d) enabling distribution of information between RFID tags and a data collection device.
Each of the clusters in
The various RFID tags Y in
Accordingly in one embodiment, the RFID tags Y in
The clusters C of
In mathematical terms for one embodiment, the set of RFID tags Y={y1, y2, y3, . . . , yN} is divided into k subsets (clusters C), with the RFID tags xi being centrally located tags in each cluster, where 1≦i≦k and k<N. Under these conditions, the following criterion will have a maximum value:
where S(xi) is a set of RFID tags that belong to a cluster Ci with the RFID tag xi as a central RFID tag, and μ(xi,yj) is some measure of communication quality between tags xi and yj (with i and j<N). In one embodiment, the measure of communication quality is based on emitted power, as will be explained with regards to
In the example of
In the example of
Similarly, the RFID tags yj and xi are the bridge RFID tags that can communicate with each other (as depicted by the double headed arrow between the RFID tags yj and xi), thereby allowing other RFID tags in the respective clusters 2 and 3 to indirectly communicating with each other through the bridge RFID tags yj and xi. Thus, a coalition is formed between the bridge RFID tags yj and xi, between the clusters 2 and 3, and/or between any RFID tag in cluster 2 with any RFID tag in cluster 3 (via communication with the bridge RFID tags yj and xi).
In an embodiment, a “bridge zone” in each cluster (e.g., in clusters 1 and 2) is defined by the region where the emitting power of the particular RFID tag xp of the cluster 1 that is sensed by the particular RFID tag yk of the cluster 2 exceeds a cumulative power that is sensed by the particular RFID tag yk from all of the RFID tags in the cluster 1 by some specified threshold value. In some embodiments, the specified threshold value exceeded by the cumulative power is uniform among the various clusters. In another embodiment, the specified threshold value can be different among the various clusters. For instance, the specified threshold value between clusters 1 and 2 can be different than the specified threshold value between clusters 2 and 3.
In an embodiment, a single cluster may have different bridge RFID tags that can be used to bridge with respective different other clusters. Further in an embodiment, a single cluster may have more than one bridge RFID tag to bridge with some other single cluster, and/or may bridge with more than one bridge RFID tag of that other single clusters. Still further in an embodiment, various RFID tags may be designated as backup bridge RFID tags, if a primary bridge RFID tag becomes disabled, is removed from the cluster, or otherwise becomes incapable of operating as a bridge RFID tag.
In yet further embodiments, the identification of bridge RFID tags may change dynamically, as the shape or size of a cluster changes and/or as additional RFID tags are added/removed from the cluster. It is therefore evident from the above that individual RFID tags are capable of communicating with other RFID tags, whether in the same cluster or in some other cluster, by “hopping” from one RFID tag to another communicatively compatible RFID tag in the same cluster and between clusters.
In
As depicted in
In another technique, a particular RFID tag is designated as a central RFID tag xi for a cluster. Then, the other RFID tags of the cluster are identified and selected based on some specified distance from the central tag xi. For example, RFID tags are included in the same cluster if the distance between such RFID tags and the central RFID tag xi is less than some specified distance. Any RFID tag that exceeds the specified distance to the central RFID tag xi of the cluster is rejected for inclusion in the cluster, and is considered instead for inclusion in some other cluster.
Again and as previously explained above, the size, shape, number of RFID tags, etc. of each cluster can dynamically vary from one cluster to another based on various factors. Moreover, it is possible to have a cluster having only a single RFID tag. Such single RFID tag can thus act as its own bridge RFID tag to other clusters.
In an embodiment, each of the clusters previously described above includes at least one active RFID tag and one or more passive RFID tags. In another embodiment, all RFID tags in one or more of the clusters may be passive RFID tags, and one or more devices (such as an automatic data collection device, including RFID readers) can provide the RF field(s) to power such passive RFID tags to perform the various functionalities described herein. In yet other embodiments, some clusters may have one active RFID tag and one or more passive RFID tags, while other clusters may have only passive RFID tags, while still other clusters may have only active RFID tags—all of these clusters have the capability to communicate with each other (directly or indirectly) using the methods described herein.
In some embodiments, certain operations of the method 500 can be implemented in software or other machine-readable instruction stored on a machine-readable medium and executable by a processor. For example, some of the operations in the method 500 can be performed by a data collection device (such as an RFID reader) in one embodiment, using one or more processors and a storage medium of the data collection device.
At a block 502, all of the RFID tags are assigned to a particular cluster that has some RFID tag xi as a central tag, thereby forming clusters of RFID tags. As described above with reference to
At a block 504, bridge RFID tags are identified and selected. As described above for one embodiment, the identification and selection of bridge RFID tags can be performed based on bridge zones where the emitting power of the particular RFID tag of a first cluster that is sensed by a particular RFID tag of a second cluster exceeds some cumulative power of all RFID tags of the first cluster that is sensed by the particular RFID tag of the second cluster.
At a block 506 for one embodiment, communication between and/or within clusters is synchronized, such as time synchronization of transmission and/or reception. The synchronization can be localized (e.g., synchronization between neighboring RFID tags in a same and/or adjacent clusters) and/or at least partially global (e.g., synchronization between all RFID tags in a same cluster, synchronization between a plurality of clusters, synchronization of all RFID tags of all clusters). In one embodiment, such synchronization can be performed using methods known to persons skilled in the art. Other embodiments can use the synchronization techniques disclosed in U.S. Provisional Patent Application Ser. No. 60/610,759, entitled “SYNCHRONIZATION OF ADAPTIVE SELF-CONFIGURING WIRELESS NETWORK OF TRANSPONDERS,” filed Dec. 1, 2004, assigned to the same assignee as the present application, and incorporated herein by reference in its entirety.
One example of such synchronization techniques includes global-based time synchronization in which all RFID tags set time to send/receive data based on a single (e.g., a common) time clock located inside and/or outside of the RFID network. In one embodiment that can implement this synchronization technique, an RFID tag is able to receive data even though such an RFID tag may not necessarily have the capability to communicate the acknowledgement of a successful reception of the data, due to factors such as power constraints. This synchronization technique is used for global synchronization in one embodiment, but can also be adapted for local synchronization.
Another example is time-stamped packet communication in which the packets or other data format received by a recipient RFID tag includes a time of transmission from a sender RFID tag. Embodiments can implement this synchronization technique in a global and/or localized basis.
Yet another example is tag-to-tag synchronization in which the time for transmission/reception is set by an outside system and propagated to the RFID tags. Such propagation can be done by having the RFID tags within and/between clusters send the time from one RFID tag to another.
A variation to the tag-to-tag synchronization involves an RFID tag (performing managerial duties for its cluster) that sets the time and propagates the time to collaborating neighbor RFID tags. In one embodiment, the central RFID tag xi can be used as the managerial tag, although other RFID tags in the cluster may also be used as primary and/or backup managerial RFID tags. The cluster's time may be synchronized locally or globally when a tag-to-tag synchronization technique is used.
Still another example of synchronization involves multi-hop time synchronization in which time error is compensated/corrected during propagation of data. In still a further example, RFID tags are capable of identifying a synchronization mode and can start corroboration with neighboring RFID tags in accordance with a proposed synchronization mode. Furthermore, in the case of multiple clusters of RFID tags, RFID tags may reconcile multiple global times to continue an appropriate communication mode.
In other embodiments, the synchronization at the block 506 need not be performed and/or need be performed only on a limited basis. Thus for such embodiments, there need not necessarily be synchronization between RFID tags in a same cluster, between RFID tags of different clusters, between clusters, and/or between other communicating elements of the RFID networks.
At a block 508 in the method 500 of
More particularly and beginning with
For embodiments of the system 100 having RFID tags, the system 600 includes an RF carrier wave (RF CW) source 602 that generates a carrier wave 604. The RF CW source 602 can be embodied as an automatic data collection device (such as an RFID reader), a cellular telephone or other portable communication device, another RFID tag, and or any other device(s) or combination thereof that are capable of generating an unmodulated carrier wave 604 that can be used for direct tag-to-tag communication, as well as a power source for the RFID tags 1 and 2. In another embodiment, the carrier wave 604 is output from the RF CW source 602 in a modulated form, and is then further modulated by the RFID tags 1 and 2 during tag-to-tag communication.
In one embodiment, the RF CW source 602 can be switched ON or OFF mechanically (such as by an operator) or electronically (such as in response to a wireless signal). The RF CW source 602 can be powered from a portable battery, thereby providing a portable solution, or from a stationary source of power, for example a 120 V AC voltage supply, thereby providing an industrial solution. Moreover, the RF CW source 602 can be integrated as an operating mode option in a cellular telephone or other device, and produced inexpensively since no frequency stability or digital signal processing capability is used in one embodiment.
An example embodiment of the RF CW source 602 can use a 5 V battery with up to 1 watt of output RF power, using Micro Device's RF2131 power amplifier integrated circuit (IC) with resonant feedback. Additionally in an embodiment, several RC CW sources 602 can be arranged in an array or other pattern so as to cover a large area where clusters of RFID tags are present.
In operation the carrier wave 604 is backscattered, and the RFID tags 1 and 2 can communicate with each other by modulating the backscattered carrier wave 604. Thus, the RFID tag 1 can send an interrogation signal 606 to the RFID tag 2, and the RFID tag 2 can reply to the interrogation signal 606 with a reply signal 608, and/or vice versa. The interrogation signal 606 and the return signal 608 are thus the modulated backscattered carrier wave 604. The interrogation signal 606 and the return signal 608 can be demodulated by the RFID tags 2 and 1, respectively, to obtain the data encoded therein.
The method of communication of
Example waveforms at terminals of the RFID tags 1 and 2 during tag-to-tag communication are illustrated in
The carrier wave 604 is depicted in
The RF CW source 602 is assumed to output the carrier wave 604 with a power value of +36 dBm. The free space path loss from the RF CW source 602 to the RFID tag 1 (assuming a distance of 4 feet between the RF CW source 602 and the RFID tag 1, with a 915 MHz frequency for the carrier wave 604) is −33 dB, thereby leaving +3 dBm of power available. There is then a backscattering modulation loss of −6 dB associated with the RFID tag 1, as well as a coupling loss of −6 dB between the RFID tags 1 and 2 in close proximity. The resulting backscattering differential modulated power received by the RFID tag 2 is thus −9 dBm. If the minimum power required for tag-to-tag communication is −10 dBm, then the resultant −9 dBm power is sufficient to meet operational requirements.
In one embodiment, the carrier wave 604 from the RF CW source 602 comprises an interrogation signal that both powers and interrogates the RFID tag 1 and/or the RFID tag 2. Such an interrogation signal can then be modulated by the RFID tag 1 and/or the RFID tag 2 in the manner described above, thereby providing tag-to-tag communication capabilities in existing passive RFID networks/systems.
In another embodiment, one of the RFID tags (such as the RFID tag 2) can comprise a passive RFID tag with capabilities to receive interrogation signals and to send return signals, and another one of the RFID tags (such as the RFID tag 1) can comprise a passive RFID tag having additional capability to independently broadcast or otherwise issue tag queries (i.e., interrogation signals), alternatively or additionally to using the carrier wave 604 for such tag queries. Such an embodiment of the RFID tag 1 obtains power from the carrier wave 604 (or from some other source) and then waits for the RF CW source 602 to transmit an interrogation signal, which may be in the form of a modulation of the carrier wave 604 and/or the issuance of another signal. If the RFID tag 1 does not receive any interrogation signals from the RF CW source 1 within a period of time, then the RFID tag 1 starts to periodically broadcast (such as by backscattering) interrogation signals itself to the RFID tag 2 and/or to other RFID tags. Such interrogation signals can comprise a modulated or unmodulated carrier wave similar to the carrier wave 604, in one embodiment.
In another embodiment, both the RFID tags 1 and 2 can have the capability to issue interrogation signals. In still further embodiments, RFID tags of the various clusters can comprise a mix of RFID tags with or without this additional capability to issue interrogation signals.
In some embodiments, certain operations of the method 900 can be implemented in software or other machine-readable instruction stored on a machine-readable medium and executable by a processor. For example, some of the operations in the method 900 can be performed by one or more controllers or other processor(s) and a storage medium in an RFID tag.
At a block 902, the RFID tags 1 and 2 receive the carrier wave 604 from the RF CW source 602 and power up. A timer in the RFID tag 1 is started at a block 904. If the RFID tag 1 receives an interrogation signal at a block 906 from the RF CW source 602 and/or from some other querying device, then the RFID tag 908 operates in a normal tag mode at a block 908, such as by generating and sending an appropriate return signal to the querying device(s).
However, if the timer expires at a block 910 and the RFID tag 1 has not received an interrogation signal at the block 906, then the RFID tag 1 sends one or more interrogation signals or other types of queries at a block 912 to an RFID tag (such as the RFID tag 2). In one embodiment, the queries at the block 912 are broadcast periodically, such as by backscattering. In other embodiments, the queries need not necessarily be sent in a periodical manner, and can be sent in a somewhat random manner, for example.
If the RFID tag 1 does not receive any return signals or other response(s) to the queries at a block 914, then the RFID tag 1 continues to issue queries at the block 912. However, if the RFID tag 1 receives one or more responses at the block 914, then the RFID tag 1 generates and sends back (such as by backscattering) a corresponding one or more acknowledgements at a block 916.
At a block 918, the RFID tag 1 receives an RFID tag identifier (such as the identifier for the RFID tag 2) from the RFID tag 2 during the direct tag-to-tag communication and stores this received RFID tag identifier in memory. The method 900 then repeats at the block 904 in which the timer of the RFID tag 1 is restarted as the RFID tag 1 monitors for additional tag queries.
The implementation illustrated in
The exchange of business card information can be performed if there is an area 1004 where the carrier wave 604 is present to energize the RFID tags embedded in the business cards 1000 and 1002. The area 1004 can be an area in a conference center, for example, is covered by the carrier wave 604 generated by the RF CW source 602. Alternatively or additionally, the carrier wave 604 can be generated from a device such as a cellular telephone 1006 or other device capable to generate the carrier wave 604. In one embodiment, the cellular telephone 1006 can be a conventional cellular telephone that does not require modification in order to generate the carrier wave 604.
The two persons can “rub” their business cards 1000 and 1002 together, or otherwise place the business cards 1000 and 100 in close proximity to each other, in order to conduct the tag-to-tag communication to exchange and store business card information of the other person. The two persons can then go their separate ways, and can later retrieve the stored business card information (such as at home, at the office, or at some other location). The business card information stored in the embedded RFID tag of the business cards 1000 and 1002 can be retrieved at such other locations using an automatic data collection device (such as an RFID reader), a personal computer of laptop with RFID-reading capability, or other device capable to read RFID tags.
In the example of
The person can read the information from selected advertisements 1202 using a personal passive RFID tag 1206, such as by “swiping” the RFID tag 1206 over the selected advertisement(s) 1202. The information read from the RFID tags of the advertisements 1202 can then be stored by the RFID tag 1206 of the person for later review or other use.
In an embodiment, the RFID tag 1206 of the user can be embedded in a business card or other object, in a handheld device portable communication device (such as a cellular telephone, pager, PDA, Blackberry, Palm Pilot, etc.), or some other compact and portable apparatus that can be conveniently carried by the person and usable to “swipe” over one or more RFID tags or other target data carriers.
An embodiment of such an apparatus having the RFID tag for reading other RFID tags is shown at 1300 in
Advantages of the apparatus 1300 are compact size, lightweight, batteryless, and relatively inexpensive (for example, less than a few dollars each). Moreover, such an apparatus 1300 can operate anywhere in a vicinity of RFID tags that are covered by the carrier wave 604 generated by the RF CW source 602.
Accordingly from the various embodiments of the RFID clusters and tag-to-tag communication techniques between RFID tags of such clusters described above, it is clear that such embodiments can be used for real time applications and/or to meet other application requirements. Additional advantages of such embodiments can further include, but not be limited to, indifference to RFID network topology changes (e.g., adaptive and self-configuring clusters), energy efficient functionality, extended range for automatic data collection device or other device for collecting data (since tags can communicate directly or indirectly with each other using bridge tags), thereby extending the range for reading tags), self-organizing capability, and so forth.
All of the above U.S. patents, U.S. patent application publications, U.S. patent applications, foreign patents, foreign patent applications and non-patent publications referred to in this specification and/or listed in the Application Data Sheet, are incorporated herein by reference, in their entirety.
The above description of illustrated embodiments, including what is described in the Abstract, is not intended to be exhaustive or to limit the invention to the precise forms disclosed. While specific embodiments and examples are described herein for illustrative purposes, various equivalent modifications are possible within the scope of the invention and can be made without deviating from the spirit and scope of the invention.
For example, embodiments have been described above in which the RFID tags are attached to objects, and provide data pertaining to the objects. In other embodiments, the RFID tags may be provided with sensor elements, such that the RFID tags can detect and collect data regarding temperature, humidity, air pressure, lighting levels, presence of certain chemical substances, presence and strength of electromagnetic or other types of signals, or other environmental condition that can be sensed and stored by the RFID tags. Such detected and collected data can then be provided to one or more RFID readers and/or to other RFID tags using the techniques described above.
Furthermore, various embodiments have been described above in the context of the data carrier being in the form of an RFID tag. It is appreciated that other embodiments can be provided for use with other types of data carriers, such as acoustical tags. In such other embodiments, the carrier wave (CW) can be in the form of an acoustical wave. Further in such embodiments, the acoustical tags can be formed into clusters and can communicate with each other in a manner analogous to the techniques described above. Further, various systems can include clusters formed entirely of acoustical tags; clusters formed from a mix of acoustical tags, RFID tags, and/or other types of tags; and/or clusters formed from various other combinations of tag types that can communicate with similarly or differently formed clusters.
In the embodiments described above, various signals (such as the carrier wave 604) have been described as being an RF signal. It is understood that the RF signal(s) can be included in at least the radio band and microwave band of frequencies.
These and other modifications can be made to the embodiments in light of the above detailed description. The terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification and the claims. Rather, the scope of the invention is to be determined entirely by the following claims, which are to be construed in accordance with established doctrines of claim interpretation.
The present application is a national stage application of Patent Cooperation Treaty (PCT) Application Ser. No. PCT/US2006/036801, filed Sep. 21, 2006, which in turn claims priority to U.S. Provisional Patent Application Ser. No. 60/719,102, entitled “STOCHASTIC COMMUNICATION PROTOCOL AND METHOD OF COALITION FORMATION FOR RF ID TAGS,” filed Sep. 21, 2005. These applications are assigned to the same assignee as the present application, and incorporated herein by reference in their entireties.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/US2006/036801 | 9/21/2006 | WO | 00 | 3/20/2008 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2007/035863 | 3/29/2007 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
3710337 | Grant | Jan 1973 | A |
3852755 | Works et al. | Dec 1974 | A |
3949403 | Yoshida et al. | Apr 1976 | A |
4056710 | Shepardson et al. | Nov 1977 | A |
4079482 | Yeh | Mar 1978 | A |
4080603 | Moody | Mar 1978 | A |
4307293 | Lazzarotti et al. | Dec 1981 | A |
4344184 | Edwards | Aug 1982 | A |
4354101 | Hester et al. | Oct 1982 | A |
4385231 | Mizutani et al. | May 1983 | A |
4443794 | Sakurai | Apr 1984 | A |
4523087 | Benton | Jun 1985 | A |
4562102 | Rabuse et al. | Dec 1985 | A |
4567361 | Rosenthal | Jan 1986 | A |
4575621 | Dreifus | Mar 1986 | A |
4589144 | Namba | May 1986 | A |
4728784 | Stewart | Mar 1988 | A |
4742567 | Ohe et al. | May 1988 | A |
4782221 | Brass et al. | Nov 1988 | A |
4785451 | Sako et al. | Nov 1988 | A |
4786792 | Pierce et al. | Nov 1988 | A |
4792910 | Lange | Dec 1988 | A |
4794239 | Allais | Dec 1988 | A |
4810867 | Speicher | Mar 1989 | A |
4816839 | Landt | Mar 1989 | A |
4823311 | Hunter et al. | Apr 1989 | A |
4827395 | Anders et al. | May 1989 | A |
4841128 | Gröttrup et al. | Jun 1989 | A |
4853705 | Landt | Aug 1989 | A |
4855581 | Mertel et al. | Aug 1989 | A |
4915519 | Afzali-Ardakani et al. | Apr 1990 | A |
4916296 | Streck | Apr 1990 | A |
4980544 | Winter | Dec 1990 | A |
5047860 | Rogalski | Sep 1991 | A |
5075691 | Garay et al. | Dec 1991 | A |
5095382 | Abe | Mar 1992 | A |
5097263 | Delpech et al. | Mar 1992 | A |
5097484 | Akaiwa | Mar 1992 | A |
5101200 | Swett | Mar 1992 | A |
5128526 | Yoshida | Jul 1992 | A |
5142292 | Chang | Aug 1992 | A |
5160023 | Adams et al. | Nov 1992 | A |
5184005 | Ukai et al. | Feb 1993 | A |
5204515 | Yoshida | Apr 1993 | A |
5216233 | Main et al. | Jun 1993 | A |
5216419 | Fujisaka et al. | Jun 1993 | A |
5218689 | Hotle | Jun 1993 | A |
5220335 | Huang | Jun 1993 | A |
5243655 | Wang | Sep 1993 | A |
5267800 | Petteruti et al. | Dec 1993 | A |
5278395 | Benezet | Jan 1994 | A |
5280159 | Schultz et al. | Jan 1994 | A |
5298731 | Ett | Mar 1994 | A |
5300761 | Kasahara et al. | Apr 1994 | A |
5315511 | Matsuura et al. | May 1994 | A |
5324922 | Roberts | Jun 1994 | A |
5324927 | Williams | Jun 1994 | A |
5341381 | Fuller | Aug 1994 | A |
5380998 | Bossen et al. | Jan 1995 | A |
5382778 | Takahira et al. | Jan 1995 | A |
5382784 | Eberhardt | Jan 1995 | A |
5387783 | Mihm et al. | Feb 1995 | A |
5389770 | Ackley | Feb 1995 | A |
5420403 | Allum et al. | May 1995 | A |
5430441 | Bickley et al. | Jul 1995 | A |
5434401 | Bauser | Jul 1995 | A |
5434572 | Smith | Jul 1995 | A |
5448110 | Tuttle et al. | Sep 1995 | A |
5463643 | Gaskins et al. | Oct 1995 | A |
5466501 | Logan et al. | Nov 1995 | A |
5479515 | Longacre, Jr. | Dec 1995 | A |
5484997 | Haynes | Jan 1996 | A |
5489908 | Orthmann et al. | Feb 1996 | A |
5497701 | Uland | Mar 1996 | A |
5499397 | Wadin et al. | Mar 1996 | A |
5514858 | Ackley | May 1996 | A |
5521601 | Kandlur et al. | May 1996 | A |
5521815 | Rose, Jr. | May 1996 | A |
5528222 | Moskowitz et al. | Jun 1996 | A |
5536924 | Ackley | Jul 1996 | A |
5539191 | Ackley | Jul 1996 | A |
5548110 | Storch et al. | Aug 1996 | A |
5550365 | Klancnik et al. | Aug 1996 | A |
5550547 | Chan et al. | Aug 1996 | A |
5552591 | Bossen et al. | Sep 1996 | A |
5553041 | Inagawa et al. | Sep 1996 | A |
5553084 | Ackley et al. | Sep 1996 | A |
5554974 | Brady et al. | Sep 1996 | A |
5557092 | Ackley et al. | Sep 1996 | A |
5560293 | Boreali et al. | Oct 1996 | A |
5563402 | Reddersen et al. | Oct 1996 | A |
5565847 | Gambino et al. | Oct 1996 | A |
5566441 | Marsh et al. | Oct 1996 | A |
5588005 | Ali et al. | Dec 1996 | A |
5594228 | Swartz et al. | Jan 1997 | A |
5612531 | Barkan | Mar 1997 | A |
5619027 | Ackley | Apr 1997 | A |
5629508 | Findley, Jr. et al. | May 1997 | A |
5640002 | Ruppert et al. | Jun 1997 | A |
5659431 | Ackley | Aug 1997 | A |
5673037 | Cesar et al. | Sep 1997 | A |
5712643 | Skladany | Jan 1998 | A |
5723853 | Longacre, Jr. et al. | Mar 1998 | A |
5729201 | Jahnes et al. | Mar 1998 | A |
5761219 | Maltsev | Jun 1998 | A |
5761529 | Raji et al. | Jun 1998 | A |
5763867 | Main et al. | Jun 1998 | A |
5767498 | Heske, III et al. | Jun 1998 | A |
5777310 | Liu et al. | Jul 1998 | A |
5777561 | Chieu et al. | Jul 1998 | A |
5782496 | Casper et al. | Jul 1998 | A |
5786626 | Brady et al. | Jul 1998 | A |
5788796 | Look et al. | Aug 1998 | A |
5805082 | Hassett | Sep 1998 | A |
5811781 | Ackley | Sep 1998 | A |
5812065 | Schrott et al. | Sep 1998 | A |
5818031 | Endoh | Oct 1998 | A |
5840657 | Mehta et al. | Nov 1998 | A |
5842118 | Wood, Jr. | Nov 1998 | A |
5874896 | Lowe et al. | Feb 1999 | A |
5874902 | Heinrich et al. | Feb 1999 | A |
5923305 | Sadler et al. | Jul 1999 | A |
5942987 | Heinrich et al. | Aug 1999 | A |
5956649 | Mitra et al. | Sep 1999 | A |
5972156 | Brady et al. | Oct 1999 | A |
5973598 | Beigel | Oct 1999 | A |
5973600 | Mosher, Jr. | Oct 1999 | A |
5979773 | Findley, Jr. et al. | Nov 1999 | A |
5982904 | Eghtesadi et al. | Nov 1999 | A |
5993093 | Schoennauer et al. | Nov 1999 | A |
6003775 | Ackley | Dec 1999 | A |
6012638 | Ackley et al. | Jan 2000 | A |
6019865 | Palmer et al. | Feb 2000 | A |
6024289 | Ackley | Feb 2000 | A |
6025784 | Mish | Feb 2000 | A |
6076064 | Rose, Jr. | Jun 2000 | A |
6078259 | Brady et al. | Jun 2000 | A |
6081718 | Ando et al. | Jun 2000 | A |
6092133 | Erola et al. | Jul 2000 | A |
6097301 | Tuttle | Aug 2000 | A |
6104311 | Lastinger | Aug 2000 | A |
6118379 | Kodukula et al. | Sep 2000 | A |
6123796 | Kathmann et al. | Sep 2000 | A |
6149059 | Ackley | Nov 2000 | A |
6180198 | Bond | Jan 2001 | B1 |
6192222 | Greeff et al. | Feb 2001 | B1 |
6210515 | Boreali et al. | Apr 2001 | B1 |
6243013 | Duan et al. | Jun 2001 | B1 |
6246326 | Wiklof et al. | Jun 2001 | B1 |
6259372 | Taranowski et al. | Jul 2001 | B1 |
6272242 | Saitoh et al. | Aug 2001 | B1 |
6278413 | Hugh et al. | Aug 2001 | B1 |
6285342 | Brady et al. | Sep 2001 | B1 |
6286763 | Reynolds et al. | Sep 2001 | B1 |
6321986 | Ackley | Nov 2001 | B1 |
6327972 | Heredia et al. | Dec 2001 | B2 |
6360208 | Ohanian et al. | Mar 2002 | B1 |
6371375 | Ackley et al. | Apr 2002 | B1 |
6409401 | Petteruti et al. | Jun 2002 | B1 |
6422476 | Ackley | Jul 2002 | B1 |
6512482 | Nelson et al. | Jan 2003 | B1 |
6570386 | Goldstein | May 2003 | B2 |
6585159 | Meier et al. | Jul 2003 | B1 |
6585437 | Wiklof et al. | Jul 2003 | B1 |
6593853 | Barrett et al. | Jul 2003 | B1 |
6664897 | Pape et al. | Dec 2003 | B2 |
6677852 | Landt | Jan 2004 | B1 |
6707376 | Patterson et al. | Mar 2004 | B1 |
6899476 | Barrus et al. | May 2005 | B1 |
6917291 | Allen | Jul 2005 | B2 |
6933848 | Stewart et al. | Aug 2005 | B1 |
6967577 | Taylor et al. | Nov 2005 | B2 |
7071825 | VoBa | Jul 2006 | B2 |
7121467 | Winter et al. | Oct 2006 | B2 |
836531 | Pickard | Nov 2006 | A1 |
837616 | Dunwoody | Dec 2006 | A1 |
7259676 | Knadle et al. | Aug 2007 | B2 |
7323977 | Kodukula et al. | Jan 2008 | B2 |
7323989 | Allen | Jan 2008 | B2 |
7413124 | Frank et al. | Aug 2008 | B2 |
7423539 | Hyde et al. | Sep 2008 | B2 |
7499648 | Draper et al. | Mar 2009 | B2 |
7528728 | Oliver et al. | May 2009 | B2 |
7546955 | Marty et al. | Jun 2009 | B2 |
7579955 | Pillai | Aug 2009 | B2 |
7667589 | Desmons et al. | Feb 2010 | B2 |
7893813 | Nikitin et al. | Feb 2011 | B2 |
20010048361 | Mays et al. | Dec 2001 | A1 |
20030012168 | Elson et al. | Jan 2003 | A1 |
20030218069 | Meier et al. | Nov 2003 | A1 |
20040166807 | Vesikivi et al. | Aug 2004 | A1 |
20050052279 | Bridgelall | Mar 2005 | A1 |
20050057370 | Warrior et al. | Mar 2005 | A1 |
20050120260 | Suzuki et al. | Jun 2005 | A1 |
20050212674 | Desmons et al. | Sep 2005 | A1 |
20060022801 | Husak et al. | Feb 2006 | A1 |
20060028343 | Taylor et al. | Feb 2006 | A1 |
20060267731 | Chen | Nov 2006 | A1 |
20070017983 | Frank et al. | Jan 2007 | A1 |
20070024423 | Nikitin et al. | Feb 2007 | A1 |
20070081671 | Ross, Jr. et al. | Apr 2007 | A1 |
20070194929 | Wagner et al. | Aug 2007 | A1 |
20070229261 | Zimmerman et al. | Oct 2007 | A1 |
20070296582 | Rofougaran | Dec 2007 | A1 |
20070296583 | Rofougaran | Dec 2007 | A1 |
20080011822 | Ackley et al. | Jan 2008 | A1 |
20080036605 | Pillai | Feb 2008 | A1 |
20080188209 | Dorogusker et al. | Aug 2008 | A1 |
20080231451 | Kamel | Sep 2008 | A1 |
20090272812 | Marty et al. | Nov 2009 | A1 |
Number | Date | Country |
---|---|---|
33 30 261 | Mar 1985 | DE |
0 595 549 | May 1994 | EP |
0 667 592 | Aug 1995 | EP |
0 718 912 | Jun 1996 | EP |
2 760 209 | Sep 1998 | FR |
3-113673 | May 1991 | JP |
10-40329 | Feb 1998 | JP |
11-221948 | Aug 1999 | JP |
WO 9512863 | May 1995 | WO |
WO 9613803 | May 1996 | WO |
WO 9847101 | Oct 1998 | WO |
2007035863 | Mar 2007 | WO |
Number | Date | Country | |
---|---|---|---|
20080252424 A1 | Oct 2008 | US |
Number | Date | Country | |
---|---|---|---|
60719102 | Sep 2005 | US |