Reader Activation Scheduling in Multi-reader RFID Systems: A Study of General Case
暂无分享,去创建一个
[1] Daniel W. Engels,et al. Colorwave: a MAC for RFID reader networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..
[2] Vinay Deolalikar,et al. Perturbative Time and Frequency Allocations for RFID Reader Networks , 2006, EUC Workshops.
[3] Harald Vogt,et al. Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.
[4] Klaus Jansen,et al. Polynomial-Time Approximation Schemes for Geometric Intersection Graphs , 2005, SIAM J. Comput..
[5] Daniel W. Engels,et al. RFID Systems and Security and Privacy Implications , 2002, CHES.
[6] Xiaojun Lin,et al. The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.
[7] Imrich Chlamtac,et al. Energy-conserving access protocols for identification networks , 1999, TNET.
[8] Koichi Yamazaki,et al. A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..
[9] D. R. Hush,et al. Analysis of tree algorithms for RFID arbitration , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[10] Yu Wang,et al. Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks , 2006, J. Parallel Distributed Comput..
[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] Kai-Yeung Siu,et al. Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.
[13] Wonjun Lee,et al. Adaptive splitting protocols for RFID tag collision arbitration , 2006, MobiHoc '06.
[14] Harry B. Hunt,et al. NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.
[15] 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).
[16] Murali S. Kodialam,et al. Fast and reliable estimation schemes in RFID systems , 2006, MobiCom '06.
[18] Himanshu Gupta,et al. Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.
[19] Klaus Jansen,et al. Polynomial-time approximation schemes for geometric graphs , 2001, SODA '01.
[20] B ShroffNess,et al. The impact of imperfect scheduling on cross-layer congestion control in wireless networks , 2006 .
[21] Norman M. Abramson,et al. THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).
[22] R. Srikant,et al. Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.
[23] Himanshu Gupta,et al. Slotted Scheduled Tag Access in Multi-Reader RFID Systems , 2007, 2007 IEEE International Conference on Network Protocols.
[24] Samir Ranjan Das,et al. Collision avoidance in a dense RFID network , 2006, WiNTECH.