Capture-aware Bayesian RFID tag estimate for large-scale identification

Dynamic framed slotted Aloha algorithm is one of popular passive radio frequency identification U+0028 RFID U+0029 tag anticollision algorithms. In the algorithm, a frame length requires dynamical adjustment to achieve higher identification efficiency. Generally, the adjustment of the frame length is not only related to the number of tags, but also to the occurrence probability of capture effect. Existing algorithms could estimate both the number of tags and the probability of capture effect. Under large-scale RFID tag identification, however, the number of tags would be much larger than an initial frame length. In this scenario, the existing algorithm U+02BC s estimation errors would substantially increase. In this paper, we propose a novel algorithm called capture-aware Bayesian estimate, which adopts Bayesian rules to accurately estimate the number and the probability simultaneously. From numerical results, the proposed algorithm adapts well to the large-scale RFID tag identification. It has lower estimation errors than the existing algorithms. Further, the identification efficiency from the proposed estimate is also higher than the existing algorithms.

[1]  Leilani Battle,et al.  Building the Internet of Things Using RFID: The RFID Ecosystem Experience , 2009, IEEE Internet Computing.

[2]  Alex X. Liu,et al.  Fast and Accurate Estimation of RFID Tags , 2015, IEEE/ACM Transactions on Networking.

[3]  Jie Wu,et al.  RFID cardinality estimation with blocker tags , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[4]  Xi Yang,et al.  Improving the Performance of RFID Tag Anti-Collision for Capture Effect , 2013 .

[5]  Bo Li,et al.  Efficient Anti-Collision Algorithm Utilizing the Capture Effect for ISO 18000-6C RFID Protocol , 2011, IEEE Communications Letters.

[6]  David C. Yen,et al.  Taxonomy and survey of RFID anti-collision protocols , 2006, Comput. Commun..

[7]  Yang Wang,et al.  Capture-Aware Estimation for Large-Scale RFID Tags Identification , 2015, IEEE Signal Processing Letters.

[8]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[9]  Xi Yang,et al.  Capture-Aware Estimation for the Number of RFID Tags with Lower Complexity , 2013, IEEE Communications Letters.

[10]  Yuping Zhao,et al.  A modified Q-parameter anti-collision scheme for RFID systems , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[11]  F. Schoute,et al.  Dynamic Frame Length ALOHA , 1983, IEEE Trans. Commun..

[12]  Quanyuan Feng,et al.  An Efficient Anti-Collision Protocol for RFID Tag Identification , 2010, IEEE Communications Letters.

[13]  Aylin Yener,et al.  ASAP : A MAC Protocol for Dense and Time Constrained RFID Systems , 2006, ICC.

[14]  Yuan-Cheng Lai,et al.  General binary tree protocol for coping with the capture effect in RFID tag identification , 2010, IEEE Communications Letters.

[15]  Quanyuan Feng,et al.  Grouping based bit-slot ALOHA protocol for tag anti-collision in RFID systems , 2007, IEEE Communications Letters.

[16]  Bin Xiao,et al.  Differential estimation in dynamic RFID systems , 2013, 2013 Proceedings IEEE INFOCOM.

[17]  Wen-Tzu Chen Optimal Frame Length Analysis and an Efficient Anti-Collision Algorithm With Early Adjustment of Frame Length for RFID Systems , 2016, IEEE Transactions on Vehicular Technology.

[18]  Norbert Goertz,et al.  RFID Tag Acquisition Via Compressed Sensing: Fixed vs. Random Signature Assignment , 2016, IEEE Transactions on Wireless Communications.

[19]  Min Chen,et al.  Joint property estimation for multiple RFID tag sets using snapshots of variable lengths , 2016, MobiHoc.

[20]  Ravikanth Pappu,et al.  An Optimal Q-Algorithm for the ISO 18000-6C RFID Protocol , 2009, IEEE Transactions on Automation Science and Engineering.

[21]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.