• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1444-1451
• /
• 2009

This paper first proposes diverse C determining models in the Q algorithm which is proposed in the EPCglobal C1 Gen 2 standard and then compares and analyzes its performance. EPCglobal C1 Gen 2 standard proposes the slot-count (Q) selection algorithm for multiple tag identification environment, but there is no such definition for the C value which modifies the Q value depending on collision or no reply. During the tag anti-collision process, the Q algorithm adds C to the Q when there is a collision and reduces the Q by C when there is no reply. The modified Q value updates new slot-counts for tags which determines the tag identification speed, so the C value is an important factor. However, many researches only intend to increase the tag identification speed by proposing a new method or modifying the Q algorithm without any research about the C value. This paper suggests diverse C models which satisfies the EPCglobal C1 Gen 2 and analyzes their performance in the multi tag identification environment. The result of this paper can be used as an index for future researches on EPCglobal C1 Gen 2 C models and multiple tag identification performance.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.518-527
• /
• 2008

Tag collection is one of the major functions in Radio Frequency Identification (RFID) systems. IS0/IEC 18000-7 defines the tag collection algorithm using the anti-collision algorithm, based on the framed slotted ALOHA for active RFID systems. However, it has inefficiency problems that reduce tag collection performance by deciding non-optimum slot size or using point-to-point commands to put collected tags to sleep. In this paper, we propose two mechanisms to overcome the inefficiency problems and improve tag collection performance: 1) a new slot size decision mechanism to allow the reader to choose the optimum slot size flexibly and 2) a broadcast-based sleep mechanism to put collected tags to sleep effectively. We also implemented an active RFID system, composed of an active RFID reader and multiple tags, and the reader is designed to maximize tag collection performance when the proposed mechanisms are applied. In experiments, we evaluated the tag collection performance using one reader and 50 tags in the real-world environment. The experimental results show that when two mechanisms are applied and the initial number of slots is chosen appropriately, the performance of the proposed tag collection algorithm is greatly enhanced, compared with that of the standard.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1569-1580
• /
• 2016

For the 2.4 GHz active RFID to be successful in the market, one of the requirements is the increased battery life. However, currently we do not have any accurate power consumption estimation method. In this study we develop a simulation model, which can be used to estimate power consumption of tag accurately. Six different simulation models are proposed depending on collision algorithm and query command method. To improve estimation accuracy, we classify tag operating modes as the wake-up receive, UHF receive, sleep timer, tag response, and sleep modes. Power consumption and operating time are identified according to the tag operating mode. Query command for simplifying collection and ack command procedure and newly developed collision control algorithm are used in the simulation. Other performance measures such as throughput, recognition time for multi-tags, tag recognition rate including power consumption are compared with those from the current standard ISO/IEC 18000-7.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.307-314
• /
• 2006

This paper proposes a QT_rev algorithm for identifying multiple tags. The proposed QT_rev algorithm is based on the query tree algorithm. In the algorithm, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. On the other hand, in the QT_rev algorithm, the tag will send the remaining bits of their identification codes. After the leader receives all the responses of the tags, it knows which bit is collided. Therefore, if the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. According to the simulation results, the QT_rev algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.866-869
• /
• 2013

In this Paper, I propose a new anti-collision algorithm called Arbitrator-collision free reflected frame which restricts the size of frames and controlled the frame size when there are small tags. Since the proposal algorithm keeps the frame size and controlled the number of responding tags in such a way ones. can increase slot utilization, the algorithm shows superior performance to the existing algorithms. The simulation results showed that the proposed algorithm improves the efficiency by 0.8times compared to the existing algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.6-12
• /
• 2004

Identification rate and time are very important in the identification of RFID tag, and the tag requires simple structure to use economically large quantity of tags. These factors make the MAC protocols of wired or wireless network environment result in different requirements. In the paper, we propose a method to apply spread spectrum scheme using orthogonal channel via Walsh function as the anti-collision communication system for the purpose of non-collision identification of multiple tags, and consider its property. The proposed system use two step identification. in the first step, collision is resolved via constructing to respond after specific delay time based on unique n, and conventional polling scheme follows in the second step.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5C
• /
• pp.540-547
• /
• 2006

This paper proposes a novel anti-collision method for the ISO/IEC 18000-6 type B protocol which is the standard protocol of the 900 MHz RFID system. We improve the anti-collision performance by reducing the transmission number of commands and the length of bits required for multi-tag identification in the ISO/IEC 18000-6 type B protocol. Simulation results show that the proposed method improves the multi-tag identification time by 21.7% over the conventional method, irrespective of number of tags.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1169-1172
• /
• 2005

In this paper, we propose an improved anti-collision algorithm for multi tag interrogation in ubiquitous sensor network(USN) and show the result of simulation for multi tag interrogation in RFID systems. We have analyzed an EPC(Electronic Product Code) protocol which specifies the physical and logical requirements for a passive-backscatter Reader-Talk-First(RTF) RFID(Radio Frequency Identification) system operating in the $860MHz{\sim}960MHz$ frequency range. We have also designed and implemented the simulator of the RFID system based on the EPC protocol. Finally, we find that proposed algorithm works better than an existing algorithm.