• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.171-175
• /
• 2010

This paper analyzes the tag data inconsistency problem caused by incomplete execution of the tag access operation to the RFID tag's memory and proposes a protocol to control consistent tag data accesses with finalizing the incomplete operation. Passive RFID tag cannot guarantee complete execution of the tag access operations because of uncertainty and unexpected disconnection of RF communications. This leads to the tag data inconsistency problem. To handle this, we propose a concurrency control protocol which defines incomplete tag operations as continuous queries and monitors the tags're-observation continuously. The protocol finalizes the incomplete operation when the tag is re-observed while it blocks inconsistent data accesses from other operations. We justify the proposed protocol by analyzing the completeness and consistency. The experiments show that the protocol shows better performance than the traditional lock-based concurrency control protocol.

• Electronics and Telecommunications Trends
• /
• v.29 no.5
• /
• pp.40-50
• /
• 2014

최근에 RFID(Radio Frequency Identification) 기술은 사물인터넷의 기반 기술로 다양한 애플리케이션의 개발과 함께 산업화/정보화에 크게 기여하고 있다. 그러나 산업에서 요구하는 RFID 태그, 리더의 요구사항이 단순한 인식뿐만 아니라 다양한 정보를 장기간 저장하고 관리할 목적으로 태그 메모리 크기가 확장되고 있으며, 해당 정보를 태그에 읽고 쓰기 위하여 간섭 잡음에 강한 신뢰성 있는 성능 향상 무선통신기술이 연구되고 있다. 본고에서는 RFID 태그-리더 간 고속으로 통신하는 기술과 다량의 태그 밀집 환경에서 RFID 인식률 향상을 위한 빔포밍 기술에 대하여 기술한다.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2002.02a
• /
• pp.415-419
• /
• 2002

가축 사양관리 시스템의 전자 개체 인식장치를 ISO 표준인 125kHz대 RFID 기술을 응용하여 유전지 태그와 리더를 개발하였다. 최대 인식거리는 37cm였으며, 인식율은 100회 반복실험에서 100%의 인식율을 보였다. 본 연구에서 개발된 유전지 태그에 건전지를 사용할 경우 수명은 2∼3개월 정도로 예상된다. 젖소의 평균 수명을 6∼7년으로 볼 때, 너무 짧은 것으로 판단된다. 따라서, 추후 태그의 수명 연장을 위해 저전력 소자 및 무전지 태그에 관한 연구가 계속 되어야 할 것으로 판단된다. 또한 메모리와 디코딩 회로를 추가하여 개체 코드 비트 수를 늘린다면, 태그에 그 개체의 출생 국가 및 지역, 생년월일, 목장 등의 정보를 할당이 가능해지므로, 보다 효율적인 사양 관리가 가능해 질뿐만 아니라 전염병 발생 시 경로 추적 및 출하 후 병적 추적 또한 가능해 질 것으로 판단된다. 본 장치가 상용화된다면, 수입에 의한 문제점 해결은 물론 국내 현실에 적합한 장치를 보다 낮은 가격으로 농가에 보급할 수 있게 되어, 국내 축산 농가의 국제 경쟁력 확보에 크게 기여할 수 있을 것으로 판단된다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.25-32
• /
• 2007

In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1421-1424
• /
• 2009

RFID(Radio-Frequency IDentification) 시스템은 무선주파수를 이용한 자동 인식 기술로 개인의 위치 추적이나 사용자 프라이버시와 같은 정보 유출의 위험성을 내포하고 있다. 이러한 문제점을 해결하기 위해 대칭키 기반의 AES 암호화 알고리즘은 해시함수나 공개키 암호화 기법에 비해 메모리를 적게 소모하고 구현이 쉬운 장점 때문에 수동형 RFID태그에 더 적합하다. 그러나 기존의 AES를 이용한 RFID 인증 프로토콜에서는 항상 고정된 키를 이용하여 암호화하였고 태그와 리더사이의 안전하지 않은 무선 채널에서 공격자에 의해 키 값이 노출될 수 있는 또 다른 문제점을 가지고 있다. 본 논문에서는 태그와 서버의 고정된 키와, 리더 태그 서버에서 생성된 난수를 차례로 이용하여 대칭키를 변환한다. 그리고 매 세션마다 변환된 키로 난수를 암호화 하면서 태그와 리더를 상호 인증한다. 이와 같이 변환된 키를 이용할 경우 키 값의 노출 문제가 해결되며, 이 키를 통해 암호화하여 인증할 경우 재전송, 도청, 위치추적 및 스푸핑과 같은 공격에도 안전하다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.1-9
• /
• 2007

in this paper, we propose the Adaptive Decision Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Adaptive Decision algorithm identify smaller one ,each Tag_ID bit's sum of bit '1'. In other words, Adaptive Decision algorithm had standard of selection by actively, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Adaptive Decision algorithm had performance test that criterions were reader's number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Adaptive Decision algorithm better than exisiting algorithm.

• The Journal of Society for e-Business Studies
• /
• v.12 no.1
• /
• pp.25-40
• /
• 2007

As memory-extended RFID tags are recently developed, various types of item identification structures can be stored in the tags. In this paper, we propose a new national product identifier(NPI) which accepts not only ISO item identification standards but also the memory capacity of ISO tags. First of all, item identification structures of ISO/IEC 15459 and EPC, and memory structures of ISO/IEC 18000-6C and EPC tags are analyzed. Based on these analyses, the NPI currently used is analyzed and its problems are described from the viewpoint of standardization. To overcome the problems, a new NPI structure suitable for ISO/IEC 15459 is proposed. Finally, data related to the NPI is designed for encoding to tags.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.47-56
• /
• 2008

An RFID system comprises a reader and a tag, and this paper focuses on a tag design. A UHF tag is activated by energy supply using electromagnetic waves and energy reflection through impedance mismatching. The tag uses a $0.25{\mu}m$ CMOS process and comprises a digital part executing tag protocols, a 512-bit memory, and an analog part having a rectifier, a modulation/demodulation unit, a clock generator, etc. The total dimension of the tag, including a saw line, is $750{\mu}m*750{\mu}m$ and the power consumption of the tag consumption power is about $17.8{\mu}W$ at a supply voltage of 2V.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.1
• /
• pp.771-776
• /
• 2023

Scratchpad memory is a software-controlled on-chip memory designed and used to mitigate the disadvantages of existing cache memories. Existing cache memories have TAG-related hardware control logic, so users cannot directly control cache misses, and their sizes are large and energy consumption is relatively high. Scratchpad memory has advantages in terms of size and energy consumption because it eliminates such hardware overhead, but there is a burden on software to manage data. In this study, data management techniques of scratchpad memory were classified and examined, and ways to maximize the advantages were discussed.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.12
• /
• pp.47-58
• /
• 1999

As the performance of processors improves, cache memories are used to overcome the difference of speed between processors and main memories. Generally cache memories are embedded and small sizes, fault coverage is a more important factor than test time in testing point of view. A new test algorithm and a new BIST architecture are developed to detect various fault models with a relatively small overhead. The new concurrent BIST architecture uses the comparator of cache management blocks as response analyzers for tag memories. A modified scan-chain is used for pre-testing of comparators which can reduce test clock cycles. In addition several boundary scan instructions are provided to control the internal test circuitries. The results show that the new algorithm can detect SAFs, AFs, TFs linked with CFs, CFins, CFids, SCFs, CFdyns and DRFs models with O(12N), where N is the memory size and the new BIST architecture has lower overhead than traditional architecture by about 11%.