File(s) under permanent embargo
A time efficient tag identification algorithm using Dual Prefix Probe Scheme (DPPS)
journal contribution
posted on 2023-06-08, 23:55 authored by Jian Su, Zhengguo ShengZhengguo Sheng, Wen Guangjun, Leung VictorTag 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.
History
Publication status
- Published
File Version
- Accepted version
Journal
IEEE Signal Processing LettersISSN
1070-9908Publisher
Institute of Electrical and Electronics EngineersExternal DOI
Issue
3Volume
23Page range
386-389Department affiliated with
- Engineering and Design Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2016-01-11First Compliant Deposit (FCD) Date
2016-01-09Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC