| 不定长RFID标签反碰撞识别算法 |
| |
| 引用本文： | 李慧,张治国.不定长RFID标签反碰撞识别算法[J].计算机工程,2010,36(20):241-243. |
| |
| 作者姓名： | 李慧 张治国 |
| |
| 作者单位： | 中山大学信息科学与技术学院,广州,510275 |
| |
| 基金项目： | 中山大学实验教学研究基金 |
| |
| 摘 要： | 射频识别技术中存在标签冲突问题，通常采用定长标签的反碰撞识别方法来解决。针对不定长标签的反碰撞识别，设计一种对RFID标签进行识别的高效二进制树形反碰撞算法——U-算法。模拟实现的测试与分析结果表明，U-算法具有二进制树形算法的优点，能达到41.67%的系统识别效率。
|
| 关 键 词： | 射频识别 不定长标签 反碰撞算法 二进制树 |
Anti-collision Identification Algorithm for Unfixed-length RFID Tags |
| |
| LI Hui,ZHANG Zhi-guo.Anti-collision Identification Algorithm for Unfixed-length RFID Tags[J].Computer Engineering,2010,36(20):241-243. |
| |
| Authors: | LI Hui ZHANG Zhi-guo |
| |
| Affiliation: | (School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, China) |
| |
| 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%. |
| |
| Keywords: | Radio Frequency Identification(RFID) unfixed-length tags anti-collision algorithm binary tree |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
