摘要
射频识别(RFID)中阅读器识别大量标签时,常存在效率较低的情况。该算法根据碰撞时的特点,跳跃式前后搜寻,识别N个标签,共需要问询2N-1次。用数学归纳法进行了证明。另外,阅读器问询时,所传输的EPC参数采用不定长方式动态进行,信息吞吐量可进一步提高,算法模拟结果表明提高幅度为34.92%。
In RFID, when the amount of tags is large, scanning efficiency of the reader is often low. By analyzing the features of tag collision, this paper brings forward an algorithm using jumping method. Using this algorithm, it only needs 2N-1 queries to identify N tags, and this can be proved by mathematical induction. Furthermore, the EPC parameter is transmitted dynamically during inquiring, so the message handling capacity can be more improved. Algorithm simulation shows that an improvement of 34.92 percent can be achieved through this algorithm.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第9期19-20,26,共3页
Computer Engineering
基金
广州市重点科技攻关基金资助项目(2002Z3-D0151)
