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

Multi-tree Anti-collision Algorithm Based on Mapping Sequence Code

作　　者：何申炎 杨恒新[1] 张昀[1] 

机构地区：[1]南京邮电大学电子科学与工程学院,江苏南京210003

出　　处：《计算机技术与发展》2017年第5期54-58,共5页Computer Technology and Development

基　　金：国家自然科学基金青年科学基金项目(61302155)

摘　　要：随着物联网技术的发展,射频识别(RFID)技术得到了广泛应用。标签碰撞问题严重影响RFID系统的识别效率,因此多标签防碰撞算法成为了研究RFID技术的关键。为此,提出了一种基于映射序列码的多叉树标签防碰撞算法,其主要思想是在多叉树的基础上,将阅读器识别范围内的标签识别码进行分组,根据唯一的映射关系确定存在的查询前缀,消除了多叉树的空闲时隙,减少了碰撞时隙;同时标签在响应阅读器时,只需要发送其与查询前缀相匹配后的剩余部分,减少了信息的传输量,降低了系统能耗。Matlab仿真结果表明,所提出的算法有效减少了标签识别的总时隙数,系统的识别效率可以达到71%左右,系统性能有了明显的提升,当标签识别码位数长,标签数量多时,算法性能的提升尤为显著。With the development of Interact of Things, Radio Frequency Identification （RFID） has been widely used. Tag collision prob- lems 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, exist- ing 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.

关 键 词：射频识别 标签防碰撞 多叉树 映射关系 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]