| 基于后退策略的位传输二进制搜索算法 |
| |
| 引用本文： | 单承赣,孙明.基于后退策略的位传输二进制搜索算法[J].合肥工业大学学报(自然科学版),2010,33(1). |
| |
| 作者姓名： | 单承赣 孙明 |
| |
| 作者单位： | 合肥工业大学计算机与信息学院,安徽,合肥,230009 |
| |
| 摘 要： | 多个电子标签在识别时发生碰撞是射频识别(RFID)技术中的关键问题,通常使用的是二进制搜索算法,在其基础上提出的位传输二进制搜索算法是二进制算法的一种变异算法。文章在位传输二进制搜索算法的基础上进行改进,提出一种新的算法,并给出了该算法的软件实现;通过分析比较证明该算法的优异性能。
|
| 关 键 词： | 无线射频识别 防碰撞 二进制搜索 位传输二进制搜索 后退策略 |
An algorithm based on bit-by-bit binary-tree of backtracking |
| |
| SHAN Cheng-gan,SUN Ming.An algorithm based on bit-by-bit binary-tree of backtracking[J].Journal of Hefei University of Technology(Natural Science),2010,33(1). |
| |
| Authors: | SHAN Cheng-gan SUN Ming |
| |
| Abstract: | Tag collision is a key problem in radio frequency identification(RFID)when many tags are identified.The binary-tree searching(BS)algorithm is usually used to solve this problem.On the basis of the BS algorithm,a bit-by-bit binary-tree(BBT)searching algorithm has been proposed,which is actually derived from the BS.This paper offers a new algorithm.which is an improvement on the BBT,and proves that the new algorithm has some advantages by comparing with other algorithms.Finally,software realization is also presented. |
| |
| Keywords: | radio frequency identification anti-collision binary-tree searching bit-by-bit binary-tree searching backtracking strategy |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
