• 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 the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.807-812
• /
• 2015

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred as anti-collision algorithm. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. In this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. Through simulations, it is demonstrated that the collision rate for the proposed algorithm is about 50% lower than STAC protocol. Therefore, the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.99-112
• /
• 2008

In the passive UHF (860-960MHz) RFID communications, which consists of a set of readers and tags, the readers normally interrogate the tag by using the backscatter mechanism. (i.e., tag response). In practical RFID environment, where multiple readers or tags exist; the interference causes collisions. This paper proposes a centralized arbitration scheme for avoiding the collision problems among multiple readers. The proposed centralized arbitration scheme is modeled in software environments, and is verified with simulation results. Simulated performance is focused on completion time, utilization and response time, and the simulation results show that our proposed scheme provides satisfactory performance grade.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.145-147
• /
• 2006

본 논문에서는 센서네트워크와 RFID 네트워크가 결합되어 있는 환경에서 센서 노드의 특성을 이용한 RFID 리더 충돌 방지 방법을 제안한다. 세부적으로 이웃 센서 노드 정보 확인 단계, 관리 노드로부터 리더 충돌 확인 단계, 태그 리드 단계를 포함한다. 리더와 센서가 결합되어 있는 환경에서, 센서 노드들간의 거리에 따라 리더들 간의 동기를 맞추어 충돌을 방지함으로써, 전체 시스템의 부하를 감소시키고, 시스템을 관리하는데 자원 낭비를 방지하며, 시스템의 처리율 및 효율을 향상시킬 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.712-714
• /
• 2004

최근 유비쿼터스 주요 이슈로 부각되는 Atuo ID나 유비쿼터스 ID(Ubiquitous ID)은 RFID(Radio Frefuency Identification) 태그(Tag)를 사용한 차세대 ID 체계이다. 이들 식별 체계는 해당 물품에 부착된 태그 정보를 RFID 리더(Reader)가 판독하여 이를 바탕으로 식별 작업을 수행함으로써 짧은 시간에 많은 물류 식별 처리가 가능할 수 있는 메커니즘을 가지고 있다. 하지만 리더가 수많은 태그 정보를 한꺼번에 모두 받아드림으로써 발생하는 여러 가지 오류가 발생할 수 있는데, 이를 충돌 문제(collision problem)이라 한다 본 논문은 충돌 문제들의 형태를 분석하고, 이를 개선할 수 있는 방안에 대해 모색, 제안하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.793-796
• /
• 2007

RFID (Radio Frequency IDentification) 리더의 동작 영역은 리더의 감도와 전력이 도달할 수 있는 거리에 의해 제한된다. RFID Shower 는 근접한 리더로부터 전송되는 신호를 증폭하여 리더의 동작영역을 확장한다. 그러나, RFID Shower 의 동작 영역 안에 여러 리더들이 있을 경우 리더들간의 신호충돌이 발생한다. 이를 해결하기 위해 중재 알고리즘이 제안되었다. 본 논문에서는 RFID 리더들을 위한 중재 알고리즘을 DEVS 형식론에 기반하여 모델링하고 시뮬레이션 하여 성능을 측정, 비교하였다.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.507-508
• /
• 2007

확률적(stochastic) RFID 충돌방지 알고리즘은 둘 이상의 태그가 리더기의 인식범위 내에 있을 경우 태그들이 동시에 리더기의 질의에 응답함으로서 발생하는 충돌을 확률적으로 감소시켜, 정확하고 빠르게 다수의 태그를 인식하기 위한 알고리즘이다. 본 논문에서는 확률적 충돌방지 알고리즘 중 하나인 dynamic framed ALOHA를 기반으로 새로운 태그 수 추정 방법을 이용한 RFID 충돌 방지 알고리즘을 제안하였다.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1887-1894
• /
• 2016

In the RFID system, the reader transmits a query message to tags in order to identify a unique ID of tags within its detection range. The procedures for arbitrating a collision is essential because the multiple tags can response simultaneously in the same to the query of the Reader. This procedure is known as conflict resolution algorithm and it is a key technology in the RFID system. In this paper, we proposed a variable bits M-ary QT algorithm based on Manchester coding techniques. The proposed algorithm use the location information of the collision bits in the reader and tags. The proposed algorithm can reduce the number of the query-response cycle because it is capable of recognizing discontinuous bits and a variable number of bits. From computer simulation, the proposed method give better performance than the conventional M-ary QT techniques in terms of response, recognition efficiency, communication overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.50-57
• /
• 2009

Tag collection is one of the major functions in RFID systems. In this paper, we propose a multichannel slotted-aloha anticollision protocol to mitigate the tag collision problem and improve tag collection performance in active RFID systems. In the proposed anticollision protocol, while an RFID reader transmits commands to multiple RFID tags via a common channel, it receives multiple tag responses over multiple channels simultaneously. We also implemented an active RFID system supporting the proposed anticollision protocol. In experiments with the implemented reader and 60 tags, the proposed dual-channel slotted-aloha anticollision protocol showed a large improvement in tag collection performance compared with the single-channel slotted-aloha anticollision protocol. With 60 tags, the average time spent on tag collection using the dual-channel anticollision protocol was 600.543 ms, which was 46.3% of the 1289.721 ms required using the single-channel anticollision protocol.