To enhance the performance of the Dynamic Frame Aloha protocol for RFID arbitration, the grouping of the tag population has been suggested in past works. However, none of them has formalized the problem of optimizing such grouping, nor has been able to provide an efficiency much higher than 0.367, the classic DF-Aloha maximum performance. In this paper we explain how to set the optimal size of groups, based on results attained decades ago in random access systems. We then present a novel protocol, Partitioned Dynamic Frame Slotted Aloha (PDFSA), based on grouping, that, when adopting the best estimation mechanism, reaches an asymptotical efficiency up to 0.469. With a more practical estimate and a short initial phase, this protocol provides an efficiency above 0.420 for any value of the population size N, reaching 0.455 asymptotically.
0.469 PDFSA protocol for RFID arbitration
BARLETTA, LUCA;BORGONOVO, FLAMINIO;CESANA, MATTEO
2011-01-01
Abstract
To enhance the performance of the Dynamic Frame Aloha protocol for RFID arbitration, the grouping of the tag population has been suggested in past works. However, none of them has formalized the problem of optimizing such grouping, nor has been able to provide an efficiency much higher than 0.367, the classic DF-Aloha maximum performance. In this paper we explain how to set the optimal size of groups, based on results attained decades ago in random access systems. We then present a novel protocol, Partitioned Dynamic Frame Slotted Aloha (PDFSA), based on grouping, that, when adopting the best estimation mechanism, reaches an asymptotical efficiency up to 0.469. With a more practical estimate and a short initial phase, this protocol provides an efficiency above 0.420 for any value of the population size N, reaching 0.455 asymptotically.File | Dimensione | Formato | |
---|---|---|---|
06064398.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
124.5 kB
Formato
Adobe PDF
|
124.5 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.