Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in thr...Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in throughput are very limited.In order to solve these problems,this paper presents a novel tag anti-collision scheme,namely adaptive hybrid search tree(AHST),by combining two algorithms of the adaptive binary-tree disassembly(ABD) and the combination query tree(CQT),in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search timeslots.From the theoretical analysis and numerical simulations,the proposed algorithm can colligate the advantages of above algorithms,improve the system throughput and reduce the searching timeslots dramatically.展开更多
A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree...A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.展开更多
Tag collision algorithm is a key issue for energy saving and throughput with Radio Frequency IDentification (RFID) system more popular in sensing infrastructure of covering wider area on a large scale. Exploiting low ...Tag collision algorithm is a key issue for energy saving and throughput with Radio Frequency IDentification (RFID) system more popular in sensing infrastructure of covering wider area on a large scale. Exploiting low energy consumption strategy would enable longer operational life of tags and reader with battery energy supply. And improving throughput is required on a large scale to preserve the capability of the correct reception. Therefore, this paper proposes an enhanced anti-collision algorithm called Dynamic Slotted with Muting (DSM), which uses multiple slots within a frame per node in a binary tree and takes tag estimation function to optimize the number of slots, and adds a mute command to put identified tags silence. The performance of the proposed algorithm is analytically provided, and simulation results show that DSM saves more than 40% energy consumptions both at reader and tags, and improves more than 35% throughput compared to the existing algorithms. Thus our algorithm is demonstrated to perform efficient energy savings at reader and tags with throughput improvement.展开更多
针对射频识别(Radio Frequency Identification,RFID)动态帧时隙防碰撞算法中,初始帧长选择比较敏感的问题,以及RFID动态帧时隙提前停止算法的问题进行了研究,提出了一种基于贝叶斯推断的标签数量估计算法。该算法可以有效利用历史时隙...针对射频识别(Radio Frequency Identification,RFID)动态帧时隙防碰撞算法中,初始帧长选择比较敏感的问题,以及RFID动态帧时隙提前停止算法的问题进行了研究,提出了一种基于贝叶斯推断的标签数量估计算法。该算法可以有效利用历史时隙的状态信息,在每个时隙对标签数量进行一次估计。估计的精确度随着时隙数量的增多逐渐增加。仿真结果显示,该算法可以有效减少动态帧时隙,提前停止算法中观察时隙的数量,从而降低了初始帧长对系统效率的影响。展开更多
基金Supported by the National Natural Science Foundation of China(No.61401407)
文摘Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in throughput are very limited.In order to solve these problems,this paper presents a novel tag anti-collision scheme,namely adaptive hybrid search tree(AHST),by combining two algorithms of the adaptive binary-tree disassembly(ABD) and the combination query tree(CQT),in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search timeslots.From the theoretical analysis and numerical simulations,the proposed algorithm can colligate the advantages of above algorithms,improve the system throughput and reduce the searching timeslots dramatically.
基金This work is supported by the National Natu ral Science Foundation of China under grant No.61071073 and No. 61371092, Doctoral Fund of Ministry of Education of China （No.20090061110043）.
文摘A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.
基金Supported by the Chongqing Education Administration Program Foundation of China (No.KJ110516)the Chongqing Natural Science Foundation of China (No.cstc2011jjA40014, No.cstc2011A40028)
文摘Tag collision algorithm is a key issue for energy saving and throughput with Radio Frequency IDentification (RFID) system more popular in sensing infrastructure of covering wider area on a large scale. Exploiting low energy consumption strategy would enable longer operational life of tags and reader with battery energy supply. And improving throughput is required on a large scale to preserve the capability of the correct reception. Therefore, this paper proposes an enhanced anti-collision algorithm called Dynamic Slotted with Muting (DSM), which uses multiple slots within a frame per node in a binary tree and takes tag estimation function to optimize the number of slots, and adds a mute command to put identified tags silence. The performance of the proposed algorithm is analytically provided, and simulation results show that DSM saves more than 40% energy consumptions both at reader and tags, and improves more than 35% throughput compared to the existing algorithms. Thus our algorithm is demonstrated to perform efficient energy savings at reader and tags with throughput improvement.
文摘针对射频识别(Radio Frequency Identification,RFID)动态帧时隙防碰撞算法中,初始帧长选择比较敏感的问题,以及RFID动态帧时隙提前停止算法的问题进行了研究,提出了一种基于贝叶斯推断的标签数量估计算法。该算法可以有效利用历史时隙的状态信息,在每个时隙对标签数量进行一次估计。估计的精确度随着时隙数量的增多逐渐增加。仿真结果显示,该算法可以有效减少动态帧时隙,提前停止算法中观察时隙的数量,从而降低了初始帧长对系统效率的影响。
