{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T15:48:58Z","timestamp":1743436138039},"reference-count":12,"publisher":"SAGE Publications","issue":"12","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2013,12,1]]},"abstract":"<jats:p> In radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n-ary query tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. The advantage of a 4-ary tree anti-collision algorithm is that it is able to reduce collision timeslots, but it also increases the idle timeslots. To reduce these excessive idle timeslots the 4-ary tree anticollision algorithm brings, an anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is proposed in this paper. On the basis of the information of collision bits, some idle timeslots can be eliminated through pruning the 4-ary tree. Both theoretical analysis and simulation results support that A4PQT algorithm can significantly reduce recognition time and improve throughput of the RFID system. <\/jats:p>","DOI":"10.1155\/2013\/848746","type":"journal-article","created":{"date-parts":[[2013,12,21]],"date-time":"2013-12-21T21:00:50Z","timestamp":1387659650000},"page":"848746","update-policy":"http:\/\/dx.doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree"],"prefix":"10.1177","volume":"9","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China"},{"name":"School of Computer, Central China Normal University, Wuhan 430079, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yajun","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer, Central China Normal University, Wuhan 430079, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueming","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longkai","family":"Wu","sequence":"additional","affiliation":[{"name":"National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Mei","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2013,12,21]]},"reference":[{"key":"B1-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.012313.122094"},{"key":"B2-2013-848746","first-page":"1","volume-title":"Proceedings of the 24th International Conference on Microelectronics","author":"Rennane A."},{"key":"B13-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.120"},{"key":"B3-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.051512.110448"},{"key":"B4-2013-848746","first-page":"107","volume-title":"Proceedings of the IEEE International Symposium on Information Theory","author":"Hush D. R."},{"key":"B5-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2009.86"},{"key":"B7-2013-848746","series-title":"Conferences in Research and Practice in Information Technology","first-page":"49","volume-title":"Proceedings of the 20th Australasian Database Conference (ADC '09)","author":"Pupunwiwat P."},{"key":"B8-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2011.77"},{"key":"B9-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.060112.120345"},{"key":"B10-2013-848746","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.E95.B.603"},{"key":"B6-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2011.62"},{"key":"B16-2013-848746","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2009.2033050"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2013\/848746","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2013\/848746","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2013\/848746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T20:18:41Z","timestamp":1621196321000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2013\/848746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,1]]},"references-count":12,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,12,1]]}},"alternative-id":["10.1155\/2013\/848746"],"URL":"https:\/\/doi.org\/10.1155\/2013\/848746","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,1]]}}}