Four slot dynamic binary search anti-collision Algorithm
暂无分享,去创建一个
To improve the performance of the Radio Frequency Identification (RFID) system and the multi-tag collision problem, a new anti-collision building algorithm is proposed based on the dynamic frame time slot Aloha algorithm and the analysis of binary search and four-slot binary search. In the new algorithm, the reader stack is used to form a further search command; the response tag is divided into four subsets, and the data information is sent in four-time slots, and up to eight tags can be recognized in one search. Simulation results show that the new algorithm greatly reduces the search times and recognition time.
[1] Vinod Namboodiri,et al. An extensive study of slotted Aloha-based RFID anti-collision protocols , 2012, Comput. Commun..
[2] Chih-Chung Lin,et al. A blocking RFID anti-collision protocol for quick tag identification , 2009, 2009 IFIP International Conference on Wireless and Optical Communications Networks.
[3] Yuan-Cheng Lai,et al. A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification , 2013, IEEE Transactions on Mobile Computing.