首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于碰撞树的自适应多叉树RFID防碰撞算法
引用本文:吕敬祥,刘清,过继红.基于碰撞树的自适应多叉树RFID防碰撞算法[J].井冈山大学学报(自然科学版),2014(2):39-44.
作者姓名:吕敬祥  刘清  过继红
作者单位:井冈山大学电子与信息工程学院,江西吉安343009
摘    要:提出了一种自适应多叉树防碰撞算法,该算法构建了无碰撞时隙的二叉查询树,通过计算碰撞因子估计标签数量,从而自适应的选择二叉树或四叉树。理论和仿真表明:该算法克服了现有算法数据传输量大的缺点,同时在二叉树分支内实现了无碰撞时隙以减少总时隙,对多标签情况下,通过自适应的选择四叉碰撞树来减少碰撞时隙。算法有效地减少了数据传输量,提高了时隙利用率和系统吞吐率,具有一定的创新性。

关 键 词:射频识别  冲突树  防碰撞  多叉树  自适应  堆栈

ADAPTIVE QUERY MULTI-TREE ANTI-COLLISION ALGORITHM BASED ON COLLISION-TREE
Lu Jing-xiang,LIU Qing,GUO Ji-hong.ADAPTIVE QUERY MULTI-TREE ANTI-COLLISION ALGORITHM BASED ON COLLISION-TREE[J].Journal of Jinggangshan University(Natural Sciences Edition),2014(2):39-44.
Authors:Lu Jing-xiang  LIU Qing  GUO Ji-hong
Institution:(School of Electronics and Information Engineering, Jinggangshan University, Ji'an, Jiangxi 343009, China)
Abstract:An adaptive query multi-tree anti-collision algorithm is proposed. The new algorithm computes the collision factor and estimates the number of the tags so that it can adaptively use the binary-tree or the quad-tree. The theory and simulation show that the new algorithm overcomes big data transmission by constructing collision-tree. It also can reduce total slots by reducing slot-free in the binary-tree and using adaptive binary-tree or the quad-tree in the case of many tags. The new algorithm has certain innovations.
Keywords:radio frequency identification  collision-tree  anti-collision  multi-tree  adaptive  stack
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号