Set-Cover Approximation Algorithms for Load-Aware Readers Placement in RFID Networks

Abstract

Radio Frequency Identification (RFID) is an emerging wireless technology that poses new fundamental challenges. Coverage in RFID networks, which is one of these challenges, is the ability to accurately read a set of RFID tags. Accurate coverage is of utmost importance in RFID networks as missing some tags may result in missing important events and, for some RFID applications, losing asset and revenue. In this paper, we address an optimization problem related to the deployment of RFID readers to cover a set of RFID tags with the objectives of minimizing the number of readers, reducing overlapping among readers coverage, and balancing the load. We propose a set-cover based approximation algorithm for RFID coverage with the minimum number of readers. We extend this algorithm to consider the objective of reducing overlapping and interference among readers interrogation ranges. And finally, we give a load balancing algorithm that evenly distributes the load among different readers. Comprehensive experiments that study the performance of our algorithms are presented. Keywords— RFID, approximation algorithms, load balancing, readers placement, set cover

DOI: 10.1109/icc.2011.5963396

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Ali2011SetCoverAA, title={Set-Cover Approximation Algorithms for Load-Aware Readers Placement in RFID Networks}, author={Kashif Ali and Waleed Alsalih and Hossam S. Hassanein}, booktitle={ICC}, year={2011} }