Skip to Main Content
In dense Radio Frequency Identification environments, several readers are placed in the same area to scan a large number of tags covering a wide distance range. The placement of the RFID elements may result in several types of collisions. This paper proposes a new distributed multi-channel algorithm to solve the reader collision problems in dense RFID environments. The proposed algorithm aims at minimizing the identification delay, collision probabilities, and network overheads. We have evaluated the performance of the proposed approach and compared it to several reader collision solutions found in the literature such as NFRA, Dica and McMac. The results show that the proposed approach reduces reader collisions while minimizing the total interrogation time and the network overheads.