Search - Binary Tree

Search - Binary Tree - List

[RFID] hit DL : 0: 二进制树防碰撞算法,使用二叉树算法避免RFID相互干扰-Binary tree anti-collision algorithm, binary tree algorithm to avoid the use of RFID interference
Date : 2025-12-19 Size : 258kb User : 郭娟
[RFID] RFID_aiti_collion DL : 0: 提出了一个在 RFID系统中改进的防冲突算法 ,该算法基于 Aloha算法并结合了二叉树算法。当有大量标签同时需要识别时 ,首先通过对标签上一轮的碰撞情况来估计待识别的标签数 ,然后对标签进行分类或改变帧的大小来降低标签发生碰撞的概率 ,从而提高识别的效率。-A in the RFID system to improve the anti-collision algorithm based on the Aloha algorithm and a combination of binary tree algorithm. When there is need to identify a large number of tags at the same time, the first round of the label collision situation to be identified to estimate the number of labels, and then on the labels to classify or change the size of the frame to reduce the probability of collisions labels, thereby enhancing the efficiency of recognition .
Date : 2025-12-19 Size : 340kb User : wang
[RFID] RFID DL : 0: 一种改进的RFID二进制搜索防碰撞算法，基于二进制树的防碰撞算法研究-An improved anti-collision RFID binary search algorithm, binary tree-based anti-collision algorithm
Date : 2025-12-19 Size : 164kb User : 李伟
[RFID] Improved_binary_query_tree_anti_collision_algorith DL : 0: 在射频识别系统中，存在阅读器与多个标签同时通信的碰撞问题，标签的防碰撞算法是解决数据冲突的关键。文章详细阐述了已有的典型的二进制查询树的防碰撞算法，并在此基础上提出了一种新的防碰撞算法；该算法利用二时隙的方法，使阅读器的询问次数和标签识别所需的数据流大大减少，提高了标签的识别效率。从仿真实验中表明，该算法比已有的二进制查询树算法具有更明显的优势。-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.
Date : 2025-12-19 Size : 548kb User : 吴晓彦
[RFID] RFID DL : 0: RF ID射频识别技术由于其技术简单,应用方便,当前在仓储,物流,图书管理,药品管理等各方面都广泛应用。但实际应用中,很多情况是在射频场中存在一个阅读器和多个电子标签。当阅读器同时清点多个电子标签时,就会出现信道争用。现有的解决方案是ALOHA和Binary Tree方法,以及在这两种方法基础上改进的方法。但现有的方法清点效率较低,因此在现有的碰撞方法基础上,提出一种结合ALOHA和Binary Tree方法的新的防碰撞方案,旨在进一步提高RFID应用的多标签清点效率-RF ID RFID technology because of its simple, convenient application, currently in storage, logistics, library management, drug management and other areas are widely used. But the practice, in many cases there is a field in the RF reader and a number of electronic tags. When reading multiple RFID tags simultaneously counting occurs when the channel contention. Existing solutions are ALOHA and the Binary Tree method, and the two methods based on the improvement of the method. However, the existing method of counting the low efficiency of the existing methods based on the collision, we propose a new method of ALOHA and Binary Tree s new anti-collision scheme, designed to further enhance the application of multi-tag RFID inventory efficiency
Date : 2025-12-19 Size : 259kb User : 蔡新林