Optimal frame tuning for aloha protocols in RFID networks

Thomas F. La Porta, Gaia Maselli, Chiara Petrioli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
DOIs
StatePublished - Nov 16 2009
Event2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 - Rome, Italy
Duration: Jun 22 2009Jun 26 2009

Other

Other2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
CountryItaly
CityRome
Period6/22/096/26/09

Fingerprint

Radio frequency identification (RFID)
Tuning
Binary trees
Identification (control systems)
efficiency
simulation
time

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

La Porta, T. F., Maselli, G., & Petrioli, C. (2009). Optimal frame tuning for aloha protocols in RFID networks. In 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 [5172951] https://doi.org/10.1109/SAHCNW.2009.5172951
La Porta, Thomas F. ; Maselli, Gaia ; Petrioli, Chiara. / Optimal frame tuning for aloha protocols in RFID networks. 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009. 2009.
@inproceedings{2887ad6f8698416fa782e6e937237f6d,
title = "Optimal frame tuning for aloha protocols in RFID networks",
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.",
author = "{La Porta}, {Thomas F.} and Gaia Maselli and Chiara Petrioli",
year = "2009",
month = "11",
day = "16",
doi = "10.1109/SAHCNW.2009.5172951",
language = "English (US)",
isbn = "9781424439386",
booktitle = "2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009",

}

La Porta, TF, Maselli, G & Petrioli, C 2009, Optimal frame tuning for aloha protocols in RFID networks. in 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009., 5172951, 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009, Rome, Italy, 6/22/09. https://doi.org/10.1109/SAHCNW.2009.5172951

Optimal frame tuning for aloha protocols in RFID networks. / La Porta, Thomas F.; Maselli, Gaia; Petrioli, Chiara.

2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009. 2009. 5172951.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Optimal frame tuning for aloha protocols in RFID networks

AU - La Porta, Thomas F.

AU - Maselli, Gaia

AU - Petrioli, Chiara

PY - 2009/11/16

Y1 - 2009/11/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71049118919&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049118919&partnerID=8YFLogxK

U2 - 10.1109/SAHCNW.2009.5172951

DO - 10.1109/SAHCNW.2009.5172951

M3 - Conference contribution

SN - 9781424439386

BT - 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009

ER -

La Porta TF, Maselli G, Petrioli C. Optimal frame tuning for aloha protocols in RFID networks. In 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009. 2009. 5172951 https://doi.org/10.1109/SAHCNW.2009.5172951