与计算机专业相关的外文文献,计算机专业的外文文献.pdf

A Rapid Tag Identification Method with Two

Slots in RFID Systems

Yong Hwan Kim, Sung Soo Kim, Kwang Seon Ahn

Department of Computer Engineering, Kyungpook National University

Daegu, Korea

{hypnus, ninny, gsahn}@knu.ac.kr

Abstract—RFID is core technology in the area of ubiquitous compu-ting. Identify the objects begin with the reader’s query to the tag at-tached to the subject. When multiple tags exist in the reader’s inter-rogation zone, these tags simultaneously respond to the reader’s query, resulting in collision. In RFID system, the reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation zone. This paper proposes tree based Rapid Tag Identi-fication Method with Two Slots(RTIMTS). The proposed algorithm rapidly identifies a tag with the information of Two Slots and MSB(Most Significant Bit). Two Slots resolve the tag collision by receiving the response from the tag to the Slot 0 and 1. The reader can identify two tags at once using MSB of information added to the tag ID. With RTIMTS algorithm, the total time of tag identification can be shortened by decreasing the number of query-responses from the reader.

Keywords-RFID; Anti-collision; Two Slots; the number of query-responses.

I.I NTRODUCTION

RFID(Radio Frequency Identification) is a technology that deciphers or identifies the tag information through a reader (or interrogator) without contact. RFID have become very popular in many service industries, purchasing and distribution logis-tics, industry, manufacturing companies and material flow systems. Automatic Identification procedures exist to provide information about people, animals, goods and products in tran-sit[1][2].

The reader receives required information from the tags by sending and receiving wireless signals with the tag. Since the communication between the readers and the tags shares wire-less channels, there exist collisions. The collisions can be di-vided into the reader collision and the tag collision. The reader collision occurs when multiple readers send request signals to one tag, and the tag receives the wrong request signal due to signal interference between readers. The tag collision occurs when more than two tags simultaneously respond to one reader and the reader cannot identify any tags. This kind of collision makes the reader take long time to identify tags within the read-er’s identification range and impossible to identify even one tag[3][4][5] [6].

Therefore, the collision is a crucial problem that must be re-solved in RFID systems, so many studies to resolve this prob-lem have been carried out as well as are ongoing. This paper focuses on the tag collision problem which occurs in the case where one reader identifies multiple tags. Figure 1 provides schematizations of reader collision and tag collision.

This paper proposes the Rapid Tag Identification Method with Two Slots (RTIMTS), for faster tag identification in mul-ti-tag environment where one reader identifies multiple tags. In the transfer paper[7], the proposed algorithm designs the method that it does without the value extracting procedure of even(or odd) parity bit of ID bit(T pb),the number of identified ‘1’s(T1n), the number of remaining ‘1’s(T rn), and the number of collided bit (T cb) with simple it can predict a tagID. Maximum 4 tag IDs can

be identified on one round by using Two slots.

a) The Reader collision b) The Tag collision

Figure 1. The collision problem in RFID System

II.T HE R ELATED WORKS

A. Query Tree

Query Tree(QT) algorithm is a binary tree based anti colli-sion algorithm and has an advantage in easily implementation due to its simple operating mode[8]. QT sets the reader’s query and tag’s response as one round, and identifies tags by iterating the round. In each round, the reader requests prefix to tag’s ID. And when ID matches the prefix, each tag transmits all IDs including prefixes to the reader. At this time, if more than one tag simultaneously responds, the reader cannot recognize tag’s ID, but can recognize that there are currently more than two tags having the prefix. Then the reader adds ‘0’ or ‘1’ to the current prefix and queries the longer prefix to the tags again. When only one tag responds to the reader, it identifies the tag. In other words, the reader adds the prefix by 1 bit until only one tag responds and iterates this process until identifying all the tags within the range. Figure 2 shows the operating process of QT algorithms[10].

Figure 2 shows the process that four tags respond according to the readers’ query. In round 1, 2, 3, and 7, the collision oc-curs because more than two tags respond, and in round 4, 5, 8, and 9, tag can be identified because only one tag responds. The digital coding method applied to QT cannot detect the collision

bits. When a collision occurs, the reader adds ‘0’ or ‘1’ to the

2009 Eighth IEEE International Symposium on Network Computing and Applications

978-0-7695-3698-9/09 $25.00 © 2009 IEEE DOI 10.1109/NCA.2009.21

292

Authorized licensed use limited to: Xi'an University of Technology. Downloaded on July 12,2010 at 03:17:11 UTC from IEEE Xplore. Restrictions apply.