• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.235-242
• /
• 2012

In RFID System, one of the problem that we must slove is to devise a good anti-collision algorithms to improve the efficiency of tag identification which is usually low because of tag collision. Among of the existing RFID anti-collision algorithm, BS (Binary Search) algorithm, though simple, has a disadvantage that the stage of times used to identify the tags increase exponentially as the number of tags does. In this paper, I propose a new anti-collision algorithm called Multi-collision reflected frame which restricts the number of stages and decided bit. Since the proposal algorithm keep the length size of UID and density of total tag when have 100%. The simulation results showed that the proposed algorithm improves the efficiency by 30~50% compared to the existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6B
• /
• pp.450-455
• /
• 2008

We analyze the tag identification procedure of conventional EPC Class 1 RFID system and propose the fast anti-collision algorithm for the performance improvement of the system. In the proposed algorithm, the reader uses information of tag collisions and reduces unnecessary procedures of the conventional algorithm. We evaluate the performance of the proposed anti-collision algorithm and the conventional algorithm using mathematical analysis and simulation. According to the results, the fast anti-collision algorithm shows greatly better performance than conventional algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.25-33
• /
• 2005

We propose a method to protect the tag's information from illegal reader in RFID system. In this method, a special tag called ownership tag makes intentionally collisions during singulation. By the forced collision of an ownership tag a reader can obtain the information of ordinary tags. Whereas a reader can not find my information on tag's ID without the ownership tag.

• 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 KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.316-327
• /
• 2007

RFID (Radio Frequency Identification) is one of the most promising air interface technologies in the future for object identification using radio wave. If there are multiple tags within the range of the RFID tag reader, all tags send their tag identifications to the reader at the same time in response to the reader's query. This causes collisions on the reader and no tag is identified. A multi-tag identification problem is a core issue in the RFID. It can be solved by anti-collision algorithm such as slot based ALHOA algorithms and tree based algorithms. This paper, proposes a collision tree based anti-collision algorithm using collision tree in RFID system. It is a memory-less algorithm and is an efficient RFID anti-collision mechanism. The collision tree is a mechanism that can solve multi-tag identification problem. It is created in the process of querying and responding between the reader and tags. If the reader broadcasts K bits of prefix to multiple tags, all tags with the identifications matching the prefix transmit the reader the identifications consisted of k+1 bit to last. According to the simulation result, a proposed collision tree based anti-collision algorithm shows a better performance compared to tree working algorithm and query tree algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.5
• /
• pp.12-20
• /
• 2008

RFID(Radio frequency indentification) technology, that the reader detect the tag information attached on the objects without contact, is considered the kernel of realizing tile Ubiquitous Sensor Network. Particularly, because there are lots of tags(which the reader have to detect) in the UHF RFID system(that is applied at the Logistic & Distribution industry). In the UHF RFID system the negative effects, we called the tag-collision, may occur and we should solve these effects. So, in the EPCglobal Gen2 protocol they present the Slotted Random Anti-collision algorithm to prevent the tag-collision effect. In this paper, in order to minimize the tag-collision effect and bring on the system efficiency, we propose the Power Increasing Method that controls the transmission power of the reader depending on the environment and verily the improved performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1013-1022
• /
• 2012

Tag collection is one of the major concerns in radio frequency identification(RFID) system. All tags in RFID reader's transmission range send response message back to the reader in response to collection request message on the given rf channel. When multiple tags respond simultaneously, tag-collision may occur. Tag-collision problem is one of the most important issues in active RFID performance. To mitigate this problem, frame slotted ALOHA(FSA) anti-collision protocol is widely used in active RFID system. Several studies show that the maximum system efficiency of FSA anti-collision protocol is 36.8%. In this paper, we propose an efficient slotted CSMA/CA protocol to improve tag collection performance. We compare our protocol to the FSA anti-collision protocol. For the experiment, an 433MHz active RFID system is implemented, which is composed of an RFID reader and multiple tags. We evaluated the tag collection performance using one RFID reader and 40 tags in the real test bed. The experimental result shows that proposed protocol improves the tag collection time, round and collision probability by 18%, 37.4% and 77.8%, respectively.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.34-39
• /
• 2012

Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tone-detection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612, which is an obvious improvement when compared to the framed-slotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.55-58
• /
• 2008

RFID(Radio frequency IDentification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a tush efficiency improvement effect was visible.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.999-1005
• /
• 2008

RFID(Radio Frequency IDintification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a high efficiency improvement effect was visible.