摘要: 射频识别技术中存在标签冲突问题,通常采用定长标签的反碰撞识别方法来解决。针对不定长标签的反碰撞识别,设计一种对RFID标签进行识别的高效二进制树形反碰撞算法——U-算法。模拟实现的测试与分析结果表明,U-算法具有二进制树形算法的优点,能达到41.67%的系统识别效率。
关键词:
射频识别,
不定长标签,
反碰撞算法,
二进制树
Abstract: 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%.
Key words:
Radio Frequency Identification(RFID),
unfixed-length tags,
anti-collision algorithm,
binary tree
中图分类号:
李慧, 张治国. 不定长RFID标签反碰撞识别算法[J]. 计算机工程, 2010, 36(20): 241-243.
LI Hui, ZHANG Chi-Guo. Anti-collision Identification Algorithm for Unfixed-length RFID Tags[J]. Computer Engineering, 2010, 36(20): 241-243.