Object localization and path optimization using particle swarm and ant colony optimization for mobile rfid reader

Mohd Zaki Zakaria, Mohd. Yusoff Jamaluddin

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)95-104
Number of pages10
JournalJournal of Theoretical and Applied Information Technology
Volume77
Issue number1
Publication statusPublished - 10 Jul 2015

Fingerprint

Ant colony optimization
Radio frequency identification (RFID)
Particle swarm optimization (PSO)
Particle Swarm Optimization
Radio Frequency Identification
Path
Vertex of a graph
Shortest path
Coverage
Particle Swarm Algorithm
Optimization
Shortest Path Problem
Optimization Techniques
Hardware
Optimization Methods
Prototype
Benchmark
Object
Costs
Experimental Results

Keywords

  • ACO
  • Path optimization
  • PSO
  • RFID

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

@article{f75ff8f2de0c48b0bec3b3dacd8cf55c,
title = "Object localization and path optimization using particle swarm and ant colony optimization for mobile rfid reader",
abstract = "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.",
keywords = "ACO, Path optimization, PSO, RFID",
author = "Zakaria, {Mohd Zaki} and Jamaluddin, {Mohd. Yusoff}",
year = "2015",
month = "7",
day = "10",
language = "English",
volume = "77",
pages = "95--104",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "1",

}

TY - JOUR

T1 - Object localization and path optimization using particle swarm and ant colony optimization for mobile rfid reader

AU - Zakaria, Mohd Zaki

AU - Jamaluddin, Mohd. Yusoff

PY - 2015/7/10

Y1 - 2015/7/10

N2 - 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.

AB - 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.

KW - ACO

KW - Path optimization

KW - PSO

KW - RFID

UR - http://www.scopus.com/inward/record.url?scp=84936940831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84936940831&partnerID=8YFLogxK

M3 - Article

VL - 77

SP - 95

EP - 104

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 1

ER -