Slotted scheduled tag access in multi-reader RFID systems

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2007, Pages 61-70

  Zhou, Zongheng ^a   Gupta, Himanshu ^b   Das, Samir R ^b   Zhu, Xianjin ^b  

^a Askcom ^*

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRALIZED ALGORITHMS; EXTENSIVE SIMULATIONS; INTERNATIONAL CONFERENCES; MULTIPLE CHANNELS; NP-HARD; OPTIMAL NUMBER; PHYSICAL SPACE; RADIO FREQUENCY IDENTIFICATION (RF ID); RADIO FREQUENCY IDENTIFICATION (RF ID) TAG; RADIO FREQUENCY IDENTIFICATION (RFID) SYSTEMS; RFID READERS; SINGLE CHANNEL (SC); TIME MODELING; TIME SLOT (TS);

ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTERNET; KETONES; NETWORK PROTOCOLS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; RADIO FREQUENCY IDENTIFICATION (RFID); RADIO NAVIGATION;

APPROXIMATION ALGORITHMS;

EID: 48349129475     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2007.4375837     Document Type: Conference Paper

References (20)

1. Passive RFID basics, 1998. http://ww1.microchip.com/downloads/en/ AppNotes/00680b.pdf.
2. Class 1 gen. 2 uhf air interface protocol standard version 1.0.9, 2005.
3. N. Abramson. The ALOHA system - another alternative for computer communication. In Joint Computing Conference Proceedings, 1970.
4. H. Bronnimann and M. Goodrich. Almost optimal set covers in finite VC-dimension: (preliminary version). In SoCG, 1994.
5. I. Chlamtac, C. Petrioli, and J. Redi. Energy-conserving access protocols for identification networks. In IEEE/ACM ToN, 1999.
6. T. Cormen et al. Introduction to Algorithms. McGraw Hill, 2001.
7. V. Deolalikar et al. Perturbative time and frequency allocations for RFID reader networks. Technical report, HP Labs, 2005.
8. H. Gupta et al. Connected sensor cover: Self-organization of sensor networks for efficient query execution. In IEEE/ACM ToN, 2006.
9. J. Ho, D. Engels, and S. Sarma. HiQ: A hierarchical q-learning algorithm to solve the reader collision problem. In SAINTW, 2006.
10. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32, 1985.
11. H. Hunt et al. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms, 26, 1998.
12. D. Hush and C. Wood. Analysis of tree algorithms for RFID arbitration. In Proc. of ISIT, 1998.
13. S. Jain and S. R. Das. Collision avoidance in multi-reader RFID networks. In WiNTECH, 2006.
14. M. Kodialam and T. Nandagopal. Fast and reliable estimation schemes in RFID systems. In MobiCom, 2006.
15. C. Law, K. Lee, and K. Siu. Efficient memoryless protocol for tag identification. In Intl. Wksp. on Dis. Algos. and Methods, 2000.
16. J. Myung and W. Lee. Adaptive splitting protocols for RFID tag collision arbitration. In MobiHoc, 2006.
17. H. Vogt. Efficient object identification with passive RFID tags. In Proc. of the Intl. Conf. on Pervasive Computing, 2002.
18. J. Waldrop, D. Engels, and S. Sarma. Colorwave: A MAC for RFID reader networks. In Proc. of WCNC, 2003.
19. W. Wang et al. Efficient interference-aware TDMA link scheduling for static wireless networks. In MobiCom, 2006.
20. Z. Zhou, H. Gupta, S. Das, and X. Zhu. Slotted scheduled tag access in multi-reader RFID systems. Technical report, Stony Brook U., 2007. http://www.cs.sunysb.edu/~hgupta/ps/rfid.pdf.