| Title |
Upper Bound on Quantile of Cognition Completion Time in Single-reader Multiple-tag RFID Networks |
| DOI |
https://doi.org/10.5573/ieie.2025.62.2.3 |
| Keywords |
RFID network; MAC scheme based on framed slotted ALOHA; Cognition completion time; Upper bound on q-quantile; First-order stochastic dominance |
| Abstract |
Consider an RFID network which consists of single reader and multiple tags. In the RFID network, a collision can occur among the packets which are simultaneously sent by two or more tags. In order for the reader to cognize tags while resolving the collision problem, the RFID network is assumed to employ a MAC scheme rooted in framed slotted ALOHA. Without prior information about nearby tags, it is a basic mission of the reader in the RFID network to cognize all the neighboring tags in a prescribed time. Thus, it is of necessity to analyze the cognition completion time, i.e., the time elapsed until the reader cognizes all the tags. In particular, it is of importance to provide a fiducial time limit by which the reader can exhaustively accomplish the tag cognition. In this paper, we thus analytically develop an upper bound on the q-quantile of the cognition completion time in a closed form by taking the three steps; creating a random variable which is greater than or equal to the cognition completion time almost surely, devising a random variable which has first-order stochastic dominance over the almost surely greater or same random variable and constructing an upper bound on the q-quantile of the first-order stochastically dominating random variable. Numerical examples reconfirm that the upper bound which is derived analytically is a truly upper bound over a wide range of key parameters. Also, numerical examples reveal that the upper bound possesses the property of parametric convexity as similarly as the q-quantile of the cognition completion time does. |