Abstract
SummaryIn 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 MethodsBased 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 DiscussionBesides, 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.ConclusionFinally, the proposed FD‐CA was demonstrated through practical examples, comparison with existing works, and successful FPGA implementation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.