Slot-wise maximum likelihood estimation of the tag population size in FSA protocols

Knerr, B.; Hölzer, Martin; Angerer, Christoph; Rupp, Markus

doi:10.1109/tcomm.2010.02.080571

Cited by 72 publications

(57 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A closed-form expression of probability p (i) n,r (c, k) can be found in [13]. The equations above can be solved in the same way as (6)- (8), with initial conditions…”

Section: Analysis With Known Collisionsmentioning

confidence: 99%

Analysis of Dynamic frame Aloha with frame restart

Barletta

Borgonovo

Filippini

2014

2014 13th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)

View full text Add to dashboard Cite

Abstract-This paper provides an analysis of the Dynamic frame Aloha (DFA) protocol with frame Restart. Although a previous work has numerically provided the best restarting strategy when the number of tags N is known, that strategy is represented by a table whose entries are so many to be impractical for high values of N . Here we provide a simpler set of equations that, besides the optimal strategy, lead to a very simple sub-optimal strategy whose performance is practically indistinguishable from the optimal one. Furthermore, we prove that asymptotically the Frame Restart property is useless, being the corresponding efficiency equal to e −1 , the same as the plain DFA. We investigate the strategies and performance when N is unknown, furthermore providing a procedure, called AE 2 , that is able to asymptotically reach the theoretical efficiency e −1 .

show abstract

“…A closed-form expression of probability p (i) n,r (c, k) can be found in [13]. The equations above can be solved in the same way as (6)- (8), with initial conditions…”

Section: Analysis With Known Collisionsmentioning

confidence: 99%

Analysis of Dynamic frame Aloha with frame restart

Barletta

Borgonovo

Filippini

2014

2014 13th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)

View full text Add to dashboard Cite

show abstract

“…Knerr et al in [3] formulated a maximum likelihood estimator to yield the estimated number of tags on a slot-wise basis. Their method can be applied for an immediate update of the frame size, during the frame duration, according to the probability level of the current slot-by-slot estimate.…”

Section: Related Workmentioning

confidence: 99%

A smart collision recovery receiver for RFIDs

Kaitovic¹,

Langwieser²,

Rupp³

2013

J Embedded Systems

View full text Add to dashboard Cite

In this work, we focus on framed slotted Aloha (FSA) and passive ultra high-frequency radio frequency identification multi-antenna systems with physical layer collision recovery. We modify the tags slightly by adding a so-called 'postpreamble' that facilitates channel estimation. Furthermore, we investigate the throughput performance of advanced receiver structures in collision scenarios. More specifically, we analyse the throughput of FSA systems with up to four receive antennas that can recover from a collision of up to eight tags on the physical layer and acknowledge all tags involved in that collision. Due to the higher collision recovery capabilities, the frame sizes can be significantly reduced, and thus, the throughput can be increased. We also derive analytically optimal frame sizes, given that a certain number of collisions can be resolved. We further study the constraints to the throughput due to the structure of our receiver and channel estimation for different collision scenarios. Furthermore, we propose a novel collision recovery method with two phases: first, a successive interference cancellation and, second, a projection of the constellation into the orthogonal subspace of the interference. Additionally, the inventory time, i.e. the number of slots necessary to successfully decode all tags in the reader range, is calculated and compared for different receiver types. A validation of our theoretical predictions is achieved by means of simulations. We show that by our proposed methods, we can realistically achieve more than ten times higher throughput or, equivalently, a reduction of the inventory time by more than 90%.

show abstract

“…Such methods incur relatively long identification latency, especially when the number of tags is large. Probabilistic algorithms [5][6], however, reduce the probability of collision by dividing the time into slots and sequentially identifying the tags in separate time slots. Aloha-based algorithms are the most prevalent probabilistic solution used in the ultra high frequency (UHF) RFID systems due to its simplicity Manuscript received August 25, 2016; revised December 1, 2016.…”

Section: Introductionmentioning

confidence: 99%

A Collision-Tolerant-Based Anti-Collision Algorithm for Large Scale RFID System

Sheng

Xie

2017

IEEE Commun. Lett.

View full text Add to dashboard Cite

Liangbo (2017) A collision-tolerant based anti-collision algorithm for large scale RFID system. IEEE Communications Letters. ISSN 1089-7798 This version is available from Sussex Research Online: http://sro.sussex.ac.uk/67136/ This document is made available in accordance with publisher policies and may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the URL above for details on accessing the published version. Copyright and reuse:Sussex Research Online is a digital repository of the research output of the University.Copyright and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable, the material made available in SRO has been checked for eligibility before being made available.Copies of full text items generally can be reproduced, displayed or performed and given to third parties in any format or medium for personal research or study, educational, or not-for-profit purposes without prior permission or charge, provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way. Abstract-Tag identification is an important issue in RFID system. Most existing anti-collision algorithms solely focus on reducing collision probability while suffering from vast idle slots. This paper proposes a collision-tolerant dynamic framed slotted Aloha (CE-DFSA) algorithm which attempts to identify multiple tags in a slot to reduce the total identification time in the process of identification. In CE-DFSA, tags are allocated with orthogonal Walsh Sequence (WS) so that multiple tags can be identified in a time slot without spreading the spectrum. Simulation results show that the proposed algorithm considerably accelerates the tag identification process with improved efficiency compared with existing anti-collision algorithms.

show abstract

Slot-wise maximum likelihood estimation of the tag population size in FSA protocols

Cited by 72 publications

References 8 publications

Analysis of Dynamic frame Aloha with frame restart

Analysis of Dynamic frame Aloha with frame restart

A smart collision recovery receiver for RFIDs

A Collision-Tolerant-Based Anti-Collision Algorithm for Large Scale RFID System

Contact Info

Product

Resources

About