节点文献
一种基于二进制树的RFID防冲突算法研究
Anti-Collision Algorithm Based on Binary Tree in RFID
【摘要】 在射频识别系统中,如何快速有效地识别多个标签,即防冲突问题,是RFID技术必须解决的关键问题之一。文中通过对查询树算法及其性能的研究,给出了一种查询树算法的改进算法—冲突跟踪树型算法。举例对比分析表明,该算法在时间复杂度和通信复杂度两个方面都有良好的改善。
【Abstract】 It is one of the key problems in RFID that how to identify multi-tags quickly and efficiently,that is,the anti-collision problem. Based on study of Query Tree Algorithm and its performance,this paper proposes an improved Query Tree Algorithm—Collision Tracking Tree Algorithm. Finally,experimented example and analysis indicate that the proposed algorithm improves the performance both in time complexity and communication complexity.
【基金】 陕西省自然科学基金(2006F13)
- 【文献出处】 通信技术 ,Communications Technology , 编辑部邮箱 ,2009年07期
- 【分类号】TP391.44
- 【被引频次】15
- 【下载频次】267