高技术通讯2017，Vol.27Issue(5)：398-403,6.DOI:10.3772/j.issn.1002-0470.2017.05.002
基于二进制树的RFID系统自适应多分支防碰撞算法
An adaptive multiple branche (AMB) anti-collision algorithm based on binary tree in RFID
摘要
Abstract
To improve the identification efficiency of radio frequency identification (RFID) systems, the anti-collision problem of the systems was studied.Considering that dividing tags into multiple branches can efficiently improve the tags identification efficiency in RFID systems, while the conventional anti-collision algorithms based on multiple branch usually choose the optimal branches based on the tag number estimation, and the estimation delay and error can affect the identification efficiency, an adaptive multiple branche (AMB) algorithm for anti-collision based on binary tree was proposed.The alglorithm uses the number of the identified tags to estimate the tags in the right node of a binary tree in the same level according to the characters of binary tree and chooses the optimal branches, then executes this repeatedly, the system identification efficiency can be improved by avoiding the estimation error caused by only once tag number estimation.The simulation result shows that the AMB algorithm can improve the system identification efficiency, which reaches 43% when in large tag number quantity.Meanwhile, the algorithm is compatible with the existing protocols by only adding several counters in the reader and without changing any air interface protocol.关键词
射频识别(RFID)/防碰撞算法/二进制树/多分支算法/标签估计Key words
radio frequency identification (RFID)/anti-collision algorithm/binary tree/multiple tree algorithm/tag estimation引用本文复制引用
崔英花..基于二进制树的RFID系统自适应多分支防碰撞算法[J].高技术通讯,2017,27(5):398-403,6.基金项目
国家自然科学基金(61340005),北京市自然科学基金(4132012),北京市教委科技发展计划(KM201411232011)和北京市优秀人才培养(5211524100)资助项目. （61340005）
