A Maximum-Weight-Independent-Set-Based Algorithm for Reader-Coverage Collision Avoidance Arrangement in RFID Networks

Radio frequency identification (RFID) systems have been widely developed and applied in identification applications. In RFID systems, a tag can be read by a reader when the tag is within the reader's interrogation range. Reader deployment has received a great deal of attention for providing a certain service quality. Many studies have addressed deploying/activating readers such that all the tags in a field can be read. However, in a practical environment, tags cannot be read due to collisions. In addition, the number of tags read by a reader is often limited due to the constraints of processing time and link layer protocols. This motivated us to study the problem of activating readers and adjusting their interrogation ranges to cover maximum tags without collisions subject to the limited number of tags read by a reader, termed the reader-coverage collision avoidance arrangement (RCCAA) problem. In this paper, the RCCAA problem is shown to be NP-complete. In addition, an approximation algorithm, termed the maximum-weight-independent-set-based algorithm (MWISBA), is proposed for the RCCAA problem. The simulation results show that the MWISBA provides good performance for the RCCAA problem.

[1]  Tomotaka Wada,et al.  A Multi-Sensing-Range Method for Position Estimation of Passive RFID Tags , 2008, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[2]  Ananth Grama,et al.  Redundant reader elimination in RFID systems , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[3]  Lei Yang,et al.  Season: Shelving interference and joint identification in large-scale RFID systems , 2011, 2011 Proceedings IEEE INFOCOM.

[4]  Yi Zhi Zhao,et al.  Distributed Design of RFID Network for Large-Scale RFID Deployment , 2006, 2006 4th IEEE International Conference on Industrial Informatics.

[5]  Gabriel Valiente,et al.  A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs , 2003, ISAAC.

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

[7]  George Q. Huang,et al.  RFID-based wireless manufacturing for real-time management of job shop WIP inventories , 2008 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[10]  Anxiao Jiang,et al.  Separability and Topology Control of Quasi Unit Disk Graphs , 2007, INFOCOM.

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

[12]  José A. Gallud,et al.  Using active and passive RFID technology to support indoor location-aware systems , 2008, IEEE Transactions on Consumer Electronics.

[13]  Illya V. Hicks,et al.  A branch-and-price approach for the maximum weight independent set problem , 2005 .

[14]  Peter H. Cole,et al.  Synchronization of RFID readers for dense RFID reader environments , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[15]  Daniel W. Engels,et al.  Colorwave: a MAC for RFID reader networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[16]  Yunhao Liu,et al.  LANDMARC: Indoor Location Sensing Using Active RFID , 2004, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

[17]  Samuel C. Yang,et al.  Leveraging RFID in hospitals: Patient life cycle and mobility perspectives , 2007, IEEE Communications Magazine.

[18]  Prashant J. Shenoy,et al.  Probabilistic Inference over RFID Streams in Mobile Environments , 2009, 2009 IEEE 25th International Conference on Data Engineering.

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

[20]  Jiann-Liang Chen,et al.  Architecture design and performance evaluation of RFID object tracking systems , 2007, Comput. Commun..

[21]  Tomotaka Wada,et al.  An Adaptive Multi-Range-Sensing Method for 3D Localization of Passive RFID Tags , 2012, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[22]  Shaojie Tang,et al.  Reader Activation Scheduling in Multi-reader RFID Systems: A Study of General Case , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[23]  Dursun Delen,et al.  An RFID network design methodology for asset tracking in healthcare , 2010, Decis. Support Syst..

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

[25]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[26]  Christian Floerkemeier,et al.  RFID Application Development With the Accada Middleware Platform , 2007, IEEE Systems Journal.

[27]  Chao Chen,et al.  Hardness Results for Homology Localization , 2010, SODA '10.

[28]  Klaus Finkenzeller,et al.  Rfid Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification , 2003 .

[29]  S. Sandoval-Reyes,et al.  Mobile RFID reader with database wireless synchronization , 2005, 2005 2nd International Conference on Electrical and Electronics Engineering.

[30]  Ching-Hsien Hsu,et al.  An Efficient Method for Optimizing RFID Reader Deployment and Energy Saving , 2013, ArXiv.

[31]  Yu Liu,et al.  Genetic Approach for Network Planning in the RFID Systems , 2006, Sixth International Conference on Intelligent Systems Design and Applications.