RASPberry: A stable reader activation scheduling protocol in multi-reader RFID systems

Recent technological advances have motivated large-scale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the distribution and movements of tags are often dynamically changed and unpredictable. We study a challenging problem of scheduling the activation of the readers without collision such that the system can work in a stable way in the long term. Here a schedule is stable if at any time slot, the number of total unread tags is bounded from above with high probability under this scheduling. In this paper, we propose a stable reader activation scheduling protocol, RASPberry, in multi-reader RFID systems. We analytically prove that our scheduling protocol, RASPberry, is stable if the arrival rate of tags is less than the processing rate of all readers. In RASPberry, at any time slot, a reader can determine its status using only information of readers within a local neighborhood. To the best of our knowledge, this is the first work to address the stability problem of reader activation scheduling in RFID systems. Our extensive simulations show that our system performs very well.

[1]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[2]  D. R. Hush,et al.  Analysis of tree algorithms for RFID arbitration , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[3]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[4]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[5]  Imrich Chlamtac,et al.  Energy-conserving access protocols for identification networks , 1999, TNET.

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

[7]  Vinay Deolalikar,et al.  Perturbative Time and Frequency Allocations for RFID Reader Networks , 2006, EUC Workshops.

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

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

[10]  Kai-Yeung Siu,et al.  Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.

[11]  Wonjun Lee,et al.  Adaptive splitting protocols for RFID tag collision arbitration , 2006, MobiHoc '06.

[12]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[13]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[14]  Murali S. Kodialam,et al.  Fast and reliable estimation schemes in RFID systems , 2006, MobiCom '06.

[15]  Samir Ranjan Das,et al.  Collision avoidance in a dense RFID network , 2006, WiNTECH.

[16]  Daniel W. Engels,et al.  RFID Systems and Security and Privacy Implications , 2002, CHES.

[17]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[18]  B ShroffNess,et al.  The impact of imperfect scheduling on cross-layer congestion control in wireless networks , 2006 .