An effective extension of anti-collision protocol for RFID in the industrial internet of things (IIoT)

16Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

The Industrial Internet of Things (IIoT) is often presented as a concept that is significantly changing industry, yet continuous improvements in the identification and automation of objects are still required. Such improvements are related to communication speed, security, and reliability, critical attributes for industrial environments. In this context, the radio-frequency identification (RFID) systems present some issues related to frame collision when there are several tags transmitting data. The dynamic framed-slotted ALOHA (DFSA) is a widely used algorithm to solve collision problems in RFID systems. DFSA dynamically adjusts the frame length based on estimations of the number of labels that have competed for slots in the previous frame. Thus, the accuracy of the estimator is directly related to the label identification performance. In the literature, there are several estimators proposed to improve labels identification accuracy. However, they are not efficient when considering a large tag population, requiring a considerable amount of computational resources to perform the identification. In this context, this work proposes an estimator, which can efficiently identify a large number of labels without requiring additional computational resources. Through a set of simulations, the results demonstrate that the proposed estimator has a nearly ideal channel usage efficiency of 36.1%, which is the maximum efficiency of the DFSA protocol.

Author supplied keywords

Cite

CITATION STYLE

APA

de Barros Filho, I. E., Silva, I., & Viegas, C. M. D. (2018). An effective extension of anti-collision protocol for RFID in the industrial internet of things (IIoT). Sensors (Switzerland), 18(12). https://doi.org/10.3390/s18124426

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free