• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Seminar on Engineering Education Cooperation Academic Research for Chinese-French Universities >A Binary-Tree Searching Anti-Collision Algorithm Based On Pruning Away Branches And Its Analyses
【24h】

A Binary-Tree Searching Anti-Collision Algorithm Based On Pruning Away Branches And Its Analyses

机译：基于修剪分支的二叉树搜索防碰撞算法及其分析

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The EPC of tags has uniqueness, different tags can be distinguished by its binary-tree structure. In the reader's processing area, there are a lot of idle nodes in the binary-tree that is composed of some tags. If the reader ignores them when searching, all tags can be identified with high efficiency. In this paper, its mathematic model of efficiency is analyzed from simplicity to complexity. First of all, the case of two tags with four bits EPC is explained, then the case of two tags with N bits EPC is generalized. Secondly, by converting complexity into simplicity, a general conclusion is obtained based on probability and induction. Its simulating result indicates that its rate of identification is 50%.
机译：标签的EPC具有唯一性，可以通过其二进制树结构来区分不同的标签。在读者的处理区域中，二进制树中有很多空闲节点由某些标签组成。如果读者在搜索时忽略它们，则可以以高效率识别所有标记。本文从简单到复杂性分析了其数学效率模型。首先，解释具有四位EPC的两个标签的情况，然后通过N比特EPC的两个标签的情况是概括的。其次，通过将复杂性转化为简单性，基于概率和诱导来获得一般的结论。其仿真结果表明其识别率为50％。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号