A Novel AISA-Based Resource Scheduling Method for Reader Collision Problem in RFID Systems

摘要

Within RFID systems, it is possible that a group of readers interfere with each other if they are transmitting and/or receiving signals at the same time. In this case, it is called reader collision problems, including reader-to-reader collision and reader-to-tag collision. Generally, the reader-to-reader collision is decreased by maximizing the system utility, which is related with time slots and frequencies. As a result, the reader-to-reader collision problem could be transferred as a resource schedule problem by optimizing the system utility. Artificial Immune System Algorithm (AISA) is an emerging heuristic evolutionary method widely applied to scientific and engineering problems. This paper proposes an improved AISA for RFID reader-to-reader collision problem by redesigning the encoding format, mutation operator and suppression operators. The numerical simulation results indicate that this proposed method is an effective reader-to-reader anti-collision schema, and performs better in total effective interrogation area than the classical random method (RM).