Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/486859
Title: Path optimization and localization of mobile RFID reader
Authors: Mohd Zaki Zakaria (P41869)
Supervisor: Yusoff Jamaluddin, Prof. Madya Dr.
Keywords: RFID reader
Triangulation technique
Path
Localization
Universiti Kebangsaan Malaysia -- Dissertations
Issue Date: 10-Jun-2017
Description: Radio Frequency Identification (RFID) is a one of the fastest growing and most beneficial technologies being adopted by businesses today. One of the important issues is localization of items in a warehouse or business premise and to keep track of the said items, it requires devices which are costly to deploy. This is because many readers need to be placed in a search space. In detecting an object, a reader will only report the signal strength of the tag detected. Once the signal strength report is obtained, the system will compute the coordinates of the RFID tags based on each data grouping. The current technique to compute the object's coordinates is the triangulation technique; however, it requires lot of readers to be deployed. The proposal to overcome this limitation is to utilize single mobile RFID reader to detect the tags and develop simulation software using triangulation technique to detect object location using passive RFID tag. The navigation of mobile RFID should be optimized to ensure the search area is fully covered by the reader. It is important to define the location of the RFID reader and to find the best way to place the nodes in a given area that guarantees 100% coverage with least possible number of readers. In detecting an object, a reader will only report the signal strength of the tag detected. Once the signal strength report is obtained, the system will compute the coordinates of the RFID tags based on each data grouping. Optimization of path for mobile RFID reader can be viewed as searching for the best path, in principle, any techniques can be used to solve them such as metaheuristic or searching algorithm technique. Searching the path can be looked upon as a combinatorial optimization and it is minimum path for complete circle of search space. It has a cost associated with it as given by cost function. Iteration is a set of moves available to go from one node to another node. The number of nodes proportionally increases by factorial for RFID reader movement. Through this research, algorithms using genetic algorithm, particle swarm, ant colony optimization, hybrid and dual hybrid intelligent techniques are proposed to achieve the shortest path for an RFID mobile reader, while covering full search area. In comparison, 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, an algorithm that computes the location of items in the search area is used. The simulation results show that the dual hybrid method works more effectively and efficiently compare to others when solving shortest path problems. The dual hybrid using combination of two hybrids i.e. GA-ACO and PSO-ACO which is a matric pheromone from ACO playing an important function for GA and PSO to determine the next node to be chosen in completing one iteration. For this Simulation, the number of iteration is divided by four (4) categories which is 100 x 100, 500x100, 100x500 and 500x500.,Ph.D.
Pages: 155
Publisher: UKM, Bangi
Appears in Collections:Faculty of Engineering and Built Environment / Fakulti Kejuruteraan dan Alam Bina

Files in This Item:
File Description SizeFormat 
ukmvital_97861+SOURCE1+SOURCE1.0.PDF
  Restricted Access
7.01 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.