基于比特查询的多进制树标签防碰撞识别协议

doi:10.3969/j.issn.0372-2112.2019.02.023

电子学报 ›› 2019, Vol. 47 ›› Issue (2): 422-427.DOI: 10.3969/j.issn.0372-2112.2019.02.023

基于比特查询的多进制树标签防碰撞识别协议

苏建, 许若钰, 姚永雷, 庄伟, 王保卫

南京信息工程大学计算机与软件学院, 江苏南京 210044

收稿日期:2018-09-05 修回日期:2018-12-12 出版日期:2019-02-25
- 通讯作者:
- 苏健
- 作者简介:
- 许若钰 女,1995年生,山西忻州人.现在南京信息工程大学攻读硕士学位.主要从事物联网技术相关研究.
- 基金资助:
- 国家自然科学基金 (No.61802196）; 江苏省自然科学基金 (No.BK20180791）; 江苏省高校面上项目 (No.17KJB510036）; 南京信息工程大学人才启动经费 (No.2243141701031）

Bit Query Based M-ary Tree Anti-Collision Identification Protocol for RFID Tags

SU Jian, XU Ruo-yu, YAO Yong-lei, ZHUANG Wei, WANG Bao-wei

School of Computer and Software, Nanjing University of Information Science & Technology, Nanjing, Jiangsu 210044, China

Received:2018-09-05 Revised:2018-12-12 Online:2019-02-25 Published:2019-02-25

摘要/Abstract

摘要： 多标签碰撞问题被认为是射频识别系统中的一个关键问题.近来，许多基于比特追踪技术的查询树算法被提出用于有效的解决标签碰撞问题，然而由于无用的碰撞比特信息和空闲时隙的存在，这些查询树算法的性能都有待进一步提升.本文提出了一种基于比特查询的查询方法，该算法使得标签返回一个映射过比特串来取代原始的ID序列.同传统的ID查询相比较，比特查询不仅可以消除空闲查询还可以将碰撞标签分成更多子集并充分利用碰撞比特信息.基于该比特查询方法，我们提出了一种基于比特查询的多进制树（Bit query based M-ary tree，BQBMT）新型查询树算法，它通过多进制树迭代的分离碰撞，并通过比特查询模式和ID查询模式之间的最佳切换来快速识别标签.理论分析和仿真结果显示，BQBMT算法的的系统效率接近0.89，超过了现有的QT算法和混合防碰撞算法.

关键词: 射频识别, 防碰撞, 比特查询, 系统效率

Abstract: Multi-tags collision has been considered as a critical problem in RFID system.Recently,many query tree protocols based on bit tracking technology have been presented for resolving the tag collision efficiently.However,their performance need to be further improved because of unused collided bits and idle slots.In this paper,a bit query based method is presented,which requires the tag to respond a mapped bit string instead of its ID sequence.Compared with traditional ID query,it not only eliminate idle queries,but also can separate collided tags into many smaller subsets and make full use of the collided bits as well.Based on this method,a novel query tree protocol bit query based M-ary tree(BQBMT)is proposed,which recursively resolves collisions by forming a M-ary tree,and optimally switches from bit query mode to ID query mode for quickly identifying the tags when tag is readable.Theoretical analysis and simulation results show that the system efficiency of BQBMT is close to 0.89,which outperforms the other existing QT-based and hybrid algorithms.

Key words: RFID (Radio frequency identification), anti-collision, bit query, system efficiency

中图分类号:

TP391.4

苏建, 许若钰, 姚永雷, 庄伟, 王保卫. 基于比特查询的多进制树标签防碰撞识别协议[J]. 电子学报, 2019, 47(2): 422-427.

SU Jian, XU Ruo-yu, YAO Yong-lei, ZHUANG Wei, WANG Bao-wei. Bit Query Based M-ary Tree Anti-Collision Identification Protocol for RFID Tags[J]. Acta Electronica Sinica, 2019, 47(2): 422-427.

参考文献

[1] Lehto Arttu,Nummela Jussi,Ukkonen Leena,Sydaenheimo Lauri,Kivikoski,Markku.Passive UHF RFID in paper industry:challenge,benefits and the application environment[J].IEEE Tran Autom Sci Eng,2009,6(1):66-79.
[2] Zhu Lei,Yum Tak-Shing Peter.A critical survey and analysis of RFID anticollision mechanisms[J].IEEE Commun.Mag.,2011,49(5):214-221.
[3] Wu Hai-feng,Zeng Yu.Bayesian tag estimate and optimal frame length for anti-collision Aloha RFID system[J].IEEE Trans Autom Sci Eng,2010,7(4):963-969.
[4] Su Jian,et al.Idle-slots elimination based binary splitting anti-collision algorithm for RFID[J].IEEE Commun.Lett,2016,20(12):2394-2397.
[5] Zhang Li-juan,Zhang Jin,Tang Xiao-hu.Assigned tree slotted Aloha RFID tag anti-collision protocols[J].IEEE Trans Wireless Commum,2013,12(11):5493-5505.
[6] Lai Yuan-cheng,et al.Optimal slot assignment for binary tracking tree protocol in RFID tag identification[J].IEEE/ACM Trans Netw,2015,23(1):255-268.
[7] Lai Yuan-cheng,et al.A novel query tree protocol with bit tracking in RFID tag identification[J].IEEE Trans Mobile Comput,2013,12(10):2063-2075.
[8] Zhang Li-juan,et al.An adaptive anti-collision protocol for large-scale RFID tag identification[J].IEEE Wireless Commun Lett,2014,3(6):601-604.
[9] Shin Jong-min,Jeon Byeong-chan,Yang Dong-min.Multiple RFID tags identification with M-ary query tree scheme[J].IEEE Commun Lett,2013,17(3):604-607.
[10] Landaluce Hugo,et al.An energy and identification time decreasing procedure for memoryless RFID tag anti-collision protocols[J].IEEE Trans Wireless Commun,2016,15(6):4234-4247.
[11] Su Jian,Sheng Zheng-guo,Wen Guang-jun,Leung Victor C.M.A time efficient tag identification algorithm using dual prefix probe scheme(DPPS)[J].IEEE Signal Process Lett,2016,23(3):386-389.
[12] Qian Chen,et al.ASAP:Scalable collision arbitration for large RFID systems[J].IEEE Trans Parallel Distrib Syst,2013,24(7):1277-1288.
[13] Shahzad Muhammad,Liu Alex X.Probabilistic optimal tree hopping for RFID identification[J].IEEE/ACM Trans Netw,2015,23(3):796-809.
[14] Landaluce Hugo,Perallos Asier,Garcia Zuazola I J.A fast RFID identification protocol with low tag complexity[J].IEEE Commun Lett,2013,17(9):1704-1706.
[15] Vales-Alonso Javier,et al.Multiframe maximum-likelihood tag estimation for RFID anticollision protocols[J].IEEE Trans Ind Informat,2011,7(3):487-496.
[16] Chen Wen-Tzu.An accurate tag estimate method for improving the performance of an RFID anticollision algorithm based on dynamic frame length Aloha[J].IEEE Trans.Autom Sci Eng,2009,6(1):9-15.
[17] Su Jian,et al.An efficient sub-frame based tag identification algorithm for UHF RFID systems[J].IEEE Int.Conf.Commun.(ICC),2016.1-6.
[18] Chen Wen-Tzu.A feasible and easy-to-implement anti-collision algorithm for the EPCglobal UHF class-1 generation-2 RFID protocol[J].IEEE Trans Autom Sci Eng,2014,11(2):485-491.
[19] Solic Petar,Radic Josko,Rozic Nikola.Energy efficient tag estimation method for ALOHA-based RFID systems[J].IEEE Sensors J,2014,14(10):3637-3647.
[20] Su Jian,Sheng Zheng-guo,Hong Dan-feng,Wen Guangjun.An effective frame breaking policy for dynamic framed slotted Aloha in RFID[J].IEEE Commun Lett,2016,20(4):692-695.

基于比特查询的多进制树标签防碰撞识别协议

Bit Query Based M-ary Tree Anti-Collision Identification Protocol for RFID Tags

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	宋建华, 何帅, 姚慧. 多阅读器协作的RFID标签树形防碰撞算法[J]. 电子学报, 2020, 48(8): 1558-1564.
[2]	李俊志, 吴海锋, 曾玉, 院东珠. 频率漂移的RFID冲突标签的物理层恢复[J]. 电子学报, 2018, 46(8): 2004-2010.
[3]	莫磊, 陈伟, 任菊. 位屏蔽多叉树搜索射频识别防碰撞算法[J]. 电子学报, 2018, 46(5): 1200-1206.
[4]	苏健, 杨晓娇, 韩雨. 一种时间高效的易于实现的多标签射频识别技术[J]. 电子学报, 2018, 46(4): 903-910.
[5]	梁笑轩, 黄樟钦, 邱兰馨. 一种基于二维相控阵天线的RFID定位方法[J]. 电子学报, 2018, 46(4): 911-917.
[6]	李川, 苏健, 刘克雄, 韩雨, 赵红军. 基于查询树的防碰撞算法性能分析与研究[J]. 电子学报, 2018, 46(11): 2671-2678.
[7]	王国伟, 贾宗璞, 彭维平. 基于动态共享密钥的移动RFID双向认证协议[J]. 电子学报, 2017, 45(3): 612-618.
[8]	苏健, 谢良波, 杨颖, 文光俊, 孟庆微. 基于空闲时隙消除的超高频RFID防碰撞算法[J]. 电子学报, 2017, 45(2): 307-314.
[9]	张小红, 张留洋. 无源RFID自适应帧时隙防碰撞算法研究[J]. 电子学报, 2016, 44(9): 2211-2218.
[10]	付钰, 钱志鸿, 孟婕, 王雪. 基于连续时隙预测的帧时隙Aloha防碰撞算法[J]. 电子学报, 2016, 44(9): 2081-2086.
[11]	胡应梦, 张小红. 基于信息位编码的自适应搜索RFID防碰撞算法研究[J]. 电子学报, 2016, 44(8): 1791-1798.
[12]	张小红, 胡应梦. 分组自适应分配时隙的RFID防碰撞算法研究[J]. 电子学报, 2016, 44(6): 1328-1335.
[13]	王鑫, 贾庆轩, 高欣, 陈钢, 赵兵. 分组N叉跟踪树型RFID防碰撞算法研究[J]. 电子学报, 2016, 44(2): 437-444.
[14]	黄以华, 陈小若. 改进型动态时隙冲突跟踪树标签防碰撞算法[J]. 电子学报, 2015, 43(8): 1465-1470.
[15]	苏健, 韩雨, 骆忠强, 谢良波, 文光俊. 超高频RFID系统中一种可行的时间最优防碰撞算法[J]. 电子学报, 2015, 43(8): 1651-1655.