U.S. patent number RE41,352 [Application Number 11/862,124] was granted by the patent office on 2010-05-25 for method of addressing messages and communications.
This patent grant is currently assigned to Keystone Technology Solutions, LLC. Invention is credited to Clifton W. Wood, Jr..
United States Patent |
RE41,352 |
Wood, Jr. |
May 25, 2010 |
Method of addressing messages and communications
Abstract
A method of establishing wireless communications between an
interrogator and individual ones of multiple wireless
identification devices.[., the method comprising utilizing a tree
search method to attempt to identify individual ones of the
multiple wireless identification devices so as to be able to
perform communications, without collision, between the interrogator
and individual ones of the multiple wireless identification
devices, a search tree being defined for the tree search method,
the tree having multiple nodes respectively representing subgroups
of the multiple wireless identification devices, wherein the
interrogator transmits a command at a node, requesting that devices
within the subgroup represented by the node respond, wherein the
interrogator determines if a collision occurs in response to the
command and, if not, repeats the command at the same node. An
interrogator configured to transmit a command at a node, requesting
that devices within the subgroup represented by the node respond,
the interrogator further being configured to determine if a
collision occurs in response to the command and, if not, to repeat
the command at the same node.]. . .Iadd.In one aspect, a method
implemented in an RFID device includes: receiving a first command,
comprising a first set of bit values, from an interrogator to
select the RFID device based on a comparison between the first set
of bit values and data stored in the RFID device; transmitting a
response to the first command, the response including an identifier
of the RFID device; if the response is received at an interrogator,
remaining silent when the first command is subsequently repeated;
and if the response is not received at the interrogator,
re-transmitting the response when the first command is subsequently
repeated..Iaddend.
Inventors: |
Wood, Jr.; Clifton W. (Tulsa,
OK) |
Assignee: |
Keystone Technology Solutions,
LLC (Boise, ID)
|
Family
ID: |
21829591 |
Appl.
No.: |
11/862,124 |
Filed: |
September 26, 2007 |
Related U.S. Patent Documents
|
|
|
|
|
|
|
Application
Number |
Filing Date |
Patent Number |
Issue Date |
|
|
10652573 |
Aug 28, 2003 |
|
|
|
|
09026050 |
Feb 19, 1998 |
6061344 |
|
|
Reissue of: |
09556235 |
Apr 24, 2000 |
06282186 |
Aug 28, 2001 |
|
|
Current U.S.
Class: |
370/346 |
Current CPC
Class: |
H04L
41/12 (20130101); H04L 41/0893 (20130101); H04W
4/00 (20130101) |
Current International
Class: |
H04L
1/00 (20060101) |
References Cited
[Referenced By]
U.S. Patent Documents
|
|
|
4075632 |
February 1978 |
Baldwin et al. |
4761778 |
August 1988 |
Hui |
4796023 |
January 1989 |
King |
4799059 |
January 1989 |
Grindahl et al. |
4845504 |
July 1989 |
Roberts et al. |
4862453 |
August 1989 |
West et al. |
4926182 |
May 1990 |
Ohta et al. |
4955018 |
September 1990 |
Twitty et al. |
4969146 |
November 1990 |
Twitty et al. |
5019813 |
May 1991 |
Kip et al. |
5025486 |
June 1991 |
Klughart |
5046066 |
September 1991 |
Messenger |
5055968 |
October 1991 |
Nishi et al. |
5121407 |
June 1992 |
Partyka et al. |
5124697 |
June 1992 |
Moore |
5142694 |
August 1992 |
Jackson et al. |
5144313 |
September 1992 |
Kirknes |
5144668 |
September 1992 |
Malek et al. |
5150114 |
September 1992 |
Johansson |
5150310 |
September 1992 |
Greenspun et al. |
5164985 |
November 1992 |
Nysen et al. |
5168510 |
December 1992 |
Hill |
5194860 |
March 1993 |
Jones et al. |
5231646 |
July 1993 |
Heath et al. |
5266925 |
November 1993 |
Vercellotti et al. |
5307463 |
April 1994 |
Hyatt et al. |
5365551 |
November 1994 |
Snodgrass et al. |
5373503 |
December 1994 |
Chen |
5449296 |
September 1995 |
Jacobsen et al. |
5461627 |
October 1995 |
Rypinski |
5479416 |
December 1995 |
Snodgrass et al. |
5500650 |
March 1996 |
Snodgrass et al. |
5530702 |
June 1996 |
Palmer et al. |
5550547 |
August 1996 |
Chan et al. |
5583850 |
December 1996 |
Snodgrass et al. |
5608739 |
March 1997 |
Snodgrass et al. |
5619648 |
April 1997 |
Canale et al. |
5621412 |
April 1997 |
Sharpe et al. |
5625628 |
April 1997 |
Heath |
5627544 |
May 1997 |
Snodgrass et al. |
5640151 |
June 1997 |
Reis et al. |
5649296 |
July 1997 |
MacLellan et al. |
5686902 |
November 1997 |
Reis et al. |
5790946 |
August 1998 |
Rotzoll |
5805586 |
September 1998 |
Perreault et al. |
5841770 |
November 1998 |
Snodgrass et al. |
5914671 |
June 1999 |
Tuttle |
5936560 |
August 1999 |
Higuchi |
5940006 |
August 1999 |
MacLellan et al. |
5942987 |
August 1999 |
Heinrich et al. |
5952922 |
September 1999 |
Shober |
5966471 |
October 1999 |
Fisher et al. |
5974078 |
October 1999 |
Tuttle et al. |
5988510 |
November 1999 |
Tuttle et al. |
6038455 |
March 2000 |
Gardner et al. |
6061344 |
May 2000 |
Wood, Jr. |
6072801 |
June 2000 |
Wood, Jr. et al. |
6075973 |
June 2000 |
Greeff et al. |
6097292 |
August 2000 |
Kelly et al. |
6104333 |
August 2000 |
Wood, Jr. |
6118789 |
September 2000 |
Wood, Jr. |
6130602 |
October 2000 |
O'Toole et al. |
6150921 |
November 2000 |
Werb et al. |
6157633 |
December 2000 |
Wright |
6169474 |
January 2001 |
Greeff et al. |
6177858 |
January 2001 |
Raimbault et al. |
6192222 |
February 2001 |
Greeff et al. |
6216132 |
April 2001 |
Chandra et al. |
6226300 |
May 2001 |
Hush et al. |
6229987 |
May 2001 |
Greeff et al. |
6243012 |
June 2001 |
Shober et al. |
6265962 |
July 2001 |
Black et al. |
6265963 |
July 2001 |
Wood, Jr. |
6275476 |
August 2001 |
Wood, Jr. |
6282186 |
August 2001 |
Wood, Jr. |
6288629 |
September 2001 |
Cofino et al. |
6289209 |
September 2001 |
Wood, Jr. |
6307847 |
October 2001 |
Wood, Jr. |
6307848 |
October 2001 |
Wood, Jr. et al. |
6324211 |
November 2001 |
Ovard et al. |
6415439 |
July 2002 |
Randell et al. |
6459726 |
October 2002 |
Ovard et al. |
6483427 |
November 2002 |
Werb |
6566997 |
May 2003 |
Bradin |
6570487 |
May 2003 |
Steeves |
6707376 |
March 2004 |
Patterson et al. |
6714559 |
March 2004 |
Meier |
6771634 |
August 2004 |
Wright |
6778096 |
August 2004 |
Ward et al. |
6784787 |
August 2004 |
Atkins |
6850510 |
February 2005 |
Kubler et al. |
6919793 |
July 2005 |
Heinrich et al. |
7026935 |
April 2006 |
Diorio et al. |
7315522 |
January 2008 |
Wood, Jr. |
7385477 |
June 2008 |
O'Toole et al. |
2003/0235184 |
December 2003 |
Dorenbosch |
2005/0060069 |
March 2005 |
Breed et al. |
2005/0207364 |
September 2005 |
Wood, Jr. |
2006/0022800 |
February 2006 |
Krishna et al. |
2006/0022801 |
February 2006 |
Husak et al. |
2006/0022815 |
February 2006 |
Fischer |
2006/0056325 |
March 2006 |
Wood, Jr. |
2006/0209781 |
September 2006 |
Wood, Jr. |
2007/0139164 |
June 2007 |
O'Toole et al. |
2007/0176751 |
August 2007 |
Cesar et al. |
2008/0007412 |
January 2008 |
Wood, Jr. |
2008/0042806 |
February 2008 |
Wood, Jr. |
2008/0048832 |
February 2008 |
O'Toole et al. |
2008/0048835 |
February 2008 |
O'Toole et al. |
2008/0129485 |
June 2008 |
Tuttle |
2008/0180221 |
July 2008 |
Tuttle |
|
Foreign Patent Documents
|
|
|
|
|
|
|
779520 |
|
Sep 1997 |
|
EP |
|
1072128 |
|
May 2008 |
|
EP |
|
9054213 |
|
Feb 1997 |
|
JP |
|
2002228809 |
|
Aug 2002 |
|
JP |
|
WO 97/48216 |
|
Dec 1997 |
|
WO |
|
1997048216 |
|
Dec 1997 |
|
WO |
|
1999043127 |
|
Aug 1999 |
|
WO |
|
2008094728 |
|
Aug 2008 |
|
WO |
|
Other References
Transaction History of related U.S. Appl. No. 09/026,043, filed
Feb. 19, 1998, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,118,789. cited by
other .
Transaction History of related U.S. Appl. No. 09/026,045, filed
Feb. 19, 1998, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System,"
now U.S. Patent No. 6,072,801. cited by other .
Transaction History of related U.S. Appl. No. 09/026,050, filed
Feb. 19, 1998, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,061,344. cited by
other .
Transaction History of related U.S. Appl. No. 09/026,248, filed
Feb. 19, 1998, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,275,476. cited by
other .
Transaction History of related U.S. Appl. No. 09/551,304, filed
Apr. 18, 2000, entitled "Method of Addressing Messages and
Communications Systems," now U.S. Patent No. 6,282,186. cited by
other .
Transaction History of related U.S. Appl. No. 09/556,235, filed
Apr. 18, 2000, entitled "Method of Addressing Messages, and
Establishing Communications Using a Tree Search Technique That
Skips Levels," now U.S. Patent No. 6,226,300. cited by other .
Transaction History of related U.S. Appl. No. 09/617,390, filed
Jul. 17, 2000, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,307,847. cited by
other .
Transaction History of related U.S. Appl. No. 09/773,461, filed
Jan. 31, 2001, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System,"
now U.S. Patent No. 6,307,848. cited by other .
Transaction History of related U.S. Appl. No. 09/820,467, filed
Mar. 28, 2001, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 7,315,522. cited by
other .
Transaction History of related Transaction History of related U.S.
Appl. No. 10/652,573, filed Aug. 28, 2003, entitled "Method of
Addressing Messages and Communications System." cited by other
.
Transaction History of related U.S. Appl. No. 10/693,696, filed
Oct. 23, 2003, entitled "Method and Apparatus to Select Radio
Frequency Identification Devices in Accordance with an Arbitration
Scheme." cited by other .
Transaction History of related U.S. Appl. No. 10/693,697, filed
Oct. 23, 2003, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System."
cited by other .
Transaction History of related U.S. Appl. No. 11/143,395, filed
Jun. 1, 2005, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/270,204, filed
Nov. 8, 2005, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/416,846, filed May
2, 2006, entitled "Method of Addressing Messages and Communications
System." cited by other .
Transaction History of related U.S. Appl. No. 11/700,525, filed
Jan. 30, 2007, entitled "Systems and Methods for RFID Tag
Arbitration." cited by other .
Transaction History of related U.S. Appl. No. 11/755,073, filed May
30, 2007, entitled "Methods and Systems of Receiving Data Payload
of RFID Tags." cited by other .
Transaction History of related U.S. Appl. No. 11/855,855, filed
Sep. 14, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/855,860, filed
Sep. 14, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/859,360, filed
Sep. 21, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/859,364, filed
Sep. 21, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/862,121, filed
Sep. 26, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/862,130, filed
Sep. 26, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
Transaction History of related U.S. Appl. No. 11/865,580, filed
Oct. 1, 2007, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System."
cited by other .
Transaction History of related U.S. Appl. No. 11/865,584, filed
Oct. 1, 2007, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System."
cited by other .
USPTO Transaction History of U.S. Appl. No. 09/026,043, filed Feb.
19, 1998, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,118,789. cited by
other .
USPTO Transaction History of U.S. Appl. No. 09/026,045, filed Feb.
19, 1998, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System,"
now U.S. Patent No. 6,072,801. cited by other .
USPTO Transaction History of U.S. Appl. No. 09/026,050, filed Feb.
19, 1998, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,061,344. cited by
other .
USPTO Transaction History of U.S. Appl. No. 09/026,248, filed Feb.
19, 1998, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,275,476. cited by
other .
USPTO Transaction History of U.S. Appl. No. 09/551,304, filed Apr.
18, 2000, entitled "Method of Addressing Messages and
Communications Systems," now U.S. Patent No. 6,282,186. cited by
other .
USPTO Transaction History of U.S. Appl. No. 09/556,235, filed Apr.
18, 2000, entitled "Method of Addressing Messages, and Establishing
Communications Using a Tree Search Technique That Skips Levels,"
now U.S. Patent No. 6,226,300. cited by other .
USPTO Transaction History of U.S. Appl. No. 09/617,390, filed Jul.
17, 2000, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 6,307,847. cited by
other .
USPTO Transaction History of U.S. Appl. No. 09/773,461, filed Jan.
31, 2001, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System,"
now U.S. Patent No. 6,307,848. cited by other .
USPTO Transaction History of U.S. Appl. No. 09/820,467, filed Mar.
28, 2001, entitled "Method of Addressing Messages and
Communications System," now U.S. Patent No. 7,315,522. cited by
other .
USPTO Transaction History of U.S. Appl. No. 10/652,573, filed Aug.
28, 2003, entitled "Method of Addressing Messages and Communicatons
System." cited by other .
USPTO Transaction History of U.S. Appl. No. 10/693,696, filed Oct.
23, 2003, entitled "Method and Apparatus to Select Radio Frequency
Identification Devices in Accordance with an Arbitration Scheme."
cited by other .
USPTO Transaction History of U.S. Appl. No. 10/693,697, filed Oct.
23, 2003, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications, and Communications System."
cited by other .
USPTO Transaction History of U.S. Appl. No. 11/143,395, filed Jun.
1, 2005, entitled "Method of Addressing Messages and Communications
System". cited by other .
USPTO Transaction History of U.S. Appl. No. 11/270,204, filed Nov.
8, 2005, entitled "Method of Addressing Messages and Communications
System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/416,846, filed May
2, 2006, entitled "Method of Addressing Messages and Communications
System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/855,855, filed Sep.
14, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/855,860, filed Sep.
14, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/859,360, filed Sep.
21, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/859,364, filed Sep.
21, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/862,121, filed Sep.
26, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/862,130, filed Sep.
26, 2007, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of U.S. Appl. No. 11/865,580, filed Oct.
1, 2007, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications,and Communications System."
cited by other .
USPTO Transaction History of U.S. Appl. No. 11/865,584, filed Oct.
1, 2007, entitled "Method of Addressing Messages, Methods of
Establishing Wireless Communications,and Communications System."
cited by other .
Auto-ID Center, Massachusetts Institute of Technology, "13.56 MHz
ISM Band Class 1 Radio Frequency Identification Tag Interface
Specification: Recommended Standard," Technical Report, Feb. 1,
2003. cited by other .
Capetanakis, John I., "Generalized TDMA: The Multi-Accessing Tree
Protocol," IEEE Transactions on Information Theory, vol. Com. 27,
No. 10, pp. 1476-1484, Oct. 1979. cited by other .
Capetanakis, John I., "Tree Algorithms for Packet Broadcast
Channels", IEEE Transactions on Information Theory, vol. IT-25, No.
5, pp. 505-515, Sep. 1979. cited by other .
CNN Money, "Manhattan Associates Announces Next-Generation
Microsoft-Based RFID Solutions," located at
http://money.cnn.com/services/tickerheadlines/prn/cltu045.PI.091620031227-
27.24911.htm. Sep. 16, 2003. cited by other .
Engels, Daniel, "The Use of the Electronic Product Code," Auto-ID
Center, Massachusetts Institute of Technology, Technical Report,
Feb. 1, 2003. cited by other .
EPC Global, Inc. "EPC Radio Frequency Identity Protocols--Class-1
Generation-2 UHF RFID--Protocol for Communications at 860
MHz-960MHz," version 1.0.9, cover sheet and pp. 37-38, Jan. 2005.
cited by other .
eRetailNews, "The Electronic Product Code (EPC)--A Technology
Revolution?" located at:
http://www.eretailnews.com/features/0105epx1.htm, accessed Oct. 15,
2003. cited by other .
eRetailNews, "The Electronic Product Code (EPC)," located at
http://www.eretailnews.com/features/epc/htm, accessed Oct. 15,
2003. cited by other .
eRetailNews, "The Electronic Product Code Schematic," located at
http://eee.eretailnews.com/features/0105epcschema.htm, accessed
Oct. 15, 2003. cited by other .
Extended Search Report and Search Opinion for EP Patent Application
No. 05016513.3, Jan. 22, 2007. cited by other .
Extended Search Report and Search Opinion for EP Patent Application
No. 05016514.1, Jan. 26, 2007. cited by other .
High Tech Aid, "ISO/IEC 18000--RFID Air Interface Standards,"
located at http://www.hightechaid.com/standards/18000.htm, Feb. 1,
2003. cited by other .
Humblet, Pierre A. et al., "Efficient Accessing of a Multiaccess
Channel," Proceedings of the 19th IEEE Conference on Decision and
Control including the Symposium on Adaptive Processes, pp. 624-627,
1980. cited by other .
ISO/IEC, "Automatic Identification--Radio Frequency Identification
for Item Management--Communications and Interfaces--Part 3:
Physical Layer, Anti Collision System andn Protocol Values at 13.56
MHz Mode 4," ISO/IEC 18000-3-4. Mar. 1, 2001. cited by other .
ISO/IEC, "Automatic Identification--Radio Frequency Identification
for Item Management--Communications and Interfaces--Part 3:
Physical Layer, Anti-Collision System and Protocol Values at 13.56
MHz Mode 1," ISO/IEC 18000-3-1, Mar. 1, 2001. cited by other .
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Proximity Cards--Part 1: Physical Characteristics," ISO/IEC
FCD 14443-1, 1997. cited by other .
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Proximity Cards--Part 2: Radio Frequency Power and Signal
Interface," ISO/IEC FCD 14443-2, Mar. 26, 1999. cited by other
.
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Proximity Cards--Part 3: Initiation and Anticollision,"
ISO/IEC FDIS 14443-3:2000(E), Jul. 13, 2000. cited by other .
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Proximity Cards--Part 4: Transmission Protocol," ISO/IEC
FDIS 14443-4:2000(E), Jul. 13, 2000. cited by other .
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Vicinity Cards--Part 1: Physical Characteristics," ISO/IEC
FDIS 15693-1:2000(E), May 19, 2000. cited by other .
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Vicinity Cards--Part 2: Interface and Initialization,"
ISO/IEC FDIS 15693-2:2000(E), Feb. 3, 2000. cited by other .
ISO/IEC, "Identification Cards--Contactless Integrated Circuit(s)
Cards--Vicinity Cards--Part 3: Anitcollision and Transmission
Protocol," ISO/IEC CD 15693-3:1999(E), Nov. 17, 1999. cited by
other .
ISO/IEC, "Information Technology AIDC Techniques--RFID for Item
Management--Air Interface--Part 3: Paramenters for Air Interface
Communications at 13.56 MHz," ISO/IEC 18000-3 FCD, May 27, 2002.
cited by other .
Mullin, Eileen, "Electronic Product Code," Baseline Magazine,
located at www.baselinemag.com/article2/0,3959,655991,00.asp, Sep.
5, 2002. cited by other .
RFID Journal, "Second Source of Class 1 EPC Chips," located at
http://www.rfidjournal.com/article/articleview/473/1/1, Jun. 26,
2003. cited by other .
Wolf, Jack Keil, "Principles of Group Testing and an Application to
the Design and Analysis of Multi-Access Protocols," NATO ASI Series
E, Applied Sciences, No. 91, pp. 237-257, 1985. cited by other
.
Zebra Technologies Corporation, "Electronic Product Code (EPC),"
located at http://www.rfid.zebra.com/epc/htm, accessed Oct. 15,
2003. cited by other .
Finkenzeller, Klaus, "Radio Frequency Identification--The Authors
Homepage of the RFID Handbook," located at
http://www.rfid-handbook.com, accessed Feb. 22, 2007. cited by
other .
Smart Active Labels Consortium, organization homepage located at
http://www.sal-c.org, accessed Feb. 22, 2007. cited by other .
Symbol Technologies, Inc., "Understanding Gen 2: What It Is, How
You Will Benefit and Criteria for Vendor Assessment," white paper,
Jan. 2006. cited by other .
Wright, Jim, "Trends and Innovations in RF Indentification," SUN
Microsystems Inc. presentation, Mar. 2005. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 10/693,697, filed Oct. 23,
2003. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 11/865,580, filed Oct. 1,
2007. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 11/865,584, filed Oct. 1,
2007. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 10/652,573, filed Aug. 28,
2008. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 11/862,121, filed Sep. 26,
2007. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 11/862,130, filed Sep. 21,
2007. cited by other .
International Application No. PCT/US08/50630, Written Opinion, Jun.
27, 2008. cited by other .
International Application No. PCT/US08/50630, International Search
Report, Jun. 27, 2008. cited by other .
Tuttle, John R., U.S. Appl. No. 11/755,073, entitled "Methods and
Systems of Receiving Data Payload of RFID Tags," filed May 30,
2007. cited by other .
International Application No. PCT/US99/02288, Written Opinion, Jan.
27, 2000. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 10/693,696, filed Oct. 23,
2003. cited by other .
International Application No. PCT/US99/02288, International Search
Report, Aug. 3, 1999. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 11/859,360, filed Sep. 21,
2007. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 11/859,364, filed Sep. 21,
2007. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 12/541,882, filed Aug. 14,
2009. cited by other .
Wood, Jr., Clifton W., U.S. Appl. No. 12/493,542, filed Jun. 29,
2009. cited by other .
USPTO Transaction History of related U.S. Appl. No. 12/493,542,
filed Jun. 29, 2009, entitled "Method of Addressing Messages,
Method and Communications System." cited by other .
USPTO Transaction History of related U.S. Appl. No. 12/541,882,
filed Aug. 14, 2009, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of related U.S. Appl. No. 12/556,530,
filed Sep. 9, 2009, entitled "Method of Addressing Messages and
Communications System." cited by other .
USPTO Transaction History of related U.S. Appl. No. 12/604,329,
filed Oct. 22, 2009, entitled "Method of Addressing Messages,
Method of Establishing Wireless Communications and Communications
System." cited by other.
|
Primary Examiner: Patel; Ajit
Attorney, Agent or Firm: Greenberg Traurig, LLP
Parent Case Text
CROSS REFERENCE TO RELATED APPLICATION
.[.This.]. .Iadd.More than one reissue application has been filed
for the reissue of U.S. Pat. No. 6,282,186, which The reissue
applications are the initial reissue application Ser. No.
10/652,573 filed Aug. 28, 2003, a continuation reissue application
Ser. No. 11/862,121, filed Sep. 26, 2007, a continuation reissue
application Ser. No. 11/862,130, filed Sep. 26, 2007, and the
present continuation reissue application, which .Iaddend.is a
.[.Continuation.]. .Iadd.continuation application of a reissue
application Ser. No. 10/652,573, filed Aug. 28, 2003, which is a
reissue application of U.S. patent application Ser. No. 09/556,235,
now U.S. Pat. No. 6,282,186, which is a continuation application
.Iaddend.of U.S. patent application Ser. No. 09/026,050, filed Feb.
19, 1998, now U.S. Pat. No. 6,061,344 and titled "Method of
Addressing Messages and Communications System".
Claims
What is claimed is:
.[.1. A method of establishing wireless communications between an
interrogator and wireless identification devices, the method
comprising utilizing a tree search technique to establish
communications, without collision, between the interrogator and
individual ones of the multiple wireless identification devices,
the method including using a search tree having multiple nodes
respectively representing subgroups of the multiple wireless
identification devices, the method further comprising, for a node,
transmitting a command, using the interrogator, requesting that
devices within the subgroup represented by the node respond,
determining with the interrogator if a collision occurred in
response to the command and, if not, repeating the command at the
same node..].
.[.2. A method in accordance with claim 1 and further comprising,
if a collision occurred in response to the first mentioned command,
sending a command at a different node, using the
interrogator..].
.[.3. A method in accordance with claim 1 wherein when a subgroup
contains both a device that is within communications range of the
interrogator, and a device that is not within communications range
of the interrogator, the device that is not within communications
range of the interrogator does not respond to the command..].
.[.4. A method in accordance with claim 1 wherein when a subgroup
contains both a device that is within communications range of the
interrogator, and a device that is not within communications range
of the interrogator, the device that is within communications range
of the interrogator responds to the command..].
.[.5. A method in accordance with claim 1 wherein a device in a
subgroup changes between being within communications range of the
interrogator and not being within communications range, over
time..].
.[.6. A method in accordance with claim 1 wherein the wireless
identification device comprises an integrated circuit including a
receiver, a modulator, and a microprocessor in communication with
the receiver and modulator..].
.[.7. A method of addressing messages from an interrogator to a
selected one or more of a number of communications devices, the
method comprising: establishing for respective devices unique
identification numbers; causing the devices to select random
values, wherein respective devices choose random values
independently of random values selected by the other devices;
transmitting a communication, from the interrogator, requesting
devices having random values within a first specified group of
random values to respond; receiving the communication at multiple
devices, devices receiving the communication respectively
determining if the random value chosen by the device falls within
the first specified group and, if so, sending a reply to the
interrogator; and determining using the interrogator if a collision
occurred between devices that sent a reply and, if so, creating a
second specified group smaller than the first specified group; and,
if not, again transmitting a communication requesting devices
having random values within the first specified group of random
values to respond..].
.[.8. A method of addressing messages from an interrogator to a
selected one or more of a number of communications devices in
accordance with claim 7 wherein sending a reply to the interrogator
comprises transmitting the unique identification number of the
device sending the reply..].
.[.9. A method in accordance with claim 7 wherein one of the first
and second specified groups contains both a device that is within
communications range of the interrogator, and a device that is not
within communications range of the interrogator, and wherein the
device that is not within communications range of the interrogator
does not respond to the interrogator..].
.[.10. A method of addressing messages from an interrogator to a
selected one or more of a number of communications devices in
accordance with claim 7 wherein, after receiving a reply without
collision from a device, the interrogator sends a communication
individually addressed to that device..].
.[.11. A method of addressing messages from a transponder to a
selected one or more of a number of communications devices, the
method comprising: establishing unique identification numbers for
respective devices; causing the devices to select random values,
wherein respective devices choose random values independently of
random values selected by the other devices; transmitting a
communication from the transponder requesting devices having random
values within a specified group of a plurality of possible groups
of random values to respond, the plurality of possible groups being
organized in a binary tree defined by a plurality of nodes at
respective levels, the specified group being defined as being at
one of the nodes; receiving the communication at multiple devices,
devices receiving the communication respectively determining if the
random value chosen by the device falls within the specified group
and, if so, sending a reply to the transponder; and, if not, not
sending a reply; and determining using the transponder if a
collision occurred between devices that sent a reply and, if so,
creating a new, smaller, specified group by descending in the tree;
and, if not, transmitting a communication at the same node..].
.[.12. A method of addressing messages from a transponder to a
selected one or more of a number of communications devices in
accordance with claim 11 wherein establishing unique identification
numbers for respective devices comprises establishing a
predetermined number of bits to be used for the unique
identification numbers..].
.[.13. A method of addressing messages from a transponder to a
selected one or more of a number of communications devices in
accordance with claim 12 and further including establishing a
predetermined number of bits to be used for the random
values..].
.[.14. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices, the method
comprising: establishing for respective devices unique
identification numbers; causing the devices to select random
values, wherein respective devices choose random values
independently of random values selected by the other devices;
transmitting a command using the interrogator requesting devices
having random values within a specified group of a plurality of
possible groups of random values to respond, the specified group
being equal to or less than the entire set of random values, the
plurality of possible groups being organized in a binary tree
defined by a plurality of nodes at respective levels; receiving the
command at multiple RFID devices, RFID devices receiving the
command respectively determining if their chosen random values fall
within the specified group and, only if so, sending a reply to the
interrogator, wherein sending a reply to the interrogator comprises
transmitting the unique identification number of the device sending
the reply; determining using the interrogator if a collision
occurred between devices that sent a reply and, if so, creating a
new, smaller, specified group using a different level of the tree,
the interrogator transmitting a command requesting devices having
random values within the new specified group of random values to
respond; and, if not, the interrogator re-transmitting a command
requesting devices having random values within the first mentioned
specified group of random values to respond; and if a reply without
collision is received from a device, the interrogator subsequently
sending a command individually addressed to that device..].
.[.15. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices in accordance with
claim 14 wherein the first mentioned specified group contains both
a device that is within communications range of the interrogator,
and a device that is not within communications range of the
interrogator, and wherein the device that is not within
communications range of the interrogator does not respond to the
transmitting of the command or the re-transmitting of the
command..].
.[.16. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices in accordance with
claim 14 wherein the first mentioned specified group contains both
a device that is within communications range of the interrogator,
and a device that is not within communications range of the
interrogator, and wherein the device that is within communications
range of the interrogator responds to the transmitting of the
command and the re-transmitting of the command..].
.[.17. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices in accordance with
claim 14 wherein a device in the first mentioned specified group is
capable of changing between being within communications range of
the interrogator and not being within communications range of the
interrogator over time..].
.[.18. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices in accordance with
claim 14 wherein the devices respectively comprise an integrated
circuit including a receiver, a modulator, and a microprocessor in
communication with the receiver and modulator..].
.[.19. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices in accordance with
claim 14 and further comprising, after the interrogator transmits a
command requesting devices having random values within the new
specified group of random values to respond; devices receiving the
command respectively determining if their chosen random values fall
within the new smaller specified group and, if so, sending a reply
to the interrogator..].
.[.20. A method of addressing messages from an interrogator to a
selected one or more of a number of RFID devices in accordance with
claim 19 and further comprising, after the interrogator transmits a
command requesting devices having random values within the new
specified group of random values to respond; determining if a
collision occurred between devices that sent a reply and, if so,
creating a new specified group and repeating the transmitting of
the command requesting devices having random values within a
specified group of random values to respond using different
specified groups until all of the devices capable of communicating
with the interrogator are identified..].
.[.21. A communications system comprising an interrogator, and a
plurality of wireless identification devices configured to
communicate with the interrogator using RF, the interrogator being
configured to employ tree searching to attempt to identify
individual ones of the multiple wireless identification devices, so
as to be able to perform communications without collision between
the interrogator and individual ones of the multiple wireless
identification devices, the interrogator being configured to follow
a search tree, the tree having multiple nodes respectively
representing subgroups of the multiple wireless identification
devices, the interrogator being configured to transmit a command at
a node, requesting that devices within the subgroup represented by
the node respond, the interrogator further being configured to
determine if a collision occurs in response to the command and, if
not, to repeat the command at the same node..].
.[.22. A communications system in accordance with claim 21 wherein
the interrogator is configured to send a command at a different
node if a collision occurs in response to the first mentioned
command..].
.[.23. A communications system in accordance with claim 21 wherein
a subgroup contains both a device that is within communications
range of the interrogator, and a device that is not within
communications range of the interrogator..].
.[.24. A communications system in accordance with claim 21 wherein
a subgroup contains both a device that is within communications
range of the interrogator, and a device that is not within
communications range of the interrogator, and wherein the device
that is within communications range of the interrogator responds to
the command..].
.[.25. A communications system in accordance with claim 21 wherein
a device in a subgroup is movable relative to the interrogator so
as to be capable of changing between being within communications
range of the interrogator and not being within communications
range..].
.[.26. A communications system in accordance with claim 21 wherein
the wireless identification device comprises an integrated circuit
including a receiver, a modulator, and a microprocessor in
communication with the receiver and modulator..].
.[.27. A system comprising: an interrogator; a number of
communications devices capable of wireless communications with the
interrogator; means for establishing for respective devices unique
identification numbers respectively having the first predetermined
number of bits; means for causing the devices to select random
values, wherein respective devices choose random values
independently of random values selected by the other devices; means
for causing the interrogator to transmit a command requesting
devices having random values within a specified group of random
values to respond; means for causing devices receiving the command
to determine if their chosen random values fall within the
specified group and, if so, to send a reply to the interrogator;
and means for causing the interrogator to determine if a collision
occurred between devices that sent a reply and, if so, to create a
new, smaller, specified group; and, if not, transmit a command
requesting devices having random values within the same specified
group of random values to respond..].
.[.28. A system in accordance with claim 27 wherein sending a reply
to the interrogator comprises transmitting the unique
identification number of the device sending the reply..].
.[.29. A system in accordance with claim 27 wherein a specified
group contains both a device that is within communications range of
the interrogator, and a device that is not within communications
range of the interrogator..].
.[.30. A system in accordance with claim 27 wherein the
interrogator further includes means for, after receiving a reply
without collision from a device, sending a command individually
addressed to that device..].
.[.31. A system comprising: an interrogator configured to
communicate to a selected one or more of a number of communications
devices; and a plurality of communications devices; the devices
being configured to select random values, wherein respective
devices choose random values independently of random values
selected by the other devices; the interrogator being configured to
transmit a command requesting devices having random values within a
specified group of a plurality of possible groups of random values
to respond, the specified group being less than the entire set of
random values, the plurality of possible groups being organized in
a binary tree defined by a plurality of nodes at respective levels,
the specified group being defined as being at one of the nodes;
devices receiving the command being configured to respectively
determine if their chosen random values fall within the specified
group and, only if so, send a reply to the interrogator, wherein
sending a reply to the interrogator comprises transmitting the
unique identification number of the device sending the reply; the
interrogator being configured to determine if a collision occurred
between devices that sent a reply and, if so, create a new,
smaller, specified group using a different level of the tree, the
interrogator being configured to transmit a command requesting
devices having random values within the new specified group of
random values to respond; and, if not, the interrogator being
configured to re-transmit a command requesting devices having
random values within the first mentioned specified group of random
values to respond..].
.[.32. A system in accordance with claim 31 wherein the first
mentioned specified group contains both a device that is within
communications range of the interrogator, and a device that is not
within communications range of the interrogator..].
.[.33. A system in accordance with claim 31 wherein a device in the
first mentioned specified group is capable of changing between
being within communications range of the interrogator and not being
within communications range of the interrogator over time..].
.[.34. A system in accordance with claim 31 wherein the respective
devices comprise an integrated circuit including a receiver, a
modulator, and a microprocessor in communication with the receiver
and modulator..].
.[.35. A system comprising: an interrogator configured to
communicate to a selected one or more of a number of RFID devices;
a plurality of RFID devices, respective devices being configured to
store a unique identification number, respective devices being
further configured to store a random value; the interrogator being
configured to transmit a command requesting devices having random
values within a specified group of a plurality of possible groups
of random values to respond, the plurality of possible groups being
organized in a binary tree defined by a plurality of nodes at
respective levels, the specified group being defined as being at
one of the nodes; devices receiving the command respectively being
configured to determine if their chosen random values fall within
the specified group and, if so, send a reply to the interrogator;
and, if not, not send a reply; and the interrogator being
configured to determine if a collision occurred between devices
that sent a reply and, if so, to create a new, smaller, specified
group by descending in the tree; and, if not, to transmit a command
at the same node..].
.[.36. A system in accordance with claim 35 wherein the unique
identification numbers for respective devices are stored in digital
form and respectively comprise a predetermined number of
bits..].
.[.37. A system in accordance with claim 35 wherein the random
values for respective devices are stored in digital form and
respectively comprise a predetermined number of bits..].
.[.38. A system in accordance with claim 35 wherein the
interrogator is configured to determine if a collision occurred
between devices that sent a reply in response to respective
Identify commands and, if so, to create further new specified
groups and repeat the transmitting of the command requesting
devices having random values within a specified group of random
values to respond using different specified groups until all
responding devices capable of responding are identified..].
.Iadd.39. A radio frequency identification (RFID) system,
comprising: a plurality of RFID tags; and at least one
interrogator, the interrogator to transmit a first request to the
plurality of RFID tags, the first request specifying a first
subgroup of a group of random numbers, among the plurality of RFID
tags at least one RFID tag having generated a random number that is
within the first subgroup to provide a first response, the
interrogator to receive one or more responses, including the first
response, from one or more of the plurality of RFID tags
respectively, and the interrogator to repeat the first request if
the first response is received without a detected
collision..Iaddend.
.Iadd.40. The system of claim 39, wherein the first request
includes a selection indicator; and the one or more of the
plurality of RFID tags provides the one or more responses only if
the selection indicator corresponds to one or more selection bits
stored on the one or more of the plurality of RFID
tags..Iaddend.
.Iadd.41. The system of claim 39, wherein the one or more of the
plurality of RFID tags are configured to set an inventoried flag to
a first state to indicate that a respective RFID tag has responded
to the interrogator..Iaddend.
.Iadd.42. The system of claim 39, wherein the interrogator is
configured to transmit a wake-up signal to cause the one or more of
the plurality of RFID tags to transition from a battery-saving mode
to an operational mode..Iaddend.
.Iadd.43. The system of claim 39, wherein the interrogator is
configured to send a sleep command to the RFID tag that provides
the first response..Iaddend.
.Iadd.44. The system of claim 39, wherein the first response
includes the random number generated by the RFID tag that provides
the first response; and the interrogator is to send at least one
additional command to the RFID tag, the first RFID tag being
identified in the at least one additional command by the random
number..Iaddend.
.Iadd.45. A method implemented in a radio frequency identification
(RFID) system having at least one RFID tag and at least one RFID
interrogator, the method comprising: generating random numbers at a
plurality of RFID tags, including an RFID tag affixed to an object;
transmitting a first command from the interrogator to select RFID
tags, including the RFID tag affixed to the object, that have
generated random numbers that are within a subset of random
numbers; the selected RFID tags transmitting a response, including
a random number generated by the RFID tag affixed to the object; if
the random number is received at the interrogator, retransmitting
the first command..Iaddend.
.Iadd.46. The method of claim 45, wherein the selected RFID tags
transmitting the response to indicate data stored on the selected
RFID tags matches one or more selection bits specified by the first
command..Iaddend.
.Iadd.47. The method of claim 45, wherein the RFID tag is further
configured to communicate the response at a time based at least in
part upon a random number..Iaddend.
.Iadd.48. The method of claim 45, further comprising transmitting a
command to silence the RFID tag affixed to the object upon
receiving the response..Iaddend.
.Iadd.49. An interrogator, comprising: one or more antennas to poll
a plurality of radio frequency identification (RFID) tags; means
for transmitting a first command to select a first subset of the
plurality of RFID tags; means for receiving one or more responses
from the subset of RFID tags, the one or more responses including a
random number generated at a first RFID tag of the plurality of
RFID tags; means for transmitting the first command if at least one
of the one or more responses is received without a collision; and
means for transmitting a second command to select a second subset
of the plurality of RFID tags if a collision is detected in the one
or more responses..Iaddend.
.Iadd.50. The interrogator of claim 49, wherein the first command
includes a selection indicator that identifies a class of one or
more of a plurality of RFID tags from which a response is being
requested..Iaddend.
.Iadd.51. The interrogator of claim 49, further comprising
repeatedly redefining the subgroup to include fewer possible random
numbers and transmitting a new request for RFID tags having a
random number within the subgroup to respond until receiving a
response without a collision or receiving no response..Iaddend.
.Iadd.52. A method implemented in a radio frequency identification
(RFID) device, the method comprising: receiving a first command,
comprising a first set of bit values, from an interrogator to
select the RFID device based on a comparison between the first set
of bit values and data stored in the RFID device; transmitting a
response to the first command, the response including an identifier
of the RFID device; if the response is received at an interrogator,
remaining silent when the first command is subsequently repeated;
and if the response is not received at the interrogator,
retransmitting the response when the first command is subsequently
repeated..Iaddend.
.Iadd.53. The method of claim 52, wherein transmitting the response
is done in a randomly selected slot; and the method further
comprises transmitting an identification code to identify a person
with whom the RFID device is associated..Iaddend.
.Iadd.54. A method implemented in a radio frequency identification
(RFID) system having an interrogator to poll a plurality of RFID
tags, the method comprising: transmitting a first command to select
a first subset of RFID tags; receiving one or more responses from
the subset of RFID tags, the one or more responses including a
random number generated at a first RFID tag of the plurality of
RFID tags; and retransmitting the first command if at least one of
the one or more responses is received without a
collision..Iaddend.
.Iadd.55. The method of claim 54, further comprising: affixing the
plurality of RFID tags to a plurality of objects to track as
inventory is added and removed..Iaddend.
.Iadd.56. The method of claim 54, further comprising: after
receiving the one or more responses and prior to retransmitting the
first command, transmitting a command to silence an RFID tag from
which a response is received without a collision..Iaddend.
.Iadd.57. The method of claim 54, wherein the first command
includes a selection indicator that identifies a class of one or
more of a plurality of RFID tags from which a response is being
requested..Iaddend.
.Iadd.58. The method of claim 54, further comprising repeatedly
redefining the subgroup to include fewer possible random numbers
and transmitting a new request for RFID tags having a random number
within the subgroup to respond until receiving a response without a
collision or receiving no response..Iaddend.
.Iadd.59. A radio frequency identification (RFID) device,
comprising: an antenna; a receiver coupled to the antenna to
receive a first command from an interrogator, the first command
comprising a first value having multiple bits to select a group of
one or more RFID devices in a field of the interrogator; processing
circuitry to determine if the RFID device is selected by the
interrogator based on the first value; and a transmitter to
communicate a response to the first command in a first time slot
with a first probability if the RFID device is selected by the
interrogator in accordance with the first value, wherein the
response includes an identifier of the RFID device and the first
probability is indicated by the first command; wherein if the first
command, including the first value to select the group, is
subsequently repeated by the interrogator while the RFID device
remains within the field of the interrogator, the RFID device is
configured to: remain silent, if the response was received at the
interrogator without detecting a collision, and retransmit the
response if the response was not received at the interrogator
without detecting a collision..Iaddend.
.Iadd.60. The RFID device of claim 59, wherein the identifier
comprises a random number generated by the RFID
device..Iaddend.
.Iadd.61. The RFID device of claim 60, wherein the response
includes the multiple bits of the first value..Iaddend.
.Iadd.62. The RFID device of claim 59, wherein the receiver is
configured to receive signals each indicating a beginning of a time
slot; and wherein the transmitter is configured to communicate the
response to the first command in a selected one of a number of time
slots indicated by the first command..Iaddend.
.Iadd.63. The RFID device of claim 59, wherein the response
includes the multiple bits of the first value..Iaddend.
.Iadd.64. The RFID device of claim 59, wherein the RFID device is
further configured to transmit an identification code to identify a
person with whom the RFID device is associated..Iaddend.
.Iadd.65. The RFID device of claim 59, wherein the interrogator is
to transmit the first command before the RFID device first
communicates to the interrogator..Iaddend.
.Iadd.66. A radio frequency identification (RFID) interrogator,
comprising: an antenna; a transmitter coupled to the antenna to
transmit a first command comprising a value, having multiple bits,
corresponding to a group of one or more RFID devices to be selected
in a field of the interrogator; a receiver to receive a response to
the first command from an RFID device selected by the first command
in accordance with the value, the response to include an identifier
of the RFID device and to be received in a time slot in accordance
with a time slot method; and processing circuitry to determine if
the response is received without a collision, and if so, to
transmit a second command to silence the RFID device and to
retransmit the first command, including the value, to reselect the
group to respond to the first command..Iaddend.
.Iadd.67. The interrogator of claim 66, wherein the identifier
comprises a random number generated by the RFID
device..Iaddend.
.Iadd.68. The interrogator of claim 66, wherein the receiver is to
receive the response in a first time slot with a first probability
in accordance with the time slot method..Iaddend.
.Iadd.69. The interrogator of claim 66, wherein the receiver is to
further receive an identification code from the RFID device to
identify a person with whom the RFID device is
associated..Iaddend.
.Iadd.70. The interrogator of claim 66, wherein the response
includes the multiple bits of the value..Iaddend.
.Iadd.71. The interrogator of claim 66, wherein the transmitter is
to transmit the first command after the RFID device enters the
field of the interrogator but before the RFID device communicates
any responses to the interrogator..Iaddend.
.Iadd.72. A method comprising: transmitting from an interrogator a
first command, including a first identifier comprising a plurality
of bits, to select a set of one or more RFID devices, corresponding
to the first identifier, in a field of the interrogator, and to
request the set to respond in accordance with a time slot method in
which an RFID device responds in a first time slot with a
probability indicated by the first command; receiving a first
response to the first command from a first RFID device of the set,
wherein the first response is received in a time slot in accordance
with the time slot method and the first response includes a second
identifier of the RFID device; detecting no collision in the first
response from the first RFID device; and retransmitting from the
interrogator the first command, including the first identifier, to
select the set of one or more RFID devices and to request the set
to respond while the set remains in the field of the
interrogator..Iaddend.
.Iadd.73. The method of claim 72, wherein the second identifier
comprises a random number generated by the RFID
device..Iaddend.
.Iadd.74. The method of claim 72, further comprising transmitting a
plurality of signals from the interrogator, each of the plurality
of signals defining the start of a time slot in accordance with the
time slot method..Iaddend.
.Iadd.75. The method of claim 72, further comprising transmitting
from the interrogator a second command, wherein the second command
indicates a change in the probability..Iaddend.
.Iadd.76. The method of claim 72, wherein the response includes the
plurality of bits of the first identifier..Iaddend.
.Iadd.77. The method of claim 72, further comprising: receiving an
identification code from the RFID device to identify a person with
whom the RFID device is associated..Iaddend.
.Iadd.78. The method of claim 72, wherein transmitting the first
command is performed after the RFID device enters the field of the
interrogator but before the RFID device communicates any signals to
the interrogator..Iaddend.
.Iadd.79. A radio frequency identification (RFID) system,
comprising: an interrogator to transmit a first command to select a
group of one or more RFID devices in a field of the interrogator,
wherein the first command includes a first identifier, comprising a
plurality of bits, that corresponds to the group of one or more
RFID devices; and an RFID device in the field of the interrogator
to determine, using the first identifier, if the RFID device is
selected as one of the group, and if so, to communicate a response
to the first command in a first time slot with a first probability,
wherein the response includes a second identifier of the RFID
device; wherein the interrogator is to retransmit the first
command, including the first identifier, after the interrogator
receives the response, without a collision, from the RFID device
and while the group remains in the field of the
interrogator..Iaddend.
.Iadd.80. The system of claim 79, wherein the interrogator is
configured to transmit a plurality of signals, each defining a
start of a time slot for one or more responses to the first
command, and the RFID device is configured to transmit the response
to the first command in a randomly selected time slot..Iaddend.
.Iadd.81. The system of claim 79, wherein the response from the
first RFID device includes the plurality of bits of the first
identifier..Iaddend.
.Iadd.82. The system of claim 79, wherein the second identifier
comprises a random number generated by the RFID
device..Iaddend.
.Iadd.83. The system of claim 79, wherein the RFID device stores an
identification code that identifies an associated
person..Iaddend.
.Iadd.84. The system of claim 79, wherein the first probability is
indicated by the first command..Iaddend.
.Iadd.85. The system of claim 79, wherein the interrogator is to
transmit the first command after the RFID device enters the field
of the interrogator but before the RFID device subsequently
communicates to the interrogator..Iaddend.
Description
TECHNICAL FIELD
This invention relates to communications protocols and to digital
data communications. Still more particularly, the invention relates
to data communications protocols in mediums such as radio
communication or the like. The invention also relates to radio
frequency identification devices for inventory control, object
monitoring, determining the existence, location or movement of
objects, or for remote automated payment.
BACKGROUND OF THE INVENTION
Communications protocols are used in various applications. For
example, communications protocols can be used in electronic
identification systems. As large numbers of objects are moved in
inventory, product manufacturing, and merchandising operations,
there is a continuous challenge to accurately monitor the location
and flow of objects. Additionally, there is a continuing goal to
interrogate the location of objects in an inexpensive and
streamlined manner. One way of tracking objects is with an
electronic identification system.
One presently available electronic identification system utilizes a
magnetic coupling system. In some cases, an identification device
may be provided with a unique identification code in order to
distinguish between a number of different devices. Typically, the
devices are entirely passive (have no power supply), which results
in a small and portable package. However, such identification
systems are only capable of operation over a relatively short
range, limited by the size of a magnetic field used to supply power
to the devices and to communicate with the devices.
Another wireless electronic identification system utilizes a large,
board level, active transponder device affixed to an object to be
monitored which receives a signal from an interrogator. The device
receives the signal, then generates and transmits a responsive
signal. The interrogation signal and the responsive signal are
typically radio-frequency (RF) signals produced by an RF
transmitter circuit. Because active devices have their own power
sources, and do not need to be in close proximity to an
interrogator or reader to receive power via magnetic coupling.
Therefore, active transponder devices tend to be more suitable for
applications requiring tracking of a tagged device that may not be
in close proximity to an interrogator. For example, active
transponder devices tend to be more suitable for inventory control
or tracking.
Electronic identification systems can also be used for remote
payment. For example, when a radio frequency identification device
passes an interrogator at a toll booth, the toll booth can
determine the identity of the radio frequency identification
device, and thus of the owner of the device, and debit an account
held by the owner for payment of toll or can receive a credit card
number against which the toll can be charged. Similarly, remote
payment is possible for a variety of other goods or services.
A communication system typically includes two transponders: a
commander station or interrogator, and a responder station or
transponder device which replies to the interrogator.
If the interrogator has prior knowledge of the identification
number of a device which the interrogator is looking for, it can
specify that a response is requested only from the device with that
identification number. Sometimes, such information is not
available. For example, there are occasions where the interrogator
is attempting to determine which of multiple devices are within
communication range.
When the interrogator sends a message to a transponder device
requesting a reply, there is a possibility that multiple
transponder devices will attempt to respond simultaneously, causing
a collision, and thus causing an erroneous message to be received
by the interrogator. For example, if the interrogator sends out a
command requesting that all devices within a communications range
identify themselves, and gets a large number of simultaneous
replies, the interrogator may not be able to interpret any of these
replies. Thus, arbitration schemes are employed to permit
communications free of collisions.
In one arbitration scheme or system, described in commonly assigned
U.S. Pat. Nos. 5,627,544; 5,583,850; 5,500,650; and 5,365,551, all
to Snodgrass et al. and all incorporated herein by reference, the
interrogator sends a command causing each device of a potentially
large number of responding devices to select a random number from a
known range and use it as that device's arbitration number. By
transmitting requests for identification to various subsets of the
full range of arbitration numbers, and checking for an error-free
response, the interrogator determines the arbitration number of
every responder station capable of communicating at the same time.
Therefore, the interrogator is able to conduct subsequent
uninterrupted communication with devices, one at a time, by
addressing only one device.
Another arbitration scheme is referred to as the Aloha or slotted
Aloha scheme. This scheme is discussed in various references
relating to communications, such as Digital Communications:
Fundamentals and Application, Bernard Sklar, published January 1988
by Prentice Hall. In this type of scheme, a device will respond to
an interrogator using one of many time domain slots selected
randomly by the device. A problem with the Aloha scheme is that if
there are many devices, or potentially many devices in the field
(i.e. in communications range, capable of responding) then there
must be many available slots or many collisions will occur. Having
many available slots slows down replies. If the magnitude of the
number of devices in a field is unknown, then many slots are
needed. This results in the system slowing down significantly
because the reply time equals the number of slots multiplied by the
time period required for one reply.
An electronic identification system which can be used as a radio
frequency identification device, arbitration schemes, and various
applications for such devices are described in detail in commonly
assigned U.S. patent application Ser. No. 08/705,043, filed Aug.
29, 1996 .Iadd.and now U.S. Pat. No. 6,130,602.Iaddend., and
incorporated herein by reference.
SUMMARY OF THE INVENTION
The invention provides a wireless identification device configured
to provide a signal to identify the device in response to an
interrogation signal.
.Iadd.One aspect of the invention provides a method implemented in
an RFID device. The method includes: receiving a first command,
comprising a first set of bit values, from an interrogator to
select the RFID device based on a comparison between the first set
of bit values and data stored in the RFID device, transmitting a
response to the first command, the response including an identifier
of the RFID device; if the response is received at an interrogator,
remaining silent when the first command is subsequently repeated;
and if the response is not received at the interrogator,
re-transmitting the response when the first command is subsequently
repeated..Iaddend.
One aspect of the invention provides a method of establishing
wireless communications between an interrogator and individual ones
of multiple wireless identification devices. The method comprises
utilizing a tree search method to attempt to identify individual
ones of the multiple wireless identification devices so as to be
able to perform communications, without collision, between the
interrogator and individual ones of the multiple wireless
identification devices. A search tree is defined for the tree
search method. The tree has multiple nodes respectively
representing subgroups of the multiple wireless identification
devices. The interrogator transmits a command at a node, requesting
that devices within the subgroup represented by the node respond.
The interrogator determines if a collision occurs in response to
the command and, if not, repeats the command at the same node.
Another aspect of the invention provides a communications system
comprising an interrogator, and a plurality of wireless
identification devices configured to communicate with the
interrogator in a wireless fashion. The interrogator is configured
to employ tree searching to attempt to identify individual ones of
the multiple wireless identification devices, so as to be able to
perform communications without collision, between the interrogator
and individual ones of the multiple wireless identification
devices. The interrogator is configured to follow a search tree,
the tree having multiple nodes respectively representing subgroups
of the multiple wireless identification devices. The interrogator
is configured to transmit a command at a node, requesting that
devices within the subgroup represented by the node respond. The
interrogator is further configured to determine if a collision
occurs in response to the command and, if not, to repeat the
command at the same node.
One aspect of the invention provides a radio frequency
identification device comprising an integrated circuit including a
receiver, a transmitter, and a microprocessor. In one embodiment,
the integrated circuit is a monolithic single die single metal
layer integrated circuit including the receiver, the transmitter,
and the microprocessor. The device of this embodiment includes an
active transponder, instead of a transponder which relies on
magnetic coupling for power and therefore has a much greater
range.
BRIEF DESCRIPTION OF THE DRAWINGS
Preferred embodiments of the invention are described below with
reference to the following accompanying drawings.
FIG. 1 is a high level circuit schematic showing an interrogator
and a radio frequency identification device embodying the
invention.
FIG. 2 is a front view of a housing, in the form of a badge or
card, supporting the circuit of FIG. 1 according to one embodiment
the invention.
FIG. 3 is a front view of a housing supporting the circuit of FIG.
1 according to another embodiment of the invention.
FIG. 4 is a diagram illustrating a tree splitting sort method for
establishing communication with a radio frequency identification
device in a field of a plurality of such devices.
FIG. 5. is a diagram illustrating a modified tree splitting sort
method for establishing communication with a radio frequency
identification device in a field of a plurality of such
devices.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
This disclosure of the invention is submitted in furtherance of the
constitutional purposes of the U.S. Patent Laws "to promote the
progress of science and useful arts" (Article 1, Section 8).
FIG. 1 illustrates a wireless identification device 12 in
accordance with one embodiment of the invention. In the illustrated
embodiment, the wireless identification device is a radio frequency
data communication device 12, and includes RFID circuitry 16. The
device 12 further includes at least one antenna 14 connected to the
circuitry 16 for wireless or radio frequency transmission and
reception by the circuitry 16. In the illustrated embodiment, the
RFID circuitry is defined by an integrated circuit as described in
the above-incorporated patent application Ser. No. 08/705,043,
filed Aug. 29, 1996 .Iadd.and now U.S. Pat. No. 6,130,602.Iaddend..
Other embodiments are possible. A power source or supply 18 is
connected to the integrated circuit 16 to supply power to the
integrated circuit 16. In one embodiment, the power source 18
comprises a battery.
The device 12 transmits and receives radio frequency communications
to and from an interrogator 26. An exemplary interrogator is
described in commonly assigned U.S. patent application Ser. No.
08/907,689, filed Aug. 8, 1997 and .Iadd.now U.S. Pat. No.
6,289,209, which is .Iaddend.incorporated herein by reference.
Preferably, the interrogator 26 includes an antenna 28, as well as
dedicated transmitting and receiving circuitry, similar to that
implemented on the integrated circuit 16.
Generally, the interrogator 26 transmits an interrogation signal or
command 27 via the antenna 28. The device 12 receives the incoming
interrogation signal via its antenna 14. Upon receiving the signal
27, the device 12 responds by generating and transmitting a
responsive signal or reply 29. The responsive signal 29 typically
includes information that uniquely identifies, or labels the
particular device 12 that is transmitting, so as to identify any
object or person with which the device 12 is associated. Although
only one device 12 is shown in FIG. 1, typically there will be
multiple devices 12 that correspond with the interrogator 26, and
the particular devices 12 that are in communication with the
interrogator 26 will typically change over time. In the illustrated
embodiment in FIG. 1, there is no communication between multiple
devices 12. Instead, the devices 12 respectively communicate with
the interrogator 26. Multiple devices 12 can be used in the same
field of an interrogator 26 (i.e., within communications range of
an interrogator 26).
The radio frequency data communication device 12 can be included in
any appropriate housing or packaging. Various methods of
manufacturing housings are described in commonly assigned U.S.
patent application Ser. No. 08/800,037, filed Feb. 13, 1997, and
.Iadd.now U.S. Pat. No. 5,988,510, which is .Iaddend.incorporated
herein by reference.
FIG. 2 shows but one embodiment in the form of a card or badge 19
including a housing 11 of plastic or other suitable material
supporting the device 12 and the power supply 18. In one
embodiment, the front face of the badge has visual identification
features such as graphics, text, information found on
identification or credit cards, etc.
FIG. 3 illustrates but one alternative housing supporting the
device 12. More particularly, FIG. 3 shows a miniature housing 20
encasing the device 12 and power supply 18 to define a tag which
can be supported by an object (e.g., hung from an object, affixed
to an object, etc.). Although two particular types of housings have
been disclosed, other forms of housings are employed in alternative
embodiments.
If the power supply 18 is a battery, the battery can take any
suitable form. Preferably, the battery type will be selected
depending on weight, size, and life requirements for a particular
application. In one embodiment, the battery 18 is a thin profile
button-type cell forming a small, thin energy cell more commonly
utilized in watches and small electronic devices requiring a thin
profile. A conventional button-type cell has a pair of electrodes,
an anode formed by one face and a cathode formed by an opposite
face. In an alternative embodiment, the power source 18 comprises a
series connected pair of button type cells. In other alternative
embodiments, other types of suitable power source are employed.
The circuitry 16 further includes a backscatter transmitter and is
configured to provide a responsive signal to the interrogator 26 by
radio frequency. More particularly, the circuitry 16 includes a
transmitter, a receiver, and memory such as is described in U.S.
patent application Ser. No. 08/705,043.Iadd., filed Aug. 29, 1996
and now U.S. Pat. No. 6,130,602.Iaddend..
Radio frequency identification has emerged as a viable and
affordable alternative to tagging or labeling small to large
quantities of items. The interrogator 26 communicates with the
devices 12 via an electromagnetic link, such as via an RF link
(e.g., at microwave frequencies, in one embodiment), so all
transmissions by the interrogator 26 are heard simultaneously by
all devices 12 within range.
If the interrogator 26 sends out a command requesting that all
devices 12 within range identify themselves, and gets a large
number of simultaneous replies, the interrogator 26 may not be able
to interpret any of these replies. Therefore, arbitration schemes
are provided.
If the interrogator 26 has prior knowledge of the identification
number of a device 12 which the interrogator 26 is looking for, it
can specify that a response is requested only from the device 12
with that identification number. To target a command at a specific
device 12, (i.e., to initiate point-on-point communication), the
interrogator 26 must send a number identifying a specific device 12
along with the command. At start-up, or in a new or changing
environment, these identification numbers are not known by the
interrogator 26. Therefore, the interrogator 26 must identify all
devices 12 in the field (within communication range) such as by
determining the identification numbers of the devices 12 in the
field. After this is accomplished, point-to-point communication can
proceed as desired by the interrogator 26.
Generally speaking, RFID systems are a type of multiaccess
communication system. The distance between the interrogator 26 and
devices 12 within the field is typically fairly short (e.g.,
several meters), so packet transmission time is determined
primarily by packet size and baud rate. Propagation delays are
negligible. In such systems, there is a potential for a large
number of transmitting devices 12 and there is a need for the
interrogator 26 to work in a changing environment, where different
devices 12 are swapped in and out frequently (e.g., as inventory is
added or removed). In such systems, the inventors have determined
that the use of random access methods work effectively for
contention resolution (i.e., for dealing with collisions between
devices 12 attempting to respond to the interrogator 26 at the same
time).
RFID systems have some characteristics that are different from
other communications systems. For example, one characteristic of
the illustrated RFID systems is that the devices 12 never
communicate without being prompted by the interrogator 26. This is
in contrast to typical multiaccess systems where the transmitting
units operate more independently. In addition, contention for the
communication medium is short lived as compared to the ongoing
nature of the problem in other multiaccess systems. For example, in
a RFID system, after the devices 12 have been identified, the
interrogator can communicate with them in a point-to-point fashion.
Thus, arbitration in a RFID system is a transient rather than
steady-state phenomenon. Further, the capability of a device 12 is
limited by practical restrictions on size, power, and cost. The
lifetime of a device 12 can often be measured in terms of number of
transmissions before battery power is lost. Therefore, one of the
most important measures of system performance in RFID arbitration
is total time required to arbitrate a set of devices 12. Another
measure is power consumed by the devices 12 during the process.
This is in contrast to the measures of throughput and packet delay
in other types of multiaccess systems.
FIG. 4 illustrates one arbitration scheme that can be employed for
communication between the interrogator and devices 12. Generally,
the interrogator 26 sends a command causing each device 12 of a
potentially large number of responding devices 12 to select a
random number from a known range and use it as that device's
arbitration number. By transmitting requests for identification to
various subsets of the full range of arbitration numbers, and
checking for an error-free response, the interrogator 26 determines
the arbitration number of every responder station capable of
communicating at the same time. Therefore, the interrogator 26 is
able to conduct subsequent unterrupted communication with devices
12, one at a time, by addressing only one device 12.
Three variables are used: an arbitration value (AVALUE), an
arbitration mask (AMASK), and a random value ID (RV). The
interrogator sends an Identify command (IdentifyCmnd) causing each
device of a potentially large number of responding devices to
select a random number from a known range and use it as that
device's arbitration number. The interrogator sends an arbitration
value (AVALUE) and an arbitration mask (AMASK) to a set of devices
12. The receiving devices 12 evaluate the following equation:
(AMASK & AVALUE)==(AMASK & RV) wherein "&" is a bitwise
AND function, and wherein "==" is an equality function. If the
equation evaluates to "1" (TRUE), then the device 12 will reply. If
the equation evaluates to "0" (FALSE), then the device 12 will not
reply. By performing this in a structured manner, with the number
of bits in the arbitration mask being increased by one each time,
eventually a device 12 will respond with no collisions. Thus, a
binary search tree methodology is employed.
An example using actual numbers will now be provided using only
four bits, for simplicity, reference being made to FIG. 4. In one
embodiment, sixteen bits are used for AVALUE and AMASK. Other
numbers of bits can also be employed depending, for example, on the
number of devices 12 expected to be encountered in a particular
application, on desired cost points, etc.
Assume, for this example, that there are two devices 12 in the
field, one with a random value RV) of 1100 (binary), and another
with a random value (RV) of 1010 (binary). The interrogator is
tying to establish communications without collisions being caused
by the two devices 12 attempting to communicate at the same
time.
The interrogator sets AVALUE to 0000 (or "don't care" for all bits,
as indicated by the character "X" in FIG. 4) and AMASK to 0000. The
interrogator transmits a command to all devices 12 requesting that
they identify themselves. Each of the devices 12 evaluate (AMASK
& AVALUE)==(AMASK & RV) using the random value RV that the
respective devices 12 selected. If the equation evaluates to "1"
(TRUE), then the device 12 will reply. If the equation evaluates to
"0" (FALSE), then the device 12 will not reply. In the first level
of the illustrated tree, AMASK is 0000 and anything bitwise ANDed
with all zeros results in all zeros, so both the devices 12 in the
field respond, and there is a collision.
Next, the interrogator sets AMASK to 0001 and AVALUE to 0000 and
transmits an Identify command. Both devices 12 in the field have a
zero for their least significant bit, and (AMASK &
AVALUE)==(AMASK & RV) will be true for both devices 12. For the
device 12 with a random value of 1100, the left side of the
equation is evaluated as follows (0001 & 0000)=0000.
The right side is evaluated as (0001 & 1100)=0000. The left
side equals the right side, so the equation is true for the device
12 with the random value of 1100. For the device 12 with a random
value of 1010, the left side of the equation is evaluated as (0001
& 0000)=0000. The right side is evaluated as (0001 &
1010)=0000. The left side equals the right side, so the equation is
true for the device 12 with the random value of 1010. Because the
equation is true for both devices 12 in the field, both devices 12
in the field respond, and there is another collision.
Recursively, the interrogator next sets AMASK to 0011 with AVALUE
still at 0000 and transmits an Identify command. (AMASK &
AVALUE)==(AMASK & RV) is evaluated for both devices 12. For the
device 12 with a random value of 1100, the leftside of the equation
is evaluated as follows (0011 & 0000)=0000. The right side is
evaluated as (0011 & 1100)=0000. The left side equals the right
side, so the equation is true for the device 12 with the random
value of 1100, so this device 12 responds. For the device 12 with a
random value of 1010, the left side of the equation is evaluated as
(0011 & 0000)=0000. The right side is evaluated as (0011 &
1010)=0010. The left side does not equal the right side, so the
equation is false for the device 12 with the random value of 1010,
and this device 12 does not respond; Therefore, there is no
collision, and the interrogator can determine the identity (e.g.,
an identification number) for the device 12 that does respond.
De-recursion takes place, and the devices 12 to the right for the
same AMASK level are accessed when AVALUE is set at 0010, and AMASK
is set to 0011.
The device 12 with the random value of 1010 receives a command and
evaluates the equation (AMASK & AVALUE)==(AMASK & RV). The
left side of the equation is evaluated as (0011 & 0010)=0010.
The right side of the equation is evaluated as (0011 &
1010)=0010. The right side equals the left side, so the equation is
true for the device 12 with the random value of 1010. Because there
are no other devices 12 in the subtree, a good reply is returned by
the device 12 with the random value of 1010. There is no collision,
and the interrogator 26 can determine the identity (e.g., an
identification number) for the device 12 that does respond.
By recursion, what is meant is that a function makes a call to
itself. In other words, the function calls itself within the body
of the function. After the called function returns, de-recursion
takes place and execution continues at the place just after the
function call; i.e. at the beginning of the statement after the
function call.
For instance, consider a function that has four statements
(numbered 1,2,3,4) in it, and the second statement is a recursive
call. Assume that the fourth statement is a return statement. The
first time through the loop (iteration 1) the function executes the
statement 2 and (because it is a recursive call) calls itself
causing iteration 2 to occur. When iteration 2 gets to statement 2,
it calls itself making iteration 3. During execution in iteration 3
of statement 1, assume that the function does a return. The
information that was saved on the stack from iteration 2 is loaded
and the function resumes execution at statement 3 (in iteration 2),
followed by the execution of statement 4 which is also a return
statement. Since there are no more statements in the function, the
function de-recurses to iteration 1. Iteration 1, had previously
recursively called itself in statement 2. Therefore, it now
executes statement 3 (in iteration 1). Following that it executes a
return at statement 4. Recursion is known in the art.
Consider the following code which can be used to implement
operation of the method shown in FIG. 4 and described above.
TABLE-US-00001 Arbitrate(AMASK,AVALUE) {
collision=IdentifyCmnd(AMASK, AVALUE) if (collision) then { /*
recursive call for left side */ Arbitrate ((AMASK<<1)+1,
AVALUE /* recursive call for right side */ Arbitrate
((AMASK<<1)+1, AVALUE+(AMASK+1)) } /* endif */ }/* return
*/
The symbol "<<" represents a bitwise left shift. "<<1"
means shift left by one place. Thus, 0001<<1 would be 0010.
Note, however, that AMASK is originally called with a value of
zero, and 0000<<1 is still 0000. Therefore, for the first
recursive call, AMASK=(AMASK<<1)+1. So for the first
recursive call, the value of AMASK is 0000+0001=0001. For the
second call, AMASK=(0001<<)+1=0010+1=0011. For the third
recursive call, AMASK=(0011<<1)+1=0110+1=0111.
The routine generates values for AMASK and AVALUE to be used by the
interrogator in an Identify command "IdentifyCmnd." Note that the
routine calls itself if there is a collision. De-recursion occurs
when there is no collision. AVALUE and AMASK would have values such
as the following assuming collisions take place all the way down to
the bottom of the tree.
TABLE-US-00002 AVALUE AMASK 0000 0000 0000 0001 0000 0011 0000 0111
0000 1111* 1000 1111* 0100 0111 0100 1111* 1100 1111*
This sequence of AMASK, AVALUE binary numbers assumes that there
are collisions all the way down to the bottom of the tree, at which
point the Identify command sent by the interrogator is finally
successful so that no collision occurs. Rows in the table for which
the interrogator is successful in receiving a reply without
collision are marked with the symbol "*". Note that if the Identify
command was successful at, for example, the third line in the table
then the interrogator would stop going down that branch of the tree
and start down another, so the sequence would be as shown in the
following table.
TABLE-US-00003 AVALUE AMASK 0000 0000 0000 0001 0000 0011* 0010
0011 . . . . . .
This method is referred to as a splitting method. It works by
splitting groups of colliding devices 12 into subsets that are
resolved in turn. The splitting method can also be viewed as a type
of tree search. Each split moves the method one level deeper in the
tree. Either depth-first or breadth-first traversals of the tree
can be employed. Depth first traversals are performed by using
recursion, as is employed in the code listed above. Breadth-first
traversals are accomplished by using a queue instead of
recursion.
Either depth-first or breadth-first traversals of the tree can be
employed. Depth first traversals are performed by using recursion,
as is employed in the code listed above. Breadth-first traversals
are accomplished by using a queue instead of recursion. The
following is an example of code for performing a breadth-first
traversal.
TABLE-US-00004 Arbitrate(AMASK,AVALUE) { enqueue(0,0) while (queue
!= empty) (AMASK,AVALTE)=dequeue( ) collision=IdentifyCmnd(AMASK,
AVALUE) if (collision) then { TEMP = AMASK+1 NEW_AMASK =
(AMASK<<1)+1 enqueue(NEW_AMASK, AVALUE) enqueue(NEW_AMASK,
AVALUE+TEMP) } /* endif */ endwhile }/* return */
The symbol "!=" means not equal to. AVALUE and AMASK would have
values such as those indicated in the following table for such
code.
TABLE-US-00005 AVALUE AMASK 0000 0000 0000 0001 0001 0001 0000 0011
0010 0011 0001 0011 0011 0011 0000 0111 0100 0111 . . . . . .
Rows in the table for which the interrogator is successful in
receiving a reply without collision are marked with the symbol
"*".
FIG. 5 illustrates an embodiment wherein the interrogator 26
retries on the same node that yielded a good reply. The search tree
has a plurality of nodes 51, 52, 53, 54 etc. at respective levels
32, 34, 36, 38, or 40. The size of subgroups of random values
decrease in size by half with each node descended.
The interrogator performs a tree search, either depth-first or
breadth-first in a manner such as that described in connection with
FIG. 4, except that if the interrogator determines that no
collision occurred in response to an Identify command, the
interrogator repeats the command at the same node. This takes
advantage of an inherent capability of the devices, particularly if
the devices use backscatter communication, called self-arbitration.
Arbitration times can be reduced, and battery life for the devices
can be increased.
When a single reply is read by the interrogator, for example, in
node 52, the method described in connection with FIG. 4 would
involve proceeding to node 53 and then sending another Identify
command. Because a device 12 in a field of devices 12 can override
weaker devices, this embodiment is modified such that the
interrogator retries on the same node 52 after silencing the device
12 that gave the good reply. Thus, after receiving a good reply
from node 52, the interrogator remains on node 52 and reissues the
Identify command after silencing the device that first responded on
node 52. Repeating the Identify command on the same node often
yields other good replies, thus taking advantage of the devices
natural ability to self-arbitrate.
AVALUE and AMASK would have values such as the following for a
depth-first traversal in a situation similar to the one described
above in connection with FIG. 4.
TABLE-US-00006 AVALUE AMASK 0000 0000 0000 0001 0000 0011 0000 0111
0000 1111* 0000 1111* 1000 1111* 1000 1111* 0100 0111 0100 1111*
0100 1111* 1100 1111* 1100 1111*
Rows in the table for which the interrogator is successful in
receiving a reply without collision are marked with the symbol
"*".
In operation, the interrogator transmits a command at a node,
requesting that devices within the subgroup represented by the node
respond. The interrogator determines if a collision occurs in
response to the command and, if not, repeats the command at the
same node.
In one alternative embodiment, the upper bound of the number of
devices in the field (the maximum possible number of devices that
could communicate with the interrogator) is determined, and the
tree search method is started at a level 32, 34, 36, 38, or 40 in
the tree depending on the determined upper bound. The level of the
search tree on which to start the tree search is selected based on
the determined maximum possible number of wireless identification
devices that could communicate with the interrogator. The tree
search is started at a level determined by taking the base two
logarithm of the determined maximum possible number. More
particularly, the tree search is started at a level determined by
taking the base two logarithm of the power of two nearest the
determined maximum possible number of devices 12. The level of the
tree containing all subgroups of random values is considered level
zero, and lower levels are numbered 1, 2, 3, 4, etc.
consecutively.
Methods involving determining the upper bound on a set of devices
and starting at a level in the tree depending on the determined
upper bound are described in a commonly assigned patent application
.[.(attorney docket MI40-118) naming Clifton W. Wood, Jr. as an
inventor, titled "Method of Addressing Messages and Communications
System," filed concurrently herewith, and.]. .Iadd.Ser. No.
09/026,043, filed Feb. 19, 1998 and now U.S. Pat. No. 6,118,789,
which is .Iaddend.incorporated herein by reference.
In one alternative embodiment, a method involving starting at a
level in the tree depending on a determined upper bound (such as
the method described in the commonly assigned patent application
mentioned above) is combined with a method comprising re-trying on
the same node that gave a good reply, such as the method shown and
described in connection with FIG. 5.
Another arbitration method that can be employed is referred to as
the "Aloha" method. In the Aloha method, every time a device 12 is
involved in a collision, it waits a random period of time before
retransmitting. This method can be improved by dividing time into
equally sized slots and forcing transmissions to be aligned with
one of these lots. This is referred to as "slotted Aloha." In
operation, the interrogator asks all devices 12 in the field to
transmit their identification numbers in the next time slot. If the
response is garbled, the interrogator informs the devices 12 that a
collision has occurred, and the slotted Aloha scheme is put into
action. This means that each device 12 in the field responds within
an arbitrary slot determined by a randomly selected value. In other
words, in each successive time slot, the devices 12 decide to
transmit their identification number with a certain
probability.
The Aloha method is based on a system operated by the University of
Hawaii. In 1971, the University of Hawaii began operation of a
system named Aloha. A communication satellite was used to
interconnect several university computers by use of a random access
protocol. The system operates as follows. Users or devices transmit
at any time they desire. After transmitting, a user listens for an
acknowledgment from the receiver or interrogator. Transmissions
from different users will sometimes overlap in time (collide),
causing reception errors in the data in each of the contending
messages. The errors are detected by the receiver, and the receiver
sends a negative acknowledgment to the users. When a negative
acknowledgment is received, the messages are retransmitted by the
colliding users after a random delay. If the colliding users
attempted to retransmit without the random delay, they would
collide again. If the user does not receive either an
acknowledgment or a negative acknowledgment within a certain amount
of time, the user "times out" and retransmits the message.
There is a scheme known as slotted Aloha which improves the Aloha
scheme by requiring a small amount of coordination among stations.
In the slotted Aloha scheme, a sequence of coordination pulses is
broadcast to all stations (devices). As is the case with the pure
Aloha scheme, packet lengths are constant. Messages are required to
be sent in a slot time between synchronization pulses, and can be
started only at the beginning of a time slot. This reduces the rate
of collisions because only messages transmitted in the same slot
can interfere with one another. The retransmission mode of the pure
11 Aloha scheme is modified for slotted Aloha such that if a
negative acknowledgment occurs, the device retransmits after a
random delay of an integer number of slot times.
Aloha methods are described in a commonly assigned patent
application .[.(attorney docket MI40-089) naming Clifton W. Wood,
Jr. as an inventor, titled "Method of Addressing Messages and
Communications System," filed concurrently herewith, and.].
.Iadd.Ser. No. 09/026,248, filed Feb. 19, 1998, now U.S. Pat. No.
6,275,476, which is .Iaddend.incorporated herein by reference.
In one alternative embodiment, an Aloha method (such as the method
described in the commonly assigned patent application mentioned
above) is combined with a method involving re-trying on the same
node that gave a good reply, such as the method shown and described
in connection with FIG. 5.
In another embodiment, levels of the search tree are skipped.
Skipping levels in the tree, after a collision caused by multiple
devices 12 responding, reduces the number of subsequent collisions
without adding significantly to the number of no replies. In
real-time systems, it is desirable to have quick arbitration
sessions on a set of devices 12 whose unique identification numbers
are unknown. Level skipping reduces the number of collisions, both
reducing arbitration time and conserving battery life on a set of
devices 12. In one embodiment, every other level is skipped. In
alternative embodiments, more than one level is skipped each
time.
The trade off that must be considered in determining how many (if
any) levels to skip with each decent down the tree is as follows.
Skipping levels reduces the number of collisions, thus saving
battery power in the devices 12. Skipping deeper (skipping more
than one level) further reduces the number of collisions. The more
levels that are skipped, the greater the reduction in collisions.
However, skipping levels results in longer search times because the
number of queries (Identify commands) increases. The more levels
that are skipped, the longer the search times. Skipping just one
level has an almost negligible effect on search time, but
drastically reduces the number of collisions. If more than one
level is skipped, search time increases substantially. Skipping
every other level drastically reduces the number of collisions and
saves battery power without significantly increasing the number of
queries.
Level skipping methods are described in a commonly assigned patent
application .[.(attorney docket MI40-117) naming Clifton W. Wood,
Jr. and Don Hush as inventors, titled "Method of Addressing
Messages, Method of Establishing Wireless Communications, and
Communications System," filed concurrently herewith, and.].
.Iadd.Ser. No. 09/026,045, filed Feb. 19, 1998, now U.S. Pat. No.
6,072,801, which is .Iaddend.incorporated herein by reference.
In one alternative embodiment, a level skipping method is combined
with a method involving re-trying on the same node that gave a good
reply, such as the method shown and described in connection with
FIG. 5.
In yet another alternative embodiment, any two or more of the
methods described in the commonly assigned, concurrently filed,
applications mentioned above are combined.
In compliance with the statute, the invention has been described in
language more or less specific as to structural and methodical
features. It is to be understood, however, that the invention is
not limited to the specific features shown and described, since the
means herein disclosed comprise preferred forms of putting the
invention into effect. The invention is, therefore, claimed in any
of its forms or modifications within the proper scope of the
appended claims appropriately interpreted in accordance with the
doctrine of equivalents.
* * * * *
References