• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.289-298
• /
• 2009

Generally, RFID systems are composed of one reader and several passive tags, and share the single wireless channel. For this reason, collisions occurwhen more than two tags simultaneously respond to the reader's inquiry. To achieve this problem, many papers, such as QT[8], HCT[10], BSCTTA[2], and QT-BCS[9], have been proposed. In this paper, we propose the tree-based anti-collision algorithm using a bit change sensing unit (TABCS) based on BSCTTA algorithm. The proposed algorithm can identify bits returned from tags through bit change sensing unit, even if multi collisions occur. So, it rapidly generates the unique prefix to indentify each tag, and reduce the total of bits. As the result, the cost of identifying all tag IDs is relatively reduced as compared with existing algorithms. It is verified through simulations that the proposed algorithm surpass other existing algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.48-55
• /
• 2009

In this paper, We propose Adaptive Group Separation algorithm for efficient RFID system AGS algorithm determines the optimized initial prefix size j, and divides the group of. A reader requests the group and searches the tag ID. If a tag collision occurred, reader adds a one bit, '0' or '1' at first bit of collision point, As a result we observe that transmitted data bits and the recognition time are decreased. The proposed algorithms have been verified by computer simulation. The performance of the proposed anti-collision algorithm is evaluated in terms of the number of repetitions and the amount of transmission bits according to the in crease of the number of tags is 256. The AGS algorithm improve the number of repetitions by about 32.3% and reduce tile amount of the transmission bits by about 1/40 than slotted binary tree algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.109-117
• /
• 2016

The most important mission of RFID reader is identify EPC (Electronic Product Code) of RFID tag of products that located within distinguishable range of RFID reader. RFID reader transmits query message to RFID tags through wireless channel and RFID tags send unique EPC to response its query message simultaneously. therefore tag collision occurred frequently. RFID tags collision resolution algorithm required to apply RFID technology to various industries. In this paper, we propose enhanced M-ary algorithm that collision bits location is used by not only RFID reader but also tags. the main feature of the proposed algorithm is that integrate multiple query message of M-ary QT algorithm to the single query message by analyze multiple response messages from tags. the simulation results show that the proposed algorithm give better performance than M-ary QT algorithm in terms of the number of query-response, identification efficiency and communication overhead.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.299-300
• /
• 2008

In this paper, we propose Adaptive Group Separation(AGS) algorithm for efficient RFID system. AGS algorithm determines the optimized initial prefix size m, and divides the group of ��$2^m$. A reader requests the group and searches the tag ID. If a tag collision occurred, reader adds a one bit, '0' or '1' at first bit of collision point. As a result, we observe that transmitted data bits and the recognition time are decreased.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.469-474
• /
• 2009

Q-algorithm is proposed at EPC global Class-1 Generation-2 RFID systems to determine the frame size of next query round. In Q-algorithm, the reader calculates the frame size without estimating the number of tags. But, it uses only the slot conditions: empty, success, or collision. Therefore, it wastes less computational cost and is simpler than other algorithms. However, the constant parameter C value, which is used for calculating the next frame size, is not optimized. In this paper, we propose the optimized C values of Q-algorithm according to the number of tags within the identification range of reader through a lot of computer simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.51-60
• /
• 2009

In radio frequency identification(RFID) systems, when an RFID reader uses the same or adjacent frequency with neighbor readers, the interference between the readers may occur, which causes the reader collision and errors in tag recognition. In the previous study on RFID reader anti-collision, the techniques based on Frequency Division Mutiplex(FDM) or Time Division Multiplex(TDM) are proposed. However in these paper, the problem on the condition of RFID reader-to-reader interference considering the distance between interfering readers, frequency and operating time is not define exactly. In this paper, the interference effect is analyzed through RFID reader interference model considering the TDM and FDM, and the optimization problem is defined. To solve this, genetic-resource allocation technique is proposed. Therefore the optimal resource allocation applied RFID environment faithfully is accomplished.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1130-1137
• /
• 2006

One of the important performance issues in large-scale RFID systems is to resolve collisions among responses from RFID tags. Considering two do facto anti-collision solutions, namely the binary-tree splitting algorithm and the Slotted-Aloha algorithm, we propose to use multi-packet reception (MPR) capability to enhance the RFID tag reading rate (i.e., throughput). MPR allows an RFID reader to receive multiple reponses transmitted by tags at the same time. We analyze the effect of MPR capability in the above anti-collision algorithms, which is also validated by simulation. The analysis and simulation results show that RFID reader antenna design and signal separation techniques play an important role in improving RFID system performance with MPR capability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2294-2309
• /
• 2020

In this article, a new Aloha-based tag identification protocol is presented to improve the reading efficiency of the EPC C1 Gen2-based UHF RFID system. Collision detection (CD) plays a vital role in tag identification process which determines the efficiency of anti-collision protocols since most Aloha-based protocols optimize the incoming frame length based on the collisions in current frame. Existing CD methods are ineffective in identifying collision, resulting in a degradation of identification performance. Our proposed algorithm adopts an enhanced CD (ECD) scheme based on the EPC C1 Gen2 standard to optimize identification performance. The ECD method can realize timely and effective CD by detecting the pulse width of the randomly sent by tags. According to the ECD, the reader detects the slot distribution and predicts tag cardinality in every collision slot. The tags involved in each collision slot are identified by independently assigned sub-frames. A large number of numerical results show that the proposed solution is superior to other existing anti-collision protocols in various performance evaluation metrics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1133-1138
• /
• 2010

In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it cannot allocate an optimized frame size because it does not consider the number of tags. Also, the conventional Q-algorithm does not define an optimized parameter value C for adjusting the frame size. In this paper, we propose a modified Q-algorithm and evaluate the performance with computer simulations. The proposed Q-algorithm estimates the number of tags at every query round, and determines the parameter value C based on the estimated number of tags.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2541-2546
• /
• 2009

In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other DFSA algorithms. However, the standard does not define an optimized parameter value for adjusting the frame size. In this paper, we propose the optimized parameter values for minimizing the identification time by various computer simulations.