奇偶区域搜索反碰撞算法及其仿真分析  

Anti-collision algorithm based on odd-even zone search and its simulation analysis

作　　者：刘亮[1] 邢焕革[1] 郭金卫[1] 

机构地区：[1]海军工程大学管理工程系,湖北武汉430033

出　　处：《计算机工程与设计》2010年第12期2740-2743,共4页Computer Engineering and Design

摘　　要：为了更好地解决射频识别技术中标签碰撞问题,按照电子标签比特位之和的奇偶性将问询区域划分成奇偶两个虚拟区域,以提高阅读器一次识别两个标签的概率,缩小了搜索范围,再对每个区域分别用二进制树搜索算法,提高了搜索效率。对奇偶区域搜索算法的时间复杂度进行了讨论,在改变标签长度和标签数量的两种情况下对该算法的效率进行了仿真分析,分析结果表明,在标签长度较短和标签数量较多的时候,该算法的搜索效率有明显提高。To solve the problem of tags collision in RFID,the interrogation zone is divided into two virtual zones according to the parity of the bit sum of each tag,which helps reader identify two tags at one interrogation period by reducing searching range,and binary tree search algorithm is used in both zones to improve searching efficiency.Its time complexity is discussed and the efficiency of the algorithm is simulated in the cases of changing length and numbers of the tags,while the result shows that the efficiency grows significantly when the tags are short or the number is large.

关 键 词：奇偶区域搜索 奇偶性 标签碰撞 反碰撞 二进制树搜索 射频识别 

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