On scheduling transmissions for hidden terminal problems in dynamic RFID systems

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 paper, 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. 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.