Randomized algorithms
Performance evaluation of the Orca shared-object system
ACM Transactions on Computer Systems (TOCS)
Efficient memoryless protocol for tag identification (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
RFID Systems and Security and Privacy Implications
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Proceedings of the 2004 international symposium on Low power electronics and design
HiQ: A Hierarchical Q-Learning Algorithm to Solve the Reader Collision Problem
SAINT-W '06 Proceedings of the International Symposium on Applications on Internet Workshops
Redundancy and coverage detection in sensor networks
ACM Transactions on Sensor Networks (TOSN)
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
PULSE: a MAC protocol for RFID networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Perturbative time and frequency allocations for RFID reader networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP)
Computers and Operations Research
Tagging requirements for web application
Proceedings of the 5th India Software Engineering Conference
RFID-based patient tracking for regional collaborative healthcare
International Journal of Computer Applications in Technology
A fuzzy k-coverage approach for RFID network planning using plant growth simulation algorithm
Journal of Network and Computer Applications
Hi-index | 0.00 |
Recent technological advances have motivated large-scale deployment of RFID systems. However, a number of critical design issues relating to efficient detection of tags remain unresolved. In this paper, we address three important problems associated with tag detection in RFID systems: (i) accurately detecting RFID tags in the presence of reader interference (reader collision avoidance problem); (ii) eliminating redundant tag reports by multiple readers (optimal tag reporting problem); and (iii) minimizing redundant reports from multiple readers by identifying a minimal set of readers that cover all tags present in the system (optimal tag coverage problem). The underlying difficulties associated with these problems arise from the lack of collision detection mechanisms, the potential inability of RFID readers to relay packets generated by other readers, and severe resource constraints on RFID tags. In this paper we present a randomized, distributed and localized Reader Collision Avoidance (RCA) algorithm and provide detailed probabilistic analysis to establish the accuracy and the efficiency of this algorithm. Then, we prove that the optimal tag coverage problem is NP-hard even with global knowledge of reader and tag locations. We develop a distributed and localized Redundant Reader Elimination (RRE) algorithm, that efficiently identifies redundant readers and avoids redundant reporting by multiple readers. In addition to rigorous analysis of performance and accuracy, we provide results from elaborate simulations for a wide range of system parameters, demonstrating the correctness and efficiency of the proposed algorithms under various scenarios.