MAC Protocols for RFID Systems

Abstract

Radio Frequency Identification (RFID) has become widespread thanks to its important advantages over traditional identification technologies, like barcodes. Compared to this technology, RFID is, in fact, able to cover larger distance and does not require line-of-sight, that represent important improvements in the considered field of application. An RFID system is formed by a set of n tags, that represent clients in the identification process, and a tag reader, that is the identification server. Each tag is associated with an identifier (ID), that must be transmitted to the reader upon receipt of a suitable identification query. Tags can be active, i.e. provided with an independent power supply (like a battery), or passive. In the latter case, tags depend on energy provided by the tag reader through its queries (Want, 2006). For this reason, active tags can have some data processing ability, while passive tags are limited to doing only elementary operations and replying to the reader’s queries. An important issue in Radio Frequency Identification systems concerns the reading of colocated tags, that must be managed through suitable Medium Access Control (MAC) protocols, specifically designed for low power devices. Efficiency of MAC protocols for RFID systems directly influences the time needed by the tag reader for completely identifying a set of co-located tags, so it has great impact on the whole system performance. A deep analysis of the MAC technologies adopted in RFID is the aim of this chapter. We denote by Ttot(n) the time needed by the tag reader for completely identifying a set of n tags. Under ideal conditions, it should be Ttot(n) = nTpkt, where Tpkt is the time needed to transmit one identification packet. However, in order to ensure collision-free transmission to each tag, a MAC protocol is needed that, inevitably, produces a time waste with respect to the ideal condition. The time actually needed for identification depends on several factors, like the technology adopted, the working frequency, etc. So, RFID systems can exhibit very different reading rates, typically ranging between 100 Tag/s and 1000 Tag/s. The most common MAC protocols used in RFID systems can be grouped into two classes: deterministic protocols and stochastic protocols. Deterministic protocols basically coincide with tree traversal algorithms: all RFID tags form a binary tree on the basis of their identifiers, and the reader explores the tree in a systematic way, by repeating queries based on bit masks. Randomness is only in the tree structure (due to the choice of the co-located tag set), while the algorithm execution is pre-determined. Stochastic MAC protocols are instead based on the framed slotted Aloha (FSA) algorithm, that requires each tag to make a constrained pseudo-random choice of an integer number in order to reduce the probability of collisions.