Decentralized RFID Coverage Algorithms With Applications for the Reader Collisions Avoidance Problem

We aim in this paper at eliminating data and reader redundancies in Radio Frequency Identification (RFID) reader networks. These redundancies have negative impact on the performance of an RFID reader network and in analyzing the readings of the network. We meet our objectives by introducing decentralized RFID coverage [reader collision avoidance (RCA)] algorithm. The RFID coverage problem consists of two subproblems: 1) the tag reporting problem, which aims at assigning to each tag in the network a reader responsible for reporting its data and 2) the redundant readers elimination problem, which aims at minimizing the number of readers in the network while preserving the tags coverage. We introduce two deterministic decentralized RFID coverage algorithms called orientation-based coverage and iterated orientation-based coverage (IOB-COVERAGE). The first algorithm runs in one communication round, whereas the latter runs in O(n) rounds, where n is the number of readers in the network. These algorithms are the first decentralized RFID coverage algorithms that use reader-to-reader communications only. We later introduce an algorithm that solves the RCA algorithm, called IOB-(RCA+COV). The algorithm is a minor modification of IOB-COVERAGE. We formally prove the correctness of our algorithms, and we use detailed simulation experiments to study their performance.

[1]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[2]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3]  Gerard Tel.  Total Algorithms , 1988, Concurrency.

[4]  David Peleg,et al.  Time-Optimal Leader Election in General Networks , 1990, J. Parallel Distributed Comput..

[5]  Earl E. Swartzlander,et al.  A Spanning Tree Carry Lookahead Adder , 1992, IEEE Trans. Computers.

[6]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[7]  Daniel W. Engels,et al.  Colorwave: an anticollision algorithm for the reader collision problem , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[8]  Di Tian,et al.  Connectivity maintenance and coverage preservation in wireless sensor networks , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[9]  Joongheon Kim,et al.  Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[10]  Gabriel H. Loh,et al.  The impact of 3-dimensional integration on the design of arithmetic units , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[11]  Yu-Chee Tseng,et al.  Efficient in-network moving object tracking in wireless sensor networks , 2006, IEEE Transactions on Mobile Computing.

[12]  Daniel W. Engels,et al.  HiQ: a hierarchical Q-learning algorithm to solve the reader collision problem , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[13]  David C. Yen,et al.  Taxonomy and survey of RFID anti-collision protocols , 2006, Comput. Commun..

[14]  Himanshu Gupta,et al.  Slotted Scheduled Tag Access in Multi-Reader RFID Systems , 2007, 2007 IEEE International Conference on Network Protocols.

[15]  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).

[16]  Jonathan Katz,et al.  Introduction to Modern Cryptography: Principles and Protocols , 2007 .

[17]  Xue Li,et al.  RFID Data Management: Challenges and Opportunities , 2007, 2007 IEEE International Conference on RFID.

[18]  Joongheon Kim,et al.  Optimized transmission power control of interrogators for collision arbitration in UHF RFID systems , 2007, IEEE Communications Letters.

[19]  Narayanan Vijaykrishnan,et al.  Architecting Microprocessor Components in 3D Design Space , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[20]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[21]  Tao Li,et al.  Microarchitecture soft error vulnerability characterization and mitigation under 3D integration technology , 2008, 2008 41st IEEE/ACM International Symposium on Microarchitecture.

[22]  Roger Fabian W. Pease,et al.  Lithography and Other Patterning Techniques for Future Electronics , 2008, Proceedings of the IEEE.

[23]  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.

[24]  Nitin H. Vaidya,et al.  RFID-based networks: exploiting diversity and redundancy , 2008, MOCO.

[25]  Shaojie Tang,et al.  RASPberry: A stable reader activation scheduling protocol in multi-reader RFID systems , 2009, 2009 17th IEEE International Conference on Network Protocols.

[26]  Subarna Sinha,et al.  The road to 3D EDA tool readiness , 2009, 2009 Asia and South Pacific Design Automation Conference.

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

[28]  Jukka Suomela,et al.  Optimisation problems in wireless sensor networks: Local algorithms and local graphs , 2009 .

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

[30]  Stephan Haller,et al.  The Things in the Internet of Things , 2010 .

[31]  Arjen K. Lenstra,et al.  Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.

[32]  Ivan Stojmenovic,et al.  RFID Systems: Research Trends and Challenges , 2011 .

[33]  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.

[34]  Maurizio Rebaudengo,et al.  Probabilistic DCS: An RFID reader-to-reader anti-collision protocol , 2011, J. Netw. Comput. Appl..

[35]  Sung Kyu Lim,et al.  Slew-aware buffer insertion for through-silicon-via-based 3D ICs , 2012, Proceedings of the IEEE 2012 Custom Integrated Circuits Conference.

[36]  Peter Ramm,et al.  Handbook of 3D integration : technology and applications of 3D integrated circuits , 2012 .

[37]  Hiroshi Takahashi,et al.  A 1/4-inch 8Mpixel back-illuminated stacked CMOS image sensor , 2013, 2013 IEEE International Solid-State Circuits Conference Digest of Technical Papers.

[38]  Charu C. Aggarwal,et al.  A Survey of RFID Data Processing , 2013, Managing and Mining Sensor Data.

[39]  H. T. Mouftah,et al.  Distributed algorithms for the RFID coverage problem , 2013, 2013 IEEE International Conference on Communications (ICC).

[40]  Sorin Cotofana,et al.  3D stacked wide-operand adders: A case study , 2013, 2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors.

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

[42]  John U. Knickerbocker,et al.  An overview of through-silicon-via technology and manufacturing challenges , 2015 .

[43]  volume , 2018, Elsa Prochazka - architectureality.