高技术通讯2017，Vol.27Issue(6)：514-518,5.DOI:10.3772/j.issn.1002-0470.2017.06.004
判断二进制树中标签识别完毕的方法
A scheme of judging the end of tag identification in binary tree
摘要
Abstract
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)/标签识别完毕/二进制树/树的深度Key words
radio frequency identification ( RFID)/end of tag identification/binary tree/depth of the tree引用本文复制引用
崔英花..判断二进制树中标签识别完毕的方法[J].高技术通讯,2017,27(6):514-518,5.基金项目
国家自然科学基金(61340005), 北京市自然科学基金(4132012), 北京市教委科技发展计划(KM201411232011)和北京市优秀人才培养(2013D5007000006)资助项目. （61340005）
