时间优先级分组的二进制防冲突协议  

Binary search anti-collision protocol time-based grouping

作　　者：陈克力[1] 彭宏[1] 钟世芬[1] 

机构地区：[1]西华大学数学与计算机学院,四川成都610039

出　　处：《电子技术应用》2011年第2期95-98,共4页Application of Electronic Technique

基　　金：西华大学重点实验室基金(XDZ0818-09)

摘　　要：RFID阅读器与标签之间的通信面临信道共享和访问冲突问题,防冲突协议是阅读器快速、正确获取标签数据的关键。分析了当前二进制搜索防冲突协议的特点,针对移动应用中有严格识别时限要求的场景,提出了基于时间分组的二进制搜索协议,该协议在标签里设置时间优先级,记录标签进入阅读器读写范围的时间长短,并以此时间优先级将阅读器范围内的多个标签进行分组,每次识别时间优先级最大(对识别时间要求最为紧迫)的标签组。理论分析和仿真表明,该协议可以有效提高识别通过率和降低漏读率。In the RFID system, tag-to-reader communication collision occurs when more than one tag responds to a reader at the same time. A protocol is key for reader to obtain quickly and con-ectly the data of tag. Analysis of the current binary search anti-collision protocol characteristics is showed, and a binary search protocol time-based grouping is proposed , which set the time priority in the tag, recording the length of entering into the reader＇s range to read and write and grouping multiple tags by the counter, and identifying the group of maximum time priority （to identify the most urgent tags）. Theoretical analysis and simulation shows that the proposed protocol can effectively improve the recognition rate and reduce the leakage.

关 键 词：RFID 时间优先级 二进制 防冲突 协议 

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