Abstract: | Radio frequency identification suffers from tag collision issue. ALOHA‐based algorithms are useful and practical groups of tag anti‐collision algorithm among others. Some standards such as EPCglobal Class‐1 Generation‐2 use some kind of dynamic framed slotted ALOHA (DFSA) to cope with tag collision. DFSA efficiency depends on estimating the number of unidentified tags in each identification cycle accurately. So tag estimation is one of the challenging issues in DFSA. In this paper, we use Manchester coding to compute the lower bound of collided tags in a frame and then add α as an additional value to computed value according to the difference between optimal number of collision slots and calculated number of collision slots. Then, we evaluate and compare our method with other proposed methods. |