Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks

Bonuccelli, Maurizio A.; Lonetti, Francesca; Martelli, Francesca

doi:10.1109/wowmom.2006.112

Cited by 90 publications

(83 citation statements)

References 9 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to ALOHA throughput improvement, different approaches have been proposed to improve the energy efficiency of (framed) slotted ALOHA [11][12][13][14]. For instance, optimizing the frame size [11] and nodes' access (transmission) probabilities [12] are ways to improve the energy efficiency of slotted ALOHA.…”

Section: State Of the Art On Aloha Protocolmentioning

confidence: 99%

“…For instance, optimizing the frame size [11] and nodes' access (transmission) probabilities [12] are ways to improve the energy efficiency of slotted ALOHA. The work reported in [13] also suggests a probabilistic approach, called tree slotted ALOHA, to lower the number of transmissions in the system which consequently results in energy saving. In this work, we attempt to improve the energy efficiency of ALOHA protocol via exploiting adaptive access probabilities at the users.…”

Section: State Of the Art On Aloha Protocolmentioning

confidence: 99%

“…Here, (13) comes from the fact that the user's access probability is in state S 1, j). Now, the average probability of access in time slot m is Here, P[ T I (i) = 1] is the probability of having T I (i) = 1.…”

Section: Analysis Of the Average Access Probabilitymentioning

confidence: 99%

See 2 more Smart Citations

An energy-efficient adaptive frameless ALOHA protocol

Rahimian

Noori

Ardakani

2016

J Wireless Com Network

View full text Add to dashboard Cite

Random access protocols are a key feature of a family of emerging communication networks such as machine-to-machine, radio frequency identification (RFID), and sensor networks. To accommodate the needs of such networks with a massive number of uncoordinated devices, new random multiple access (MAC) protocols have been proposed that aim to improve the system efficiency by resolving collisions in the received signal. In this work, we consider one of such protocols, called frameless ALOHA, and propose two techniques to improve its energy efficiency without sacrificing the network throughput. More specifically, we propose mechanisms to adaptively control the access probability at the users. The proposed mechanisms are local and like the original frameless ALOHA, no coordination between the users is needed. Our simulation results verify the improvement achieved in the energy efficiency by the proposed techniques.

show abstract

Section: State Of the Art On Aloha Protocolmentioning

confidence: 99%

Section: State Of the Art On Aloha Protocolmentioning

confidence: 99%

See 1 more Smart Citation

An energy-efficient adaptive frameless ALOHA protocol

Rahimian

Noori

Ardakani

2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The reader continues splitting and probing until each individual tag is identified (Law et al, 2000;Micic et al, 2005;Myung and Lee, 2005). The second category is based on the ALOHA protocol and the Slotted ALOHA protocol (Madden et al, 2002a;Cha and Kim, 2005;Bonuccelli et al, 2006;Sheng et al, 2008;Tan et al, 2008;Sheng et al, 2010;Xie et al, 2010). Probabilistic estimation algorithms which efficiently estimate the cardinality of RFID tags have been proposed in numerous works (Cha and Kim, 2006;Kodialam and Nandagopal, 2006;Qian et al, 2008;Han et al, 2010).…”

Section: Related Workmentioning

confidence: 99%

Efficient median estimation for large-scale sensor RFID systems

Mustafa

Zhu

et al. 2012

IJSNET

View full text Add to dashboard Cite

Abstract:We consider the median estimation problem in a large-scale sensor augmented RFID system. The large-scale deployment of RFID technology has opened the door to innovative ways to integrate RFID and sensor technology. Sensor-tags are tags that can report over 50 types of physical information to a reader. The traditional way to obtain information from sensor-tags is to query each tag. When the number of tags is large, however, it is prohibitive to query tags individually due to the high delay. In this paper, we present a probabilistic algorithm to estimate the median of a set of sensor-RFID tags without individually querying each tag. The median estimation problem is solved using binary search. Our evaluation demonstrates that the median search algorithm exhibits high accuracy and reasonable time latency. Moreover, we also design an exact algorithm for the continuous median update problem. Our algorithm can incrementally compute the exact median in less time.

show abstract

“…Each tag ID in the probabilistic schemes will have a chance to be retrieved successfully; however, there is a possibility that some tags may not be accessed due to recurrent collisions. Other than the above two categories, some hybrid schemes are also proposed; for instance, Bonuccelli et al proposed a tree slotted ALOHA (TSA) is proposed in (Bonuccelli et al 2006), and Shin et al also proposed another hybrid tag anti-collision scheme (Shin et al 2007). Because the fundamental binary tree-search scheme interrogates one branch completely to obtain a tag ID, it is naturally slow.…”

Section: Time Division Multiple Access (Tdma) Based Schemesmentioning

confidence: 99%