Research on Grouping N-ray Tracking Tree RFID Anti-Collision Algorithm

WANG Xin; JIA Qing-xuan; GAO Xin; CHEN Gang; ZHAO Bing

doi:10.3969/j.issn.0372-2112.2016.02.027

您当前的位置：

首页 >

文章列表页 >

Research on Grouping N-ray Tracking Tree RFID Anti-Collision Algorithm

更新时间：2025-07-16

- Research on Grouping N-ray Tracking Tree RFID Anti-Collision Algorithm
- Acta Electronica Sinica Vol. 44, Issue 2, Pages: 437-444(2016)
- 作者机构：
  
  1. 北京邮电大学自动化学院,北京,100876
  2. 中国电力科学研究院,北京,100192
  3. 北京邮电大学自动化学院,北京,100876
  4. 中国电力科学研究院,北京,100192
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2016.02.027
  CLC： TP393
- Published Online：25 February 2016，
  
  Published：2016
- 稿件说明：
移动端阅览
WANG Xin, JIA Qing-xuan, GAO Xin, et al. Research on Grouping N-ray Tracking Tree RFID Anti-Collision Algorithm[J]. Acta Electronica Sinica, 2016, 44(2): 437-444.
DOI：

WANG Xin, JIA Qing-xuan, GAO Xin, et al. Research on Grouping N-ray Tracking Tree RFID Anti-Collision Algorithm[J]. Acta Electronica Sinica, 2016, 44(2): 437-444. DOI： 10.3969/j.issn.0372-2112.2016.02.027.

摘要

针对无线射频识别(RFID

Radio Frequency Identification)标签多路访问产生的信号碰撞问题

提出了基于碰撞位跟踪的分组

叉跟踪树型RFID防碰撞算法(CBGN

Collision Bit Tracking Tree Algorthm Based on Grouping

-ray).利用极大似然位估算法(MLE

Maximum Likelihood Bit Estimation)估算应用环境下标签的数量.在MLE基础上根据标签标识(ID)将标签分配在不同分组内

并利用

叉树识别分组后的标签

CBGN算法通过分组及

叉识别两种策略相结合来降低碰撞概率及识别延时.最后

以通信复杂度为基准对不同

叉树下的最优分组系数进行了推导

从而获得最优

值及对应分组系数.理论分析和仿真实验表明

CBGN算法具有鲁棒性好和通信复杂度低的特点.

Abstract

One grouping N-ray tracking tree RFID(Radio Frequency Identification) anti-collision algorithm (CBGN

Collision Bit Tracking Tree Algorthm Based on Grouping

-ray) for signals collision caused by RFID(radio frequency identification) tags multiple access of shared channel is proposed.We estimated the number of tags by the maximum likelihood bit estimation method (MLE

Maximum Likelihood Bit Estimation).Based on MLE

we allocated the set of tags into different groups through the tag identification

identified grouped tags via

-ray tree

and reduced recognition time

by CBGN under combining grouping and

-ray identify.Finally

we derived the optimal grouping coefficient of different

-ray tree using the average identify tag cost time in communication link

further obtained the optimal

values and the corresponding optimalcoefficient of clusters.Our theoretical analysis and simulation results showed that CBGN algorithm had the characteristics of strong robustness and low communication complexity.

关键词

Keywords

references

Views

1490

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

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

Improved Dynamic Slots Collision Tracking Tree for RFID Anti-Collision Algorithm

An Efficient RFID Anti-Collision Algorithm for ISO 18000-6B Protocol

Idle Slots Elimination Based Anti-collision Algorithm for UHF RFID

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

Related Author

WEN Guang-jun

XIE Liang-bo

LUO Zhong-qiang

HAN Yu

SU Jian

CHEN Xiao-ruo

HUANG Yi-hua

WEN Guang-jun

Related Institution

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

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

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

Department of Electronic and Communication Engineering, Sun Yat-Sen University

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

⁰