优化结合二叉树和帧时隙ALOHA的防碰撞算法.pdfVIP

第22卷第9期 2014年9月 光学精密工程 Optics and Precision Engineering V01．22 No．9 Sept．2014 文章编号1004—924X(2014)09—2580—05 优化结△一日l叉树和帧时隙ALOHA的防碰撞算法 梁士利+，徐美玲，林 青，宫 姗，赵星博 (东北师范大学物理学院，吉林长春130024) 摘要：分析和比较了现有无线射频识别(RFID)中采用的防碰撞算法存在的问题，提出了一种优化结合二叉树(BT)和帧 时隙ALOHA的新的防碰撞算法。提出的算法在阅读器与标签开始通讯时采用帧时隙的ALOHA算法，当有时隙发生 碰撞时采用BT算法对其进一步识别。该算法根据曼彻斯特译码得到碰撞位，通过估算一帧中可能出现的碰撞情况，运 用数学推导并通过R软件编程计算给出数学期望值。仿真实验显示：提出的算法充分发挥了两种算法的优点，其搜索 次数、传输时延、吞吐率等重要指标都明显优于ALOHA算法，尤其是新的防碰撞算法的吞吐率比ALOHA算法提高了 近50％。另外，传输负担的减小还使数据传输的安全性有了更高的保障。 关 键 词：无线射频识别；防碰撞算法；二叉树；ALOHA算法；帧时隙 中图分类号：TP301．6；TN92 文献标识码：A doi：10．3788／OPE2580 Mixed frame anti—collision algorithm based on binary tree and frame time slot ALOHA LIANG Shi—li‘，XU Mei—ling，LIN Qing，GONG Shan，ZHAO Xing—bo (Department of Physics，Northeast Normal University，Changchun 130024，China) *Corresponding author，E-mail：lsl@nenu．edu．cn Abstract：The current anti—collision algorithms for Radio Frequency IDentification(RFID)was analyzed and compared，and an optimized mixed frame anti—collision algorithm based on the binary tree and frame time slotted ALOHA was presented to resolve the problems in traditional algorithms．In proposed algorithm，the frame time slot algorithm was used to identify collision time slot when a reader communicated with the labels．However，if the collision labels have happened in the one time slot，the binary tree algorithm was used to make a clear distinction．By using the Manchester decoder to get collision location。the states of collision was estimated in one time slot，then the mathematical expectation was obtained by using mathematical deduction and R software programming．The simulation shows that the proposed mixed algorithm gives full play to the advantages of the tWO algorithms，its throughput rate，searching time and transmission delay are all superior to that of the traditional algorithm，especially，the throughput rate is nearly higher 50％than that of the ALOHA algorithm．Moreover，the data transmission shows higher security by decreasing of the burden of ot