Title: A simple performance analysis of RFID networks with binary tree collision arbitration

Authors: Gianluigi Ferrari, Fabio Cappelletti, Riccardo Raheli

Addresses: Information Engineering Department, University of Parma, Italy. ' Selta SpA, Cadeo (PC), Italy. ' Information Engineering Department, University of Parma, Italy

Abstract: Radio Frequency Identification (RFID) networks are becoming a widespread technology in industry and commerce. In this paper, we propose a simple performance analysis of RFID networks, based on the binary tree collision arbitration protocol. We evaluate various network performance metrics such as throughput, delay and average number of packets needed to take a census of the RFID tags. In order to validate our analytical results, we develop a simple, yet accurate, simulator and show that the predicted analytical performance is in good agreement with the simulation results. While the analytical approach does not take into account the communication channel characteristics, we evaluate, through simulations, the impact of fading and topology (in terms of tag spatial density) on the network performance.

Keywords: radio frequency identification; RFID networks; binary tree protocol; delay; throughput; fading; tag spatial density; simulations; collision arbitration; network performance; performance evaluation; RFID tags.

DOI: 10.1504/IJSNET.2008.022112

International Journal of Sensor Networks, 2008 Vol.4 No.3, pp.194 - 208

Published online: 18 Dec 2008 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article