首页> 中文期刊> 《计算机技术与发展》 >基于映射序列码的多叉树防碰撞算法

基于映射序列码的多叉树防碰撞算法

         

摘要

随着物联网技术的发展,射频识别(RFID)技术得到了广泛应用.标签碰撞问题严重影响RFID系统的识别效率,因此多标签防碰撞算法成为了研究RFID技术的关键.为此,提出了一种基于映射序列码的多叉树标签防碰撞算法,其主要思想是在多叉树的基础上,将阅读器识别范围内的标签识别码进行分组,根据唯一的映射关系确定存在的查询前缀,消除了多叉树的空闲时隙,减少了碰撞时隙;同时标签在响应阅读器时,只需要发送其与查询前缀相匹配后的剩余部分,减少了信息的传输量,降低了系统能耗.Matlab仿真结果表明,所提出的算法有效减少了标签识别的总时隙数,系统的识别效率可以达到71%左右,系统性能有了明显的提升,当标签识别码位数长,标签数量多时,算法性能的提升尤为显著.%With the development of Internet of Things,Radio Frequency Identification (RFID) has been widely used.Tag collision problems seriously affect the efficiency of RFID identification systems.As a result,multi-tag anti-collision algorithm becomes a key point in investigation of RFID technology.A multi-tree anti-collision algorithm based on mapping sequence code has been presented.With the main idea of multi-tree,tag identifiers within the range of reader have been grouped.According to the unique mapping relationship,existing query prefixes has been determined;idle slots of multi-tree have been eliminated and collision slots of multi-tree have been reduced.At the same time,tags only need to send the rest parts matching with the query prefix when responding to the reader.Thus,the amount of information transmission and energy consumption has been reduced.The results of Matlab simulation show that the proposed algorithm has effectively reduced the total slots of tag identification and significantly improved system performance,and that efficiency of identification reaches about 71%,which means this algorithm can achieve optimal performance especially since the length of tag identifier is long and the number of tags is large.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号