[1]SCHOUTE F S. Dynamic frame length ALOHA [J]. IEEE Transactions on Communications Letters, 1983, 31(4): 565-568.[2]王亚奇,蒋国平.基于分组机制的跳跃式动态二进制防碰撞算法[J].自动化学报,2010,36(10):1390-1400.[3]王中祥,王俊宇,刘丹,等.BIS:一种降低空时隙开销的RFID防碰撞算法[J].通信学报,2009,30(9):1-7.[4]程文青,赵梦欣,徐晶,等.改进的RFID动态帧时隙ALOHA算法[J].华中科技大学学报:自然科学版,2007,35(6):14-16.[5]LEE S-R, JOO S-D, LEE C-W. An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification [C]// Proceedings of the Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services. Washington, DC: IEEE Computer Society, 2005: 166-172.[6]LIN C-F, LIN F Y-S. Efficient estimation and collision-group-based anticollision algorithms for dynamic frame-slotted ALOHA in RFID networks [J]. IEEE Transactions on Automation Science and Engineering, 2010, 7(4): 840-848.[7]CAPETANAKIS J I. Tree algorithms for packet broadcast channels [J]. IEEE Transactions on Information Theory, 1979, 25(5): 505-515.[8]鞠伟成,俞承芳.一种基于动态二进制的RFID抗冲突算法[J].复旦学报:自然科学版,2005,44(1):46-50.[9]WANG T-P. Enhanced binary search with cut-through operation for anti-collision in RFID systems [J]. IEEE Communications Letters, 2006, 10(4): 236-238.[10]SHI X-L, SHI X-W, HUANG Q-L, et al. An enhanced binary anti-collision algorithm of backtracking in RFID system [J]. Progress in Electromagnetics Research B, 2008, 4: 263-271.[11]SHI X-L, WEI F, HUANG Q-L, et al. Novel binary search algorithm of backtracking for RFID tag anti-collsion [J]. Progress in Electromagnetics Research B, 2008, 9: 97-104.[12]余松森,詹宜巨,王志平,等.跳跃式动态树形反碰撞算法及其分析[J].计算机工程,2005,31(9):19-21.[13]王雪,钱志鸿,胡正超,等.基于二叉树的RFID防碰撞算法的研究[J].通信学报,2010,31(6):49-57. |