Stability of synchronous queued RFID networks

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.This work was supported by the Project AIM, (AEI/FEDER, EU) under Grant TEC2016-76465-C2-1-R

Stability of synchronous queued RFID networks

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.Ministerio de Economía, Industria y Competitividad | Ref. TEC2016-76465-C2-1-

Протокол запобігання колізій в мережі IoT з використанням безпілотних літальних апаратів

Мета роботи: вирішення проблеми колізій міток для щільних середовищ Інтернету Речей, за рахунок запропонованого протоколу запобігання колізій в мережі ІoT з використанням безпілотних літальних апаратів. В ході виконання даної роботи розроблено тривимірну модель системи радіочастотної ідентифікації на основі БПЛА, розроблено новий алгоритм боротьби із колізіями для Інтернету Речей, на основі якого запропоновано протокол протидії колізії множини тегів на базі БПЛА (протокол протидії колізії для множини міток). Проведено моделювання та виконано оцінку запропонованого протоколу.Goal: solving the problem of label collisions for dense environments of the Internet of Things, due to the proposed protocol to prevent collisions in the Internet of Things using unmanned aerial vehicles. In the course of this work, a three-dimensional model of the UAV-based radio frequency identification system was developed, and a new anti-collision algorithm for the Internet of Things was developed, based on the anti-collision protocol for multiple tags. The simulation and evaluation of the proposed protocol was performed