ALOHA Algorithm considering the Slot Duration Difference in RFID system

被引:16
作者
Liu, Dan [1 ]
Wang, Zhongxiang [1 ]
Tan, Jie [2 ]
Min, Hao [1 ]
Wang, Junyu [1 ]
机构
[1] Fudan Univ, State Key Lab ASIC & Syst, Auto ID Lab, Shanghai 200433, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Beijing, Peoples R China
来源
IEEE RFID: 2009 IEEE INTERNATIONAL CONFERENCE ON RFID | 2009年
关键词
Anti-collision; Framed-Aloha; Collision Detection; BIS; RFID Identification;
D O I
10.1109/RFID.2009.4911180
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
When multiple RFID tag identification is becoming a commonplace, the anti-collision technology for multiple RFID tag environment has drawn mounting research interest in the RFID domain. Many published Aloha-based algorithms, assuming that all the slots have the same duration, tend to increase the number of successful slots by tag estimation and dynamic frame scheduling, and thus improve the system efficiency (the ratio of successful slots to all slots in each frame), which is limited by 1/e according to the theory of Probability. Whereas, in this paper, the effect of the empty slots and collided slots is analyzed and two novel methods based on the parameters of EPC Gen2 protocol, BIS and Collision Detection, are proposed, to improve the RFID system efficiency by reducing the cost of the none successful slots other than the successful slots. Moreover, a new approach to evaluate the system efficiency for multiple tag identification, taking consideration of the duration difference of the slots, is presented. According to the simulation and test results, the proposed methods, BIS and Collision Detection, can improve the system throughput by 120% and 30 similar to 40% respectively.
引用
收藏
页码:56 / +
页数:2
相关论文
共 17 条
[1]  
[Anonymous], 2005, EPC RAD FREQ ID PROT
[2]  
Cha JR, 2005, 11TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS WORKSHOPS, VOL II, PROCEEDINGS,, P63
[3]  
Chen W., 2006, IEICE T COMMUN B, VE89-B
[4]  
FLOERKEMEIER C, 2006, THESIS ETH ZURICH
[5]  
Floerkemeier C., 2006, IEEE PERCOM WORKSH P
[6]   Analysis of tree algorithms for RFID arbitration [J].
Hush, DR ;
Wood, C .
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, :107-107
[7]  
Jacomet Marcel., 1999, P IEEE C CIRCUITS SY, P269
[8]  
JUELS RL, 10 ANN ACM CCS 2003
[9]  
Kim C.S., 2004, P INT C PAR DISTR PR
[10]  
Law C., 2000, Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, P75, DOI DOI 10.1109/TMM.2006.879817