RFID Anti-collision Protocol for Dense Passive Tag Environments

Ali, Kashif; Hassanein, Hossam S.; Tana, A.-E.M.

doi:10.1109/lcn.2007.140

Cited by 34 publications

(25 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Even if they are part of the RFID systems modeling, they are not a central issue in this research. One of the basis for modeling the propagation signals in RFID systems is the spherical approach [3,4,5]. Taking into account such an approach along with the devices described in Table 1, an interest area (IA) of 1963.5

{normalm}^{2}

is considered.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Towards an Efficient Identification Process for Large-Scale RFID Systems

Sánchez

Ramos

2018

Sensors

View full text Add to dashboard Cite

Radio Frequency Identification (RFID) is one of the most widely used wireless communications technologies nowadays. Among the numerous processes executed within an RFID system, the identification processis the most important one. There have been several proposals to efficiently execute such a mechanism, which are based on the use of an RFID identification method. Besides, one of the most studied scenarios comprises one reader and a set of RFID tags, which we call the centralized approach. Recent work shows that executing the identification process in a distributed or parallel way may be of great benefit for applications with high requirements on time and resources usage, i.e., applications where the time required to execute the identification process needs to be low. In this paper, we focus is on large RFID systems and compare two identification mechanisms, one based on the centralized approach and the other based on the distributed approach. Our aim is to find the advantages and disadvantages of each approach for general RFID scenarios. We observe that the distributed approach is very promising compared to the traditional approach since considerable improvements are found in identification delay, and also the implementation costs would be highly reduced.

show abstract

{normalm}^{2}

is considered.…”

Section: Discussionmentioning

confidence: 99%

“…The identification process was executed in a distributed way by using particular anticollision protocols [3,4,5]. Therefore, in literature, there are two important contributions that are pioneers in this research direction.…”

Section: Introductionmentioning

confidence: 99%

Towards an Efficient Identification Process for Large-Scale RFID Systems

Sánchez

Ramos

2018

Sensors

View full text Add to dashboard Cite

show abstract

“…Here, we consider a practical way to implement PDFSA in common RFID systems, taking advantage of the fact that, in general, a tag responds to the reader only if its received signal power is strong enough for activation and signal decoding, or in other words, the tag's instantaneous Signal-to-Noise Ratio (SNR) is greater than the tag's sensitivity threshold. Indeed, an European Union tag operating at 868 MHz requires 50 microwatts to respond from a distance of about 3.25 m, under ideal conditions [19], and hence, transmit power control methods can be used to resolve RFID collision problems [22,31]. Specifically, in Ali et.al.…”

Section: Implementation Of Pdfsa Using Transmit Power Controlmentioning

confidence: 99%

“…There are some methods dealing with this problem. For example, in [22], transmit power can be controlled to cluster the tags in distance ascending order from the reader, however, this method is only applied to tree-based algorithms. Note that the reader could utilize both the tree-based and ALOHA-based algorithms, in which tags are first split into multiple subgroups through the tree-based algorithm with binary suffix strings, and then the ALOHAbased algorithm is used to identify tags in each subgroup [23].…”

mentioning

confidence: 99%

Probabilistic Dynamic Framed Slotted ALOHA for RFID Tag Identification

Nguyen

Hayashi

Kaneko

et al. 2013

Wireless Pers Commun

View full text Add to dashboard Cite

In this paper, we study radio frequency identification tag identification problems using framed slotted ALOHA protocol. Each tag will be assumed to participate in the contention with a certain probability. Then, the frame size and the probability will be dynamically controlled by the reader in every reading round so that all the tags can be detected in a short period of time. Moreover, we propose a practical way of controlling the probability in terms of transmit power control, assuming Additive White Gaussian Noise channel or flat Rayleigh fading channel. Computer simulation results demonstrate the effectiveness of the proposed method.

show abstract

“…Avoiding the collision of tags in the process of data transmission is the key technology in RFID system [1], and some scholars have proposed many tag anti-collision algorithms: for example the binary tree algorithm with adaptability [2], the anti-collision algorithm for dense tag environment [3], query tree-based anti-collision algorithm [4], energy-aware tag anti-collision algorithm [5] and so on. Framed slotted ALOHA is preferred to use in RFID because it can control the probability of transmission of tags, and the estimation of the number of tags is necessary to compute the initial frame size.…”

Section: Introductionmentioning

confidence: 99%

Study on the Improved Framed Slotted ALOHA Anti-Collision Algorithm

Chen

Qin

Wang

2008

2008 4th International Conference on Wireless Communications, Networking and Mobile Computing

View full text Add to dashboard Cite

In order to improve the identification efficiency of tag anti-collision algorithm in RFID system further, the improved framed slotted ALOHA algorithm is proposed with accurate tag estimation and quick identification. the whole process is divided into two phases including tag estimation and tag identification, in tag estimation algorithm, the collision probability threshold parameter is used to estimate the number of tags accurately for the optimization of the number of time slots in the initial frame; in tag identification phase, the binary search algorithm is used to identify the tags fleetly that collide with other tags in time slots. Simulation result shows that the improved FSA consumes less time slots than dynamic framed slotted ALOHA (DFSA), the binary tree protocol and FSA. The proposed algorithm can improve the tag identification efficiency in RFID system further.

show abstract

RFID Anti-collision Protocol for Dense Passive Tag Environments

Cited by 34 publications

References 18 publications

Towards an Efficient Identification Process for Large-Scale RFID Systems

Towards an Efficient Identification Process for Large-Scale RFID Systems

Probabilistic Dynamic Framed Slotted ALOHA for RFID Tag Identification

Study on the Improved Framed Slotted ALOHA Anti-Collision Algorithm

Contact Info

Product

Resources

About