Accurate Tag Estimation for Dynamic Framed-Slotted ALOHA in RFID Systems

被引:55
作者
Eom, Jun-Bong [1 ]
Lee, Tae-Jin [1 ]
机构
[1] Sungkyunkwan Univ, Sch Informat & Commun Engr, Suwon 440746, South Korea
基金
新加坡国家研究基金会;
关键词
Anti-collision; DFSA; frame size; RFID; tag estimation; tag identification;
D O I
10.1109/LCOMM.2010.01.091378
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Dynamic Framed-Slotted ALOHA (DFSA) is one of the most popular algorithms to resolve tag collision in RFID systems. In DFSA, it is widely known that the optimal performance is achieved when the frame size is equal to the number of tags. So, a reader dynamically adjusts the next frame size according to the current number of tags. Thus it is important to estimate the number of tags accurately. In this paper, we propose a novel tag estimation method for DFSA. We compare the performance of the proposed method with those of other existing methods. And, simulation results show that our scheme improves the accuracy of tag estimation and the speed of tag identification.
引用
收藏
页码:60 / 62
页数:3
相关论文
共 7 条
[1]  
Cha JR, 2005, 11TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS WORKSHOPS, VOL II, PROCEEDINGS,, P63
[2]   An efficient anti-collision method for tag identification in a RFID system [J].
Chen, Wen-Tzu ;
Lin, Guan-Hung .
IEICE TRANSACTIONS ON COMMUNICATIONS, 2006, E89B (12) :3386-3392
[3]   An Efficient Framed-Slotted ALOHA Algorithm with Pilot Frame and Binary Selection for Anti-Collision of RFID Tags [J].
Eom, Jun-Bong ;
Lee, Tae-Jin ;
Rietman, Ronald ;
Yener, Aylin .
IEEE COMMUNICATIONS LETTERS, 2008, 12 (11) :861-863
[4]  
EPCglobal, 2005, EPCTM RAD FREQ ID PR
[5]   Adaptive binary splitting for efficient RFID tag anti-collision [J].
Myung, Jihoon ;
Lee, Wonjun ;
Srivastava, Jaideep .
IEEE COMMUNICATIONS LETTERS, 2006, 10 (03) :144-146
[6]   DYNAMIC FRAME LENGTH ALOHA [J].
SCHOUTE, FC .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (04) :565-568
[7]  
Vogt H., 2002, Pervasive Computing. First International Conference, Pervasive 2002. Proceedings (Lecture Notes in Computer Science Vol.2414), P98