Keywords: RFID, anti-collision, code expansion, tag identification, tree-based protocol
Received February 18, 2009; revised August 12 & December 1, 2009 & March 26, 2010; accepted March 24, 2010.
Communicated by Ren-Hung Hwang.
| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] | [ 22] | [ 23] | [ 24] | [ 25] |
¡@
KUO-HUI YEH, NAI-WEI LO AND ENRICO WINATA
Department of Information Management
National Taiwan University of Science and Technology
Taipei, 106 Taiwan
With the ability of recognizing tag content wirelessly within a limited distance and a
short period of query time, RFID technology has been adopted and deployed on various
applications. In consequence, how to effectively avoid responses collision from multiple
tags and to further reduce the average query time per tag becomes an important performance
issue for RFID systems. To get better performance in comparison with current RFID
anti-collision mechanisms from ISO and EPCglobal standards, an efficient tag identification
scheme for RFID systems is presented. Instead of avoiding signal collision, the proposed
protocol, called CE-TIP, adequately utilizes a code expansion mechanism and
takes the advantage of signal collision to fast identify numerous tags. Compared to existing
protocols such as QueryTree, BinarySearch and RN16QT, CE-TIP can reduce at least
13% (up to 58%) of communication overhead on the number of query commands issued
and average 10% to 12.5% of total transmission delay on the number of transmitted bits,
respectively. In addition, CE-TIP protocol can be easily adopted and implemented within
current RFID tags and readers. A RFID tag only needs to store one extra code at its
memory space.
Received February 18, 2009; revised August 12 & December 1, 2009 & March 26, 2010; accepted March 24, 2010.
Communicated by Ren-Hung Hwang.