文件名称:Improved_binary_query_tree_anti_collision_algorith
介绍说明--下载内容均来自于网络,请自行研究使用
在射频识别系统中,存在阅读器与多个标签同时通信的碰撞问题,标签的防碰撞算法是解决数据冲突的关键。文章详细阐述了已有的典型的二进制查询树的防碰撞算法,并在此基础上提出了一种新的防碰撞算法;该算法利用二时隙的方法,使阅读器的询问次数和标签识别所需的数据流大大减少,提高了标签的识别效
率。从仿真实验中表明,该算法比已有的二进制查询树算法具有更明显的优势。-In the radio frequency identification system, there is reader to communicate with multiple tags at the same time the problem of collisions, the label' s anti-collision algorithm to resolve data conflicts. The article has elaborated a typical binary query tree anti-collision algorithm, and on this basis, proposed a new anti-collision algorithms The algorithm uses two slots of the ways in which readers asked about the number and tag identification greatly reduced the required data flow and improve the efficiency of tag identification. From the simulation experiments show that the algorithm than the existing binary query tree algorithm is more obvious advantages.
率。从仿真实验中表明,该算法比已有的二进制查询树算法具有更明显的优势。-In the radio frequency identification system, there is reader to communicate with multiple tags at the same time the problem of collisions, the label' s anti-collision algorithm to resolve data conflicts. The article has elaborated a typical binary query tree anti-collision algorithm, and on this basis, proposed a new anti-collision algorithms The algorithm uses two slots of the ways in which readers asked about the number and tag identification greatly reduced the required data flow and improve the efficiency of tag identification. From the simulation experiments show that the algorithm than the existing binary query tree algorithm is more obvious advantages.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
改进的二进制查询树的RFID标签防碰撞算法.pdf