A time efficient tag identification algorithm using Dual Prefix Probe Scheme (DPPS)

Su, Jian, Sheng, Zhengguo, Guangjun, Wen and Victor, Leung (2016) A time efficient tag identification algorithm using Dual Prefix Probe Scheme (DPPS). IEEE Signal Processing Letters, 23 (3). pp. 386-389. ISSN 1070-9908

[img] PDF - Accepted Version
Restricted to SRO admin only

Download (257kB)


Tag collision severely affects the performance of radio-frequency identification (RFID) systems. Most anti-collision algorithms focus on preventing or reducing collisions but waste lots of idle slots. In this letter, we propose a time efficient anti-collision algorithm based on a query tree scheme. Specifically, the dual prefixes matching method is implemented based on the traditional query tree identification model when the reader detects the consecutive collision bits, which can significantly remove idle slots. Moreover, the proposed method can also make extensive use of collision slots to improve the identification efficiency. Both theoretical and simulation results indicate that the proposed algorithm can achieve better performance than existing tree-based algorithms.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Engineering and Design
Subjects: T Technology > TA Engineering (General). Civil engineering (General) > TA0329 Engineering mathematics. Engineering analysis
Depositing User: Zhengguo Sheng
Date Deposited: 11 Jan 2016 12:38
Last Modified: 08 Mar 2017 05:54
URI: http://srodev.sussex.ac.uk/id/eprint/59052

View download statistics for this item

📧 Request an update