Advancing RFID Missing Tag Identification: Theoretical Bounds, Existing Algorithm Quantification, and a Collision-Partition Tree-Based Approach

Advancing RFID Missing Tag Identification: Theoretical Bounds, Existing Algorithm Quantification, and a Collision-Partition Tree-Based Approach | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 2 December 2025 V1 Latest version Share on Advancing RFID Missing Tag Identification: Theoretical Bounds, Existing Algorithm Quantification, and a Collision-Partition Tree-Based Approach Author : John Snare 0009-0000-6641-8352 [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.176463768.86696409/v1 125 views 48 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract Radio Frequency Identification (RFID) missing tag identification is a fundamental task for large-scale IoT applications like warehouse inventory management and supply-chain control. However, two key issues have long restricted its development: the lack of clear theoretical performance boundaries for evaluation, and the limited efficiency of existing algorithms in balancing time overhead and identification accuracy. This paper addresses these gaps through three core contributions to advance the state of the art in RFID missing tag identification. First, we conduct a systematic quantitative assessment of representative missing tag identification algorithms developed over the past decade. Our analysis shows that even the most effective existing solutions have an expected execution time closely related to the total number of tags (N) and accuracy requirements (where represents confidence and represents error tolerance), with a consistent cost structure that fails to fully optimize for largescale tag systems. Second, we establish an algorithm-independent theoretical lower bound for expected execution time, which takes into account both the number of tags and accuracy constraints. This bound fills a long-standing gap in the field by providing a formal benchmark for evaluating all future algorithms. Third, we propose a novel algorithm based on a Collision-Partition Tree (CPT), a balanced data structure built using tag pseudo-IDs. This design leverages Manchester coding to improve slot utilization and reduces time overhead by up to a factor of log N compared to state-of-the-art algorithms. Extensive simulations using standard RFID system parameters confirm that our CPTbased algorithm outperforms existing solutions (including MMTI, SFMTI, and PCMTI) in time efficiency, scalability, and stability across different tag counts and accuracy requirements. This work not only provides a practical, high-performance solution for realworld RFID missing tag identification but also offers a theoretical framework to guide future algorithm development in this area. Supplementary Material File (manuscript3.pdf) Download 715.01 KB Information & Authors Information Version history V1 Version 1 02 December 2025 Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords collision-partition tree manchester coding rfid missing tag identification theoretical performance bound time overhead optimization Authors Affiliations John Snare 0009-0000-6641-8352 [email protected] Ach Medical University View all articles by this author Metrics & Citations Metrics Article Usage 125 views 48 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation John Snare. Advancing RFID Missing Tag Identification: Theoretical Bounds, Existing Algorithm Quantification, and a Collision-Partition Tree-Based Approach. Authorea . 02 December 2025. DOI: https://doi.org/10.22541/au.176463768.86696409/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.176463768.86696409/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9feb26dd0adc3fe2',t:'MTc3OTI3ODEyMA=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();