射频识别系统中的防碰撞算法设计  

Design of Anti-collision Algorithm in RFID System

作　　者：贾利锋[1] 郑晓彦[2] 高金辉[2] 

机构地区：[1]河南师范大学图书馆,河南新乡453007 [2]河南师范大学物理与信息工学院,河南新乡453007

出　　处：《河南师范大学学报（自然科学版）》2012年第2期59-61,共3页Journal of Henan Normal University(Natural Science Edition)

基　　金：河南省教育厅科技攻关项目(2009A510006)

摘　　要：提出了一种用于解决射频识别系统中的碰撞问题的方法——动态多叉树搜索算法,新算法分析了动态二叉树算法和四叉树算法的优缺点,改进了动态二叉树搜索算法,并通过Schoute算法估计标签数量,选择调整搜索叉树,解决了多标签识别的碰撞问题,理论和仿真证明了新算法的优越性,即减少搜索的时隙数并提高了时隙的吞吐率.This paper anti-collision problems. The proposes a novel anti-collision method, dynamic multi-tree search algorithm for solving the RFID new algorithm analyzes the advantages and drawbacks of the dynamic binary search and the dy- namic four-tree search, and improves the former, taking advantage of the Schoute algorithm estimates the number of the tags, then the branch is decided. Theory and computer simulations show that the new anti-collision algorithm is superior to the traditional algorithm. It can reduce the search timeslots and improve the throughput of timeslots.

关 键 词：射频识别 防碰撞算法 动态多叉树搜索算法 标签估计 时隙 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]