-
IEICE Transactions. 01/2010; 93-B:170-173.
-
10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010; 01/2010
-
[show abstract]
[hide abstract]
ABSTRACT: In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Enhanced Slotted Binary Tree Algorithm with Intelligent Separation (IS-ESBT). In IS-ESBT, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2<sup>nd</sup> bits responds in slot 0, while the group of tags with an odd number of 1's responds in slot 1. The IS-ESBT generates the request prefix so that the only existing tags according to the response in the corresponding slot. That is, it decreases the tag identification time by reducing the overall number of requests.
Computers and Communications, 2009. ISCC 2009. IEEE Symposium on; 08/2009
-
[show abstract]
[hide abstract]
ABSTRACT: In RFID system, because a collision occurs while a reader attempts to identify multiple tags at the same time, the anti-collision algorithm is necessary. This paper uses the tree based algorithm expressed in the form of a B-ary tree, in which the time required to identify all tags varies according to the value of B(Bges2). An increase in the value of B will decrease the number of collision cycles, while increasing the number of idle cycles. In order to solve this problem in previous algorithms, an improved 4-ary query tree algorithm (I4QTA) is suggested. If a collision occurs, the I4QTA uses the bits change method (BCM) to remove idle cycles by only detecting the tag IDs that actually exist. In other words, it can quickly identify all tags by reducing the number of query-responses.
Advanced Information Networking and Applications, 2009. AINA '09. International Conference on; 06/2009
-
Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2009, Chengdu, China, 12-14 December, 2009; 01/2009
-
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC 2009, Suwon, Korea, January 15-16, 2009; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: With the wide adoption of radio frequency identification (RFID) system, one of important issues is the anti-collision problem. This means that the reader should be identified all tags within the same range, efficiently, fast. Generally, the tree-based protocols should make the unique ID from the request from the reader and the response from tags. In the result, the traditional methods need the number of considerable query. In this paper, we, on the environment making IDs from the rest of bits except the specified fields of EPC Class 1 Gen. 2 for the similar circumstances that we can easily look at real environment, propose the BSCTTA based method to reduce the number of query.
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on; 11/2008
-
[show abstract]
[hide abstract]
ABSTRACT: In RFID (Radio Frequency IDentification) system, the reader needs the anti collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree based Tag Prediction Algorithm using Upper Bit (TPAUB) to arbitrate the tag collision. A TPAUB can identify tags without identifying all the bits in the tag ID. The reader uses the upper bit which is added to the tag ID and if there are two collided bits or multiple collided bits, it checks the upper bit and grasps the number the number of identified dasia1psilas. A TPAUB can reduce the number of the requests transmitted from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on; 11/2008
-
[show abstract]
[hide abstract]
ABSTRACT: The RFID (radio frequency identification) is a technology that automatically identifies objects containing the electronic tags by using radio frequency. In RFID system, the reader needs the anti collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree based anti collision algorithm using parity bit (ACPB) to arbitrate the tag collision. The proposed algorithm identifies tags without checking all the bits in the tags. The reader uses the parity bit which is added to the tag IDs. If there are two collided bits in tags, then reader identify tags by the parity concept. The reader can identify two tags using ACPB algorithm. ACPB can reduce the number of the requests from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.
Network Computing and Applications, 2008. NCA '08. Seventh IEEE International Symposium on; 08/2008
