| 一种基于跳跃式动态树的二进制搜索改进算法 |
| |
| 引用本文： | 郭洪役,郦苏丹. 一种基于跳跃式动态树的二进制搜索改进算法[J]. 广东电脑与电讯, 2009, 0(3) |
| |
| 作者姓名： | 郭洪役 郦苏丹 |
| |
| 作者单位： | 国防科技大学计算机学院,湖南,长沙,410073;国防科技大学计算机学院,湖南,长沙,410073 |
| |
| 摘 要： | 众所周知，RFID系统数据采集功能实现的一个关键技术问题就是多标签防碰撞问题。如何更高效地识别大量的标签，对RFID系统性能来讲尤为重要。本文在分析各类二进制算法的基础上，提出一种改进算法。经过比较，该算法识读效率更高。
|
| 关 键 词： | RFID 二进制搜索算法 跳跃式动态树形防碰撞算法 |
An Improved Anti-collision Algorithm Based on Binary-tree Searing of Jumping and Dynamic |
| |
| Guo Hongyi Li Sudan. An Improved Anti-collision Algorithm Based on Binary-tree Searing of Jumping and Dynamic[J]. Computer & Telecommunication, 2009, 0(3) |
| |
| Authors: | Guo Hongyi Li Sudan |
| |
| Affiliation: | National University of Defense Technology;Changsha 410073;Hunan |
| |
| Abstract: | As is well known,a key technologies question of the RFI D system's data collection function is the multi-labels anti-collision.It is important to the RFID system performance that how to identify many of the tags more efficiently.This article proposes one kind of improvement algorithm based on the analysis of each kind of binary algorithm.After the comparison,the algorithm is more efficient. |
| |
| Keywords: | RFID |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
