一种基于堆栈存储的RFID防冲突算法  

New anti-collision algorithm for RFID system based on stack storage

作　　者：陈炳才[1,2] 徐东升[1] 顾国昌[1] 郭黎利[2] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001 [2]哈尔滨工程大学信息与通信工程学院,哈尔滨150001

出　　处：《计算机应用》2009年第6期1483-1486,共4页journal of Computer Applications

基　　金：黑龙江省博士后基金资助项目(LBH-Z07218);哈尔滨工程大学基础研究基金资助项目(HEUFT07025)

摘　　要：针对现有几种基于二进制搜索法的射频识别(RFID)防冲突算法没有同时考虑识别次数和传输位数这两方面性能,通过改进读写器识别电子标签过程中的步骤和减少读写器发送指令的位数,提出了基于堆栈的RFID动态减位防冲突算法。该算法利用堆栈记忆存储功能避免每次从树型根部识别,从而减少识别次数;并采用适当协议进一步缩减必需的指令信息位。仿真结果表明该算法在识别次数和传输位数方面相比其他几种二进制搜索法都有很大降低,在次数效率和位数效率性能上亦有较大提高,故该算法在识别完成时间和能量消耗方面相应得到较大改善。To solve the problem that both identifying times and the number of transmitting data could not be simultaneously run in some binary-search schemes, a new anti-collision algorithm for Radio Frequency Identification （RFID） system based on stack storage was proposed through modifying the process for reader to identify all tags and cutting short the number of bits sent by reader. In order to reduce identifying times, this algorithm utilized the memory function of stack to avoid starting identifying step from the root every time. In addition, it adopted suitable protocols to further cut down necessary command bits. Simulation results indicate that this algorithm can not only decrease the identifying times but also reduce the number of command bits. Moreover, it can obtain a better performance with regard to times-efficiency and bits-efficiency. Thus, this algorithm achieves an improvement in the aspects of operative duration and energy consumed.

关 键 词：RFID系统 防冲突 堆栈 二进制搜索法 动态减位 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]