Research Article
A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve
Algorithm 1
Reader procedure pseudocode of DAS-DFSA.
(1) | L = 128; | (2) | Frame_counts = 0; | (3) | = L(1–0.368); | (4) | if (!IdentificationIsEnd) | (5) | { | (6) | Frame_counts++; | (7) | Set [Ss, Sc, Se] to 0;/ slot counter / | (8) | Broadcast Start instruction; | (9) | Set SIDc to 1; | (10) | Set SIDl to ; | (11) | while (!FrameIsEnd) | (12) | { | (13) | Broadcast IndicateWait/IndicateArrival instruction; | (14) | Identification process and read answers; | (15) | Update identification results Ss/Sc/Se; | (16) | SIDc++; | (17) | if (SIDc ≥ SIDl) | (18) | Set SIDl to SIDc + 1; | (19) | if (SIDc ≥ L) | (20) | Set FrameIsEnd is true; | (21) | } | (22) | if (Frame_counts ≥ 2) begin | (23) | Calculate or use the arrival rate of this frame; | (24) | Calculate the frame length of next frame; | (25) | end | (26) | Set to 2.39Sc; | (27) | if (No tags) | (28) | Set IdentificationIsEnd is true; | (29) | } |
|