Earticle

초록

영어

The Radio Frequency Identification (RFID) system is a newemerging technology used to identify a tag attached to an object. To make RFID systems practical, the cost of RFIDtags is very important. Further, an interrogator should be able to identify thenumber of tags in the reading range in a short time. The most important technical issue in radio frequency identification (RFID) is to correctly and quickly recognize the number of tag IDs in the reader’s communication range. Unlike the probabilistic RFID tag identification schemes, a query tree(QT)-based protocol guarantees the identification of all the tags, where the distribution of tag IDs is assumed to be uniform. In this paper, we proposed an extended M-ary QT protocol, which effectively reduces unnecessary query-response cycles by using a non-sequential m-bit recognition method. The simulation results show that the proposed scheme significantly outperforms M-ary QT schemes in terms of identification time, efficiency and communications overhead.

목차

Abstract
 1. Introduction
 2. Related Work
  2.1. Query Tree Protocol
  2.2. Basics of Manchester Coding
  2.3. Collision Tree Protocol
  2.4. M-aryQuery Tree
 3. Proposed Collision Resolution Method
  3.1. The Proposed Modified M-ary Query Tree
 4. Experimental Performance Evaluations
 5. Conclusion
 6. References

키워드

저자

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

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605