Abstract
In this letter, a novel Query window Tree (QwT) protocol is proposed and presented. Based on the Query Tree (QT), a fast anti-collision protocol with low tag complexity (which preserves the memoryless feature of the QT) is achieved. The QwT effectively controls the number of responded bits from tags by adopting a dynamic-size `window'. As a result, the tags of the proposed QwT deliver exclusively the bits that are required by the window controlled at the reader, rather than sending their full ID. Simulations show that the QwT positively decreases the total number of bits that are transmitted by a tag and as a result mitigates latency.
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.
