摘要
为了解决RFID系统中标签识别信息碰撞问题,文中基于现有的确定性二叉树防碰撞算法,通过引入置换码机制,提出了一种基于置换码的RFID防冲突算法。新算法中读卡器依据碰撞位个数的不同,发送不同的查询命令。若读卡器发现碰撞位个数仅为两位或者三位,则命令标签发送其碰撞位编码的置换码,从而快速识别这几个碰撞编码。仿真结果表明,新算法可以有效地减少标签识别过程中的查询次数和通信量,提高了标签识别效率和系统吞吐率。
In order to solve the problem of information collision during the process of tags identification, based on the existing binary search tree algorithm,by introducing substitution code unit mechanism, propose an anti-collision algorithm in RFID based on substitution code. In the new algorithm, the card reader sends different request command based on the number of the collision position. In order to rec- ognize the tags rapidly, the card reader sends the new request command if the card reader finds the number of the collision position are 2 or 3. The simulation results show that the new algorithm can effectively reduce the times of tag identification and the information trans- ferred in the process of query, improving the efficiency of tags identification and the system throughput.
出处
《计算机技术与发展》
2015年第2期60-63,共4页
Computer Technology and Development
基金
国家自然科学重点基金(71231004)
关键词
射频识别
防碰撞
置换码
曼彻斯特编码
radio frequency identification
anti-collision
substitution code
Manchester encoding