测试结果表明，读卡器碰撞问题得到了有效的控制，该防碰撞算法是有效、可行的。
The simulation result showed that readers'collision problem could be solved evidently, and the algorithm is effective and feasible.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
解决这个问题可以采用时分多路存取技术，其相关的算法有aloha法、时隙aloha法、二进制搜索法、动态二进制搜索法等防碰撞算法。
The technique of TDMA can solve this problem. In TDMA, there are several anti - collision algorithms, such as ALOHA, Slotted ALOHA, binary search, dynamic binary search and so on.
针对多标签的碰撞问题，本文重点介绍和讨论基于TDMA的两类主流的标签防碰撞算法：基于ALOHA的标签防碰撞算法和基于二进制树的标签防碰撞算法。
For this multi-label collisions problem, this paper focuses on describing two kinds of main label anti-collision algorithm based on TDMA, ALOHA algorithm and binary tree.
针对多标签的碰撞问题，本文重点介绍和讨论基于TDMA的两类主流的标签防碰撞算法：基于ALOHA的标签防碰撞算法和基于二进制树的标签防碰撞算法。
For this multi-label collisions problem, this paper focuses on describing two kinds of main label anti-collision algorithm based on TDMA, ALOHA algorithm and binary tree.
应用推荐