增强型四叉树RFID防碰撞算法

doi:10.11896/j.issn.1002-137X.2016.11A.063

计算机科学 ›› 2016, Vol. 43 ›› Issue (Z11): 271-274.doi: 10.11896/j.issn.1002-137X.2016.11A.063

增强型四叉树RFID防碰撞算法

单朴芳,郑嘉利,岳世彬,杨子薇

广西大学计算机与电子信息学院南宁530004,广西大学计算机与电子信息学院南宁530004,广西大学计算机与电子信息学院南宁530004,广西大学计算机与电子信息学院南宁530004

出版日期:2018-12-01 发布日期:2018-12-01
基金资助:
本文受广西自然科学基金面上项目(2015GXNSFAA139290),广西科学研究与技术开发计划项目(桂科攻14124005-2-3)资助

Enhanced Four-fork Tree RFID Anti-collision Algorithm

SHAN Pu-fang, ZHENG Jia-li, YUE Shi-bin and YANG Zi-wei

Online:2018-12-01 Published:2018-12-01

摘要/Abstract

摘要： 在四叉树及各类自适应防碰撞算法的基础上,提出一种增强型四叉树防碰撞算法——EFFT(Enhanced four-fork tree )。该算法首先利用曼彻斯特编码准确定位出标签的碰撞位,对K位长度标签提取出其碰撞位形成新的k位标签UID信息,再采取动态四叉树进行识别。在MATLAB平台对EFFT算法、后退式二进制算法、自适应算法进行仿真对比实验。仿真结果与理论分析表明,所提算法大幅度减少了阅读器查询次数和传输比特数,同时也提高了吞吐率及系统识别效率。

关键词: 射频识别,防碰撞算法,碰撞位提取,四叉树

Abstract: Based on the four-fork tree and all kinds of adaptive anti collision algorithms,an enhanced EFFT (Enhanced four-fork tree) was proposed.The algorithm firstly uses the Manchester code to accurately locate the collision bit of the tag,and the K bit length tag is extracted from the collision bit to form a new K bit tag UID information,and then the dynamic four fork tree is used to identify the collision bit.In the MATLAB platform,the EFFT algorithm,the back type binary algorithm,the adaptive algorithm have been performed simulation comparison experiments.The simulation results and theoretical analysis show that the new algorithm greatly reduces the number of reader queries and the number of transmission bits,improve the throughput rate and the efficiency of system identification.

Key words: RFID,Anti-collision algorithm,Collision location extraction,Four-fork tree

单朴芳,郑嘉利,岳世彬,杨子薇. 增强型四叉树RFID防碰撞算法[J]. 计算机科学, 2016, 43(Z11): 271-274. https://doi.org/10.11896/j.issn.1002-137X.2016.11A.063

SHAN Pu-fang, ZHENG Jia-li, YUE Shi-bin and YANG Zi-wei. Enhanced Four-fork Tree RFID Anti-collision Algorithm[J]. Computer Science, 2016, 43(Z11): 271-274. https://doi.org/10.11896/j.issn.1002-137X.2016.11A.063

参考文献

[1] 郑嘉利,覃团发,倪光南.Tree-based Back off Protocol for Fast RFID Tag Identification [J].中国邮电高校学报(英文版),2013,20(2):37-41
[2] 丁治国,朱学永,等.自适应多叉树防碰撞算法研究[J].自动化学报,2010,36(2):237-241
[3] Yussof Y M,Hashim H,Baba M D.Identity-based Trusted Authentication in Wireless Sensor Network[J].International Journal of Computer Science Issues,2012,9(3)
[4] Grawrock D.TCG specification architecture overview [EB/OL].Technology Report.Trusted Computing Group Revision 1,4(2007).http://www.trustedcomputinggroup.org/resources/tcg_architecture_overview_version_14,2
[5] Tae-Wook H,Byong-Gyo L,Kim Y S,et al.Improved anti-collision scheme for high speed identification in RFID system[C]∥Proceedings of the 1st International Conference on Innovative Computing,Information and Control.Beijing,China:IEEE,2006:449-452
[6] 韦冬雪,郑嘉利,李亮亮,等.一种新颖的多叉树防碰撞算法研究[J].计算机科学,2013,40(10):52-55
[7] 黄庆欢,郑嘉利,韦冬雪,等.基于维码数的RFID混合防碰撞算法[J].计算机科学,2014,41(11):10-14
[8] 张学军,蔡文琦,王锁萍.改进型自适应多叉树防碰撞算法的研究[J].电子学报,2012,40(1):193-198
[9] 林伟,李景霞,叶林峰.基于多叉树搜索算法改进的RFID防碰撞算法[J].电子技术应用,2012,20(10):130-133
[10] 陈希孺,倪国熙.数理统计学教程[M].合肥:中国科学技术出版社,2009:189-211
[11] 数理统计编程组.数理统计[M].西安:西北工业大学出版社,1997:42-49
[12] 任少杰,郝永生,许博浩,等.一种新的自调整多叉树防碰撞算法[J].计算机测量与控制,2015,23(12):4180-4184

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed

增强型四叉树RFID防碰撞算法

Enhanced Four-fork Tree RFID Anti-collision Algorithm

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

Metrics

本文评价

推荐阅读 0