| Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 98 === In Radio Frequency Identification (RFID) systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. One important approach of the RFID tag identification protocol is Query Tree protocol (QT). In general RFID applications, a RFID system has a database, which owns all tag IDs that possibly occur. Thus, we consider the case that the RFID system has this knowledge and propose a Query Tree protocol with Shortcutting and Couple-resolution techniques (QTSC). From the database of RFID system, QTSC constructs a knowledge-based query tree, which stores each query that can identifies each tag stored in the database. Then, QTSC not only uses the shortcutting technique, which searches this knowledge-based query tree to skip many redundant queries, but also adopts the couple-resolution technique to couple two tags by simultaneously transmitting two ID prefixes from the reader for reducing the identification delay time. Our simulation results show that QTSC obviously outperforms QT and the previous method, namely, Knowledge-based Query Tree protocol (KQT).
|
|---|
