RFID 8-4-2 Dynamic Multi-branches Tree Anti-collision Algorithm Design and Analysis
Guo Rong-zu · Chongqing Shifan Daxue xuebao. Ziran kexue ban · 2013
For RFID system tags anti-collision and information-interactive inefficient problems,this paper puts forward 8-4-2dynamic multi-branches tree collision algorithm and short information to carry prior interaction algorithm.8-4-2DMTSA algorithm searches branches through calculating the current system generates collision ratio dynamic determining,optimizes the search command and reduces the idle time slot.The SMF algorithm identifies different label through carrying information,according to the information carrying capacity of small priority principle to interact,shorten the average wait time.The simulation analysis shows that this algorithm can effectively improve the RFID system performance and the whole efficiency of the system.