TDMA‐SDMA‐based RFID algorithm for fast detection and efficient collision avoidance. (7th August 2017)

• Record Type: Journal Article
• Authors: Saadi, Hadjer; Touhami, Rachida; Yagoub, Mustapha C.E.
• Is Part Of: International journal of communication systems. Volume 31:Number 1(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-08-07
• Subjects: FPGA -- reader collision -- RFID -- SDMA -- tag collision -- TDBF; Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.3392
• Languages: English
• ISSNs: 1074-5351

Abstract

Summary: In radio frequency identification, collisions between tags and readers are among key weaknesses to address for reliable operation. To efficiently tackle the above issues and shorter the identification time, different algorithms have been adopted. However, they are still perfectible. For this aim, an efficient fast detection and collision avoidance (FD‐CA) algorithm is proposed to solve tag to tag collision drawbacks. Design and Methods: Based on an innovative combination of TDMA and SDMA algorithms, it takes into account spatial distribution of tags to significantly reduce their identification time. Results and Discussion: Besides, to further highlight its efficiency, the proposed algorithm was successfully applied to reader‐to‐reader collision with an increasing throughput and a decreasing average waiting time and average rate collision while compared to existing algorithms. Conclusion: Finally, the proposed FD‐CA was demonstrated through practical examples, comparison with existing works, and successful FPGA implementation. Abstract : In radio frequency identification, collisions between tags and/or readers are among key weaknesses to address for reliable operation. To efficiently tackle the above issues and shorter the identification time, different algorithms have been adopted. However, they are still perfectible. For this aim, an efficient fast detection and collision avoidance (FD‐CA) algorithm is proposed to solve tag‐to‐tag collision drawbacks. Based on an innovative combination of TDMA and SDMA algorithms, it takes into account spatial distribution of tags to significantly reduce their identification time. Besides, to further highlight its efficiency, the proposed algorithm was successfully applied to reader‐to‐reader collision with an increasing throughput and a decreasing average waiting time and average rate collision while compared to existing algorithms. Finally, the proposed FD‐CA was demonstrated through practical examples, comparison with existing works, and successful FPGA implementation.