改进型动态时隙冲突跟踪树标签防碰撞算法  

Improved Dynamic Slots Collision Tracking Tree for RFID Anti-Collision Algorithm

作　　者：黄以华[1] 陈小若 

机构地区：[1]中山大学电子与通信工程系,广东广州510006

出　　处：《电子学报》2015年第8期1465-1470,共6页Acta Electronica Sinica

基　　金：广东顺德中山大学卡耐基梅隆大学国际联合研究院资助项目(No.20130203)

摘　　要：射频识别RFID(Radio Frequency Identification)系统内的读卡器在识别大数量标签时常因信号的碰撞而导致系统识别效率降低.动态时隙冲突跟踪树算法DSCTTA(Dynamic Slots Collision Tracking Tree Algorithm)采用动态时隙应答机制可减少前缀开销和迭代开销,但会产生大量空闲时隙.本文将DSCTTA和比特转换方式(BCM)相结合,得到改进型动态时隙冲突跟踪树标签防碰撞算法(IDSCTTA)以防止标签冲突,加快标签识别速度.理论分析及仿真结果表明,IDSCTTA不仅具有DSCTTA的全部优点,而且能够有效地减小识别时延和提高时隙效率,并且标签数目越大,算法性能越优越.The identification efficiency of a RFID system decreases when a reader attempts to identify a large number of tags, because a collision occurs. Dynamic slots collision tracking tree algorithm （DSCTTA） reduces the prefix and iteration overhead by using time-divided responding scheme,meanwhile a lot of idle time slots are generated.In this paper,an improved dynamic slots collision tracking tree anticollision algorithm （IDSCTTA） is proposed to prevent the tag collision by combining DSCTTA with bits change method （BCM）.IDSCTTA not only has all the advantages of DSCTTA,but also can suppress the generation of idle slots therefore improve the system throughput and reduce the identification delay. Simulation results show that, IDSCTTA can effectively reduce the identification delay and improve the slot efficiency.And the greater the number of tags is,the better the algorithm performance is.

关 键 词：射频识别 防碰撞 冲突跟踪树 空闲时隙 比特转换方法 

分 类 号：TN918.7[电子电信—通信与信息系统]