Abstract
Radio frequency identification is a wireless communication technology, which enables data gathering and identifies recognition from any tagged object. The number of collisions produced during wireless communication would lead to a variety of problems including unwanted number of iterations and reader-induced idle slots, computational complexity in terms of estimation as well as recognition of the number of tags. In this work, dynamic frame adjustment and optimal splitting are employed together in the proposed algorithm. In the dynamic frame adjustment method, the length of frames is based on the quantity of tags to yield optimal efficiency. The optimal splitting method is conceived with smaller duration of idle slots using an optimal value for splitting level , where (M > 2), to vary slot sizes to get the minimal identification time for the idle slots. The application of the proposed algorithm offers the advantages of not going for the cumbersome estimation of the quantity of tags incurred and the size (number) of tags has no effect on its performance efficiency. Our experiment results show that using the proposed algorithm, the efficiency curve remains constant as the number of tags varies from 50 to 450, resulting in an overall theoretical gain in the efficiency of 0.032 compared to system efficiency of 0.441 and thus outperforming both dynamic binary tree slotted ALOHA (DBTSA) and binary splitting protocols.
Highlights
RFID is a low power and low-cost wireless technology, which enables tracking and identification of objects such as credit cards for access applications, tracking of shipping containers, anti-theft objects in stores and tags used as screw-shapes to recognize wooden items [1–3]
We propose an anti-collision protocol corresponding to optimal splitting to replace binary splitting
The efficiency of the proposed algorithm is achieved through reducing the number of idle slots as well as identification time compared to existing protocols, such as a dynamic BTSA (DBTSA), adoptive BTSA and splitting BTSA that only proposed to reduce the number of collisions
Summary
RFID is a low power and low-cost wireless technology, which enables tracking and identification of objects such as credit cards for access applications, tracking of shipping containers, anti-theft objects in stores and tags used as screw-shapes to recognize wooden items [1–3]. Conventional estimate methods are generally less efficient and produce inaccurate calculations when the frame length exceeds the total quantity of tags with the number of slots, either idle or successful, as being zero [15,16]. ALOHA-based protocols, such as enhanced dynamic frame slotted ALOHA (EDFSA) [17] and tree slotted ALOHA (TSA) [18], separate tags into groups and interrogate each group at the same time, reducing the probability of collisions and improving the performance efficiency in the range of 34–37%. The efficiency of the proposed algorithm is achieved through reducing the number of idle slots as well as identification time compared to existing protocols, such as a DBTSA, adoptive BTSA and splitting BTSA that only proposed to reduce the number of collisions.
Sign-in/Register to view highlights & summary 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 call
