Performance Analysis and Research of Anti-collision Algorithms Based on Query Tree

LI Chuan; SU Jian; LIU Ke-xiong; HAN Yu; ZHAO Hong-jun

doi:10.3969/j.issn.0372-2112.2018.11.014

您当前的位置：

首页 >

文章列表页 >

Performance Analysis and Research of Anti-collision Algorithms Based on Query Tree

更新时间：2025-07-16

- Performance Analysis and Research of Anti-collision Algorithms Based on Query Tree
- Acta Electronica Sinica Vol. 46, Issue 11, Pages: 2671-2678(2018)
- 作者机构：
  
  1. 绵阳职业技术学院信息工程系,四川,绵阳,621000
  2. 南京信息工程大学计算机与软件学院,江苏,南京,210044
  3. 北京林业大学工学院,北京,100083
  4. 电子科技大学通信与信息工程学院,四川,成都,611731
  5. 西南科技大学信息工程学院,四川,绵阳,621010
  6. 绵阳职业技术学院信息工程系,四川,绵阳,621000
  7. 南京信息工程大学计算机与软件学院,江苏,南京,210044
  8. 北京林业大学工学院,北京,100083
  9. 电子科技大学通信与信息工程学院,四川,成都,611731
  10. 西南科技大学信息工程学院,四川,绵阳,621010
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2018.11.014
  CLC： TP391.4
- Published Online：25 November 2018，
  
  Published：2018
- 稿件说明：
移动端阅览
LI Chuan, SU Jian, LIU Ke-xiong, et al. Performance Analysis and Research of Anti-collision Algorithms Based on Query Tree[J]. Acta Electronica Sinica, 2018, 46(11): 2671-2678.
DOI：

LI Chuan, SU Jian, LIU Ke-xiong, et al. Performance Analysis and Research of Anti-collision Algorithms Based on Query Tree[J]. Acta Electronica Sinica, 2018, 46(11): 2671-2678. DOI： 10.3969/j.issn.0372-2112.2018.11.014.

摘要

多标签碰撞问题严重影响射频识别系统的性能.基于查询树的防碰撞算法作为一种确定性算法被广泛的应用于各类射频识别场景中.本文分析了主流查询树防碰撞算法的性能与不足，并基于查询树方法提出了一种时间有效的防碰撞算法.该算法基于传统查询树识别模型，实施了一种双查询前缀匹配方法，可以消除传统查询树方法中的空闲时隙.此外，提出的算法可以充分利用碰撞时隙来提高识别效率.理论分析和仿真结果表明该算法优于现有的查询树防碰撞算法.

Abstract

Multiple tags collision problem severely impairs identification performance of RFID systems. Anti-collision algorithms based on query tree have been widely applied in various RFID scenarios. In this paper

we analyze the performance and deficiency of mainstream query tree based algorithms. And then

a time efficient anti-collision algorithm based on query tree is proposed to enhance the identification efficiency. Specifically

the dual prefixes matching method is implemented based on the conventional query tree identification model

which can significantly remove idle slots. Moreover

the proposed method can also make extensive use of collision slots to improve the identification efficiency. Both theoretical and simulation results indicate that the proposed algorithm outperforms the existing query tree based algorithms.

关键词

Keywords

references

Views

210

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Feasible Time-Optimal Anti-Collision Algorithm for UHF RFID Systems

Idle Slots Elimination Based Anti-collision Algorithm for UHF RFID

Research of an Adaptive Searching Anti-collision Algorithm for RFID Based on Information-Bit Encoding

A Time-Efficient and Easy-to-Implement RFID Technology for Multiple Tags

Research on the Attack Model for RFID Anti-Counterfeit Protocol

Related Author

WEN Guang-jun

XIE Liang-bo

SU Jian

LUO Zhong-qiang

HAN Yu

SU Jian

XIE Liang-bo

YANG Ying

Related Institution

电子科技大学通信抗干扰技术国家级重点实验室四川成都 6111731

电子科技大学通信抗干扰技术国家级重点实验室, 四川成都 6111731

电子科技大学通信与信息工程学院

School of Management Science, Chengdu University of Technology

School of Communications and Information Engineering, University of Electronic Science and Technology of China Chengdu

⁰