• 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.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.239-245
• /
• 2007

차세대 유비쿼터스 환경에서 중요한 기술적, 산업적 위치를 차지하는 RFID 네트워크에는 다수의 RFID 리더(Reader)와 수많은 RFID 태그(Tag)들이 통신을 하면서 존재하게 된다. 이러한 RFID 네트워크에서 리더와 태그간의 원활한 통신을 위해서는 주파수 충돌이 발생하지 않아야 한다. 주파수 충돌 현상은 리더와 다수의 태그들 간의 태그 충돌(Tag Collision)과 리더간 주파수 간섭으로 인한 리더간 충돌(Reader Collision)로 나뉘어 질 수 있다. 따라서 리더간 충돌 현상을 피하기 위해서는 근접한 리더들 간에 서로 다른 타임슬롯(Timeslot)을 사용하여 태그와 통신을 시도하여야 한다. 본 연구에서는 RFID 네트워크에서 다수의 리더간 충돌을 최소화하며 안전한 태그 인식을 할 수 있도록 타임 슬롯 할당 문제를 CSP(Constraint Satisfaction Problem)로 접근한다. 그리고 CSP를 풀기 위해 리더간 충돌 문제가 가지고 있는 제약조건을 찾아내고 해를 찾기 위한 목적함수를 모델링 한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.884-891
• /
• 2008

As the scale of RFID systems grows, decrease in recognition rate of collision between readers is becoming an issue. Time division technique may solve the problem, but this will cause total recognition time to increase. This issue must be solved for real-time inventory control. In this study, total recognition time was improved by placing ARCM in RFID systems. ARCM maintains short recognition time through efficient utilization of frequency channel and manages RFID systems to recognize the tag by avoiding interference. As the result of using ARCM, saving maximum 20% of time was possible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1624-1637
• /
• 2013

In RFID systems, one important issue is how to effectively address tag collision, which occurs when multiple tags reply simultaneously to a reader, so that all the tags are correctly identified. However, most existing anti-collision protocols assume isotropic collisions where a reader cannot detect any of the tags from the collided signals. In practice, this assumption turns out to be too pessimistic since the capture effect may take place, in which the reader considers the strongest signal as a successful transmission and the others as interference. In this case, the reader disregards the other collided tags, and in turn, fails to read the tag(s) with weaker signal(s). In this paper, we propose a capture effect-aware anti-collision protocol, called Multi-Round Collision Tree (MRCT) protocol, which efficiently identifies the tags in real RFID environments. MRCT deals with the capture effect as well as channel error by employing a multi-round based identification algorithm. We also analyze the performance of MRCT in terms of the number of slots required for identifying all tags. The simulation results show that MRCT significantly outperforms the existing protocol especially in a practical environment where the capture effect occurs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1460-1478
• /
• 2020

This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader's same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.389-396
• /
• 2009

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 Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, 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 + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.260-265
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In 13.56MHz RFID system, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, there is no differentiation between the collided tags and others in the identification process. Therefore, tags may never be successfully identified because its responses may always collide with others. This situation may cause the tag starvation problem. This paper proposes a fair identification scheme for STAC protocol. In the proposed scheme, if the number of collided slots is large during a query round, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that are experienced collision during the previous query round.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.87-97
• /
• 2013

In the RFID system, multiple tags respond in the process of identifying multiple tags in the reader's interrogation zone, resulting in collisions. Tag collision occurs when two or more tags respond to one reader, so that the reader cannot identify any tags. These collisions make it hard for the reader to identify all tags within the interrogation zone and delays the identifying time. In some cases, the reader cannot identify any tags. The reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation zone. The proposed algorithm efficiently divides tag groups through an efficient separation to respond, preventing collisions. Moreover, the proposed algorithm identifies tags without checking all the bits in the tags. The prediction with efficient separation reduces the number of the requests from the reader.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2247-2256
• /
• 2011

In this paper, we propose a coordinator-based reader protocol that can avoid reader collisions in a passive RFID system. In a proposed protocol, unlike conventional protocols that a reader itself selects its own slot randomly to communicate with tags such as DCS, Colorwave, a coordinator reader allocates an unused slot to a reader to participate in the network and sends a current slot number. A reader allocated a slot can communicate with tags. The proposed protocol can adaptively modified to apply for multiple coordinator readers environment in a wide area. This causes reader collision problem, but can be alleviated partly by applying the frequency planning. In this way, we verifies that a RFID system using the proposed protocol is three to five times better than existing systems through the simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.99-108
• /
• 2010

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio wave. When there are some tags in the domain of the RFID reader, the mechanism that can solve a collision between the tags occurs is necessary. The multi tag identification problem is the core issue in the RFID and could be resolved by the anti-collision algorithm. However, RFID system has another problem. The problem id user information security. Tag response easily by query of reader, so the system happened user privacy violent problem by tag information exposure. In the case, RFID system id weak from sniffing by outside. In this paper, We study of security robustness for tree-walking algorithm, query tree algorithm and advanced query tree algorithm of tree based memoryless algorithm.