A stochastic shortest path model to minimize the reading time in DFSA-Based RFID systems

Journal ar
IEEE Communications Letters
  • Volumen: 17
  • Número: 2
  • Fecha: 18 enero 2013
  • Páginas: 341-344
  • ISSN: 10897798
  • Tipo de fuente: Revista
  • DOI: 10.1109/LCOMM.2013.011113.122407
  • Tipo de documento: Artículo
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. © 1997-2012 IEEE.

Palabras clave del autor

    Palabras clave indexadas

      Detalles de financiación