判断二进制树中标签识别完毕的方法  

A scheme of judging the end of tag identification in binary tree

作　　者：崔英花[1] Cui Yinghua(School of Information and Communication Engineering, Beijing Information Science ＆ Technology University, Beijing 100101)

机构地区：[1]北京信息科技大学信息与通信工程学院,北京100101

出　　处：《高技术通讯》2017年第6期514-518,共5页Chinese High Technology Letters

基　　金：国家自然科学基金(61340005);北京市自然科学基金(4132012);北京市教委科技发展计划(KM201411232011);北京市优秀人才培养(2013D5007000006)资助项目

摘　　要：分析了射频识别(RFID)系统阅读器与标签通信的二进制树算法,指出在标签识别过程中,阅读器并不知道是否识别完标签,阅读器会以连续多次没有接收标签响应为依据结束对标签的查询,这样往往会造成标签漏读或浪费时间在已识别完的标签上。基于此分析,提出了判断二进制树中标签识别完毕的方法。该方法通过在阅读器中设置计数器,就可以很好地跟踪标签的识别情况,准确地判断出标签是否识别完毕。分析结果表明,该方法可以准确地判断标签是否识别完毕,增加系统识别效率和可靠性。The binary tree algorithm for the communication between tags and a radio frequency identification （RFID） system＇s reader was analyzed, and it was pointed that in the RFID tag recognition process, the reader does not know whether all the tags are identified, and the reader will end up querying if it does not receive the tag response many times, thus often resulting in tag read off or wasted time on the tags identified. Based on the analysis, a scheme for judging the end of tag identification in the binary tree was proposed. The scheme can well track the identification of the tags by setting a counter in the reader, and accurately judge if all the tags are identified. The analysis results show that this method can accurately judge whether all the tags are identified or not, with the higher identification efficiency and reliability.

关 键 词：射频识别(RFID) 标签识别完毕 二进制树 树的深度 

分 类 号：TP391.44[自动化与计算机技术—计算机应用技术]