• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2014, Vol. 36 ›› Issue (10): 2041-2046.

• 论文 • 上一篇    

基于信息预处理的分组动态二进制防碰撞算法

周艳聪1,2,董永峰2,崔晓欣2,杨阔1   

  1. (1.天津商业大学信息工程学院,天津 300134;2.河北工业大学计算机科学与软件学院,天津 300401)
  • 收稿日期:2014-06-11 修回日期:2014-08-02 出版日期:2014-10-25 发布日期:2014-10-25
  • 基金资助:

    天津市应用基础与前沿技术研究计划重点项目(12JCZDJC21200,14JCYBJC15900);全国大学生创新创业训练计划项目(201310069016)

A grouping dynamic binary anti-collision algorithm
based on information preprocessing             

ZHOU Yancong1,2,DONG Yongfeng2,CUI Xiaoxin2,YANG Kuo1   

  1. (1.School of Information Engineering,Tianjin University of Commerce,Tianjin 300134;
    2.School of Computer Science and Engineering,Hebei University of Technology,Tianjin 300401,China)
  • Received:2014-06-11 Revised:2014-08-02 Online:2014-10-25 Published:2014-10-25

摘要:

针对现有二进制防碰撞算法通信数据量大、存在冗余信息的缺点,提出了一种新二进制防碰撞算法。新算法在阅读器与标签的首次通信中首先进行信息预处理,后继识别过程中只处理冲突位,然后利用每次探测得到的碰撞位信息构造二叉树。最高碰撞位之前的部分后接一个“0”为左子树,最高碰撞位之前的部分后接一个“1”+两个最高碰撞位之间的部分为右子树,在叶子结点实现标签的识别。该算法从阅读器和标签两方面同时进行改进,减少了通信量,提高了识别效率。

关键词: 信息预处理, 防碰撞, 二叉树, 射频识别

Abstract:

In order to overcome the shortcomings of binary anti-collision,such as more communication data and communication time,a novel dynamic binary anticollision algorithm is proposed.In the new algorithm,the ID information is preprocessed in the first communication between the reader and tags,and then only the collision bits are handled in the next process.The binarytree is constructed by the deleted collision bits accordingly.The bits before the highest collision bit followed by "0"  constitute the left subtree.The bits before the highest collision bit followed by "1" and the bits between the highest collision bit and the second highest one constitute the right subtree. Then the tags are identified at leaf level.The new algorithm is improved for both reader and tags, so that it reduces the amount of communication data and improves the recognition efficiency.

Key words: information preprocessing;anti-collision;binary-tree;radio frequency identification