On the energy consumption of Pure and Slotted Aloha based RFID anti-collision protocols

2009 ◽  
Vol 32 (5) ◽  
pp. 961-973 ◽  
Author(s):  
Dheeraj Klair ◽  
Kwan-Wu Chin ◽  
Raad Raad
2020 ◽  
Vol 10 (1) ◽  
pp. 327
Author(s):  
Francisco Vázquez-Gallego ◽  
Pere Tuset-Peiró ◽  
Luis Alonso ◽  
Jesus Alonso-Zarate

This paper models and evaluates three FSA-based (Frame Slotted ALOHA) MAC (Medium Access Control) protocols, namely, FSA-ACK (FSA with ACKnowledgements), FSA-FBP (FSA with FeedBack Packets) and DFSA (Dynamic FSA). The protocols are modeled using an AMC (Absorbing Markov Chain), which allows to derive analytic expressions for the average packet delay, as well as the energy consumption of both the network coordinator and the end-devices. The results, based on computer simulations, show that the analytic model is accurate and outline the benefits of DFSA. In terms of delay, DFSA provides a reduction of 17% (FSA-FBP) and 32% (FSA-ACK), whereas in terms of energy consumption DFSA provides savings of 23% (FSA-FBP) and 28% (FSA-ACK) for the coordinator and savings of 50% (FSA-FBP) and 24% (FSA-ACK) for end-devices. Finally, the paper provides insights on how to configure each FSA variant depending on the network parameters, i.e., depending on the number of end-devices, to minimize delay and energy expenditure. This is specially interesting for massive data collection in IoT (Internet-of-Things) scenarios, which typically rely on FSA-based protocols and where the operation has to be optimized to support a large number of devices with stringent energy consumption requirements.


Sensors ◽  
2014 ◽  
Vol 14 (8) ◽  
pp. 13416-13436 ◽  
Author(s):  
Pere Tuset-Peiro ◽  
Francisco Vazquez-Gallego ◽  
Jesus Alonso-Zarate ◽  
Luis Alonso ◽  
Xavier Vilajosana

Author(s):  
Rafael Perazzo Barbosa Mota ◽  
Daniel Macedo Batista

In this article, the authors propose an algorithm that reduces useless responses for RFID systems in a motion environment, for tracking applications. The mechanism achieves its goals by reducing the number of packets exchanged between readers and tags. They analyze the behavior of their proposal by considering the average number of identification rounds. With extensive simulations using an RFID module for the ns-2 simulator, the authors show the benefit of the proposed mechanism. When compared to the Pure Q Algorithm and Binary Tree Slotted Aloha, their mechanism reduces the number of packets up to 43%, which is a good result in terms of performance of motion applications and energy consumption of the devices used in the communications.


2014 ◽  
Vol 687-691 ◽  
pp. 4050-4055
Author(s):  
Wen Wen Fan ◽  
Yan Li Feng ◽  
Jian Hong Xu

To address this issue that the real time monitoring tag of large-scale active RFID tag system, we propose an another missing tag detection algorithm which is based on frame-slotted ALOHA protocol. By reducing the number of bits of the tag reply information, the energy consumption of active tags has been greatly reduced. Compared with that traditional detection algorithm based on tag identification number, experimental results demonstrate that HPL algorithm will reduce an order of magnitude on energy consumption of label, and at the same time, it will reduce the execution time of the algorithm. Meanwhile, compared with the best iteration ID-free protocol detection algorithm currently, HPL algorithm will reduce three orders of magnitude on energy consumption of label, and reduce the execution time of the algorithm.


2020 ◽  
Vol 16 (7) ◽  
pp. 155014772094020 ◽  
Author(s):  
Seksan Laitrakun

We consider the composite hypothesis testing problem of time-bandwidth-constrained distributed detection. In this scenario, the probability distribution of the observed signal when the event of interest is happening is unknown. In addition, local decisions are censored and only those uncensored local decisions will be sent to the fusion center over a shared and noisy collision channel. The fusion center also has a limited time duration to collect transmitted decisions and make a final decision. Two types of medium access control that the sensor nodes apply to send their decisions are investigated: time division multiple access and slotted-Aloha. Unlike using the time division multiple access protocol, the slotted-Aloha-based distributed detection will experience packet collisions. However, in this article, since only uncensored decisions are sent, packet collisions are informative. We derive fusion rules according to generalized likelihood ratio test, Rao test, and Wald test for both the time division multiple access–based distributed detection and the slotted-Aloha-based distributed detection. We see that the fusion rules for the slotted-Aloha-based distributed detection here also exploit packet collisions in the final decision-making. In addition, the asymptotic performances and energy consumption of both schemes are analyzed. Extensive simulation and numerical results are provided to compare the performances of these two schemes. We show that, for a given time delay, the slotted-Aloha-based distributed detection can outperform the time division multiple access–based distributed detection by increasing the number of sensor nodes which results in higher energy consumption.


Author(s):  
Shahzeen Z. Attari ◽  
Michael L. DeKay ◽  
Cliff I. Davidson ◽  
Wandi Bruine de Bruin

ICCTP 2009 ◽  
2009 ◽  
Author(s):  
Shunquan Huang ◽  
Siqin Yu ◽  
Zhongmin Liu

Sign in / Sign up

Export Citation Format

Share Document