RFID queries—single category
The key technical contribution of this chapter is in proposing a protocol to search tags in a population of RFID tags. This chapter represents the first effort on addressing this important and practical problem for C1G2 compliant RFID systems. The key technical depth of this chapter is in the mathematical development of the theory that RTSP is based on. The solid theoretical underpinning ensures that RTSP always achieves the required confidence interval. We have proposed a technique to handle large frame sizes to ensure the compliance with the C1G2 standard. We have also proposed a method to implicitly estimate the number of tags in set C. We implemented RTSP and conducted side-by-side comparisons with TH, the fastest prior tag identification protocol. Our experimental results show that RTSP always achieves the required confidence interval and significantly outperforms TH in terms of search time.
RFID queries—single category, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/ce/pbce112e/PBCE112E_ch7-1.gif /docserver/preview/fulltext/books/ce/pbce112e/PBCE112E_ch7-2.gif