基于冲突分段的动态树型RFID防碰撞算法  

Dynamic tree structure anti-collision algorithm for RFID system based on collision segmentation

作　　者：张荣华[1] 张海周[1] 杨大志[1] 柳忠彬[1] ZHANG Ronghua;ZHANG Haizhou;YANG Dazhi;LIU Zhongbin(College of Mechanical Engineering, Sichuan University of Science & Engineering, Zigong, Sichuan 643000, China)

机构地区：[1]四川理工学院机械工程学院,四川自贡643000

出　　处：《计算机工程与应用》2017年第15期117-121,共5页Computer Engineering and Applications

基　　金：企业信息化与物联网测控技术四川省高校重点实验室开放基金(No.2015WYY01)

摘　　要：针对射频识别系统中,基于树的防碰撞算法因存在较多空闲时隙和碰撞时隙导致系统效率低的问题,提出了基于冲突分段的动态树型防碰撞算法(DTCS)。新算法充分考虑随着搜索层数增加,碰撞节点内标签数量减少,标签未识别序列碰撞概率降低这一特点,有效利用冲突位分布信息,按规则提取每一碰撞节点标签查询段N,结合编码机制,确定查询前缀,优化查询命令。理论分析和仿真结果表明,新算法避免了空闲时隙,快速缩短了搜索深度,从而降低标签识别时延,系统吞吐率提高达0.649。To resolve the problem of the tree-based anti-collision algorithm which produces many idle time slots and collisiontime slots,it makes RFID system a lower efficiency,a dynamic tree structure anti-collision algorithm based on collisionsegmentation(DTCS)is proposed.Considering with the increase of search layers,the number of tags in the collisionnodes and tags non-recognition sequence collision probability is reduced,this paper effective uses the conflict bit distributioninformation,extracts every collision node tag query segment N according to the rules,combines with the codingmechanism,determines the query prefix and optimizes query command.Theory analysis and simulation results show thatthe new algorithm avoids idle time slots,shortens the search depth quickly,then can reduce the delay of tag identificationand improve the throughput of the system up to0.649.

关 键 词：射频识别 防碰撞 冲突分段 查询段 编码 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]