Abstract
In RFID (Radio Frequency IDentification) system, when multiple tags are in the operating range of one reader and send their information to the reader simultaneously, the signals of these tags are superimposed in the air, which results in a collision and leads to the degrading of tags identifying efficiency. To improve the multiple tags’ identifying efficiency due to collision, a physical layer network coding based binary search tree algorithm (PNBA) is proposed in this paper. PNBA pushes the conflicting signal information of multiple tags into a stack, which is discarded by the traditional anti-collision algorithm. In addition, physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the con- flicting information in the stack. Therefore, PNBA reduces the number of interactions between reader and tags, and improves the tags identification efficiency. Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings, and improve RFID identification effi- ciency. Especially, when the number of tags to be identified is 100, the average needed reading number of PNBA is 83% lower than the basic binary search tree algorithm, 43% lower than reverse binary search tree algorithm, and its reading efficiency reaches 0.93.
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.