Wijayasekara, Sanika KrishnamaliSanika KrishnamaliWijayasekaraNakpeerayuth, SuvitSuvitNakpeerayuthAnnur, RobithohRobithohAnnurSanguankotchakorn, TeerapatTeerapatSanguankotchakornSandrasegaran, KumbesanKumbesanSandrasegaranSrichavengsup, WarakornWarakornSrichavengsupPhromsa-ard, TharathornTharathornPhromsa-ardWuttisittikulkij, LunchakornLunchakornWuttisittikulkijHUNG-YUN HSIEH2020-06-162020-06-1620191074-5351https://www.scopus.com/inward/record.uri?eid=2-s2.0-85070777695&doi=10.1002%2fdac.4108&partnerID=40&md5=24694896b0ce2ce8535297d1bdd6a97bIn this work, we propose a highly efficient binary tree-based anti-collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS-MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS-MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000-6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS-MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well-performed algorithms. © 2019 John Wiley & Sons, Ltd.ALOHA; anti-collision; reader; RFID; tag; tree algorithmjournal article10.1002/dac.41082-s2.0-85070777695WOS:000480976100001