RFID系统时隙不完全竞争防碰撞算法  

Slot Partial Competitive Anti-collision Algorithm for RFID System

作　　者：杨坤[1] 冷甦鹏[1] 

机构地区：[1]电子科技大学通信与信息工程学院,成都611731

出　　处：《计算机工程》2011年第1期260-262,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60802024);国家"863"计划基金资助重点项目(2009AA011801);国家科技重大专项基金资助项目(2008ZX03006-001);教育部博士点基金资助项目(200806141014);通信抗干扰国家级重点实验室基金资助项目(9140C0203010904)

摘　　要：基于ISO/IEC 18000-6C超高频射频识别标准,提出一种时隙不完全竞争防碰撞算法。将动态二叉树搜索技术引入竞争性冲突避免机制,并加入对空闲时隙和碰撞时隙的特殊处理策略。通过NS-2平台建立仿真模型,分析对比动态二叉树搜索算法、ISO/IEC 18000-6C标准算法和SPC算法的性能。仿真结果表明,SPC算法识别时间分别比动态二叉树搜索算法和18000-6C标准算法缩短约30%和20%,识别率比18000-6C算法提高约35%。Based on the ISO/IEC 18000-6C UHF Radio Frequency Identification（RFID） standard, this paper proposes a Slot-based Partial Competitive（SPC） anti-collision algorithm, which introduces dynamic binary tree search technology into the competitive collision avoidance mechanism for the first time. Moreover, the SPC algorithm applies the specific technologies to idle slots and collision slots. The performances of the dynamic binary tree search, ISO/IEC ,18000-6C and the SPC algorithm are compared via NS-2 simulation experiments. Simulation results indicate that the SPC algorithm is able to not only reduce the recognition time by 30% and 20% compared with the binary tree search algorithm and the 18000-6C algorithm, respectively, but also improve the recognition rate by 35% compared with 18000-6C algorithm.

关 键 词：时隙ALOHA 二叉树搜索 射频识别 不完全竞争 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]