[1] |
YOON W J , CHUNG S H , LEE S J . Implementation and performance evaluation of an active RFID system for fast tag collection[J]. Computer Communications, 2008,31(17): 4107-4116.
|
[2] |
李慧贤 . 轻量级RFID双向认证协议设计与分析[J]. 西安电子科技大学学报(自然科学版), 2012,(1): 172-178. LI H X . Design and analysis of the light-weight mutual authentication protocol for RFID[J]. Journal of Xidian University, 2012,(1): 172-178.
|
[3] |
高飞, 薛艳明, 王爱华 ,等. 物联网核心技术-RFID 原理与应用[M]. 北京: 人民邮电出版社, 2010. 96-101. GAO F,XUE Y M , WANG A H , et a l . The Core-Technology of the Internet of Things the Application & Principle of RFID[M]. Beijing: Posts & Telecom PressPress, 2010. 96-101.
|
[4] |
王中祥, 王俊宇, 刘丹 ,等. 一种降低空时隙开销的RFID 防碰撞算法[J]. 通信学报, 2009,30(9): 1-5. WANG Z X , WANG J Y , LIU D ,et al. An RFID anti-collision algorithm minimizing the cost of empty slots[J]. Journal on Communications, 2009,30(9): 1-5.
|
[5] |
吴海峰, 曾玉 . RFID动态帧时隙ALOHA防冲突中的标签估计和帧长确定[J]. 自动化学报, 2010,36(4): 621-624. WU H F , ZENG Y . Tag estimate and fame length for dynamic frame slotted ALOHA anti-collision RFID system[J]. Acta Automatica Sinica, 2010,36(4): 621-624.
|
[6] |
VOGT H . Multiple object identification with passive RFID tags[A]. Proceedings of IEEE International Conference on Systems,Man,and Cybernetics[C]. Hammamet,Tunisia, 2002. 1-6.
|
[7] |
VOGT H . Efficient object identification with passive RFID tags[A]. Proceedings of International Conference on Pervasive Computing[C]. Zurich,Switzerland, 2002. 98-113.
|
[8] |
CHEN W T . An accurate tag estimate method for improvin the performance of an RFID anti-collision algorithm based on dynamic frame length ALOHA[J]. IEEE Transactions on Automation Science and Engineering, 2009,6(1): 9-15.
|
[9] |
LEE S R , JOO S D , LEE C W . An enhanced dynamic framed ALOHA algorithm for RFID tag identification[A]. Proceedings f the 2nd Annual International Conference on Mobile and Ubiquitous Systems:Networking and Services[C]. Washington D C,USA, 2005. 166-174.
|
[10] |
BONUCCELLI M A , LONETTI F , MARTELLI F . Tree slotted ALOHA:a new protocol for tag identification in RFID networks[A]. Proceedings of the International Symposium on a World of Wireless,Mobile and Multimedia Networks[C]. New York,USA, 2006. 603-608.
|
[11] |
李泽兰, 何怡刚, 刘拓晟 . 基于广义地址码的RFID 防碰撞算法[J]. 计算机测量与控制, 2010,18(5): 1114-1117. LI Z L , HE Y G , LIU T S . An anti-collision algorithm on new spreading code RFID[J]. Computer Measurement & Control, 2010,18(5): 1114-1117.
|
[12] |
李萌, 钱志鸿, 张旭 ,等. 基于时隙预测的RFID 防碰撞 ALOHA 算法[J]. 通信学报, 2011,32(12): 43-50. LI M , QIAN Z H , ZHANG X ,et al. Slot predicting based ALOHA algorithm for RFID anti-collision[J]. Journal on Communications, 2011,32(12): 43-50.
|
[13] |
朱军, 张元, 卢小冬 ,等. 基于分段搜索的多 RFID 标签抗冲突方法[J]. 计算机应用研究, 2011,28(3): 1031-1033. ZHU J , ZHANG Y , LU X D ,et al. Anti-collision method of multi-RFID tags based on segmental search[J]. Application Research of Computers, 2011,28(3): 1031-1033.
|
[14] |
李世煜, 冯全源 . 分层深度搜索树型RFID防碰撞算法设计[J]. 计算机工程与应用, 2009,45(11): 82-84. LI S Y , FENG Q Y . Delaminating deepness searching tree anti-collision algorithm in RFID system[J]. Computer Engineering and Applications, 2009,45(11): 82-84.
|
[15] |
EOM J , LEE T . Accurate tag estimation for dynamic framed-slotted ALOHA in RFID systems[J]. IEEE Communications Letters, 2010,14(1): 60-62.
|
[16] |
杨坤, 冷甦鹏 . RFID系统时隙不完全竞争防碰撞算法[J]. 计算机工程, 2011,37(1): 260-262. YANG K , LENG S P . Slot partial competitive anti-collision algorithm for RFID system[J]. Computer Engineering, 2011,37(1): 260-262.
|
[17] |
CHOI J S , LEE H , ENGELS D W . Robust and dynamic bin slotted anti-collision algorithms in RFID systems[A]. Proc of IEEE nternational Conference on RFID[C]. IEEE Press, 2008. 191-198.
|
[18] |
陈颖, 张福洪, 廖彬彬 . 一种新的RFID 传感系统的防碰撞算法的研究[J]. 传感技术学报, 2009,22(6): 865-868. CHEN Y , ZHANG F H , LIAO B B . Research on a novel anti-collision algorithm in RFID sensor system[J]. Chinese Journal of Sensors and Actuators, 2009,22(6): 865-868.
|
[19] |
王雪, 钱志鸿, 胡正超 ,等. 基于二叉树的RFID防碰撞算法研究[J]. 通信学报, 2010,31(6): 49-50. WANG X , QIAN Z H , HU Z C ,et al. Research on RFID anti-collision algorithms based on binary trees[J]. Journal on Communications, 2010,31(6): 49-50.
|