A Time Efficient Tag Identification Algorithm Using Dual Prefix Probe Scheme (DPPS)

作者：Su, Jian^*; Sheng, Zhengguo^*; Wen, Guangjun^*; Leung, Victor C. M.^*

来源：IEEE Signal Processing Letters, 2016, 23(3): 386-389.

DOI：10.1109/LSP.2016.2516768

• Anti-collision
• identification efficiency
• RFID
• tree-based

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.

• 出版日期2016-3
• 单位电子科技大学