RFID Network Planning Based on MCPSO Alogorithm

Radio Frequency Identification (RFID) has a widespread application in reality, and RFID wireless network planning is a core challenge in the deployment of RFID networks. This paper presents a new approach for optimal scheduling of RFID network based on our proposed MCPSO algorithm. RFID network planning problem is identified as a graph partitioning problem by mapping the readers in RFID network into the particles in MCPSO algorithm. The optimal scheduling schemes can be obtained through the competition and collaboration of particles in MCPSO. Our proposed method is evaluated against a test scenario using a RFID network with 15 readers. The simulation results are also compared with standard PSO, BFO and greedy algorithm to demonstrate the effectiveness and efficiency of MCPSO.