Premium
TDMA‐SDMA‐based RFID algorithm for fast detection and efficient collision avoidance
Author(s) -
Saadi Hadjer,
Touhami Rachida,
Yagoub Mustapha C.E.
Publication year - 2017
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3392
Subject(s) - computer science , radio frequency identification , identification (biology) , collision , algorithm , key (lock) , throughput , collision avoidance , time division multiple access , field programmable gate array , software deployment , real time computing , wireless , embedded system , computer network , telecommunications , computer security , operating system , botany , biology
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.