An Efficient Q-Algorithm for RFID Tag Anticollision. (10th May 2021)

• Record Type: Journal Article
• Authors: Zhao, Lingyun; Wang, Lukun; Du, Shan
• Other Names: Zhang Yuanpeng Academic Editor.
• Is Part Of: Wireless communications and mobile computing. Volume 2021(2021)
• Publication Date: 2021-05-10
• Subjects: Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1155/2021/9967739
• Languages: English
• ISSNs: 1530-8669

Abstract

Abstract : In large-scale Internet of Things (IoT) applications, tags are attached to items, and users use a radiofrequency identification (RFID) reader to quickly identify tags and obtain the corresponding item information. Since multiple tags share the same channel to communicate with the reader, when they respond simultaneously, tag collision will occur, and the reader cannot successfully obtain the information from the tag. To cope with the tag collision problem, ultrahigh frequency (UHF) RFID standard EPC G1 Gen2 specifies an anticollision protocol to identify a large number of RFID tags in an efficient way. The Q -algorithm has attracted much more attention as the efficiency of an EPC C1 Gen2-based RFID system can be significantly improved by only a slight adjustment to the algorithm. In this paper, we propose a novel Q -algorithm for RFID tag identification, namely, HTEQ, which optimizes the time efficiency of an EPC C1 Gen2-based RFID system to the utmost limit. Extensive simulations verify that our proposed HTEQ is exceptionally expeditious compared to other algorithms, which promises it to be competitive in large-scale IoT environments.