TDMA Grouping Based RFID Network Planning Using Hybrid Differential Evolution Algorithm

摘要

With the fast development of Radio Frequency Identification (RFID) technology, RFID network has been applied in different aspects of logistic management. How to effectively deploy the readers becomes a crucial problem in RFID network planning. The planning is related to a complicated optimization problem and interference elimination between readers. To find a good solution in the optimization problem effectively, we introduced Differential Evolution algorithm. To minimize the interference between the readers, we applied TDMA on the network and proposed two methods to group the readers. The first method is a modified version of Differential Evolution algorithm. Since part of the problem domain is binary while the searching space of the Differential Evolution algorithm is in a real domain, we modified the mutation rule of the Differential Evolution algorithm so that it can support binary parameters. The other way is to transform the problem into a graph and apply a maximum cut heuristic on it. The experimental result shows that both methods are effective.