An Accurate Tag Estimate Method for Improving the Performance of an RFID Anticollision Algorithm Based on Dynamic Frame Length ALOHA

被引:186
作者
Chen, Wen-Tzu [1 ]
机构
[1] Natl Cheng Kung Univ, Inst Telecommun Management, Tainan 70101, Taiwan
关键词
Anticollision; framed ALOHA; radio-frequency identification (RFID); tag estimate;
D O I
10.1109/TASE.2008.917093
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In a radio-frequency identification (RFID) system, the dynamic frame length ALOHA protocol is widely adopted to solve the anticollision problem. Analysis for the anticollision problem can be divided into two primary parts. The concern of the first part is how to precisely estimate the number of tags. The other part involves determination of dynamic frame length to achieve maximum throughput or channel usage efficiency. In this paper, we present an accurate method for estimating tag quantity. This method is based on the maximum a posteriori probability decision. We also derive the optimal frame length using radio channel efficiency. Simulation results indicate the tag estimate error of the proposed method is less than 4%. Use of our proposed tag estimate method together with optimal frame length can achieve close to the theoretical maximum throughput of the framed ALOHA algorithm. Note to Practitioners-A tag estimate method presented here is capable of precisely estimating the number of tags in resolving multiple-tag access using dynamic frame length ALOHA. The optimal frame length for obtaining the maximum radio channel efficiency is derived. Performance measures including tag estimate error and total read time show that our proposed anticollision algorithm is superior in comparison to previously published work. Since the frame length update mechanism including tag estimate method and the setting of frame length is not specified in current RFID standards such as ISO 18000-6 and ISO 14443-3, our proposed anticollision algorithm can be useful for engineers to implement the dynamic frame length ALOHA algorithm in a real RFID system. Also, using our method can achieve uplink throughput close to the theoretical maximum value 0.368 of the framed ALOHA algorithm.
引用
收藏
页码:9 / 15
页数:7
相关论文
共 20 条
  • [1] [Anonymous], P AINA IMPR PROT SPE
  • [2] [Anonymous], 2005, CLASS 1 GENERATION 2
  • [3] [Anonymous], 2003, RFID HDB FUNDAMENTAL
  • [4] Cha JR, 2005, 11TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS WORKSHOPS, VOL II, PROCEEDINGS,, P63
  • [5] FLOERKEMEIER C, 2006, P INT C PERV COMP CO
  • [6] Analysis of tree algorithms for RFID arbitration
    Hush, DR
    Wood, C
    [J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 107 - 107
  • [7] *ISO IEC, 2000, 144433 ISOIEC 3
  • [8] *ISO IEC, 2004, 180006 ISOIEC 6
  • [9] ANALYTIC PROPERTIES OF MULTIPLE-ACCESS TREES
    KAPLAN, MA
    GULKO, E
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (02) : 255 - 263
  • [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