{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:16:50Z","timestamp":1759335410403,"version":"3.41.2"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Ltd","issue":"16","funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFB4703102"],"award-info":[{"award-number":["2022YFB4703102"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62273105"],"award-info":[{"award-number":["62273105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Province Foundation","award":["2019B1515120036","501200069"],"award-info":[{"award-number":["2019B1515120036","501200069"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2023,12,30]]},"abstract":"<jats:p>In RFID systems, many anti-collision algorithms, driven by the concept of rescheduling the response sequence between the reader and unidentified tags, have been put forward to solve tag collision problem, including ALOHA-based, tree-based and hybrid algorithms. In this paper, we propose a novel RFID anti-collision algorithm called EAQ-CBB, which adopts three main approaches: tag population estimation based on collided bit detection method, optimal partitions and trimmed query tree based on the strategy of collided block bit-mapping (QTCBB). The relatively accurate estimation of tag backlog and optimal partition ensure a great reduction of collisions in the initial phase. For each collided partition, a QTCBB process is introduced immediately, which eliminates all the empty slots and significantly reduces the collided slots. Simulation results show that EAQ-CBB performs good stability and scalability when the key parameters change. Compared with the existing algorithms, such as DFSA, QTI, T-GDFSA and CT, EAQ-CBB outperforms the others with high system throughput, low normalized latency and low normalized overhead at a low cost of energy, which makes it easier to be used widely in the efficient-aware and energy-aware applications.<\/jats:p>","DOI":"10.1142\/s0218001423510205","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T07:49:55Z","timestamp":1702367395000},"source":"Crossref","is-referenced-by-count":1,"title":["An Efficient and Scalable RFID Anti-Collision Algorithm on Optimal Partition and Collided Block Bit-Mapping"],"prefix":"10.1142","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2932-9224","authenticated-orcid":false,"given":"Jian","family":"Yang","sequence":"first","affiliation":[{"name":"School of Automation, Guangdong University of Technology, Guangzhou 510006, Guangdong, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0051-7224","authenticated-orcid":false,"given":"Yonghua","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Automation, Guangdong University of Technology, Guangzhou 510006, Guangdong, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2842-6439","authenticated-orcid":false,"given":"Shuting","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Guangdong University of Technology, Guangzhou 510006, Guangdong, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,1,20]]},"reference":[{"key":"S0218001423510205BIB001","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12247"},{"key":"S0218001423510205BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2009.5073775"},{"key":"S0218001423510205BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.917093"},{"key":"S0218001423510205BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2009.2033050"},{"key":"S0218001423510205BIB005","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12204362"},{"key":"S0218001423510205BIB006","first-page":"768","volume-title":"IEEE Int. Conf. Consumer Communications and Networking (CCNC)","author":"Jae R. C.","year":"2006"},{"key":"S0218001423510205BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.051512.110448"},{"key":"S0218001423510205BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2002558"},{"key":"S0218001423510205BIB009","first-page":"75","volume-title":"Int. Conf. Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM)","author":"Law C.","year":"2000"},{"key":"S0218001423510205BIB010","first-page":"166","volume-title":"IEEE Int. Conf. Mobile and Ubiquitous Systems: Networking and Services (MobiQuitous)","author":"Lee S. R.","year":"2005"},{"issue":"11","key":"S0218001423510205BIB011","first-page":"2671","volume":"46","author":"Li C.","year":"2018","journal-title":"Tien Tzu Hsueh Pao\/Acta Electron. Sin."},{"issue":"3","key":"S0218001423510205BIB012","first-page":"4931","volume":"72","author":"Li G.","year":"2022","journal-title":"Comput. Mater. Contin."},{"issue":"1","key":"S0218001423510205BIB013","first-page":"21","volume":"13","author":"Li G.","year":"2023","journal-title":"Int. J. RF Technol., Res. Appl."},{"key":"S0218001423510205BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1098"},{"key":"S0218001423510205BIB015","doi-asserted-by":"publisher","DOI":"10.3390\/app13042228"},{"key":"S0218001423510205BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.64"},{"key":"S0218001423510205BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/JRFID.2023.3265504"},{"key":"S0218001423510205BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2011.2158831"},{"key":"S0218001423510205BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45866-2_9"},{"key":"S0218001423510205BIB021","doi-asserted-by":"crossref","first-page":"6646812","DOI":"10.1155\/2021\/6646812","volume":"2021","author":"Wang X. Y.","year":"2021","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"S0218001423510205BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/ICIST55546.2022.9926819"},{"key":"S0218001423510205BIB023","doi-asserted-by":"publisher","DOI":"10.1007\/s10776-019-00465-4"},{"key":"S0218001423510205BIB024","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/641327"},{"key":"S0218001423510205BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2817587"},{"key":"S0218001423510205BIB026","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001420500111"},{"key":"S0218001423510205BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2021.02.075"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001423510205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T20:14:21Z","timestamp":1730837661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218001423510205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"references-count":26,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2023,12,30]]}},"alternative-id":["10.1142\/S0218001423510205"],"URL":"https:\/\/doi.org\/10.1142\/s0218001423510205","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"article-number":"2351020"}}