作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (24): 287-289. doi: 10.3969/j.issn.1000-3428.2011.24.096

• 开发研究与设计技术 • 上一篇    下一篇

基于自适应分裂树的RFID防碰撞算法

文 超,欧若风,凌 力   

  1. (复旦大学通信科学与工程系,上海 200433)
  • 收稿日期:2011-07-04 出版日期:2011-12-20 发布日期:2011-12-20
  • 作者简介:文 超(1988-),男,硕士研究生,主研方向:数据通信,RFID技术;欧若风,硕士研究生;凌 力,副教授

RFID Anti-collision Algorithm Based on Adaptive Splitting Tree

WEN Chao, OU Ruo-feng, LING Li   

  1. (Department of Communication Science and Engineering, Fudan University, Shanghai 200433, China)
  • Received:2011-07-04 Online:2011-12-20 Published:2011-12-20

摘要: 提出一种基于自适应分裂树的RFID防碰撞算法,通过估计碰撞集大小自适应地调整分裂规模,将碰撞标签均匀地划分到不同子集,实现快速分裂。仿真实验结果表明,该算法可以减少碰撞时隙和空闲时隙数目,系统效率较高,通信处理开销较小,适用于大规模标签的应用场合。

关键词: 无线射频识别, 防碰撞算法, 自适应分裂树, 大规模标签

Abstract: This paper proposes a Radio Frequency Identification(RFID) anti-collision algorithm based on Adaptive Splitting Tree(AST). The algorithm estimates the size of the collision set and adaptively adjusts the splitting scale. RFID Tags can be evenly and fast divided into different subsets. Simulation results show that the algorithm can effectively reduce the amount of collision slots and idle slots. It shows good system efficiency even in situation with high tags population.

Key words: Radio Frequency Identification(RFID), anti-collision algorithm, Adaptive Splitting Tree(AST), high tags population

中图分类号: