摘要
射频识别技术中存在标签冲突问题,通常采用定长标签的反碰撞识别方法来解决。针对不定长标签的反碰撞识别,设计一种对RFID标签进行识别的高效二进制树形反碰撞算法——U-算法。模拟实现的测试与分析结果表明,U-算法具有二进制树形算法的优点,能达到41.67%的系统识别效率。
Tag collision problem is a key issue in Radio Frequency Identification(RFID) system.The efficient algorithms for solving this problem usually deal with fix-length of tag encoding.For solving this problem with unfixed-length of tag encoding,a fast anti-collision algorithm called U-algorithm is presented.The U-algorithm is also of the advantages of binary tree algorithms.Simulation implementation experiments show that the proposed algorithm has the efficient identification ratio of 41.67%.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第20期241-243,共3页
Computer Engineering
基金
中山大学实验教学研究基金资助项目
关键词
射频识别
不定长标签
反碰撞算法
二进制树
Radio Frequency Identification(RFID)
unfixed-length tags
anti-collision algorithm
binary tree