Professional Documents
Culture Documents
http://jcupt.xsw.bupt.cn
Abstract
This paper proposes a tree-based backoff (TBB) protocol that reduces the number of iterations implemented in the
procedure of tag collision arbitration in radio frequency identification (RFID) systems. This is achieved by employing the
following mechanisms: one is send the request command iteratively to all tags in the interrogation zone until a single tag is
identified. The other is backward to the parent node instead of root node to obtain the request parameters and send the
request command again until all tags are identified. Compared with the traditional tree-based protocol, on average,
simulated results show that the TBB protocol reduces the number of the iterations by 72.3% and the identification delay by
58.6% and achieves the goal of fast tag identification.
Keywords
1 Introduction
The RFID system [12] is an automatic technology
widely used in the fields of medicine, traffic, service
industries, distribution logistics and manufacturing
companies, etc. [3]. An RFID system usually consists of an
RFID reader, which is a transmitter/receiver module
connected to an antenna and a set of RFID tags, each of
which is a low functionality microchip connected to an
antenna. Generally, a tag that is attached to an object,
typically stores information about that object [4]. This
information may range from static identification (serial
number), to user written data (cost of the item), to sensory
data (temperature of a boiler). The reader uses radio signals
to communicate with the tag and access this information.
The operation of an RFID system often involves a
situation in which numerous tags are present in the
interrogation zone of a single reader at the same time, as
shown in Fig. 1. This leads to collisions because readers and
tags communicate over a shared channel capacity [5]. The
available channel capacity must be divided among the
individual tags so that data can be transferred from several
Received date: 19-07-2012
Corresponding author: ZHENG Jia-li, E-mail: lemontree312@live.cn
DOI: 10.1016/S1005-8885(13)60025-4
Fig. 1
38
n
rn
(1)
1 T
where n = 1, 2, 3,is the number of tags in the system and
rn =0,1,2,is the number of data packets that are
Table 2
Commands
Request
G=
2013
Select
Read-data
Unselect
Serial number
1010 0111
1011 0101
1010 1111
1011 1101
Descriptions
This command sends a serial number to the tags as a
parameter. If the tags own serial number is less than or
equal to the received serial number, then the tag sends its
own serial number back to the reader.
Sends a serial number to the tag as a parameter. The tag
with the identical tag address will become available for the
processing of other commands, e.g., reading and writing
data. Thus, this tag is selected. Tags with different
addresses will thereafter only respond to a request
command.
The selected tag sends stored data to the reader.
The selection of a previously selected tag is cancelled
and the tag is muted. In this case, the tag is completely
inactive and does not even respond to a request command.
Issue 2
ZHENG Jia-li, et al. / Tree-based backoff protocol for fast RFID tag identification
Command request
1111 1111
1010 1111
1010 0111
1111 1111
1010 1111
1111 1111
1011 0111
1111 1111
Responded tags
Tag 1: 1010 0111
Tag 2: 1011 0101
Tag 3: 1010 1111
Tag 4: 1011 1101
Tag 1: 1010 0111
Tag 3: 1010 1111
Tag 1: 1010 0111
Tag 2: 1011 0101
Tag 3: 1010 1111
Tag 4: 1011 1101
Tag 3:1010 1111
Tag 2:1011 0101
Tag 4: 1011 1101
Tag 2:1011 0101
Tag 4: 1011 1101
Identified tags
None
None
Tag 1
None
Tag 3
None
Tag 2
Tag 4
39
40
Responded tags
Identified tags
1111 1111
None
1010 1111
1010 0111
Tag 1
1010 1111
Tag 3
1111 1111
None
None
1011 0111
Tag 2
1111 1111
Tag 4
Simulated results
2013
Parameter
Value
Experimental area
30 m30 m
Number of readers
Identification range of the reader
Number of tags
Tag ID
Maximum meter per frame
1
3m
160
Random selected 48-bit ID
1 m/frame
Descriptions
Number
of iteration
Identification
delay
Scenario A
Scenario B
50
Issue 2
ZHENG Jia-li, et al. / Tree-based backoff protocol for fast RFID tag identification
41
work
was
supported
by
the
National
Natural
References
6 Conclusions
In this work, we propose a new tag collision arbitration
protocol-tree-based backoff (TBB) protocol, which
combines the tree-based protocol with a backoff
mechanism. By obtaining the request parameters from the
parent node instead of root node when a tag of the current
node is identified, the TBB protocol can significantly
reduce the number of iterations that are implemented to
detect all tags in the interrogation zone. Because the TBB
protocol requires less computational complexity than that
of the traditional tree-based protocol, tag identification
delays are reduced greatly and the goal of fast