An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags
Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2008-11, Vol.12 (11), p.861-863 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 863 |
|---|---|
| container_issue | 11 |
| container_start_page | 861 |
| container_title | IEEE communications letters |
| container_volume | 12 |
| creator | Jun-Bong Eom Tae-Jin Lee Rietman, R. Yener, A. |
| description | Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution. |
| doi_str_mv | 10.1109/LCOMM.2008.081157 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_4685979</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4685979</ieee_id><sourcerecordid>34498334</sourcerecordid><originalsourceid>FETCH-LOGICAL-c386t-e8457ab0ed670c79fc3f19e6ab446c987659bbef586f4d7f6f71f959209575393</originalsourceid><addsrcrecordid>eNp9kU1r3DAQhk1poWnaH1B6EYWWXLyRbH0el03zARsWQnsWsjxKFbTWRtIS-u8rxyGHHnoZiXmfeWHmbZrPBK8Iwep8u9nd3q46jOUKS0KYeNOcEMZk29Xytv6xVK0QSr5vPuT8gCvYMXLSPK4nBM5562EqyCWzh7HNIZYCI1pvd9drZMJ9TL783qOnWtHBV3UhkZlGNPjJpD8oQwBbfJyQi6kKxbc2huDz3IoO3V3eXKBi7vPH5p0zIcOnl_e0-XX54-fmut3urm42621re8lLC5IyYQYMIxfYCuVs74gCbgZKuVVScKaGARyT3NFROO4EcYqpDismWK_60-b74ntI8fEIuei9zxZCMBPEY9Y9pUr2Pa3g2X9BwgWhPeeYVfTrP-hDPKaprqEl74QgXM0QWSCbYs4JnD4kv6830gTrOSz9HJaew9JLWHXm24uxydaEet3J-vw62GHJqv-81JeF8wDwKlMumarqXz1_nIY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>862771695</pqid></control><display><type>article</type><title>An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags</title><source>IEEE Electronic Library (IEL)</source><creator>Jun-Bong Eom ; Tae-Jin Lee ; Rietman, R. ; Yener, A.</creator><creatorcontrib>Jun-Bong Eom ; Tae-Jin Lee ; Rietman, R. ; Yener, A.</creatorcontrib><description>Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2008.081157</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Access methods and protocols, osi model ; Access protocols ; Algorithms ; Analytical models ; Anti-collision ; Applied sciences ; Binary trees ; Collision avoidance ; collision threshold ; Collisions ; Exact sciences and technology ; Frames ; Information technology ; Optimization ; Performance analysis ; pilot frame ; Pilots ; Radio frequency identification ; Radiofrequency identification ; Radiolocalization and radionavigation ; RFID ; RFID tags ; Robustness ; Signal resolution ; tag estimation ; tag identification ; Tags ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Throughput</subject><ispartof>IEEE communications letters, 2008-11, Vol.12 (11), p.861-863</ispartof><rights>2008 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c386t-e8457ab0ed670c79fc3f19e6ab446c987659bbef586f4d7f6f71f959209575393</citedby><cites>FETCH-LOGICAL-c386t-e8457ab0ed670c79fc3f19e6ab446c987659bbef586f4d7f6f71f959209575393</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4685979$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4685979$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20856279$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Jun-Bong Eom</creatorcontrib><creatorcontrib>Tae-Jin Lee</creatorcontrib><creatorcontrib>Rietman, R.</creatorcontrib><creatorcontrib>Yener, A.</creatorcontrib><title>An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.</description><subject>Access methods and protocols, osi model</subject><subject>Access protocols</subject><subject>Algorithms</subject><subject>Analytical models</subject><subject>Anti-collision</subject><subject>Applied sciences</subject><subject>Binary trees</subject><subject>Collision avoidance</subject><subject>collision threshold</subject><subject>Collisions</subject><subject>Exact sciences and technology</subject><subject>Frames</subject><subject>Information technology</subject><subject>Optimization</subject><subject>Performance analysis</subject><subject>pilot frame</subject><subject>Pilots</subject><subject>Radio frequency identification</subject><subject>Radiofrequency identification</subject><subject>Radiolocalization and radionavigation</subject><subject>RFID</subject><subject>RFID tags</subject><subject>Robustness</subject><subject>Signal resolution</subject><subject>tag estimation</subject><subject>tag identification</subject><subject>Tags</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Throughput</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kU1r3DAQhk1poWnaH1B6EYWWXLyRbH0el03zARsWQnsWsjxKFbTWRtIS-u8rxyGHHnoZiXmfeWHmbZrPBK8Iwep8u9nd3q46jOUKS0KYeNOcEMZk29Xytv6xVK0QSr5vPuT8gCvYMXLSPK4nBM5562EqyCWzh7HNIZYCI1pvd9drZMJ9TL783qOnWtHBV3UhkZlGNPjJpD8oQwBbfJyQi6kKxbc2huDz3IoO3V3eXKBi7vPH5p0zIcOnl_e0-XX54-fmut3urm42621re8lLC5IyYQYMIxfYCuVs74gCbgZKuVVScKaGARyT3NFROO4EcYqpDismWK_60-b74ntI8fEIuei9zxZCMBPEY9Y9pUr2Pa3g2X9BwgWhPeeYVfTrP-hDPKaprqEl74QgXM0QWSCbYs4JnD4kv6830gTrOSz9HJaew9JLWHXm24uxydaEet3J-vw62GHJqv-81JeF8wDwKlMumarqXz1_nIY</recordid><startdate>20081101</startdate><enddate>20081101</enddate><creator>Jun-Bong Eom</creator><creator>Tae-Jin Lee</creator><creator>Rietman, R.</creator><creator>Yener, A.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20081101</creationdate><title>An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags</title><author>Jun-Bong Eom ; Tae-Jin Lee ; Rietman, R. ; Yener, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c386t-e8457ab0ed670c79fc3f19e6ab446c987659bbef586f4d7f6f71f959209575393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Access methods and protocols, osi model</topic><topic>Access protocols</topic><topic>Algorithms</topic><topic>Analytical models</topic><topic>Anti-collision</topic><topic>Applied sciences</topic><topic>Binary trees</topic><topic>Collision avoidance</topic><topic>collision threshold</topic><topic>Collisions</topic><topic>Exact sciences and technology</topic><topic>Frames</topic><topic>Information technology</topic><topic>Optimization</topic><topic>Performance analysis</topic><topic>pilot frame</topic><topic>Pilots</topic><topic>Radio frequency identification</topic><topic>Radiofrequency identification</topic><topic>Radiolocalization and radionavigation</topic><topic>RFID</topic><topic>RFID tags</topic><topic>Robustness</topic><topic>Signal resolution</topic><topic>tag estimation</topic><topic>tag identification</topic><topic>Tags</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Throughput</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jun-Bong Eom</creatorcontrib><creatorcontrib>Tae-Jin Lee</creatorcontrib><creatorcontrib>Rietman, R.</creatorcontrib><creatorcontrib>Yener, A.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jun-Bong Eom</au><au>Tae-Jin Lee</au><au>Rietman, R.</au><au>Yener, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2008-11-01</date><risdate>2008</risdate><volume>12</volume><issue>11</issue><spage>861</spage><epage>863</epage><pages>861-863</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2008.081157</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2008-11, Vol.12 (11), p.861-863 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_ieee_primary_4685979 |
| source | IEEE Electronic Library (IEL) |
| subjects | Access methods and protocols, osi model Access protocols Algorithms Analytical models Anti-collision Applied sciences Binary trees Collision avoidance collision threshold Collisions Exact sciences and technology Frames Information technology Optimization Performance analysis pilot frame Pilots Radio frequency identification Radiofrequency identification Radiolocalization and radionavigation RFID RFID tags Robustness Signal resolution tag estimation tag identification Tags Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Throughput |
| title | An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T23%3A09%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20efficient%20framed-slotted%20ALOHA%20algorithm%20with%20pilot%20frame%20and%20binary%20selection%20for%20anti-collision%20of%20RFID%20tags&rft.jtitle=IEEE%20communications%20letters&rft.au=Jun-Bong%20Eom&rft.date=2008-11-01&rft.volume=12&rft.issue=11&rft.spage=861&rft.epage=863&rft.pages=861-863&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2008.081157&rft_dat=%3Cproquest_RIE%3E34498334%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=862771695&rft_id=info:pmid/&rft_ieee_id=4685979&rfr_iscdi=true |