Four-ary query tree splitting with parallel responses for RFID tag anti-collision Online publication date: Mon, 25-Aug-2014
by Ming-Kuei Yeh; Jehn-Ruey Jiang; Shing-Tsaan Huang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 16, No. 3, 2014
Abstract: In a radio frequency identification (RFID) system, tags can be identified by a reader when they are within the interrogation zone of the reader. Collisions occur when tags using backscatter technology report their IDs to the reader at the same carrier frequency simultaneously. The performance of tag identification is degraded by collisions, so it is important to address the tag collision problem. Several anti-collision protocols have been proposed for reducing tag collisions. They can be categorised into two classes: ALOHA-based and tree-based protocols. This paper proposes a 4-ary query tree-based anti-collision protocol, namely the parallel response query tree (PRQT) protocol, to improve the performance of tag identification. In the PRQT protocol, the tags with the ID prefix matching either the reader's request bit string or the complementary of the string are arranged to respond in two subcarriers in parallel. The PRQT protocol is analysed, simulated and compared with related ones to demonstrate its advantages.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook