2 research outputs found

    Asymptotic Analysis of Backlog Estimates for Dynamic Frame Aloha

    Get PDF
    In this paper a new analysis is presented that allowsto investigate the asymptotic behavior of some backlog estimation procedures for Dynamic Frame Aloha (DFA) in Radio Frequency Identification (RFID) environment. Although efficiency e-1 can theoretically be reached, none of the solution proposed in the literature has been shown to reach such value. Here we analyze first the Schoute’s backlog estimate, which is very attractive for its simplicity, and formally show that its asymptotic efficiency is 0:311 for any finite initial frame length. Since the analysis shows how the Schoute’s estimate impairment can be avoided, wefurther propose the Asymptotic Efficient Estimate (AE2), an improvement of the Schoute’s one, that exploits the Frame Restart property of the standard and that is proved to asymptotically reach efficiency e-1

    0.469 PDFSA protocol for RFID arbitration

    No full text
    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
    corecore