Earticle

초록

영어

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 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605