A Scheme for Guaranteeing Fair Identification Delay in Gen-2 RFID Systems
In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust c...
Saved in:
Published in | Journal of Information and Communication Convergence Engineering, 9(1) Vol. 9; no. 1; pp. 44 - 49 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
한국정보통신학회
28.02.2011
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust command. Anti-collision algorithm of Gen-2 RFID system is simple. But, it has the tag starvation problem that a tag may never be successfully identified because its responses always collide with others. Therefore, this paper proposes a scheme to guarantee the fair identification delay. In the proposed scheme, if the slot-count value changes due to the collisions, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that occurred collision during the previous query round. In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust command. Anti-collision algorithm of Gen-2 RFID system is simple. But, it has the tag starvation problem that a tag may never be successfully identified because its responses always collide with others. Therefore, this paper proposes a scheme to guarantee the fair identification delay. In the proposed scheme, if the slot-count value changes due to the collisions, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that occurred collision during the previous query round. KCI Citation Count: 0 |
---|---|
Bibliography: | G704-SER000003196.2011.9.1.019 |
ISSN: | 2234-8255 2234-8883 |
DOI: | 10.6109/jicce.2011.9.1.044 |