首页> 外文会议>IEEE International Conference on Safety Produce Informatization >An Improve Group Anti-collision Algorithm based on Query Tree for RFID
【24h】

An Improve Group Anti-collision Algorithm based on Query Tree for RFID

机译:基于RFID查询树的改进组防碰撞算法

获取原文
获取外文期刊封面目录资料

摘要

Tag collision avoidance is critical to the success of data communications in radio frequency identification (RID) system. Many classic algorithms are similar to QT, CTT, etc., and cannot meet the needs of higher and higher parameters. So based on QT and CTT, we propose an improve group anticollision algorithm(IGQT) to improve the performance of RFID system. First, we compare the algorithmic processes in QT and CTT, and compare and analyze the pros and cons of the two algorithms. Then, we reduce the number of slots and reduces the number of queries based on the QT and CTT algorithm, final, compare the system throughput and number of slots of QT, CTT, and IGQT algorithms. Experiment shows, the IGQT algorithm outperforms the existing proposed algorithms and greatly improves the recognition rate of the entire system.
机译:标签碰撞避免对于射频识别(RID)系统中的数据通信成功至关重要。许多经典算法类似于QT,CTT等,并且不能满足更高和更高参数的需求。因此,基于Qt和CTT,我们提出了一种改进的群体抗癌算法(IGQT)来提高RFID系统的性能。首先,我们将Qt和CTT中的算法过程进行比较,并比较和分析两个算法的优点。然后,我们减少了基于QT和CTT算法的Qties的数量,最终,比较系统吞吐量和QT,CTT和IGQT算法的时隙数。实验表明,IGQT算法优于现有的算法,大大提高了整个系统的识别率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号