计算机技术与发展2017，Vol.27Issue(5)：54-58,5.DOI:10.3969/j.issn.1673-629X.2017.05.012
基于映射序列码的多叉树防碰撞算法
Multi-tree Anti-collision Algorithm Based on Mapping Sequence Code
摘要
Abstract
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.关键词
射频识别/标签防碰撞/多叉树/映射关系Key words
RFID/tag anti-collision/multi-tree/mapping relationship分类
信息技术与安全科学引用本文复制引用
何申炎,杨恒新,张昀..基于映射序列码的多叉树防碰撞算法[J].计算机技术与发展,2017,27(5):54-58,5.基金项目
国家自然科学基金青年科学基金项目(61302155) （61302155）
