A Stochastic Shortest Path Model to Minimize the Reading Time in DFSA-Based RFID Systems
- 15 January 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 17 (2) , 341-344
Abstract
RFID systems implementing Dynamic Frame Slotted Aloha (DFSA) can adjust the number of identification rounds (slots) within an inventory cycle (frame). The usual approach to reduce the identification time of the tag population is to select the frame size attaining the highest throughput in the frame. However, it is more accurate to minimize the identification time of all the tags considering an indefinite long decision horizon. This is done in this paper by means of a Stochastic Shortest Path (SSP) formulation that incorporates capture effect and differentiation among slot durations. Our results show that the optimal policy is even faster than previous approaches.Keywords
This publication has 5 references indexed in Scilit:
- Multiframe Maximum-Likelihood Tag Estimation for RFID Anticollision ProtocolsIEEE Transactions on Industrial Informatics, 2011
- Efficient Anti-Collision Algorithm Utilizing the Capture Effect for ISO 18000-6C RFID ProtocolIEEE Communications Letters, 2011
- Complete Link Budgets for Backscatter-Radio and RFID SystemsIEEE Antennas and Propagation Magazine, 2009
- RFIDSim—A Physical and Logical Layer Simulation Engine for Passive RFIDIEEE Transactions on Automation Science and Engineering, 2008
- An Accurate Tag Estimate Method for Improving the Performance of an RFID Anticollision Algorithm Based on Dynamic Frame Length ALOHAIEEE Transactions on Automation Science and Engineering, 2008