Premium
A collision window tree algorithm improved by fixed‐window and parallel‐matching schemes
Author(s) -
Sok Kyongjin,
Hong Gon,
Rim Chongil,
Pak Unjin,
Sin Kinam
Publication year - 2019
Publication title -
internet technology letters
Language(s) - English
Resource type - Journals
ISSN - 2476-1508
DOI - 10.1002/itl2.108
Subject(s) - collision , window (computing) , computer science , tree (set theory) , algorithm , sliding window protocol , collision problem , matching (statistics) , idle , real time computing , mathematics , mathematical analysis , statistics , computer security , operating system
In passive radio frequency identification systems, tag collision is a serious problem causing performance degradation. Most anti‐collision protocols waste numerous transmitted bits while eliminating or reducing the idle and collision slots. In this letter, an improved collision window tree (ICwT) algorithm is proposed by applying a parallel‐matching scheme to a fixed‐window scheme, in order to restrict the length of tag response as well as reduce the number of query cycles. As a result of the simulation, ICwT is proved to be more effective in terms of identification time and energy cost, compared to the existing tree‐based algorithms including collision tree, M‐ary query tree, dual prefix probe scheme, query window tree, and collision window tree.