重庆邮电大学学报（自然科学版）2017，Vol.29Issue(3)：416-420,5.DOI:10.3979/j.issn.1673-825X.2017.03.021
基于锁位的奇偶分区二进制树算法
A bit-locking binary tree algorithm based on odd-even zone
摘要
Abstract
RFID technology is the core of the Internet of Things,Anti-collision technique is a key technique and research focus in the RFID system.In view of the inefficient of the binary tree algorithm with long delay and too much inquiry.This article is based on collision technology of radio frequency identification (RFID) technology.On the basis of many binary tree search algorithm existed,We present a new algorithm,which combine odd-even zone with bit-locking back off anti-collision algorithm.The inquiring area is divided into two zone,The dividing odd-even zone can improve the efficiency of search,while the bit-locking back off anti-collision algorithm can reduce transmission delay.Both theory and simulation results show the effectiveness and superiority of the algorithm.关键词
无线射频识别/奇偶区域/锁位/防碰撞/二进制树Key words
radio frequency identification/odd-even zone/bit-locking/anti-collision/binary tree分类
信息技术与安全科学引用本文复制引用
汤宏斌,周尚波..基于锁位的奇偶分区二进制树算法[J].重庆邮电大学学报（自然科学版）,2017,29(3):416-420,5.基金项目
重庆市基础与前沿研究计划项目(cstc2014jcyjA40037)The Chongqin Foundation and Advanced Research Project (cstc2014jcyjA40037) （cstc2014jcyjA40037）
