Decentralized RFID coverage algorithms using writeable tags

A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID tag in a given area. The RFID coverage (RFC) problem is defined as follows. Given a reader network, assign to each tag t a specific reader v in its proximity such that v is responsible for covering t (called its owner), while minimizing the number of owner readers. The problem has applications in energy conservation and in eliminating readers and data redundancy from the reader networks. We introduce a number of decentralized algorithms for the RFID coverage problem: 1) algorithms RANDOM, RANDOM+, and MAX-MIN which are randomized algorithms that run in O(1) write/read rounds, 2) algorithm GDE which is an efficient decentralized implementation of the greedy set cover algorithm, and 3) an improvement of GDE which is called . Our algorithms assume that the RFID tags are writeable, where a writeable tag is a passive RFID tag with writeable memory. We show using simulation experiments that our algorithms outperform major RFID coverage algorithms in various scenarios with respect to a number of performance metrics.

[1]  Wafaa A. H. Ali Alsalihy,et al.  Enhancement of Redundant Reader Elimination by Using Hybrid Algorithm in RFID Systems , 2013, Wirel. Pers. Commun..

[2]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[3]  Huang Yihua,et al.  A middleware-based approach for redundant reader elimination , 2011, The 5th International Conference on New Trends in Information Science and Service Science.

[4]  Nazish Irfan,et al.  Efficient Approach for Redundant Reader Elimination in Large-Scale RFID Networks , 2010, 2010 First International Conference on Integrated Intelligent Computing.

[5]  Suresh Jagannathan,et al.  Efficient tag detection in RFID systems , 2009, J. Parallel Distributed Comput..

[6]  Ahmed Jedda,et al.  Distributed Algorithms for Networks Formation in a Scalable Internet of Things , 2014 .

[7]  Jan Vitek,et al.  Redundancy and coverage detection in sensor networks , 2006, TOSN.

[8]  Chao-Tung Yang,et al.  A Layered Optimization Approach for Redundant Reader Elimination in Wireless RFID Networks , 2007 .

[9]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[11]  Kun-Ming Yu,et al.  A Density-Based Algorithm for Redundant Reader Elimination in a RFID Network , 2008, 2008 Second International Conference on Future Generation Communication and Networking.

[12]  Mario Cannataro,et al.  Protein-to-protein interactions: Technologies, databases, and algorithms , 2010, CSUR.

[13]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[14]  Koushik Kar,et al.  Load Balancing in Large-Scale RFID Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[15]  Shunzheng Yu,et al.  A fuzzy k-coverage approach for RFID network planning using plant growth simulation algorithm , 2014, J. Netw. Comput. Appl..

[16]  Ramanathan Muthukaruppan,et al.  Optimal Solution for RFID Load Balancing , 2010 .

[17]  H. T. Mouftah,et al.  Decentralized RFID Coverage Algorithms With Applications for the Reader Collisions Avoidance Problem , 2016, IEEE Transactions on Emerging Topics in Computing.

[18]  Hossam S. Hassanein,et al.  Using neighbor and tag estimations for redundant reader eliminations in RFID networks , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[19]  Ching-Hsien Hsu,et al.  A Layered Optimization Approach for Redundant Reader Elimination in Wireless RFID Networks , 2007, The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007).

[20]  Nazish Irfan.  Efficient Algorithm for Redundant Reader Elimination in Wireless RFID Networks , 2010 .