电子学报 ›› 2020, Vol. 48 ›› Issue (8): 1558-1564.DOI: 10.3969/j.issn.0372-2112.2020.08.014

• 学术论文 • 上一篇    下一篇

多阅读器协作的RFID标签树形防碰撞算法

宋建华1,2,3,4, 何帅1, 姚慧1   

  1. 1. 湖北大学计算机与信息工程学院, 湖北武汉 430062;
    2. 湖北省教育信息化工程技术研究中心, 湖北武汉 430062;
    3. 湖北省软件工程工程技术研究中心, 湖北武汉 430062;
    4. 智慧政务与人工智能应用湖北省工程研究中心, 湖北武汉 430062
  • 收稿日期:2020-02-13 修回日期:2020-06-01 出版日期:2020-08-25 发布日期:2020-08-25
  • 通讯作者: 何帅
  • 作者简介:宋建华 女,1973年出生,湖北襄阳人.现为湖北大学副教授.湖北省教育信息化工程技术研究中心、湖北省软件工程技术研究中心、湖北省智能政务与人工智能应用工程研究中心成员.主要研究方向为信息安全与网络安全. E-mail:sjhhubu@126.com;姚 慧 女,1995年出生,湖北荆州人.2018年在湖北大学计算机与信息工程学院获得理学学士学位,现为湖北大学计算机与信息工程学院硕士研究生,主要研究方向为信息安全和网络安全. E-mail:yaoh.ly@foxmail.com
  • 基金资助:
    国家自然科学基金(No.61803149,No.61901163,No.61977021);湖北省技术创新专项重大项目(No.2018ACA13);湖北省高等学校人文社科重点研究基地(绩效评价信息管理研究中心)资助项目(No.2015JX02)

A Multi-Reader Cooperative Tree-Based Anti-Collision Algorithm

SONG Jian-hua1,2,3,4, HE Shuai1, YAO Hui1   

  1. 1. School of Computer Science and Information Engineering, Hubei University, Wuhan, Hubei 430062, China;
    2. Engineering and Technical Research Center of Hubei Province in Educational Informatization, Wuhan, Hubei 430062, China;
    3. Engineering and Technical Research Center of Hubei Province in Software Engineering, Wuhan, Hubei 430062, China;
    4. Engineering Research Center of Hubei Province in Intelligent Government Affairs and Application of Articial Intelligence, Wuhan, Hubei 430062, China
  • Received:2020-02-13 Revised:2020-06-01 Online:2020-08-25 Published:2020-08-25

摘要: 在物联网复杂的应用环境中,射频识别技术中的标签碰撞问题作为造成其系统标签识别时间长,通信量大等问题的主要原因,已成为近年来本领域的核心研究热点之一.针对以上问题,本文提出一种多阅读器协作的树形防碰撞算法:在第一阶段,根据位追踪技术能够识别标签碰撞位的特点,阅读器通过判别待识别标签中的碰撞位,从待广播节点中删除已验证的无效节点;在第二阶段的循环广播中,阅读器间通过共享每次的广播的前缀与当次广播结果对自身的树形结构进行不断优化,优化策略是为每一个阅读器分配一个待广播节点队列,通过共享的信息计算待广播节点中含有标签的概率,依据其概率调整队列中待广播节点的优先级,并不断地删除无需广播的节点.在下一轮广播中阅读器选取含有标签概率最大的节点进行广播.仿真实验结果表明:提出的算法的平均标签识别效率达到59.9%,并且在总时隙数量方面有一定优势.

关键词: 射频识别, 标签识别, 多阅读器, 二叉树, 防碰撞

Abstract: In the complex application environment of the internet of things,tag collision in RFID(radio frequency identification)technology has become one of the core research hotspots in recent years,which is the main reason for the high delay of tag identification and communication cost.To solve the problems above,a MRCT(multi-reader cooperative tree-based algorithm)is proposed in this paper.In the first stage of the algorithm,readers delete part of the invalid nodes according to the advantage of manchester code which can identify the collision bits of tags; In the second stage,readers share the prefix and the current broadcast result in each round of broadcast.The tree structure of the readers is continuously optimized by the information readers shared.The optimization strategy is to allocate a queue of nodes’ priority to be broadcasted for each reader.The probability of tags to be broadcasted is calculated by the shared information.The priority of nodes to be broadcasted is adjusted according to its probability,and the invalid nodes are deleted continuously.In the next broadcast,readers select the node with the highest probability to broadcast.Simulation results show that the average tag recognition efficiency of this algorithm is 59.9%,and MRCT has advantage in total time slots.

Key words: RFID(radio frequency identification), tag recognition, multi-reader, binary tree, anti-collision

中图分类号: