Performance of Tag Cognizance Scheme Using Tag Separation in RFID Networks

In an RFID network consisting of a single reader and many tags, a response of a tag may collide with responses of other tags. However, the time for cognizing a crowd of tags is often limited. In such a network, we consider a tag cognizance scheme which is based on static framed and slotted ALOHA and is equipped with tag separation function as well. To evaluate the scheme, we first choose the cognizance completion probability as a performance measure and derive it exactly. Next, we formulate a problem to find an optimal time structure maximizing the cognizance completion probability under a constraint on the cognizance time. By solving the problem, we finally obtain optimal time structure and group formation.