期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2015
卷号：77
期号：1
出版社：Journal of Theoretical and Applied
摘要：Optimization for an RFID reader is an important technique to reduce the cost of hardware; we need to define the location of the RFID reader to ensure the node will be fully covered by the reader. It is also essential to find the best way to place the nodes in a given area that guarantees 100% coverage with least possible number of readers. In this paper, we propose a novel algorithm using particle swarm and ant colony optimization techniques to achieve the shortest path for an RFID mobile reader, and at the same time, ensure 100% coverage in the given area. For path optimization, the mobile reader traverses from one node to the next, moving around encountered obstacles in its path. The tag reading process is iterative, in which the reader arrives at its start point at the end of each round. Based on the shortest path, we use an algorithm that computes the location of items in the given area. After development of a simulation prototype, the algorithm achieves promising results. Experimental results with benchmarks having up to 150 nodes show that the ant colony optimization (ACO) method works more effectively and efficiently than particle swarm optimization (PSO) when solving shortest path problems.
