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

改进型自适应多叉树防碰撞算法研究
引用本文:张学军,蔡文琦,王锁萍.改进型自适应多叉树防碰撞算法研究[J].电子学报,2012,40(1):193-198.
作者姓名:张学军  蔡文琦  王锁萍
作者单位:南京邮电大学电子科学与工程学院,江苏南京,210003
基金项目:国家自然科学基金,江苏省高校自然科学基金,南京邮电大学引进人才项目
摘    要: 文章在自适应多叉树防碰撞算法的基础上,通过优化阅读器所发送前缀的方法,提出了一种改进型自适应多叉树(IAMS)防碰撞算法.该算法通过计算碰撞因子来动态地选择搜索树的叉数,并对四叉树的查询前缀进行优化,从而避免了大量的空闲时隙.文章通过数学分析,准确地描述了IAMS算法识别标签所需的时隙数.仿真结果表明,改进型自适应多叉树防碰撞算法具有更快的识别速度和更高的系统吞吐率.

关 键 词:射频识别  防碰撞算法  多叉树  自适应
收稿时间:2011-04-22

One Anti-Collision Algorithm Based on Improved Adaptive Multi-Tree Search
ZHANG Xue-jun,CAI Wen-qi,WANG Suo-ping.One Anti-Collision Algorithm Based on Improved Adaptive Multi-Tree Search[J].Acta Electronica Sinica,2012,40(1):193-198.
Authors:ZHANG Xue-jun  CAI Wen-qi  WANG Suo-ping
Affiliation:(College of Electronic Science and Engineering,Nanjing University of Posts and Telecommunications,Nanjing,Jiangsu 210003,China)
Abstract:Based on the adaptive multi-tree search anti-collision algorithm,we proposed an improved adaptive multi-tree search anti-collision algorithm(IAMS) by optimizing the prefix sent by readers.Our algorithm reduces idle time slots by choosing the number of search tree branches adaptively according to the collision factor and optimizing the query prefix of quadtree.By mathematical analysis,we accurately predict the total number of time slots required for the tag identification in IAMS algorithm.Simulation results show that the IAMS algorithm has faster identification speed and higher system throughput.
Keywords:RFID(Radio Frequency Identification)  anti-collision algorithms  multi-tree  adaptive
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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