Efficient Scheduling Transmissions for Hidden Terminal Problems in Dynamic RFID Systems

• Main Authors: Shu Yuan Lin, 林書源
• Other Authors: Ching-Hsien Hsu
• Format: Others
• Language: en_US
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/35057668485884945434

碩士 === 中華大學 === 資訊工程學系碩士班 === 94 === The problem of scheduling transmissions of dynamic Radio Frequency Identification (RFID) systems has been recently studied. One of the common problems, reader collision avoidance has instigated researchers to propose different heuristic algorithms. In this thesis, we present a prime based First Come Higher Priority (FCHP) transmission scheduling method for reader collision problems that caused by hidden terminal. FCHP is a simple mechanism for coordinating simultaneous transmissions among multiple readers. A significant improvement of this approach is that FCHP prevents reader collisions by giving contention free scheduling. The second advantage of the proposed technique is that FCHP is adaptive in both static and dynamic RFID environments. To evaluate the performance of the proposed technique, we have implemented FCHP along with two other techniques. The simulation results show that the proposed technique provides superior performance in both static and dynamic instances. The FCHP is shown to be effective in terms of system throughput, system efficiency and easy to implement.