A NEW EPC-C1G2 BASED ANTI-COLLISION ALGORITHM TO ADDRESS TAGS’ STARVATION IN RFID SYSTEMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ABBASIAN A.; SAFKHANI M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2018 | Volume:16 | Issue:1 Page(s): 79-87

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

655

Download:

Cites:

Information Journal Paper

Title

A NEW EPC-C1G2 BASED ANTI-COLLISION ALGORITHM TO ADDRESS TAGS’ STARVATION IN RFID SYSTEMS

Author(s)

ABBASIAN A. | SAFKHANI M. | Issue Writer Certificate

Keywords

ANTI-COLLISIONQ1

DIFFERENT-VALUEQ1

STARVATIONQ1

IDENTIFICATIONQ2

Abstract

In this paper, we present a new EPC-C1G2 standard based ANTI-COLLISION algorithm to solve the problem of tags’ STARVATION in RFID systems. Non deterministic IDENTIFICATION of tags in the collisions lots, leads to tags’ STARVATION phenomenon. In this paper, to address this problem, we use the position of the first different value bits that are the first different bits in the tags’ 16-bit random number (or RN16).In fact, the reader in facing with collision slots, earns the position of the first DIFFERENT-VALUE bit in RN16 and uses it to deterministic IDENTIFICATION of tags. Unlike recent ANTI-COLLISION algorithms, which in them it is assumed that tags send information synchronous or asynchronous, in the proposed ANTI-COLLISION algorithm in order to obtain the position of the first DIFFERENT-VALUE bit there is not any assumption on synchronous or asynchronous sending information by tags. Based on simulation which is done, the average time of IDENTIFICATION for 200 to 2000tags in the proposed ANTI-COLLISION algorithm relative to average time of IDENTIFICATION in EPC-C1G2, BIS and ERN2 ANTI-COLLISION algorithms is less than 0.92, 0.71, and 0.42 second, respectively.

Cites

No record.

References

No record.

Cite

APA: Copy

ABBASIAN, A., & SAFKHANI, M.. (2018). A NEW EPC-C1G2 BASED ANTI-COLLISION ALGORITHM TO ADDRESS TAGS’ STARVATION IN RFID SYSTEMS. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 16(1 ), 79-87. SID. https://sid.ir/paper/228385/en

Vancouver: Copy

ABBASIAN A., SAFKHANI M.. A NEW EPC-C1G2 BASED ANTI-COLLISION ALGORITHM TO ADDRESS TAGS’ STARVATION IN RFID SYSTEMS. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2018;16(1 ):79-87. Available from: https://sid.ir/paper/228385/en

IEEE: Copy

A. ABBASIAN, and M. SAFKHANI, “A NEW EPC-C1G2 BASED ANTI-COLLISION ALGORITHM TO ADDRESS TAGS’ STARVATION IN RFID SYSTEMS,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 16, no. 1 , pp. 79–87, 2018, [Online]. Available: https://sid.ir/paper/228385/en

Related Journal Papers