Prefix Subsection Matching Binary Algorithm in Passive RFID System  

作　　者：王新锋 俞静一 张绍军 周颖 

机构地区：[1]Unit No.63880

出　　处：《Defence Technology（防务技术）》2011年第2期82-86,共5页Defence Technology

基　　金：Sponsored by the National Natural Science Foundation of China(60372042)

摘　　要：Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.Identifying speed, tag average response times and reliability are the most important capabilities in passive RFID （radio frequency identification） system. QT （query tree） is a famous algorithm for lowest-cost RFID tags, but its shortcoming is high searching delay and high tag average response times. A prefix subsection matching binary （PSMB） algo- rithm based on QT algorithm is proposed. The key idea of PSMB anti-collision algorithm is that, during searching phase, a given reader uses the particular tags ID, which has been searched out formerly, to shorten searching delay and depress tag average response times. The idea of PSMB algorithm can be described as follows. Usually, tag ID is composed of several subsections which have different meanings. Based on the tags ID searched out formerly, a given reader builds a prefix data- base. In subsequent searching phase, the reader uses its prefix database to deduce searching space of tag ID. Simulation results show that identification delay of PSMB algorithm is about 1/3 of QT algorithm, tag average response times is about 1/4 of QT algorithm, and system throughput rate is treble QT algorithm.

关 键 词：information processing radio frequency identification ANTI-COLLISION binary tree prefix matching 

分 类 号：TP391.44[自动化与计算机技术—计算机应用技术]