由于二元树抗冲突方法消耗的识别时间随标签数量呈线性增长,提高巨量(>100)标签的抗冲突识别的效率对于推动RFID的应用显得尤为重要.提出一种分段搜索清点RFID标签的抗冲突方法,通过减少清点过程中标签时阅读器回传数据的位数,达到减少传输耗时的目的.将其与现有的动态二进制搜索法对比,仿真结果表明.当标签突破一定数量,对于特定的分段方式,该算法能够显著降低清点过程的时间消耗.%The time consumption of the current RFID binary tree anti-collision algorithm increases linearly with the number of tags in the reader electric-magnetic field.Since reducing the time cost in the anti-collision inventory query of large amount( ＞100) of RFID tag is particularly important to promote the RFID technology in real applications.This paper presented a new segmental search method to cut down the overall time through reducing the responding data bytes from tags to the reader in the RFID anti-collision inventory process.Simulation result of MATLAB shows that the new algorithm can reduce time consumption of inventory process significantly when the tag number is larger than specific number with fixed segmental method.
展开▼
