| Autor: |
Sok, Kyongjin, Hong, Gon, Rim, Chongil, Pak, Unjin, Sin, Kinam |
| Zdroj: |
Internet Technology Letters; Sep/Oct2019, Vol. 2 Issue 5, pN.PAG-N.PAG, 1p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Plný text