A Time- and Energy-Aware Collision Tree Protocol for Efficient Large-Scale RFID Tag Identification
- 10 November 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 14 (6) , 2406-2417
Abstract
Being able to provide a relatively easy and inexpensive way to collect data, portable RFID readers have gained increasing popularity in wide-ranging RFID applications. In order to maximize the reader's battery life, efficient tag identification protocols are of paramount importance in large-scale passive RFID systems. This paper proposes a time- and energy-aware protocol based on M-ary collision tree (MCT) for efficient RFID tag identification. Thanks to Manchester encoding, the proposed MCT protocol recursively divides colliding tags into M subsets with at least two non-empty ones according to the information of the first log_2 M colliding bits. Through the new M-ary collision tree recognition method, MCT can effectively identify all the tags within its reading range. Theoretic analysis demonstrates that it takes the proposed MCT protocol fewer number of message bits to identify all the tags, which reduces not only the identification time but also the energy cost. Simulation results are also presented to show that compared with other benchmark works, the proposed MCT protocol is able to reduce the average identification time and energy cost by at least 16.12% and 15.73%, respectively.Keywords
Funding Information
- National Natural Sciences Fundation of China (61628102)
- Major Frontier Project of Sichuan Province (2015JY0282)
- China International Joint Research Center of Green Communications and Networking (2015B01008)
This publication has 21 references indexed in Scilit:
- Energy Efficiency Challenges of 5G Small Cell NetworksIEEE Communications Magazine, 2017
- Efficient tag reading protocol for large-scale RFID systems with pre-readingComputer Communications, 2016
- An Energy and Identification Time Decreasing Procedure for Memoryless RFID Tag Anticollision ProtocolsIEEE Transactions on Wireless Communications, 2016
- A Time Efficient Tag Identification Algorithm Using Dual Prefix Probe Scheme (DPPS)IEEE Signal Processing Letters, 2016
- An energy- and time-efficient M-ary detecting tree RFID MAC protocol2015
- Assigned Tree Slotted Aloha RFID Tag Anti-Collision ProtocolsIEEE Transactions on Wireless Communications, 2013
- Energy-Efficient Identification in Large-Scale RFID Systems with Handheld ReaderIEEE Transactions on Parallel and Distributed Systems, 2013
- A Novel Query Tree Protocol with Bit Tracking in RFID Tag IdentificationIEEE Transactions on Mobile Computing, 2012
- Binary Tree Slotted ALOHA for Passive RFID Tag AnticollisionIEEE Transactions on Parallel and Distributed Systems, 2012
- An Efficient Anti-Collision Protocol for RFID Tag IdentificationIEEE Communications Letters, 2010