Su, Jian, Sheng, Zhengguo, Liu, Alex X, Han, Yu and Chen, Yongrui (2019) A group-based binary splitting algorithm For UHF RFID anti-collision systems. IEEE Transactions on Communications. p. 1. ISSN 0090-6778

PDF - Accepted Version Download (15MB)

Abstract

Identification efficiency is a key performance metrics to evaluate the ultra high frequency(UHF) based radio frequency identification (RFID) systems. In order to solve the tag collision problem and improve the identification rate in large scale networks, we propose a collision arbitration strategy termed as group-based binary splitting algorithm (GBSA), which is an integration of an efficient tag cardinality estimation method, an optimal grouping strategy and a modified binary splitting. In GBSA, tags are properly divided into multiple subsets according to the tag cardinality estimation and the optimal grouping strategy. In case that multiple tags fall into a same time slot and form a subset, the modified binary splitting strategy will be applied while the rest tags are waiting in the queue and will be identified in the following slots. To evaluate its performance, we first derive the closed-form expression of system throughput for GBSA. Through the theoretical analysis, the optimal grouping factor is further determined. Extensive simulation results supplemented by prototyping tests indicate that the system throughput of our proposed algorithm can reach as much as 0.4835, outperforming the existing anti-collision algorithms for UHF RFID systems.

Item Type:	Article
Schools and Departments:	School of Engineering and Informatics > Engineering and Design
Research Centres and Groups:	Advanced Communications, Mobile Technology and IoT (ACMI)
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101 Telecommunication
Depositing User:	Zhengguo Sheng
Date Deposited:	05 Nov 2019 14:08
Last Modified:	13 Nov 2019 14:00
URI:	http://sro.sussex.ac.uk/id/eprint/87835

View download statistics for this item

📧 Request an update