Abstract
Radio frequency identification (RFID) is a technology with numerous benefits in applications where objects have to be identified automatically. However, cost, fragile tags, collision and reading errors are some of issues to be concerned with in an RFID implementation. Mainly, this paper proposes a method for tag identification and a method for the selection of the binary codes to program on the tags in order to facilitate the identification process. For the identification method a heuristic based on Hamming distance is developed where the basic idea is to utilize the information obtained in consecutive read attempts to help identify a tag. For the selection method three models based on Hamming distance are also developed which strive to find the set with the greatest dissimilarity among the codes. Computer simulations are performed to verify the validity of the proposed methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Machine Learning and Cybernetics
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.
