Optimizing Large-Scale RFID Networks with Energy-Efficient Dynamic Cluster Head Selection: A Performance Improvement Approach

This paper focuses on the use of radio frequency signals for non-contact tracking and localization utilising Radio Frequency Identification (RFID) technology. The clustering approach is quite useful when dealing with large RFID readers. This method stimulates the expansion of RFID nodes without comp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 12; p. 1
Main Authors: Pandian, M. Thurai, Somasundaram, Devaraj, Sahu, Hemanta Kumar, Sindhu, A S, Kumaresan, A, Watson, Naveen VijayaKumar
Format: Journal Article
Language:English
Published: Piscataway IEEE 01-01-2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper focuses on the use of radio frequency signals for non-contact tracking and localization utilising Radio Frequency Identification (RFID) technology. The clustering approach is quite useful when dealing with large RFID readers. This method stimulates the expansion of RFID nodes without compromising the overall network performance. The Cluster Head (CH) is the most critical node in a clustered RFID system. This research presents a method for dynamically selecting the cluster head that takes the connectivity and power of each RFID reader into account. In dynamic mode, selecting a new cluster head is based on Fuzzy Logic. Based on these data, the energy level of 0.443 and centrality of 0.809 are the thresholds at which a node has a 91.8 % chance of becoming a CH. The management of massive RFID networks is also handled, with cluster numbers increasing at different time intervals. The RFID network's effectiveness is determined by measuring throughput, accuracy, delay, success, and error rates. The network may accommodate up to a thousand nodes with 13 node leaders for improved capacity. The results show a 97.8 % success rate, 0.22 % accuracy, a 2.64 % error rate, and a 36.91 second latency.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2024.3378528