一种双向混合查询树防碰撞算法
|
摘要
本算法在混合查询树算法的基础上,利用比较碰撞距离之和,正向用最高碰撞位和次高碰撞位的组合信息,对标签进行分组,并决定其推迟几个时隙进行响应;逆向利用基本二进制算法进行搜索。仿真结果表明,该算法优于基本QT算法和HQT算法,减少了查询次数和系统通信量,标签识别效率明显提高。
Based on the Hybrid Query tree algorithm,this new algorithm used the compared sum of the collision distances in forward direction,the combined information of the highest and the second highest bit of collision and categorized the tags and decided the gaps of delay to reduce collision.In reverse direction,the identification tree is constructed to identify the electronic labels as the leaf nodes.The simulated experiment showed that this proposed algorithm is superior to QT and HQT by decreasing the number of query and the frequency of system communication.Hence,the efficiency of tag identification is greatly enhanced.
Based on the Hybrid Query tree algorithm,this new algorithm used the compared sum of the collision distances in forward direction,the combined information of the highest and the second highest bit of collision and categorized the tags and decided the gaps of delay to reduce collision.In reverse direction,the identification tree is constructed to identify the electronic labels as the leaf nodes.The simulated experiment showed that this proposed algorithm is superior to QT and HQT by decreasing the number of query and the frequency of system communication.Hence,the efficiency of tag identification is greatly enhanced.
引文
[1]杨晓娇,闫斌,谢光斌.一种改进的二进制防碰撞算法[J].计算机应用与软件,2013,30(10):312-316.
[2]米志强.射频识别(RFID)技术与应用[M].北京:电子工业出版社,2011.
[3]王春华,许静,彭关超,等.改进的RFID标签识别防冲突算法[J].计算机工程与应用,2011,47(31):104-107.
[4]Choi J H,Lee D,Lee H.Bi-Slotted tree based anti-collision protocols for fast tag identification inRFID systems[C].IEEE Communications Letters,2006:861-863.AND Feng Bo,Li Jintao,Guo Junbo,etal.ID-Binary tree stack anti-collision algorithm for RFID[C].Proceedings of the 11th IEEE Symposium on Computers and Communications(2006ISCC’06),2006:207-212.
[5]李秉璋,景征骏,罗烨.基于后退式二进制的RFID防碰撞搜索算法[J].计算机应用与软件,2009,26(12):96-98.
[6]Myung J,Lee W.An adaptive memory less tag anti-collision protocol for RFID networks[C].IEEEICC,2005:32-26.
[7]Hsu C H,Chia-Hao Yu,Yi Pin Huang,etal.An enhanced query tree(EQT)protocol for memorylesstag anti-collision in RFID systems[J].Second International Conference on Future Generation Communication and Networking FGCN’08,2008:427-432.
[8]Ryu J,Lee Hojin,Seok Y,et al.A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID System[C]//Proceedings of the IEEE international conference on communications.Glasgow:IEEE,2007:5981-5986.
[2]米志强.射频识别(RFID)技术与应用[M].北京:电子工业出版社,2011.
[3]王春华,许静,彭关超,等.改进的RFID标签识别防冲突算法[J].计算机工程与应用,2011,47(31):104-107.
[4]Choi J H,Lee D,Lee H.Bi-Slotted tree based anti-collision protocols for fast tag identification inRFID systems[C].IEEE Communications Letters,2006:861-863.AND Feng Bo,Li Jintao,Guo Junbo,etal.ID-Binary tree stack anti-collision algorithm for RFID[C].Proceedings of the 11th IEEE Symposium on Computers and Communications(2006ISCC’06),2006:207-212.
[5]李秉璋,景征骏,罗烨.基于后退式二进制的RFID防碰撞搜索算法[J].计算机应用与软件,2009,26(12):96-98.
[6]Myung J,Lee W.An adaptive memory less tag anti-collision protocol for RFID networks[C].IEEEICC,2005:32-26.
[7]Hsu C H,Chia-Hao Yu,Yi Pin Huang,etal.An enhanced query tree(EQT)protocol for memorylesstag anti-collision in RFID systems[J].Second International Conference on Future Generation Communication and Networking FGCN’08,2008:427-432.
[8]Ryu J,Lee Hojin,Seok Y,et al.A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID System[C]//Proceedings of the IEEE international conference on communications.Glasgow:IEEE,2007:5981-5986.