Advanced SearchSearch Tips
EMQT : A Study on Enhanced M-ary Query Tree Algorithm for Sequential Tag IDs
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
EMQT : A Study on Enhanced M-ary Query Tree Algorithm for Sequential Tag IDs
Yang, Dongmin; Shin, Jongmin;
  PDF(new window)
One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.
RFID;anti-collision;query tree;aloha protocol;M-ary tree;
 Cited by
RFID 시스템에서 효율적인 분리를 이용한 충돌 방지 알고리즘,김성수;윤태진;

한국컴퓨터정보학회논문지, 2013. vol.18. 11, pp.87-97 crossref(new window)
RFID 시스템에서 충돌비트 위치를 이용한 M-ary QT 알고리즘 향상에 관한 연구,김관웅;

한국인터넷방송통신학회논문지, 2016. vol.16. 6, pp.109-117 crossref(new window)
K. Finkenzeller, RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, John Wiley & Sons, pp. 206-219, 2003.

H. Vogt, "Efficient object identification with passive RFID tags," in Proc. Int. Conf. Pervasive Comput., pp. 98-113, Zurich, Switzerland, Aug. 2002.

M. A. Bonuccelli, F. Lonetti, and F. Martelli, "Instant collision resolution for tag identification in RFID networks," Ad Hoc Networks, vol. 5, no. 8, pp. 1220-1232, Nov. 2007. crossref(new window)

G. Bagnato, G. Maselli, C. Etrioli, and C. Vicari, "Performance analysis of anti-collision protocols for RFID systems," in Proc. IEEE 69th Veh. Technol. Conf., pp.1-5, Barcelona, Spain, Apr. 2009.

C. Law, K. Lee, and K. Y. Siu, "Efficient memoryless protocol for tag identification," in Proc. ACM DIAL-M '00, pp. 75-84, Boston, U.S.A., Aug. 2000.

J. Myung, W. Lee, J. Srivastava, and T. K. Shih, "Tag-splitting: adaptive collision arbitration protocols for RFID tag identification," IEEE Trans. Parallel Distributed Syst., vol. 18, no. 6, pp. 763-775, June 2007. crossref(new window)

J. H. Choi, D. Lee, and H. Lee, "Query tree-based reservation for efficient RFID tag anti-collision," IEEE Commun. Lett., vol. 11, no. 1, pp. 85-87, Jan. 2007. crossref(new window)

P. Hawkes, "Anti-collision and transponder selection methods for grouped vicinity cards and RFID tags," IEE Colloq RFID Technol., pp. 7/1-7/12, 1999.

X. Jia, Q. Feng, and C. Ma, "An efficient anti-collision protocol for RFID tag identification," IEEE Commun. Lett., vol. 14, no. 11, pp. 1014-1016, Nov. 2010. crossref(new window)

J. Shin and D. Yang, "Multiple RFID tags identification with M-ary query tree scheme," IEEE Commun. Lett., vol. 17, no. 3, pp. 604-607, Mar. 2013. crossref(new window)

EPC Tag Data Standard 1.6, [Online], Available:, Sep. 2011.

J.-R. Cha and J.-H. Kim, "Dynamic framed slotted ALOHA algorithms using fast tag estimation method for RFID system," in Proc. IEEE Consumer Commun. Networking Conf. 2006, vol. 2, pp. 768-772, Las Vegas, U.S.A., Jan. 2006.

Y. Kim, S. Kim, S. Lee, and K Ahn, "Improved 4-ary query tree algorithm for anti-collision in RFID system," in Proc. IEEE AINA 2009, Bradford, U.K., pp. 699-704, May 2009.

H. Gou and Y. Yoo, "Bit collision detection based query tree protocol for anti-collision in an RFID system," Int. J. Innovative Comput., Inform. Control, vol. 8, no. 5, pp. 3081-3102, May 2012.

EPC Tag Data Standards Version 1.1 Rev.1.24, [Online], Available:, Apr. 2004.