Abstract
Hidden-tag problem is one of the most important issues in the implementation of radio-frequency identification (RFID) systems. Due to effects of imperfect wireless channels, RFID tags can be hidden during the identification process by either another tag or an unsuccessful detection. The former is known as the capture effect (CE) while the latter is the detection error (DE). This study newly proposes two modified tree-based identification protocols, namely tweaked binary tree (TBT) and tweaked query tree (TQT), which are able to tackle the hidden-tag problem caused by both the CE and DE. The performance of the proposed TBT and TQT protocols, in terms of the average number of slots required to detect a tag, and the tag-loss rate, is evaluated in comparison with that of previously proposed ones. Computer simulations and numerical results confirm the effectiveness of the proposed protocols.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
