Skip to main navigation Skip to search Skip to main content

A multi-objective meta-heuristic for RFID network planning optimization

  • State University of New York Binghamton University

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

Radio Frequency Identification (RFID) technology is increasingly used for tracking and identification purposes. RFID network planning can be considered a difficult optimization problem due to limitations in communications between RFID readers and tags such as short coverage range, power consumption, and interference. This research proposes a multi-objective metaheuristic that maximizes tag coverage and minimizes interference, transmit power consumption, and number of readers in RFID network planning under the constraints of communication distance thresholds, limited number of channels, and transmit power boundaries. In order to allocate tag readers and their assigned frequency channels, unlike existing approaches in the literature, the proposed algorithm considers the dynamic behavior of the network, where wireless propagation, tags movements between readers, and noise existence are included. In addition, the two metaheuristic algorithms, Grey Wolf Optimization (GWO) and Firefly Algorithm (FFA), are compared.

Original languageEnglish
Pages342-347
Number of pages6
StatePublished - 2018
Event2018 Institute of Industrial and Systems Engineers Annual Conference and Expo, IISE 2018 - Orlando, United States
Duration: May 19 2018May 22 2018

Conference

Conference2018 Institute of Industrial and Systems Engineers Annual Conference and Expo, IISE 2018
Country/TerritoryUnited States
CityOrlando
Period05/19/1805/22/18

Keywords

  • Firefly algorithm
  • Grey Wolf optimization
  • Multi-objective optimization
  • Network planning
  • Radio frequency identification
  • Swarm intelligence

Fingerprint

Dive into the research topics of 'A multi-objective meta-heuristic for RFID network planning optimization'. Together they form a unique fingerprint.

Cite this