ASAP : A MAC Protocol for Dense and Time Constrained RFID Systems

Khandelwal, Girish; Yener, Aylin; Lee, Kyoung Hwan; Serbetli, S.

doi:10.1109/icc.2006.255711

Cited by 81 publications

(43 citation statements)

References 18 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, Khandelwal et al [23] proposed using L opt = 1.943 η × N, where η = log(H/N)/ log(1 − 1/N) and H represents the number of slots with no tag response. Vogt [13] provided a frame size table listing recommended values for several ranges of N, as presented in Table 1, which are supposed to yield lower identification delays for a given tag range.…”

Section: Related Workmentioning

confidence: 99%

On the optimal configuration of framed slotted ALOHA

Kim

2016

J Wireless Com Network

View full text Add to dashboard Cite

The primary task of RFID readers is to identify multiple objects as quickly and reliably as possible with minimal power consumption and computation. One issue addressed in this study is the manner in which RFID systems adopting the framed slotted ALOHA (FSA) protocol should be configured so that the minimum identification delay can be achieved with a preassigned confidence level. We first formalize two optimization problems associated with the configuration of passive RFID tag identification processes, i.e., the determination of two key parameter values-termination time and frame size. Next, by considering a comparative RFID system, which well approximates the original system, we establish closed-form formulas for the aforementioned parameters. Furthermore, through asymptotic analysis, we investigate the asymptotic behavior of the optimal parameter values as functions of number of tags and confidence level. Through numerical comparisons, we verify the effectiveness of the proposed solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

On the optimal configuration of framed slotted ALOHA

Kim

2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Some of these add a heuristic to estimate the number of tags that compete in each cycle [15][16][17][18]. In this way, the reader is able to get a more accurate when has to establish the optimal frame-length in each cycle.…”

Section: Related Workmentioning

confidence: 99%

“…A relevant set of performance studies has been conducted in the last years for anticollision protocols based on FSA for passive RFID systems [10][11][12][13][14][15][16][17][18]. Most of them propose variations to the EPCglobal Class-1 Gen-2 standard or new algorithms to improve the frame adaptation.…”

Section: Related Workmentioning

confidence: 99%

“…Ideally, it is well-known that the frame-length must be made equal to the number of contending tags to maximize the system throughput. Nevertheless, the standard constraints the feasible frame-lengths to a reduced set of possibilities: the natural numbers power of two from 2 0 to 2 15 . Our study explores this problem, to obtain the feasible frame-length which maximizes the throughput in each cycle, minimizing the total identification time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimum Frame-length Configuration in Passive RFID Systems Installations

Bueno-Delgado¹,

Vales‐Alonso²,

Egea-López³

et al. 2009

Proceedings of the 3rd International Workshop on RFID Technology - Concepts, Applications, Challenges

View full text Add to dashboard Cite

Abstract. Anti-collision mechanisms in RFID, including current standards, are variations of Aloha and Frame Slotted Aloha (FSA). The identification process starts when the reader announces the length of a frame (in number of slots). Tags receive the information and randomly choose a slot in that cycle to transmit their identifier number. The best performance of FSA always requires working with the optimum frame-length in each cycle. However, it is not a parameter easy to adjust in real RFID readers. In this work a markovian analysis is proposed to find the optimum value of frame-length for the current readers of the market. Besides, to validate and contrast the analytical results, a real passive RFID system has been used to get experimental results: the development kit Alien 8800. The experimental results match the analysis predictions.

show abstract

“…Therefore, the system requires a multiple-access scheme that allows the reader to read data from the individual tags. A technical scheme that handles multiple-access is called an anti-collision algorithm [2] [3].…”

Section: Introductionmentioning

confidence: 99%

A Scheme for Guaranteeing Fair Identification Delay in Gen-2 RFID Systems

Lim¹

2011

Journal of information and communication convergence engineerin

View full text Add to dashboard Cite

Abstract-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.

show abstract

ASAP : A MAC Protocol for Dense and Time Constrained RFID Systems

Cited by 81 publications

References 18 publications

On the optimal configuration of framed slotted ALOHA

On the optimal configuration of framed slotted ALOHA

Optimum Frame-length Configuration in Passive RFID Systems Installations

A Scheme for Guaranteeing Fair Identification Delay in Gen-2 RFID Systems

Contact Info

Product

Resources

About