RFID Reader Anticollision Based on Distributed Parallel Particle Swarm Optimization

Abstract

The deployment of a very large number of readers in a limited space may increase the probability of collision among radio-frequency identification (RFID) readers and reduce the dependability and controllability of Internet-of-Things (IoT) systems. Intelligent computing technologies can be used to realize intelligent management by scheduling resources to circumvent collision issues. In this article, an improved RFID reader anticollision model is constructed by modifying the measure index, introducing a constraint function, and simultaneously considering collisions among readers and between readers and tags. The dense deployment of large numbers of readers increases the number of variables to be encoded, resulting in a high-dimensional problem that cannot be effectively and efficiently solved by traditional algorithms. Accordingly, distributed parallel cooperative co-evolution particle swarm optimization (DPCCPSO) is proposed. The inertia weight and learning factors are adjusted during evolution, and an improved grouping strategy is presented. Moreover, various combinations of random number generation functions are tested. For improved efficiency, DPCCPSO is implemented with distributed parallelism. Experimental verification shows that the proposed novel algorithm exhibits superior performance to existing state-of-the-art algorithms, particularly when numerous RFID readers are deployed.