On Converse Binary Anti-collision Algorithm
According to the research and analysis of binary anti-collision algorithm for radio frequency identification,a new algorithm of converse binary anti-collision was proposed.For the general binary algorithms disadvantage of more interactive times and more communication data,many improved methods were introduced into it.In the new one the identification tree was constructed from leaves and it can identify the tags no matter whether the collision bits are consecutive or not.The new one had obvious superiority in interactive times,communication data and identification efficiency;especially there were many tags within the scope of reader.Finally,the algorithm was proved feasible,practical and effective by simulation,data analysis and testing instance.
ZHOU Yancong GU Junhua DONG Yongfeng GU Zhitao LI Guoyan
School of Electrical Engineering,Hebei University of Technology,Tianjin 300130,P.R.China School of I School of Computer Science and Engineering,Hebei University of Technology,Tianjin 300130,P.R.China School of Electrical Engineering,Hebei University of Technology,Tianjin 300130,P.R.China
国际会议
The 30th Chinese Control Conference(第三十届中国控制会议)
烟台
英文
1-5
2011-07-01（万方平台首次上网日期，不代表论文的发表时间）