电子学报
電子學報
전자학보
ACTA ELECTRONICA SINICA
2015年
8期
1465-1470
,共6页
射频识别%防碰撞%冲突跟踪树%空闲时隙%比特转换方法
射頻識彆%防踫撞%遲突跟蹤樹%空閒時隙%比特轉換方法
사빈식별%방팽당%충돌근종수%공한시극%비특전환방법
RFID(radio frequency identification)%anti-collision%collision tracking tree%idle slot%bits change method
射频识别 RFID（Radio Frequency Identification）系统内的读卡器在识别大数量标签时常因信号的碰撞而导致系统识别效率降低。动态时隙冲突跟踪树算法 DSCTTA（Dynamic Slots Collision Tracking Tree Algorithm）采用动态时隙应答机制可减少前缀开销和迭代开销，但会产生大量空闲时隙。本文将 DSCTTA 和比特转换方式（BCM）相结合，得到改进型动态时隙冲突跟踪树标签防碰撞算法（IDSCTTA）以防止标签冲突，加快标签识别速度。理论分析及仿真结果表明， IDSCTTA 不仅具有 DSCTTA 的全部优点，而且能够有效地减小识别时延和提高时隙效率，并且标签数目越大，算法性能越优越。
射頻識彆 RFID（Radio Frequency Identification）繫統內的讀卡器在識彆大數量標籤時常因信號的踫撞而導緻繫統識彆效率降低。動態時隙遲突跟蹤樹算法 DSCTTA（Dynamic Slots Collision Tracking Tree Algorithm）採用動態時隙應答機製可減少前綴開銷和迭代開銷，但會產生大量空閒時隙。本文將 DSCTTA 和比特轉換方式（BCM）相結閤，得到改進型動態時隙遲突跟蹤樹標籤防踫撞算法（IDSCTTA）以防止標籤遲突，加快標籤識彆速度。理論分析及倣真結果錶明， IDSCTTA 不僅具有 DSCTTA 的全部優點，而且能夠有效地減小識彆時延和提高時隙效率，併且標籤數目越大，算法性能越優越。
사빈식별 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 anti-collision 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 perfor-mance is.
