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,bu...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.展开更多
在射频识别(Radio Frequency Identification,RFID)系统中碰撞是一个很常见的问题。如何有效地解决这一问题对于RFID系统来说是至关重要的。包括跳跃式动态树形反碰撞算法在内的二进制搜索反碰撞算法是一种重要的解决碰撞问题的算法,但...在射频识别(Radio Frequency Identification,RFID)系统中碰撞是一个很常见的问题。如何有效地解决这一问题对于RFID系统来说是至关重要的。包括跳跃式动态树形反碰撞算法在内的二进制搜索反碰撞算法是一种重要的解决碰撞问题的算法,但是这一算法有一个缺点就是标签的识别码的识别速率较低。为此提出一种改进型的反碰撞算法。和其他现存的算法相比,能够大大减少阅读器问询的次数,同时信息吞吐量可以进一步提高,算法模拟结果表明,当标签数目为100时,其吞吐量提高幅度为29.85%。展开更多
在射频识别技术(Radio frequency identification,RFID)系统中,标签碰撞的解决对于标签的快速识别极为重要.本文提出一种基于分组机制的跳跃式动态二进制防碰撞算法(Anti-collision algorithm based on grouping mechanism and jumping ...在射频识别技术(Radio frequency identification,RFID)系统中,标签碰撞的解决对于标签的快速识别极为重要.本文提出一种基于分组机制的跳跃式动态二进制防碰撞算法(Anti-collision algorithm based on grouping mechanism and jumping dynamic binary,GJDB),该算法通过在确定性算法中引入随机分组机制,很好地解决了基于二进制搜索算法中,由于标签数目不断增大所导致的识别效率降低的问题.理论分析和仿真结果表明,GJDB算法的性能优于其他常用的标签防碰撞算法,并且该算法对标签随机分组数目的选取具有较强的鲁棒性.展开更多
基金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.
文摘在射频识别(Radio Frequency Identification,RFID)系统中碰撞是一个很常见的问题。如何有效地解决这一问题对于RFID系统来说是至关重要的。包括跳跃式动态树形反碰撞算法在内的二进制搜索反碰撞算法是一种重要的解决碰撞问题的算法,但是这一算法有一个缺点就是标签的识别码的识别速率较低。为此提出一种改进型的反碰撞算法。和其他现存的算法相比,能够大大减少阅读器问询的次数,同时信息吞吐量可以进一步提高,算法模拟结果表明,当标签数目为100时,其吞吐量提高幅度为29.85%。
文摘在射频识别技术(Radio frequency identification,RFID)系统中,标签碰撞的解决对于标签的快速识别极为重要.本文提出一种基于分组机制的跳跃式动态二进制防碰撞算法(Anti-collision algorithm based on grouping mechanism and jumping dynamic binary,GJDB),该算法通过在确定性算法中引入随机分组机制,很好地解决了基于二进制搜索算法中,由于标签数目不断增大所导致的识别效率降低的问题.理论分析和仿真结果表明,GJDB算法的性能优于其他常用的标签防碰撞算法,并且该算法对标签随机分组数目的选取具有较强的鲁棒性.
