关键词:
RFID network planning optimization
Chaotic particle swarm optimization (CPSO)
BIRCH clustering algorithm
Coverage
Interference
摘要:
The difficulty of deploying an RFID network optimally is brought on by the quick advancement of radio frequency identification (RFID) technology. It has been established that the RFID network planning (RNP) problem, which includes various constraints and objectives, is NP-hard. The research has given a lot of attention to the use of (EC) Evolutionary Computation and (SI) Swarm Intelligence for solving RNP, but the suggested methods experienced trouble regulating the number of readers deployed in the network. The complexity and cost of the network, however, are considerably influenced by the number of installed readers. In this study, we introduced a hybrid (BCPSO) algorithm that seeks to maximize tag coverage while minimizing interference, using as little power and as little load balancing as possible with a little number of readers. The suggested algorithm is a hybrid algorithm made up of a Chaotic Particle Swarm Optimization (CPSO) used to find the best positions for readers that incorporate the chaos approach into the PSO algorithm to increase randomness in the search for the PSO algorithm and addressed the issue of local minima, and a Balanced Iterative Reducing and Clustering using the Hierarchies (BIRCH) algorithm used to automatically count the number of readers and initialize the readers' coordinates. The proposed hybrid BCPSO algorithm improves the coverage of tags by 100% with the fewest readers while avoiding interference, and it also improves load balancing in three cases: case 30 by 99.94%, case 50 by 42.4%, and case 100 by 46.23%, according to comparison results between the proposed algorithm and the other algorithms in Jaballah and Meddeb (J Ambient Intell Human Comput 12:2905-2914, 2021. 10.1007/s12652-020-02446-5). and were compared the proposed hybrid BCPSO algorithm to the proposed algorithm in Cao et al. (Soft Comput 25: 5747-5761, 2021. 10.1007/s00500-020-05569-1), The comparison results demonstrate that the proposed hybrid BCPSO algorithm incre