While the exact magnitude of the nighttime bird collision problem in New York City is not well understood, research in other cities has shown the problem to be significant.
This kind of neutral SFDE has a practical background in a collision problem in electrodynamics.
As described before, the tag collision problem in single-reader scenario can be solved by using compressed sensing techniques, which tolerate collisions differently from FSA protocols.
In 3GPP [3], a concept of group paging has been introduced to alleviate the heavy collision problem in the random access channels (RACHs) of the cellular networks.
To solve the ACK frame collision problem in Section 2.2.2, we also proposed extending the NAV period by using the request-to-send (RTS / clear-to-send (CTS) procedure for an RoF-based WLAN [16], as illustrated in Fig. 5.
ARCA and DRCA schemes allocate the ranging codes according to statistics about Ranging and BR messages collected at the BS, so BR can get more ranging codes without the collision problem in the AA scheme.
The simulation results demonstrate that the proposed AINetHE-RA algorithm is effective and efficient in mitigating the reader-to-reader collision problem in dense RFID networks and outperforms such methods as GA-RA, PSO-GA and opt-aiNet-RA in finding the optimal resource allocation schemes.
In the ATRAS scheme, the RoF STAs and legacy WLAN nodes transmitted frames using the RTS/CTS exchange protocol, and the RoF-based WLAN employed the NAV extension method mentioned in Section 3.3 to solve the ACK frame collision problem in 2.2.2.
