一种基于二进制码调制的射频识别防碰撞算法  

A Radio Frequency Identification Anti-collision Algorithm Based on Binary Code Modulation

作　　者：李志坚[1,2] 肖熠琳 

机构地区：[1]华南理工大学电子与信息学院,广州510640 [2]广东省现代控制与光机电技术公共实验室,广州510663 [3]广州市光机电技术研究院,广州510663

出　　处：《计算机工程》2015年第2期308-312,共5页Computer Engineering

基　　金：广东省科技计划基金资助项目(2010A011300016,2011J4100034,2011J4300078)

摘　　要：针对射频识别(RFID)标签防碰撞算法识别效率低的问题,提出一种基于二进制码调制的RFID标签防碰撞算法BCMA。对传统多叉树防碰撞算法进行改进,活动标签采用位编码技术把标签ID在多叉数中的位置信息调制到一个2m位的二进制数主控继电器(MCR)上,并把MCR回送给阅读器;阅读器采用位跟踪技术,定位MCR碰撞发生的数位,从而解调出活动标签的分组信息。阅读器对待识别标签的分组是确定性的,进而避免空闲时隙的产生,提高系统识别效率。仿真结果表明,与常见的八叉树算法相比,BCMA算法使系统吞吐率提高168%。To improve the identification efficiency and reduce the communication overhead,a novel algorithm,Binary Code Modulation Algorithm（BCMA） is proposed.BCMA works as follows：the activated tag generates and sends back a2-m bit binary code,Master Control Relay（MCR） pn which the location information of the tag＇ s ID in the multi-branch tree is modulated.After receiving the MCR,the reader finds out the collided bits,demodulates the branch information,and groups the tags into determinate subsets.It is obvious that BCMA avoids generating idle slots.Analysis results and simulations show that compared with other existing multi-branch algorithms,as the common octree algorithm,BCMA improves the system throughput by 168%.

关 键 词：射频识别 防碰撞算法 吞吐率 二进制码调制算法 多叉树 位跟踪技术 

分 类 号：TN92[电子电信—通信与信息系统]