RFID系统中基于按段排序的防碰撞算法  

Anti-collision Algorithm in RFID System based on Segment Sorting Algorithm

作　　者：陈义[1] 李鸿[2] 

机构地区：[1]湖南工业职业技术学院电子信息工程教研室,湖南长沙410208 [2]长沙理工大学电气与信息工程学院,湖南长沙410114

出　　处：《淮阴师范学院学报（自然科学版）》2016年第1期33-37,63,共6页Journal of Huaiyin Teachers College;Natural Science Edition

基　　金：国家自然科学基金资助项目(61074018);长沙市科技计划项目(K1203020-11)

摘　　要：针对无线射频识别系统中的标签碰撞问题,在商余排序算法的基础上,提出了一种按段排序的防碰撞算法.该算法通过提取碰撞位构建新的ID,并从ID号最高位开始每4个比特位划为一段,根据标签段序列对争用周期时隙数商余运算的结果,确定标签在段序列对应的争用帧内的发送时隙及发送位,从而确定标签的发送顺序.实验结果表明,相比商余排序算法,该算法性能更稳定,识别耗时更少,识别效率提高46%.To solve the tag collision problem in Radio Frequency Identification（ RFID） system,a kind of segment sorting anti-collision algorithm based on quotient and remainder sorting algorithm is proposed. The algorithm is obtained by extracting the collision information to construct new ID and every four bits is divided into a segment starting from the highest bit of ID,through quotient and remainder operating result of tags＇ segment sequence to the timeslot number of competitive frame,sent slots and sent bits of tags are determined in the corresponding competitive frame of segments,such that sent sequences of tags in segments are determined.The results show that,compared with quotient and remainder sorting algorithm,the proposed algorithm is more stable and the consuming time of identification is less,the identification efficiency is enhanced by 46%.

关 键 词：无线射频识别 按段排序 提取碰撞位 商余运算 发送时隙 

分 类 号：TP391.44[自动化与计算机技术—计算机应用技术]