An Advanced Dynamic Framed-Slotted ALOHA Algorithm Based on Bayesian Estimation and Probability Response

Wang, Chaowei; Li, Menglong; Qiao, Juyi; Wang, Weidong; Li, Xiuhua

doi:10.1155/2013/743468

Cited by 6 publications

(8 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We define also the system throughput

U_{t} = \frac{c_{1}}{T_{T r a m e}} monospace[tags/s]

as the ratio between the total successful slots and the frame length time . Indeed, the total time to identify all the tags of the system is equal to the total number of frames multiplied by the duration of a frame.…”

Section: Simulation Resultsmentioning

confidence: 99%

A cooperative Bayesian and lower bound estimation in dynamic framed slotted ALOHA algorithm for RFID systems

Benssalah

Djeddou

Dahou

et al. 2018

Int J Communication

View full text Add to dashboard Cite

A novel estimation scheme that combines Bayesian and lower bound estimating radio frequency identification tag population size is proposed. The developed methodology is based on the fusion between the Bayesian and lower bound estimating techniques. It turns out that the fusion rule is built up thanks to an existing linear relationship between the cited techniques. Simulation resultsshow that the developed technique significantly improves the accuracy of the estimating tag quantity and presents less estimation error. Also, the resulting advanced dynamic framed slotted ALOHA protocol considerably improves the performance and efficiency of the radio frequency identification anti-collision compared with the most recent protocols using others estimating methods. KEYWORDSBayesian estimation, lower bound, RFID, slotted ALOHA INTRODUCTIONRadio frequency identification (RFID) technology is becoming an integral part in a wide spectrum of applications, such as access control, distribution, medicine, and RFID-embedded cards. However, despite the significant increasing of the density of available tags in the readers' interrogation zones, the tag collision problem remains a serious issue that must be addressed seriously before any deployment. The collision problem occurs when simultaneous tags share the same communication channel with the interrogating reader. As a result, the reader will not be able to get the correct identity from each tag. Recently, several state-of-the-art anti-collision tag identification algorithms have been proposed in the literature to mitigate the low tag identification efficiency and performance.The anti-collision algorithm can be divided into 2 main categories. 1 The first category concerns the anti-collision techniques that are processed in medium access control (MAC) layer. In this category, most of the RFID reader uses dynamic framed slotted ALOHA (DFSA)-based probabilistic algorithms. 2-7 The DFSA protocols dynamically adjust the frame size in the successive rounds according to the estimating tags quantity. In fact, DFSA anti-collision protocols can be divided into 2 key parts. The first one deals on how to estimate the tag quantity during an inventory process. The second part focuses on how to dynamically adjust frame size, according to the estimated number of tags, to achieve maximum throughput. Knowing that, the tag quantity to be read is usually unknown, and the maximum throughput of the system is achieved when the frame length is equal to the number of tags of the system. 8 Therefore, it is utmost important to use an estimation method of high accuracy in order to not affect the reading performance of DFSA algorithms.In this context, numerous methods have been proposed in the literature. Among conventional methods (process the problem in MAC layer), the basic ones are idle slot estimate, 9 lower bound estimate, 10 and Schoute estimate. 11 So far, Int J Commun Syst. 2018;31:e3723.wileyonlinelibrary.com/journal/dac

show abstract

“…We define also the system throughput

U_{t} = \frac{c_{1}}{T_{T r a m e}} monospace[tags/s]

Section: Simulation Resultsmentioning

confidence: 99%

A cooperative Bayesian and lower bound estimation in dynamic framed slotted ALOHA algorithm for RFID systems

Benssalah

Djeddou

Dahou

et al. 2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…e minimum distance between the expected value and the actual identification result vector was used to estimate the number of tags [26]. Bayesian estimation and probability response was proposed [13], which can get a relatively accurate statistical result without a large number of observations. Based on the multinomial distribution, the number of empty slots S e was used to estimate the number of tags [27] and the maximum posterior probability distribution (MAP) method was proposed [18], which was defined as follows:…”

Section: Tag Number Estimation At Present Various Methodsmentioning

confidence: 99%

“…To obtain maximum system efficiency, the frame length L i is equal to N i . It can be concluded that the SID wi of F i frame is (13), and the SID ai of F i frame is (14):…”

Section: Frame Length Division Strategymentioning

confidence: 99%

“…RFID technology enables two-way communication between the reader and tag by sharing wireless channels. However, when multiple tags respond simultaneously, the collision of signals will lead to the failure to identify any tags [13], which reduces the system efficiency. e anticollision algorithm provides a solution to this problem and has achieved many research results [8,11,[14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

Zhang

Tao

et al. 2019

Mobile Information Systems

View full text Add to dashboard Cite

Radio-frequency identification (RFID) tag anticollision algorithm is a key technology that affects the performance of RFID systems. In dynamic arrival scenarios, when the tags arrive the reader’s interrogation zone, they cannot participate in the ongoing identification immediately, resulting in longer waiting time and tag miss. Focusing on solving this problem, based on blocking technology, dynamic frame-slotted ALOHA (DFSA) algorithm, and the first-come-first-serve (FCFS) idea, a fast RFID tag anticollision algorithm for dynamic arrival scenarios is proposed, named as “DAS-DFSA algorithm”. By optimizing the instruction structure and identification process, the DAS-DFSA allows the new arrival tag to immediately participate in the ongoing identification process, the tag’s waiting time is shortened, and the miss rate is reduced. DAS-DFSA not only adopts blocking technology to prevent the collision between the arrival tag and waiting tag but also uses unequal-length slots to reduce the communication time overhead. Simulation results show that the identification speed of the algorithm is significantly improved and high system efficiency is guaranteed. Under the same operating conditions, compared with similar algorithms, the waiting time is shortened by more than 44.548% and the identification speed is improved by at least 39.053%. More importantly, it can provide the instant-on-service for dynamic arrival tags and can fully meet the requirements of fast identification of tags in different dynamic arrival scenarios.

show abstract

“…In this scenario, frame size L is adjusted according to N at appropriate time instances (e.g., on a frame-by-frame basis) during the identification process. Consequently, the so-called dynamic FSA (DFSA) protocol [6,7,[15][16][17] is more realistic than FSA. However, in this work, we assume that the frame size is fixed throughout the identification process in order to facilitate our discussion, because our interest is focused primarily on the optimal parameter configuration of the FSA protocol for a given N, i.e., we consider the situation after N or N is determined.…”

Section: Introductionmentioning

confidence: 99%

On the optimal configuration of framed slotted ALOHA

Kim

2016

J Wireless Com Network

View full text Add to dashboard Cite

The primary task of RFID readers is to identify multiple objects as quickly and reliably as possible with minimal power consumption and computation. One issue addressed in this study is the manner in which RFID systems adopting the framed slotted ALOHA (FSA) protocol should be configured so that the minimum identification delay can be achieved with a preassigned confidence level. We first formalize two optimization problems associated with the configuration of passive RFID tag identification processes, i.e., the determination of two key parameter values-termination time and frame size. Next, by considering a comparative RFID system, which well approximates the original system, we establish closed-form formulas for the aforementioned parameters. Furthermore, through asymptotic analysis, we investigate the asymptotic behavior of the optimal parameter values as functions of number of tags and confidence level. Through numerical comparisons, we verify the effectiveness of the proposed solutions.

show abstract

An Advanced Dynamic Framed-Slotted ALOHA Algorithm Based on Bayesian Estimation and Probability Response

Cited by 6 publications

References 13 publications

A cooperative Bayesian and lower bound estimation in dynamic framed slotted ALOHA algorithm for RFID systems

A cooperative Bayesian and lower bound estimation in dynamic framed slotted ALOHA algorithm for RFID systems

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

On the optimal configuration of framed slotted ALOHA

Contact Info

Product

Resources

About