计算机工程与应用Issue(15)：117-121,5.DOI:10.3778/j.issn.1002-8331.1610-0037
基于冲突分段的动态树型RFID防碰撞算法
Dynamic tree structure anti-collision algorithm for RFID system based on collision segmentation
摘要
Abstract
To resolve the problem of the tree-based anti-collision algorithm which produces many idle time slots and colli-sion time slots, it makes RFID system a lower efficiency, a dynamic tree structure anti-collision algorithm based on colli-sion segmentation(DTCS)is proposed. Considering with the increase of search layers, the number of tags in the collision nodes and tags non-recognition sequence collision probability is reduced, this paper effective uses the conflict bit distribu-tion information, extracts every collision node tag query segment N according to the rules, combines with the coding mechanism, determines the query prefix and optimizes query command. Theory analysis and simulation results show that the new algorithm avoids idle time slots, shortens the search depth quickly, then can reduce the delay of tag identification and improve the throughput of the system up to 0. 649.关键词
射频识别/防碰撞/冲突分段/查询段/编码Key words
Radio Frequency Identification(RFID)/anti-collision/collision segmentation/query segment/coding分类
信息技术与安全科学引用本文复制引用
张荣华,张海周,杨大志,柳忠彬..基于冲突分段的动态树型RFID防碰撞算法[J].计算机工程与应用,2017,(15):117-121,5.基金项目
企业信息化与物联网测控技术四川省高校重点实验室开放基金(No.2015WYY01). （No.2015WYY01）
