Weight Decision Scheme based on Slot-Count in Gen-2 Q-Algorithm
In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-co...
Saved in:
Published in | Journal of Information and Communication Convergence Engineering, 9(2) Vol. 9; no. 2; pp. 172 - 176 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
한국정보통신학회
30.04.2011
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-count is small. In this case, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round. Through various computer simulations, it is demonstrated that the proposed scheme achieves more stable performances than Gen-2 Q-algorithm KCI Citation Count: 0 |
---|---|
Bibliography: | G704-SER000003196.2011.9.2.015 |
ISSN: | 2234-8255 2234-8883 |
DOI: | 10.6109/jicce.2011.9.2.172 |