• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.13-19
• /
• 2012

The use of RFID is recently increasing for the realization of Ubiquitous computing. Reducing the process time of tag recognition is crucial as RFID system has to recognize multiple objects in a short amount of time. In this manuscript, therefore, an effective scheme using multi-reader is suggested to improve processing speed for tag authentication in RFID system. According to the result of performance analysis, the processing time required for tag authentication was drastically reduced in multi-reader environment than it was in a single reader. Consequently, the use of the suggested scheme cuts down on the processing time while identifying tags by using multi-reader and bring about overall performnce improvement of RFID system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.9
• /
• pp.4133-4137
• /
• 2011

Reliable Multi-Reader RFID identification is one of issues in Multi-Reader RFID realization program in recent. And the Multi-Reader RFID reader has difficulty to obtain reliable data in data capture layer. The reason is that unreliable readings such as a false positive reading and a false negative reading and missed readings can happen by reader collision problems, noise, or the mobility of tagged objects. We introduce performance metrics to solve these reader problems. We propose three solutions the Minimum Overlapped Read Zone (MORZ) with Received Signal Strength Indicator (RSSI), the Spatial-Temporal Division Access (STDA) method, and double bigger size of tags attached on the object. To show the improvement of the proposed methods, we calculate tag's successful read rates in a smart office, which consists of Multi-Reader RFID systems.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.2
• /
• pp.44-53
• /
• 2004

RFID 시스템에서는 리더가 다수의 태그를 읽는 다중접속방식(Multi-access Mode)을 이용하므로 태그간 충돌이 발생한다. 또한 넓은 면적에서 다수의 리더가 태그를 읽을 때에는 리더간의 충돌도 발생한다. 이러한 충돌은 RFID 시스템의 효율에 큰 영향을 미치므로, 효과적인 충돌방지 알고리즘이 요구된다. 현재 RFID의 충돌방지 알고리듬은 REID 시스템의 효율과 직결되기 때문에 공개를 꺼리고 있어 많은 자료를 구할 수는 없으나, 본고는 RFID 시스템의 다중인식 기술 및 태그의 충동방지 알고리즘 그리고 리더의 충돌방지 알고리즘 중 널리 알려진 것을 소개한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4A
• /
• pp.431-439
• /
• 2006

RFID Anti-Collision technique is needed to avoid collision problem caused by Radio interference between tags in the same RFID Reader area. It affects the performance and reliability of the RFID System. This paper propose the QT-CBP(Query Tree with Collision-Bit Positioning) Algorithm based on the QT(Query Tree) algorithm. QT-CBP Algorithm use precise collision bit position to improve the performance. We demonstrated the proposed algorithm by simulation. Our algorithm outperformed when each tag bit streams are the more duplicate and the number of tags is increased, compared with QT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.1005-1014
• /
• 2010

When reader collect tags, we found that they tend to get together to specific interface in Multi-Interface Multi-Channel 2.4GHz Active RFID system. To solve this problem, we designed the LP-Combind and AP-Balanced protocol for load distribution between interfaces, then verified its superiority of the performance through the simulation. There are three problems to implement designed protocols in hardware of firmware-level. first, tag selects randomly the channel of reader and reader need the method which can change the channel of tags. second, reader has the synchronization problem between reader and tag. third, reader has problem that MCU of reader have to operate simultaneously dual interface. To slove this problems, we designed the message and implemented method for tag channel change and the protocol in order to adjust synchronization between reader and tag, Therefore, we compared and analyzed the performance of protocols by experiment. If LP windows size is same, the performance of LP-Combined protocol and AP-Balanced protocol which lower collision probability by its load distribution is more outstanding than single interface protocol performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.405-415
• /
• 2012

In many applications a reader needs to determine whether a particular tag exists within a group of tags without a server. This is referred to as serverless RFID tag searching. A few protocols for the serverless RFID searching are proposed but they are the single tag search protocol which can search a tag at one time. In this paper, we propose a multi-tag search protocol based on a hash function and a random number generator which can search some tags at one time. For this study, we introduce a protocol which can resolve the problem of synchronization of seeds when communication error occurs in the S3PR protocol[1], and propose a multi-tag search protocol which can reduce the communication overhead. The proposed protocol is secure against tracking attack, impersonation attack, replay attack and denial-of-service attack. This study will be the basis of research for multi-tag serach protocol.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.486-488
• /
• 2006

RFID 기술의 신속한 확산을 위해서는 태그의 저가격화, 초소형화, 저전력화, 보안 및 프라이버시 문제, 태그식별자의 표준화, 다중태그 식별문제등이 우선적으로 해결되어야 한다. 특히, 식별영역 내에 다수의 태그가 존재할 경우에 다중태그 식별(multi-tag identification)을 위한 충돌방지(anticollision) 알고리즘은 RFID 시스템 구축에 있어서 반드시 해결해야 하는 핵심기술이다. 기존의 충돌방지 알고리즘들은 구현의 복잡성과 낮은 성능이 문제로 제기되고 있으며 지금까지 충돌방지와 관련하여 진행된 대부분의 연구들은 각각 고유한 형태의 태그식별자 체계를 기반으로 진행되어 왔으며 태그식별성능에 대한 비교연구도 부족한 상태이다. 본 논문에서는 저비용(low-cost) RFID 시스템에서 현재 표준화가 진행되고 있는 96비트 EPC (Electronic Product Code) 코드를 기반으로 병원 환경에서 태그에 우선순위를 부여하여 충돌이 발생하면 우선순위가 가장 높은 것부터 읽어들일 수 있는 그룹 트리 알고리즘을 제안하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.448-454
• /
• 2007

This paper proposes an estimation method of number of tags which may be necessary in improving anti-collision performance for ALOHA-based RFID systems. In ALOHA-based anti-collision algorithms, since the performance of the multi tag identification can be improved by allocating the optimal slot size corresponding to the number of tags, it is needed to exactly estimate the number of tags. The proposed method uses the a priori knowledge of the relation between the expectation of the number of empty slots and the number of tags. After measuring the number of empty slots in one ROUND, we estimate the number of tags which corresponds to the expectation of the number of empty slots nearest to the measured one. Simulation results show that the proposed method is superior to conventional methods in terms of the estimation accuracy and the computational complexity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.95-98
• /
• 2009

RFID(Radio Frequency IDentification) technology is an automatic identification method using radio frequencies between RFID reader which collects the informatin and tag which transmits the information. RFID technology develops passive RFID which transmit the only ID to active RFID which transmit the additional information such as sensing information. there is ISO/IEC 18000-7 as typical standard of active RFID. it is single channel system of 433.92MHz and has limitation of collection of a number of tags. to overcome limitation of collection of many tags, we propose the new 2.4GHz active RFID technology which can use the multi-channel. if reader has multi-interface and uses another channel in each, reader could fast collect the tags. but, if a reader which has many interfaces collects tags through the specific interface, the performance may not improve any more comparing with a reader using single interface. in this paper, we show the fast collection through design and implementation of protocol for load balancing between interfaces in multi-interface RFID reader.

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