Throughout the analysis, it is assumed that if a packet is received collision free, it can successfully be decoded and no errors occur because of channel noise.
For a data packet, even if its corresponding control packet has been successfully received, collisions can still happen.
The throughput per slot is calculated for all tags that a reader with i receive antennas and collision recovery factor M can resolve from a collision (R = 1,…,M).
In other words, find a collision-free broadcast schedule that guarantees that all the nodes in V receive the message collision free in minimum time.
More precisely, in case of two concurrent SU transmissions, a SU can still receive a packet without collision if the SINR at the receiver is high enough for successfully decoding the ongoing transmission.
FSA: For the legacy FSA approach [3], the reader features one receive antenna and no collision recovery capabilities.
Thus, we only need to prove that all nodes in each phase are able to receive the broadcast message collision free.
Values of the maximal theoretical throughput per slot together with the optimal frame size normalized to the tag population size are shown in Table 6 for NRA = {1,2,4} receive antennas allowing for collision recovery factors of M = {1,2,4,8}.
Also, once impact is made to the helmet, sideline staff receive notification of the collision wirelessly, allowing them to perform proper concussion diagnosis real-time.
In the event of collision, some nodes are selected to act as relays and retransmit the signal they received during the collision in a specific time slot.
