基于多处碰撞位探测的标签防碰撞算法研究
|
摘要
在无线射频识别(RFID)系统中,当阅读器向范围内的标签发送命令以后,标签向阅读器发送反馈信号,当有两个或者两个以上的标签作出了相同的反馈信息,就会产生标签碰撞。解决碰撞问题,提高标签识别效率对RFID的应用具有重要意义。针对目前一些已有算法存在查询次数过多且吞吐率不高的问题进行了研究,提出一种基于多处碰撞位探测(multiple collision bits detection,MCBD)的标签防碰撞算法。通过阅读器发送的探测命令获取标签发生碰撞位的比特值,再结合查询命令直接识别出标签。仿真实验结果显示,MCBD算法降低了识别标签所需的查询次数,提高了吞吐率。所提算法的创新在于可以对单独或者连续的碰撞位都一并处理,充分利用标签的ID信息,且相较于其他算法进一步提高了吞吐率,对RFID标签识别的研究具有一定意义。
The tag sends a feedback signal to the reader when the reader sends a command to the tags within the range in the RFID system. When there are two or more tags feedback the same information,it will produce the tag collision. It has great significance for the application of RFID to solve collision problems and improve the efficiency of tag identification. According to the fact that some existing algorithms had too many query times and low throughput rate,this paper proposed a multiple collision bits detection( MCBD) algorithm. Through the detection command sented by the reader,this algorithm could obtain the bit value of the collision bit,and then the tag was identified directly by query command. The simulation results show that the MCBD algorithm reduces the number of query times and improves the throughput rate. The innovation of this algorithm is that it can deal with single or continuous collision bits,make full use of the ID information of the tags and improve the throughput rate compared with other algorithms,which is meaningful to the recognition of RFID tags.
The tag sends a feedback signal to the reader when the reader sends a command to the tags within the range in the RFID system. When there are two or more tags feedback the same information,it will produce the tag collision. It has great significance for the application of RFID to solve collision problems and improve the efficiency of tag identification. According to the fact that some existing algorithms had too many query times and low throughput rate,this paper proposed a multiple collision bits detection( MCBD) algorithm. Through the detection command sented by the reader,this algorithm could obtain the bit value of the collision bit,and then the tag was identified directly by query command. The simulation results show that the MCBD algorithm reduces the number of query times and improves the throughput rate. The innovation of this algorithm is that it can deal with single or continuous collision bits,make full use of the ID information of the tags and improve the throughput rate compared with other algorithms,which is meaningful to the recognition of RFID tags.
引文
[1] Liu Leian,Lai Shengli. ALOHA-based anti-collision algorithms used in RFID system[C]//Proc of International Conference on Wireless Communications,Networking&Mobile Computing. Piscataway,NJ:IEEEPress,2006:1-4.
[2] Finkenzeller D K. RFID handbook:fundamentals and applications in contactless smart cards and identification[M]. Hoboken:Wiley,2003.
[3] Cha J R,Kim J H. Novel anti-collision algorithms for fast object identification in RFID system[C]//Proc of the 11th International Conference on Parallel and Distributed Systems. Piscataway,NJ:IEEE Press,2005:63-67.
[4] Choi J H,Lee D,Jeon H,et al. Enhanced binary search with timedivided responses for efficient RFID tag anti-collision[C]//Proc of IEEE International Conference on Communications. Piscataway,NJ:IEEE Press,2007:3853-3858.
[5]张学军,马军飞,鲁友.基于位编码单元的双时隙防碰撞算法[J].计算机技术与发展,2014,24(9):93-97,102.
[6] Shao Min,Jin Xiaofang,Jin Libiao. A slot detection anti-collision algorithm with Hamming weight re-selection in RFID[C]//Proc of the6th IEEE International Conference on Software Engineering and Service Science. Piscataway,NJ:IEEE Press,2015:779-782.
[7] Cheng Tao,Jin Li. Analysis and simulation of RFID anti-collision algorithms[C]//Proc of the 9th International Conference on Advanced Communication Technology. Piscataway,NJ:IEEE Press,2007:697-701.
[8]樊文静,张姗姗,田智慧.基于后退式二进制搜索的RFID防碰撞算法的研究[J].计算机应用与软件,2012,29(5):191-194.
[9] Law C,Lee K,Siu K Y. Efficient memoryless protocol for tag identification(extended abstract)[C]//Proc of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. New York:ACM Press,2000:75-84.
[10]Choi J H,Lee D W,Lee H J. Bi-slotted tree based anti-collision protocols for fast tag identification in RFID system[J]. IEEE Communications Letters,2006,10(12):861-863.
[11]Su Jian,Wen Guangjun,Hong Danfeng. A new RFID anti-collision algorithm based on the Q-ary search scheme[J]. Chinese Journal of Electronics,2015,24(4):679-683.
[12]刘子龙,纪金水,刘彩虹,等.基于连续碰撞位探测的防碰撞算法研究[J].电子学报,2013,41(11):2156-2160.
[13] Wang Yong,Tang Xiaohu,Zhang Lijuan. Prefix-maximized querytree anti-collision algorithm with robust estimation for RFID system[C]//Proc of the 3rd IEEE International Conference on Cloud Computing and Intelligence Systems. Piscataway,NJ:IEEE Press,2014:170-174.
[14]丁治国,雷迎科.基于优先级避让的防碰撞算法研究[J].计算机应用研究,2016,33(3):836-839.
[15]程桂花,陈付龙,齐学梅,等. RFID技术中碰撞位探测电路设计[J].中国科技论文,2016,11(8):869-874,890.
[2] Finkenzeller D K. RFID handbook:fundamentals and applications in contactless smart cards and identification[M]. Hoboken:Wiley,2003.
[3] Cha J R,Kim J H. Novel anti-collision algorithms for fast object identification in RFID system[C]//Proc of the 11th International Conference on Parallel and Distributed Systems. Piscataway,NJ:IEEE Press,2005:63-67.
[4] Choi J H,Lee D,Jeon H,et al. Enhanced binary search with timedivided responses for efficient RFID tag anti-collision[C]//Proc of IEEE International Conference on Communications. Piscataway,NJ:IEEE Press,2007:3853-3858.
[5]张学军,马军飞,鲁友.基于位编码单元的双时隙防碰撞算法[J].计算机技术与发展,2014,24(9):93-97,102.
[6] Shao Min,Jin Xiaofang,Jin Libiao. A slot detection anti-collision algorithm with Hamming weight re-selection in RFID[C]//Proc of the6th IEEE International Conference on Software Engineering and Service Science. Piscataway,NJ:IEEE Press,2015:779-782.
[7] Cheng Tao,Jin Li. Analysis and simulation of RFID anti-collision algorithms[C]//Proc of the 9th International Conference on Advanced Communication Technology. Piscataway,NJ:IEEE Press,2007:697-701.
[8]樊文静,张姗姗,田智慧.基于后退式二进制搜索的RFID防碰撞算法的研究[J].计算机应用与软件,2012,29(5):191-194.
[9] Law C,Lee K,Siu K Y. Efficient memoryless protocol for tag identification(extended abstract)[C]//Proc of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. New York:ACM Press,2000:75-84.
[10]Choi J H,Lee D W,Lee H J. Bi-slotted tree based anti-collision protocols for fast tag identification in RFID system[J]. IEEE Communications Letters,2006,10(12):861-863.
[11]Su Jian,Wen Guangjun,Hong Danfeng. A new RFID anti-collision algorithm based on the Q-ary search scheme[J]. Chinese Journal of Electronics,2015,24(4):679-683.
[12]刘子龙,纪金水,刘彩虹,等.基于连续碰撞位探测的防碰撞算法研究[J].电子学报,2013,41(11):2156-2160.
[13] Wang Yong,Tang Xiaohu,Zhang Lijuan. Prefix-maximized querytree anti-collision algorithm with robust estimation for RFID system[C]//Proc of the 3rd IEEE International Conference on Cloud Computing and Intelligence Systems. Piscataway,NJ:IEEE Press,2014:170-174.
[14]丁治国,雷迎科.基于优先级避让的防碰撞算法研究[J].计算机应用研究,2016,33(3):836-839.
[15]程桂花,陈付龙,齐学梅,等. RFID技术中碰撞位探测电路设计[J].中国科技论文,2016,11(8):869-874,890.