Framed ALOHA for multiple RFID objects identification

被引:142
作者
Zhen, B [1 ]
Kobayashi, M [1 ]
Shimizu, M [1 ]
机构
[1] NTT Corp, NTT Network Innovat Labs, Yokosuka, Kanagawa 2390487, Japan
关键词
RFID; anti-collision; framed ALOHA; low energy;
D O I
10.1093/ietcom/e88-b.3.991
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Radio frequency identification (RFID) enables everyday objects to be identified, tracked, and recorded. The RFID tags are must be extremely simple and of low cost to be suitable for large scale application. An efficient RFID anti-collision mechanism must have low access latency and low power consumption. This paper investigates how to recognize multiple RFID tags within the reader's interrogation ranges without knowing the number of tags in advance by using framed ALOHA. To optimize power consumption and overall tag read time, a combinatory model was proposed to analyze both passive and active tags with consideration on capture effect over wireless fading channels. By using the model, the parameters on tag set estimation and frame size update were presented. Simulations were conducted to verify the analysis. In addition, we come up with a proposal to combat capture effect in deterministic anti-collision algorithms.
引用
收藏
页码:991 / 999
页数:9
相关论文
共 13 条
  • [1] Energy-conserving access protocols for identification networks
    Chlamtac, I
    Petrioli, C
    Redi, J
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (01) : 51 - 59
  • [2] ENGELS DW, 2002, MITAUTOIDWH007PDF
  • [3] Analysis of tree algorithms for RFID arbitration
    Hush, DR
    Wood, C
    [J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 107 - 107
  • [4] *ISO IEC, 18007 ISO IEC
  • [5] JACOMET M, 1999, IEEE C IRC SYST COMP, P4
  • [6] KENZELLER KF, 2003, RFID HDB
  • [7] LAW C, 2000, MITAUTOIDTR003PDF
  • [8] PRASAD R, 1998, UNIVERSAL WIRELESS
  • [9] Sarma S., 2001, MITAUTOIDWH006
  • [10] DYNAMIC FRAME LENGTH ALOHA
    SCHOUTE, FC
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (04) : 565 - 568