A knowledge-based Query Tree with Shortcutting and Couple-Resolution for RFID tag identification
Authors:
- Zelalem Legese HailemariamZHZelalem Legese Hailemariam
- Yuan-Cheng LaiYLYuan-Cheng Lai
- Riyanto JayadiRJRiyanto Jayadi
- Yen-Hung ChenYCYen-Hung Chen
- Sheng-Chi HuangSHSheng-Chi Huang
- 1 July 2020
- journal article
- research article
- Published by Elsevier in Computer Communications
- Vol. 160, 779-789
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Science and Technology of the People's Republic of China
This publication has 25 references indexed in Scilit:
- Channel-Quality Aware RFID Tag Identification Algorithm to Accommodate the Varying Channel Quality of IoT EnvironmentApplied Sciences, 2019
- Timing-Aware RFID Anti-Collision Protocol to Increase the Tag Identification RateIEEE Access, 2018
- A framework for enhancing the performance of Internet of Things applications based on RFID and WSNsJournal of Network and Computer Applications, 2018
- Efficiently and Completely Identifying Missing Key Tags for Anonymous RFID SystemsIEEE Internet of Things Journal, 2017
- Optimal Slot Assignment for Binary Tracking Tree Protocol in RFID Tag IdentificationIEEE/ACM Transactions on Networking, 2014
- Adaptive frame on binary splitting for radio frequency identification anticollisionInternational Journal of Communication Systems, 2012
- Query Tree Algorithm for RFID Tag with Binary-Coded Decimal EPCIEEE Communications Letters, 2012
- A Novel Query Tree Protocol with Bit Tracking in RFID Tag IdentificationIEEE Transactions on Mobile Computing, 2012
- On the optimal frame-length configuration on real passive RFID systemsJournal of Network and Computer Applications, 2011
- Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag IdentificationIEEE Transactions on Parallel and Distributed Systems, 2007