Taxonomy and survey of RFID anti-collision protocols

Shih, Dong‐Her; Sun, Po-Ling; Yen, David C.; Huang, Shi‐Ming

doi:10.1016/j.comcom.2005.12.011

Cited by 263 publications

(122 citation statements)

References 16 publications

Supporting

Mentioning

101

Contrasting

Unclassified

Order By: Relevance

“…Sometimes, it has the probability of 1/2 96 to generate the same identification because the length of tag identification has only 96 bits. Many researchers also provide complete solution for tag collision (Shih et al, 2006;Lee et al, 2004). Hence, we think that tag collision is almost impossible happened for RFID tag.…”

Section: System Assumptionmentioning

confidence: 99%

A Secure Mutual Authentication Protocol for Low-Cost RFID System

Yang¹,

Yeh²

2009

Development and Implementation of RFID Technology

View full text Add to dashboard Cite

Section: System Assumptionmentioning

confidence: 99%

A Secure Mutual Authentication Protocol for Low-Cost RFID System

Yang¹,

Yeh²

2009

Development and Implementation of RFID Technology

View full text Add to dashboard Cite

“…The first methodology uses filtering algorithms to correct incoming records when data is first captured. The filtration processes rely on anti-collision protocols to correct tagged observations as they are being physically read pre-data storage [8]. The second approach applies correcting algorithms to the stored data, which enhances the integrity of the observations within the data storage.…”

Section: Related Workmentioning

confidence: 99%

Correcting Missing Data Anomalies with Clausal Defeasible Logic

Darcy

Stantić

Sattar

2010

Advances in Databases and Information Systems

View full text Add to dashboard Cite

Abstract. Databases are used globally to store essential information required for various business applications such as automated data capturing. Unfortunately, due to missing record anomalies present within the repository, the overall integrity of stored information is compromised. Currently, filtration and rule-based techniques have been proposed to correct the problem, but due to a lack of high-level reasoning, ambiguous scenarios lead to anomalies persisting within the database. In this paper, we propose an enhanced Non-Monotonic Reasoning cleaning architecture that utilises intelligent analysis coupled with Clausal Defeasible Logic to rectify the missing data by generating and restoring imputed data. From our experimental evaluation, we have found that our proposed technique surpasses other leading intelligence classifiers such as Bayesian and Neural Networks.

show abstract

“…The different proposals fall into the two following categories: (i) splitting algorithms or (ii) probabilistic protocols. In the first group, a well-known protocol, called QT memoryless [2] exemplifies its operation: the reader sends a string prefix and all the tags whose ID match that prefix reply. The reader appends a new digit to the string prefix subsequently.…”

Section: Related Workmentioning

confidence: 99%

“…For passive tags, mainly due to the limitations of the devices, the protocols are very simple and most of them fall into the following two categories [2]:…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, active tags are more complex devices, with more sophisticated capabilities (usually integrating a microprocessor and memory) and they can be read and written from distances in excess of 100 meters [1]. Whereas passive RFID systems are the most deployed and have been studied for years [2,3,4], active RFID systems have devoted little academic attention, and only recently a standard is available [5].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance Evaluation of Non-persistent CSMA as Anti-collision Protocol for Active RFID Tags

Egea-López

Vales‐Alonso

Martínez-Sala

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we propose the use of non-persistent CSMA as an anti-collision procedure for RFID active tags. Current proposals for both passive and active tags are based on the framed slotted ALOHA protocol, which does not scale well requiring additional procedures for frame length adaptation. However, active RFID devices already include carrier sense capabilities with no additional cost and, thus, CSMA may be employed seamlessly. Nevertheless, selecting the contention microslots of CSMA in the classical way (i.e., with a uniform distribution and an exponential back-off algorithm) does not result in an efficient identification process, as we will demonstrate. Fortunately, better choices can be found. Recently, an optimal distribution for the selection of microslots for event-driven sensor networks has been computed, as well as a practical implementation: the Sift distribution. In this work we propose the application of the quasi-optimal Sift distribution along with CSMA for active tag identification. By means of an analytical study, we evaluate the average time needed for identification with this mechanism and compare it with the current ISO 18000-7 and EPC "Gen 2" standard. The results reveal that the Sift-based non-persistent CSMA outperforms both of them. Moreover, it also scales much better, without the need for further adaptation mechanisms.

show abstract

Taxonomy and survey of RFID anti-collision protocols

Cited by 263 publications

References 16 publications

A Secure Mutual Authentication Protocol for Low-Cost RFID System

A Secure Mutual Authentication Protocol for Low-Cost RFID System

Correcting Missing Data Anomalies with Clausal Defeasible Logic

Performance Evaluation of Non-persistent CSMA as Anti-collision Protocol for Active RFID Tags

Contact Info

Product

Resources

About