Download now Free registration required
The performance of RFID MAC algorithms is expressed in terms of the total time it takes by a reader to read all the tags in the reading range. One of the major MAC approaches for RFID systems is the framed slotted ALOHA based approach. It is proven that this class of algorithms achieve the smallest total reading time when, at each reading round, the frame length is set equal to the actual number of remaining unread tags. An important design challenge to increase the performance of this class of algorithms is to estimate the remaining tag count before each reading round. In this paper, the authors address this remaining tag count estimation problem for such RFID systems.
- Format: PDF
- Size: 157.4 KB