%0 Journal Article
%T An Adaptive Anti-collision Algorithm Based on Binary-Tree Disassembly<br>基于二叉树分解的自适应防碰撞算法
%A Ding Zhi-guo
%A Guo Li
%A Zhu Xue-yong
%A Wang Zhao-hua
%A <br>丁治国
%A 郭立
%A 朱学永
%A 汪赵华
%J 电子与信息学报
%D 2009
%I 
%X A new adaptive anti-collision algorithm based on binary-tree disassembly is proposed in this paper. In order to enhance the search efficiency, a big and complex binary-tree is disassembled to several small and simple binary-trees by estimating the distributing of tags. The introduction of the collision stack, as well as adjusting the search paths adaptively based on the state of slots, the performance of the new algorithm is improved further, including reducing the search timeslots and improving the throughput of timeslots. Theory and computer simulations show that the new anti-collision algorithm is practical, especially when the number of tags is large.
%K 射频识别
%K 防碰撞算法
%K 二叉树分解
%K 碰撞堆栈
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=D83F68E20DF085058A02CF1AD6B46C9A&yid=DE12191FBD62783C&vid=4AD960B5AD2D111A&iid=B31275AF3241DB2D&sid=98973A2DBA64FAC9&eid=969830E7B1842E81&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=1&reference_num=11