ALOHA-Based Anti-Collision Algorithms Used in RFID System

Liu, Leian; Lai, Shengli

doi:10.1109/wicom.2006.342

Cited by 52 publications

(26 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Esses algoritmos asseguram que as etiquetas efetuem a transmissão em intervalos de tempos previamente definidos, de modo a diminuir o número de colisões [6]. Dentro dessa categoria, existem duas classes de algoritmos -os determinísticos, baseados em busca em árvores binárias, e os probabilísticos, baseados no protocolo ALOHA [7].…”

Section: Algoritmos Anticolisão De Domínio Temporalunclassified

Um ambiente de simulação de algoritmos anticolisão para apoio ao desenvolvimento de aplicações de RFID

Sorokin

Martins²

2012

Revista Brasileira De Computação Aplicada

View full text Add to dashboard Cite

Resumo: Dentre os aspectos técnicos a serem considerados no projeto de um sistema baseado em Radio Frequency Identification (RFID) um dos mais importantes é a análise do processo de colisão de informações, ou seja, a sucessão de eventos que ocorrem quando etiquetas RFID adentram a zona de abrangência de um dispositivo leitor e transmitem suas informações simultaneamente, dificultando sua correta identificação. Para evitar os efeitos danosos que seriam causados por tais eventos é necessário integrar aos dispositivos transmissores e receptores um algoritmo -denominado 'anticolisão' -responsável pelo isolamento da comunicação entre cada etiqueta e o leitor. Neste trabalho propõe-se o desenvolvimento de um ambiente de simulação de algoritmos anticolisão para sistemas RFID que permite sua análise comparativa em situações variadas, facilitando a avaliação de desempenho desses algoritmos e sua subsequente seleção, de modo a atender às características da aplicação pretendida. Também são apresentados alguns experimentos realizados com os algoritmos anticolisão implantados no ambiente de simulação e analisados à luz das métricas de desempenho adotadas. Palavras-chave: Algoritmo anticolisão. ALOHA. Árvore binária. RFID. Abstract: A crucial task in the project of Radio Frequency Identification (RFID) systems is to cope with information collision, an undesirable event caused by the attempt of two or more RFID tags simultaneously respond to an interrogation command issued by a data collector. To avoid the deleterious effects that such events could provoke, it is necessary to include an

show abstract

Section: Algoritmos Anticolisão De Domínio Temporalunclassified

Um ambiente de simulação de algoritmos anticolisão para apoio ao desenvolvimento de aplicações de RFID

Sorokin

Martins²

2012

Revista Brasileira De Computação Aplicada

View full text Add to dashboard Cite

show abstract

“…On the other hand, if two or more tag handles are received by the reader, a collision happens, the tag will be unacknowledged, and all the unacknowledged tags will independently select random backoff time again in the next round. This process is repeated until all the tags are finally identified and acknowledged by the reader [6][7][8].…”

Section: Introductionmentioning

confidence: 99%

Adaptive Aloha anti-collision algorithms for RFID systems

Zheng

Kaiser

2016

J Embedded Systems

View full text Add to dashboard Cite

In this paper, we propose two adaptive frame size Aloha algorithms, namely adaptive frame size Aloha 1 (AFSA1) and adaptive frame size Aloha 2 (AFSA2), for solving radio frequency identification (RFID) multiple-tag anti-collision problem. In AFSA1 and AFSA2, the frame size in the next frame is adaptively changed according to the real-time collision rate measured in the current frame. It is shown that AFSA1 and AFSA2 can significantly improve the transmission efficiency of RFID systems compared to the static Aloha, and AFSA2 produces transmission efficiency similar to that of the electronic product code (EPC) Q-selection algorithm (Variant II), while the mean identification delay of AFSA2 is much smaller than that of EPC Q-selection algorithm (Variant II). It is also shown that the transmission efficiency of AFSA2 and EPC Variant II is very close to its upper bound which is obtained by assuming that the reader knows the number of unidentified tags. It is worth noting that when the threshold of the collision rate is chosen to be 0.5 or 0.6, AFSA2 can maintain the transmission efficiency well above 0.65 for the case of a typical EPC code length of 96 bits and for the investigated range of tag population, i.e., from 2 to 1000, while keeping the mean identification delay below ten transmit contentions. Very light computational burden at the reader is needed: the reader needs only to measure the collision rate in the current frame and then to double or halve the frame size accordingly. No additional computational burden is required at the tag side.

show abstract

“…RFID technology enables objects to be distinguished from a long distance [5], and furthermore, passive RFID tags which collect energy from the RFID reader offer several advantages such as battery-less operation, wireless communication, high flexibility, low cost, and fast deployment [6]. Because there is only one communication channel between RFID reader and RFID tags, collision is a familiar problem in RFID systems, easily resulting in missing information and inefficient use of resources-particularly hardware resources [7].…”

Section: Introductionmentioning

confidence: 99%

“…In dynamic frame-slotted ALOHA (DFSA) [9][10][11], the length of the frame dynamically changes with the number of unidentified tags. In frame slotted ALOHA protocols, when the length of the frame is equal to the number of tags, the maximum system efficiency is attained, which is about 36.8% [7,12]. Tags select time slots to send their data packages…”

Section: Introductionmentioning

confidence: 99%

Design of a Quaternary Query Tree ALOHA Protocol Based on Optimal Tag Estimation Method

Zhang

Deng

2016

Information

View full text Add to dashboard Cite

Radio Frequency Identification (RFID) technology is one of the most promising technologies in the IoT (The Internet of Things) era. Many RFID systems have been used in supermarkets or warehouses. There are two challenges for RFID anti-collision algorithms. The first challenge is accurately estimating the number of tags; the other is improving the efficiency of RFID systems. This paper proposes an optimal tag estimation method in which tags respond to the reader in assigned time slots instead of responding randomly. In order to improve the performance of the RFID system, a 4-ary query tree Additive Link On-line HAwaii (ALOHA) protocol is presented that combines the merits of query tree algorithm and frame slotted ALOHA, and avoids their weaknesses. Simulation results show that the proposed algorithm has a higher tag identification efficiency compared to other dynamic frame slotted ALOHA algorithms, and it can overcome the tag starvation phenomenon, because it traces each tag until all of them are identified successfully.

show abstract

ALOHA-Based Anti-Collision Algorithms Used in RFID System

Cited by 52 publications

References 8 publications

Um ambiente de simulação de algoritmos anticolisão para apoio ao desenvolvimento de aplicações de RFID

Um ambiente de simulação de algoritmos anticolisão para apoio ao desenvolvimento de aplicações de RFID

Adaptive Aloha anti-collision algorithms for RFID systems

Design of a Quaternary Query Tree ALOHA Protocol Based on Optimal Tag Estimation Method

Contact Info

Product

Resources

About