一种基于连续度的自适应改进型碰撞树算法  

An Adaptation of Protocol Based on Continuous Degree Improved Collision Tree

作　　者：王飞 王彬[1] 郝永放 狄辉 WANG Fei;WANG Bin;HAO Yongfang;DI Hui(School of Electronic Information,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China)

机构地区：[1]杭州电子科技大学电子信息学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2018年第4期11-15,共5页Journal of Hangzhou Dianzi University：Natural Sciences

摘　　要：改进型碰撞树算法是射频识别中重要的防碰撞算法之一。针对该算法通信复杂度过高和仅适用于标签编号连续情况的不足,提出了一种基于连续度的自适应改进型碰撞树算法。研究结果表明:在改善通信量方面,自适应改进型碰撞树算法对标签编号采用预处理的方式,减少了标签长度,与改进型碰撞树算法相比,通信量减少了30%;在标签编号连续时,新算法识别效率提高了10%,在标签编号非连续时比原来提高了20%以上。Improved collision tree protocol（ICTP）is one of the important protocol of anti-collision in radio frequency identification.Aiming at the problem that the communication complexity is too high and only the continuous problem of tag number is applied,an adaptation of protocol based on continuous degree improved collision tree is proposed.In the case of improved traffic,the tag number is pre-processed to reduce the length of the tag.Both the theoretical and experimental results indicate that AICT reduces the communication complexity by 30% compared with original protocol.It also improves the identification efficiency by 10% when the tag number is continuous and increases by more than 20% when the tag number is discontinuous.

关 键 词：射频识别 连续度 预处理 多叉树 防碰撞算法 

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