Systems and methods for optimizing communications between an RFID reader and a tag population using partial binary tree traversal

• US 20070001812A1
• Filed: 06/30/2005
• Published: 01/04/2007
• Est. Priority Date: 06/30/2005
• Status: Abandoned Application

• Current Assignee: Symbol Technologies, Inc. (Zebra Technologies Corporation)
• Original Assignee: Symbol Technologies, Inc. (Zebra Technologies Corporation)
• Inventors: Powell, Kevin
• Application Number:
  US11/169,567
• Publication Number:
  US 20070001812A1
• Time in Patent Office: Days
• US Class Current: 340/10.200
• CPC Class Codes: G06K 7/0008 General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
• CPC Class Codes: G06K 7/10049 binary tree

Abstract

System and methods for optimizing communications between an RFID reader and a population of tags are described. To increase a read rate, the reader and tags use a partial binary tree traversal. In partial binary tree traversal, a first portion of a tag identification sequence is read. A set marker command is then transmitted to a group of tags causing the tags to set a bit position for start of subsequent binary tree traversal. The subsequent binary tree traversal for the tag group starts at the marked position. Thus, the reader and group of tags negotiate a subset of the identification sequence instead of the entire identification sequence.

Claims

1. A method in a radio frequency identification (RFID) reader for interrogating an RFID tag population, comprising the steps of:

(a) reading a first portion of a tag identification bit sequence of tags in the population of tags using a tag interrogation protocol;

(b) causing the tags in the tag population to transition to a state for receiving reader commands;

(c) transmitting a command to cause a first group of tags in the tag population to each set a marker at a specific bit position of their respective tag identification bit sequence and to transition to a state for negotiating a second portion of the tag identification bit sequence; and

(d) reading the second portion of the tag identification bit sequence for a first tag in the first group of tags starting from the marked specific bit position using the tag interrogation protocol.

2. The method of claim 1, further comprising the step of:

(e) repeating step (d) for each remaining tag in the first group of tags.

3. The method of claim 1, wherein step (a) comprises:

determining bit values in the first portion of the tag identification bit sequence; and

reading the first portion of the tag identification sequence according to a specific read binary tree traversal protocol, wherein the reader uses the determined values for the bits in the first portion of the tag identification bit sequence to direct the specific read.

4. The method of claim 1, wherein step (a) comprises:

reading the first portion of the tag identification sequence according to a general read binary tree traversal protocol; and

ending the read of the first portion of the tag identification sequence when the reader receives both a data “

0” and

a data “

1”

from the tags in the tag population for a current bit position being read,

wherein bit values in bit positions negotiated prior to the current bit position being read comprise the first portion of the tag identification sequence.

5. The method of claim 1, wherein step (b) further comprises:

causing a second group of tags in the tag population to transition to a dormant state.

6. The method of claim 1, wherein step (c) further comprises:

transmitting a bit position indicator following the command.

7. The method of claim 1, wherein the first group of tags have tag identification sequences matching the first portion of the tag identification sequence for all read bit positions.

8. The method of claim 1, wherein the tag interrogation protocol is a binary tree traversal protocol.

9. The method of claim 2, further including the steps of:

appending the first portion of the tag identification sequence to each second portion of the tag identification sequence read.

10. A method in a radio frequency identification (RFID) tag for communicating with a reader, comprising the steps of:

(a) engaging in negotiation of a first portion of an identification sequence associated with the tag according to an interrogation protocol;

(b) transitioning to a state for receiving commands from the reader upon receipt of a first sequence of symbols;

(c) receiving a set marker command;

(d) setting a bit position for start of negotiation of a second portion of the identification sequence associated with the tag; and

(e) engaging in negotiation of the second portion of the identification sequence associated with the tag according to the interrogation protocol, wherein the negotiation of the second portion begins at the set bit position.

11. The method of claim 10, wherein step (b) comprises the steps of:

(i) transitioning to a negotiation start state upon receipt of a second sequence of symbols;

(ii) tracking each time a symbol having a first value is received while the tag is in the negotiation start state; and

(iii) transitioning to the state for receiving commands when a symbol having a second value is received.

12. The method of claim 11, wherein step (d) further comprises transitioning to a negotiation state when the symbol having a first value was received a predetermined number of times while the tag was in the negotiation start state.

13. The method of claim 10, wherein step (d) comprises setting the bit position for start of the negotiation of the second portion of the identification sequence at the bit position immediately next to the last bit position negotiated during negotiation of the first portion of the identification sequence.

14. The method of claim 10, wherein step (c) further comprises:

receiving a bit position indicator following the set marker command.

15. The method of claim 14, wherein step (d) comprises setting the bit position for start of the negotiation of the second portion of the identification sequence at the bit position received in the bit position indicator.

16. The method of claim 11, wherein the interrogation protocol is a binary tree traversal protocol.

17. The method of claim 12, wherein step (b)(ii) includes:

incrementing a counter each time the symbol having the first value is received when the tag is in the negotiation start state.

18. The method of claim 12, wherein step (d) includes:

upon receipt of the set marker command, comparing the value of the counter to a value of a stored variable; and

transitioning to a command start state when the value of the counter equals the value of the stored variable.

19. The method of claim 11, wherein step (b)(ii) includes:

setting the value of a counter to a predetermined number;

decrementing the counter each time the symbol having the first value is received when the tag is in the negotiation start state.

20. The method of claim 19, wherein step (d) includes:

upon receipt of the set marker command, examining the value of the counter; and

transition to a command start state when the value of the counter equals zero.