A novel-Q DFSA algorithm for passive RFID system

摘要

The tag detection ability of Passive Radio Frequency Identification (RFID) systems are critically challenged by the collision occurrence due to simultaneous responding tags during the identification process. The dynamic scheduling of the frame size governed by Dynamic Frame Size ALOHA(DFSA) process, by adjusting the frame lengths according to the size of tag population can avoid the collisions during the identification. However, the performance of DFSA majorly depends on the frame size selection policy which in previous studies was adopted to achieve the target of throughput maximization during a frame. This condition is obtained at the cost of equating the frame size up to the number of estimated tags responding during the time frame. This approximation enhances the throughput value but contributes to massive energy wastages as the frame lengths approach to a very large value in large tag population size. Therefore, it is essential to develop the new frame size estimation policy for DFSA achieving the aim of optimization between throughput and energy for improved time and energy performance. In this paper, we have proposed an EPC C1G2 standards based Novel-Q DFSA algorithm which optimizes the frame size accounting both the energy and the throughput. The combined throughput and energy trade-offs are measured through Energy-Time-Delay (ET) cost which is minimum for our proposed algorithm compared to the existing solutions. Furthermore, the Throughput-Time Delay product approves the stability in large population size making it suitable for numerous identification applications. (C) 2017 Elsevier B.V. All rights reserved.