Performance analysis of basic tree protocols and ALOHA-based anti-collision algorithms used in RFID systems

Saadi, Hadjer; Touhami, R.; Yagoub, M.C.E.

doi:10.1109/isspit.2011.6151531

Cited by 2 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During the last few years, several anti-collision algorithms have been proposed [1][2][3]. They can be classified into two broad categories namely, stochastic and deterministic, involving ALOHA based algorithms and Binary tree ones, respectively.…”

Section: Introductionmentioning

confidence: 99%

Design and simulation of anti-collision RFID system based on SDMA-OFDM

Saadi

Touhami

Yagoub

2014

2014 International Conference on Multimedia Computing and Systems (ICMCS)

Self Cite

View full text Add to dashboard Cite

This paper discusses the implementation of an efficient anti-collision algorithm for RFID systems. Conventional TDMA methods do not show a high efficiency and speediness in collision detection and do not take into account the spatial characteristics of tags distribution. By combining the TDMA (Time Division Multiple Access) and SDMA (Space Division Multiple Access) algorithms, the proposed approach takes into account the characteristics of the tag position in the reading area of the reader. Knowing that the SDMA method is based on the principle of Digital Beam Forming (DB F), we used the FFT and IFFT blocks to form the different beams and the OFDM technique to meet the orthogonality condition. We then divided the space into two subsets of beams and applied the TDMA method to detect any collision. The developed RFID anti-collision SDMA system has been coded by VHDL and simulated using the ISE software for FPGA implementation.

show abstract

Section: Introductionmentioning

confidence: 99%

Design and simulation of anti-collision RFID system based on SDMA-OFDM

Saadi

Touhami

Yagoub

2014

2014 International Conference on Multimedia Computing and Systems (ICMCS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The tag identification process is deterministic, and is based on iteratively querying a subset of tags which match a given property until all tags are identified [2][3][4].…”

Section: Basic Tree Protocolsmentioning

confidence: 99%

“…If two or more tags transmit, a complete or partial collision occurs, each tag then resolve by backing off randomly before retransmitting their ID. So the first disadvantage of this algorithm is the high probability of collision [1], [4][5][6][7][8].…”

Section: Aloha-based Anti-collision Algorithmsmentioning

confidence: 99%

“…Thus, compared to pure ALOHA, this method will decrease the probability of collision. Therefore, the throughput S of slotted ALOHA for the offered traffic G is given as [1], [4][5][6][7][8]:…”

Section: B Slotted Alohamentioning

confidence: 99%

“…So DFSA algorithm can solve partially the problem of FSA. DFSA algorithm has several versions depending on the methods changing the frame size [1]- [4][5][6][7][8].…”

Section: Dynamic Framed Slotted Aloha (Dfsa)mentioning

confidence: 99%

See 2 more Smart Citations

A comparative performance evaluation study of the basic binary tree and aloha based anti-collision protocols for passive RFID system

Rennane

Saadi

Touhami

et al. 2012

2012 24th International Conference on Microelectronics (ICM)

Self Cite

View full text Add to dashboard Cite

RFID (Radio Frequency Identification) technology is one of the most important branches of the automatic identification technology which achieves the identification of targets by contactless communications. One of the major challenges for RFID systems is to avoid or solve collisions due to interference that might occur between tags which decrease the efficiency of RFID system. This paper focused on a detailed comparative performance evaluation study and an adoption of certain algorithms of anti-collision for passive RFID system, for the two families of solving collision: deterministic (according to the: QTA, CTTA, BS-QTA, BS-CTTA) and stochastic (ALOHA, SLOTTED ALOHA, np-CSMA). The simulation results for the two families that we get with protocols evaluation are based on their own proper evaluation parameters. Thus, for evaluating the simulation of the stochastic family, we have proposed a new performance metric which judges and correctly evaluates this anti-collision protocol; which is: the number of identified tags versus to the time. This metric provides a direct measure of the time taken to read a group of tags.

show abstract

Performance analysis of basic tree protocols and ALOHA-based anti-collision algorithms used in RFID systems

Cited by 2 publications

References 14 publications

Design and simulation of anti-collision RFID system based on SDMA-OFDM

Design and simulation of anti-collision RFID system based on SDMA-OFDM

A comparative performance evaluation study of the basic binary tree and aloha based anti-collision protocols for passive RFID system

Contact Info

Product

Resources

About