基于动态二进制的改进型树型搜索算法  

Improved tree search algorithm based on dynamic binary

作　　者：杨颖[1] 戴彬[2] 

机构地区：[1]川北医学院基础医学院,四川南充637100 [2]西华师范大学商学院,四川南充637009

出　　处：《华中师范大学学报（自然科学版）》2012年第6期669-672,共4页Journal of Central China Normal University：Natural Sciences

基　　金：四川省教育厅2010年青年基金项目(10ZC102)

摘　　要：RFID技术作为物联网应用的核心关键技术,已经普及到日常生产和生活的各个领域,然而如何提高RFID系统的防冲突能力,减少总识别时间已成为当前急需解决的关键问题.为此,提出了一个基于动态二进制的改进型树型搜索算法.该算法通过简化阅读器发送的指令和冲突检测过程,并利用栈来保存已经被阅读器接收到的标签EPC数据,以便最大化地降低阅读器与标签之间的通信量,从而有效地提高标签的识别速度.仿真结果表明,相比于常规的确定性标签防冲突算法,该算法显著提高了性能,尤其在待识别标签数量较大的情况下,具有良好的应用前景.As the key technology of internet of things,RFID technology have been spread to every field of life and production,and how to improve the anti-collision ability of RFID system and reduce the total recognition time has become an urgent tasks.This paper put forward an improved tree search algorithm based on dynamic binary to simplify instructions which the reader sends and collision detection process,and employs stack save EPC labels which have been received by readers,so that traffic between reader and lable is maximized and the recognition speed of labels is effectively improved.The simulation results show that compared with the conventional deterministic label anti-collision algorithms,the presented algorithm can greatly improve the search performance,especially in the case of greater number of labels,and it has a good application prospect.

关 键 词：RFID 物联网 动态二进制 树型搜索 EPC 

分 类 号：TP393.18[自动化与计算机技术—计算机应用技术]