The Aloha Anti-collision Algorithms for RFID Systems Using in Smart Hospital

Abstract

One of the areas of research in Radio Frequency Identification (RFID) systems is the reduction of identification processing time for a number of tags in an RFID reader recognition region. During the last decade, numerous research results concerning anti-collision algorithms have been presented in the literature. Most of them are tree-based protocols. However, it is important that tree-based protocols improve the stability and throughput of the system because they may experience long identification delays when the network density is high. In this study, we present a highly efficient prediction-based tree algorithm to obtain more efficient tag identification performance. Our proposed mechanism can effectively reduce collisions and rest cycles by exploiting the pre-detection technique and the adjustable slot size mechanism. The results of the simulation show that the proposed mechanism can effectively improve tag identification time performance from about 29.9 to 64.8% over previous techniques. In addition, the number of request cycles, the number of collisions and the total number of slots are reduced compared to previous prior detection protocols. It is also observed that the proposed scheme may have good performance in large scale RFID systems. The purpose of this paper is to comparing the efficiency of several algorithms with MATLAB.