Analysis of Dynamic frame Aloha with frame restart

This paper provides an analysis of the Dynamic frame Aloha (DFA) protocol with frame Restart. Although a previous work has numerically provided the best restarting strategy when the number of tags N is known, that strategy is represented by a table whose entries are so many to be impractical for high values of N. Here we provide a simpler set of equations that, besides the optimal strategy, lead to a very simple sub-optimal strategy whose performance is practically indistinguishable from the optimal one. Furthermore, we prove that asymptotically the Frame Restart property is useless, being the corresponding efficiency equal to e^-1, the same as the plain DFA. We investigate the strategies and performance when N is unknown, furthermore providing a procedure, called AE², that is able to asymptotically reach the theoretical efficiency e^-1.