摘要
针对射频识别防碰撞系统多标签识别效率低、识别时隙长的问题,提出一种基于双重分组和对位映射的防碰撞查询树算法。按照识别码位数和异或运算结果对标签进行横向和纵向双重分组,并分别赋予不同的组标签,再基于对位映射规则根据组标签和识别码得到不同的映射数据。在此基础上,阅读器利用映射规律反推出碰撞信息得到查询前缀,并对碰撞信息进行分组、解码、入栈和出栈,最终完成标签识别。仿真结果表明,与传统查询树算法、八叉树搜索算法、A4PQT以及GBAQT算法相比,该算法能有效减少识别总时隙数,提高系统效率。
To address the low efficiency caused by the long time slots of multi-tag identification in Radio Frequency Identification(RFID)-based anti-collision system,this paper proposes an anti-collision query tree algorithm based on aligning mapping and double grouping.The tags are horizontally grouped according to the number of digits of identification codes and vertically grouped according to the XOR results of identification codes.Different group labels are assigned to different groups.Then based on the contraposition mapping rules,different mapping data are obtained according to the group label and identification code.On this basis,the reader uses the mapping law to implement backward reasoning for the collision information,so as to obtain the query prefix.Finally,the collision information is grouped,decoded,pushed and popped out of the stack to complete tag identification.Simulation results show that compared with the traditional query tree algorithm,octree search algorithm,A4PQT and GBAQT algorithm,the proposed algorithm can effectively reduce the total number of time slots and improve system efficiency.
作者
董轩江
李世宝
蔡丽萍
袁静
DONG Xuanjiang;LI Shibao;CAI Liping;YUAN Jing(College of Computer and Communication Engineering,China University of Petroleum (East China),Qingdao,Shandong 266580,China)
出处
《计算机工程》
CAS
CSCD
北大核心
2020年第8期184-189,196,共7页
Computer Engineering
基金
国家自然科学基金(61872385)
中央高校基本科研业务费专项资金(18CX02134A,18CX02137A,19CX05003A-4)。
关键词
射频识别
标签防碰撞算法
查询树
双重分组
映射机制
Radio Frequency Identification(RFID)
tag anti-collision algorithm
query tree
double grouping
mapping mechanism
作者简介
董轩江(1994—),男,硕士研究生,主研方向为射频识别通信,E-mail:dongxj1994@163.com;李世宝,副教授、硕士;蔡丽萍,高级工程师、硕士;袁静,硕士研究生。
