We consider the problem of efficient tag identification in RFID networks. Among the solutions recently proposed for tag identification, a variant of the Framed Slotted Aloha protocol, called Tree Slotted Aloha (TSA), has been shown to achieve the lowest identification delay and highest time system efficiency. However, in case of a large number of tags, this protocol produces an estimate of the tag population size which still differs from the actual number of tags, and utilizes a nonoptimal method for deciding the frame size. In this paper we address the issues of more precise tag number estimation and achieving optimal frame sizing by proposing a new protocol, the Binary Spitting TSA (BSTSA) protocol. Through thorough ns2- based simulations we show that BSTSA considerably outperforms all previous protocols, achieving 80% time system efficiency vs. the 50% achieved by TSA, and reduces the length of the tag identification process of up to 40% with respect to TSA. © 2009 IEEE.
Optimal frame tuning for aloha protocols in RFID networks / Thomas F., La Porta; Maselli, Gaia; Petrioli, Chiara. - (2009), pp. 1-3. (Intervento presentato al convegno 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 tenutosi a Rome nel 22 June 2009 through 26 June 2009) [10.1109/sahcnw.2009.5172951].
Optimal frame tuning for aloha protocols in RFID networks
MASELLI, GAIA;PETRIOLI, Chiara
2009
Abstract
We consider the problem of efficient tag identification in RFID networks. Among the solutions recently proposed for tag identification, a variant of the Framed Slotted Aloha protocol, called Tree Slotted Aloha (TSA), has been shown to achieve the lowest identification delay and highest time system efficiency. However, in case of a large number of tags, this protocol produces an estimate of the tag population size which still differs from the actual number of tags, and utilizes a nonoptimal method for deciding the frame size. In this paper we address the issues of more precise tag number estimation and achieving optimal frame sizing by proposing a new protocol, the Binary Spitting TSA (BSTSA) protocol. Through thorough ns2- based simulations we show that BSTSA considerably outperforms all previous protocols, achieving 80% time system efficiency vs. the 50% achieved by TSA, and reduces the length of the tag identification process of up to 40% with respect to TSA. © 2009 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
