RT Journal Article
T1 Stability of synchronous queued RFID networks
A1 Vales Alonso, Javier
A1 López Matencio, Pablo
A1 Alcaraz, Juan José
A1 González Castaño, Francisco Javier
K1 3325 Tecnología de las Telecomunicaciones
K1 3325.99 Otras
AB Queued Radio Frequency Identification (RFID) networks arise naturally in many applications, where tags are grouped into batches, and each batch must be processed before the next reading job starts. In these cases, the system must be able to handle all incoming jobs, keeping the queue backlogs bounded. This property is called stability. Besides, in RFID networks, it is common that some readers cannot operate at the same time, due to mutual interferences. This fact reduces the maximum traffic that readers can process since they have to share the channel. Synchronous networks share the channel using a TDMA approach. The goal of this work is to analytically determine whether a synchronous queued RFID network attains stable operation under a given incoming traffic. Stability depends on the service rate, which is characterized in this paper using an exact numerical method based on a recursive analytical approach, overcoming the limitations of previous works, which were based on simplifications. We also address different flow optimization problems, such as computing the maximum joint traffic that a network can process stably, selecting the minimal number of readers to process a given total load, or determining the optimal timeslot duration, which are novel in the RFID literature.
PB IEEE Access
SN 21693536
YR 2019
FD 2019-10-03
LK http://hdl.handle.net/11093/4264
UL http://hdl.handle.net/11093/4264
LA eng
NO IEEE Access, 7, 148828-148842 (2019)
NO Ministerio de Economía, Industria y Competitividad | Ref. TEC2016-76465-C2-1-R
DS Investigo
RD 04-dic-2024