earticle

논문검색

Dynamic M-ary QT Algorithm to Improve the Performance of RFID Tag Identification

초록

영어

Radio-frequency identification (RFID) is the wireless non-contact use of radio- frequency electromagnetic fields to transfer data, for the purposes of automatically identifying and tracking tags attached to objects. Most important technical issue in radio frequency identification (RFID) is to correctly and quickly recognize a number of tag IDs in the reader’s communication range. At present, a reasonable solution is the introduction of M-ary QT(Query Tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. In this paper, we proposed a dynamic M-ary QT protocol, which effectively reduces unnecessary query-response cycles by varying ‘m’-bit recognition method. By using Manchester code, we can detect the location of collided bits due to the characteristic of Manchester code. We proposed enhanced tag identification algorithm that utilize feature of Manchester coding to increase efficiency of Tag identification not only in RF- ID reader but also in RF-ID tags. From the simulation results, the proposed scheme significantly outperforms traditional M-ary QT schemes in terms of efficiency and communications overhead, identification time.

목차

Abstract
 1. Introduction
 2. Related Work
  2.1. Basics of Manchester Coding
  2.2. Collision Tree Protocol
  2.3. M-ary Query Tree
 3. The Proposed Dynamic M-ary Query Tree Algorithm
 4. Experimental Performance Evaluations
 5. Conclusion
 References

저자정보

  • Byun-Gon Kim Department of Electronic Engineering, Kunsan National University, Kunsan, Korea
  • Kwan-Woong Kim Thunder Technology, Director in Digital Signal Processing Team, ChonJu, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.