一种分段抽取RFID标签防碰撞算法  

AN ANTI-COLLISION ALGORITHM FOR RFID TAGS USING SEGMENTED EXTRACTION

作　　者：王明斐[1] 于琨[1] 

机构地区：[1]河南机电高等专科学校计算机科学系,河南新乡453002

出　　处：《计算机应用与软件》2014年第10期292-294,308,共4页Computer Applications and Software

摘　　要：无线识别技术由于实现成本较低且能够有效简化货物的识别过程而受到各行业的关注。无线识别技术需要从大量的标签中迅速、准确地获取标签信息。由于扫描时间成本和标签成本的限制,无法避免扫描过程中多个标签信息碰撞的发生。以基于树的查询系列算法为代表的确定性防碰撞算法因可靠性高而获得大量应用。但是,这些算法的标签识别时间较长同时识别的总通信量较大。提出一种分段抽取的防碰撞算法。理论分析与仿真表明,该算法与已有典型确定性算法相比,具有更低的标签识别时间和更少的总通信量。RFID technology gains attention from various industries, because it has low implementation cost and can effectively simplify the identification process of goods. RFID needs to rapidly and accurately obtain tag information from a great deal of tags. Limited by the scanning time cost and tags cost, the collision of multiple tag information cannot be avoid in scanning process. Deterministic anti-collision algorithms represented by tree-based query series algorithm are widely used due to high reliability. However, these algorithms have long tag recognition time and also have a large amount of traffic for information exchange. An anti-collision algorithm with segmented extraction is proposed in this paper. Theoretical analysis and simulation show that the proposed algorithm has a lower tag recognition time and a fewer total traffic compared with existing typical deterministic algorithms.

关 键 词：无线识别 二进制算法 防碰撞算法 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]