Shelving Interference and Joint Identification in Large-Scale RFID Systems
Prior work on anti-collision for radio frequency identification (RFID) systems usually schedule adjacent readers to exclusively interrogate tags for avoiding reader collisions. Although such a pattern can effectively deal with collisions, the lack of readers' collaboration wastes numerous time...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on parallel and distributed systems 2015-11, Vol.26 (11), p.3149-3159 |
---|---|
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 | 3159 |
---|---|
container_issue | 11 |
container_start_page | 3149 |
container_title | IEEE transactions on parallel and distributed systems |
container_volume | 26 |
creator | Yang, Lei Qi, Yong Han, Jinsong Wang, Cheng Liu, Yunhao |
description | Prior work on anti-collision for radio frequency identification (RFID) systems usually schedule adjacent readers to exclusively interrogate tags for avoiding reader collisions. Although such a pattern can effectively deal with collisions, the lack of readers' collaboration wastes numerous time on the scheduling process and dramatically degrades the throughput of identification. Even worse, the tags within the overlapped interrogation regions of adjacent readers (termed as contentious tags), even if the number of such tags is very small, introduce a significant delay to the identification process. In this paper, we propose a new strategy for collision resolution. First, we shelve the collisions and identify the tags that do not involve reader collisions. Second, we perform a joint identification, in which adjacent readers collaboratively identify the contentious tags. In particular, we find that neighboring readers can cause a new type of tag collision, cross-tag-collision, which may impede the joint identification. We propose a protocol stack, named Season, to undertake the tasks in two phases and solve the cross-tag-collision. We conduct extensive simulations and preliminary implementation to demonstrate the efficiency of our scheme. The results show that our scheme can achieve above 6× improvement on the identification throughput in a large-scale dense reader environment. |
doi_str_mv | 10.1109/TPDS.2013.276 |
format | Article |
fullrecord | <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TPDS_2013_276</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6654142</ieee_id><sourcerecordid>10_1109_TPDS_2013_276</sourcerecordid><originalsourceid>FETCH-LOGICAL-c257t-8c5f771952165155208f5edbc4d7c60056bf8a6fe3adaaef9b5cf7f8d86d94a73</originalsourceid><addsrcrecordid>eNo9kM1KAzEYRYMoWKtLV27yAqlJJn-zlNbWKQXFqeshTb7USJtKMgh9e6dUXN27OFwuB6F7RieM0fpx_TZrJ5yyasK1ukAjJqUhnJnqcuhUSFJzVl-jm1K-KGVCUjFCy_YTdj8xbXGTesgBMiQH2CaPl4eYetx4SH0M0dk-HhKOCa9s3gJpnd0Bfp83M9weSw_7couugt0VuPvLMfqYP6-nL2T1umimTyviuNQ9MU4GrVktOVNyuMipCRL8xgmvnaJUqk0wVgWorLcWQr2RLuhgvFG-FlZXY0TOuy4fSskQuu8c9zYfO0a7k4juJKI7iegGEQP_cOYjAPyzSknBBK9-AcmtWdc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Shelving Interference and Joint Identification in Large-Scale RFID Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Yang, Lei ; Qi, Yong ; Han, Jinsong ; Wang, Cheng ; Liu, Yunhao</creator><creatorcontrib>Yang, Lei ; Qi, Yong ; Han, Jinsong ; Wang, Cheng ; Liu, Yunhao</creatorcontrib><description>Prior work on anti-collision for radio frequency identification (RFID) systems usually schedule adjacent readers to exclusively interrogate tags for avoiding reader collisions. Although such a pattern can effectively deal with collisions, the lack of readers' collaboration wastes numerous time on the scheduling process and dramatically degrades the throughput of identification. Even worse, the tags within the overlapped interrogation regions of adjacent readers (termed as contentious tags), even if the number of such tags is very small, introduce a significant delay to the identification process. In this paper, we propose a new strategy for collision resolution. First, we shelve the collisions and identify the tags that do not involve reader collisions. Second, we perform a joint identification, in which adjacent readers collaboratively identify the contentious tags. In particular, we find that neighboring readers can cause a new type of tag collision, cross-tag-collision, which may impede the joint identification. We propose a protocol stack, named Season, to undertake the tasks in two phases and solve the cross-tag-collision. We conduct extensive simulations and preliminary implementation to demonstrate the efficiency of our scheme. The results show that our scheme can achieve above 6× improvement on the identification throughput in a large-scale dense reader environment.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2013.276</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>IEEE</publisher><subject>Collaboration ; Computer Systems Organization ; Delays ; Interference ; Joints ; Protocols ; Radiofrequency identification ; Sensor networks ; Special-Purpose and Application-Based Systems ; Throughput ; Ubiquitous computing</subject><ispartof>IEEE transactions on parallel and distributed systems, 2015-11, Vol.26 (11), p.3149-3159</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c257t-8c5f771952165155208f5edbc4d7c60056bf8a6fe3adaaef9b5cf7f8d86d94a73</citedby><cites>FETCH-LOGICAL-c257t-8c5f771952165155208f5edbc4d7c60056bf8a6fe3adaaef9b5cf7f8d86d94a73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6654142$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6654142$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yang, Lei</creatorcontrib><creatorcontrib>Qi, Yong</creatorcontrib><creatorcontrib>Han, Jinsong</creatorcontrib><creatorcontrib>Wang, Cheng</creatorcontrib><creatorcontrib>Liu, Yunhao</creatorcontrib><title>Shelving Interference and Joint Identification in Large-Scale RFID Systems</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>Prior work on anti-collision for radio frequency identification (RFID) systems usually schedule adjacent readers to exclusively interrogate tags for avoiding reader collisions. Although such a pattern can effectively deal with collisions, the lack of readers' collaboration wastes numerous time on the scheduling process and dramatically degrades the throughput of identification. Even worse, the tags within the overlapped interrogation regions of adjacent readers (termed as contentious tags), even if the number of such tags is very small, introduce a significant delay to the identification process. In this paper, we propose a new strategy for collision resolution. First, we shelve the collisions and identify the tags that do not involve reader collisions. Second, we perform a joint identification, in which adjacent readers collaboratively identify the contentious tags. In particular, we find that neighboring readers can cause a new type of tag collision, cross-tag-collision, which may impede the joint identification. We propose a protocol stack, named Season, to undertake the tasks in two phases and solve the cross-tag-collision. We conduct extensive simulations and preliminary implementation to demonstrate the efficiency of our scheme. The results show that our scheme can achieve above 6× improvement on the identification throughput in a large-scale dense reader environment.</description><subject>Collaboration</subject><subject>Computer Systems Organization</subject><subject>Delays</subject><subject>Interference</subject><subject>Joints</subject><subject>Protocols</subject><subject>Radiofrequency identification</subject><subject>Sensor networks</subject><subject>Special-Purpose and Application-Based Systems</subject><subject>Throughput</subject><subject>Ubiquitous computing</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM1KAzEYRYMoWKtLV27yAqlJJn-zlNbWKQXFqeshTb7USJtKMgh9e6dUXN27OFwuB6F7RieM0fpx_TZrJ5yyasK1ukAjJqUhnJnqcuhUSFJzVl-jm1K-KGVCUjFCy_YTdj8xbXGTesgBMiQH2CaPl4eYetx4SH0M0dk-HhKOCa9s3gJpnd0Bfp83M9weSw_7couugt0VuPvLMfqYP6-nL2T1umimTyviuNQ9MU4GrVktOVNyuMipCRL8xgmvnaJUqk0wVgWorLcWQr2RLuhgvFG-FlZXY0TOuy4fSskQuu8c9zYfO0a7k4juJKI7iegGEQP_cOYjAPyzSknBBK9-AcmtWdc</recordid><startdate>20151101</startdate><enddate>20151101</enddate><creator>Yang, Lei</creator><creator>Qi, Yong</creator><creator>Han, Jinsong</creator><creator>Wang, Cheng</creator><creator>Liu, Yunhao</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20151101</creationdate><title>Shelving Interference and Joint Identification in Large-Scale RFID Systems</title><author>Yang, Lei ; Qi, Yong ; Han, Jinsong ; Wang, Cheng ; Liu, Yunhao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c257t-8c5f771952165155208f5edbc4d7c60056bf8a6fe3adaaef9b5cf7f8d86d94a73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Collaboration</topic><topic>Computer Systems Organization</topic><topic>Delays</topic><topic>Interference</topic><topic>Joints</topic><topic>Protocols</topic><topic>Radiofrequency identification</topic><topic>Sensor networks</topic><topic>Special-Purpose and Application-Based Systems</topic><topic>Throughput</topic><topic>Ubiquitous computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Lei</creatorcontrib><creatorcontrib>Qi, Yong</creatorcontrib><creatorcontrib>Han, Jinsong</creatorcontrib><creatorcontrib>Wang, Cheng</creatorcontrib><creatorcontrib>Liu, Yunhao</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>CrossRef</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yang, Lei</au><au>Qi, Yong</au><au>Han, Jinsong</au><au>Wang, Cheng</au><au>Liu, Yunhao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Shelving Interference and Joint Identification in Large-Scale RFID Systems</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2015-11-01</date><risdate>2015</risdate><volume>26</volume><issue>11</issue><spage>3149</spage><epage>3159</epage><pages>3149-3159</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>Prior work on anti-collision for radio frequency identification (RFID) systems usually schedule adjacent readers to exclusively interrogate tags for avoiding reader collisions. Although such a pattern can effectively deal with collisions, the lack of readers' collaboration wastes numerous time on the scheduling process and dramatically degrades the throughput of identification. Even worse, the tags within the overlapped interrogation regions of adjacent readers (termed as contentious tags), even if the number of such tags is very small, introduce a significant delay to the identification process. In this paper, we propose a new strategy for collision resolution. First, we shelve the collisions and identify the tags that do not involve reader collisions. Second, we perform a joint identification, in which adjacent readers collaboratively identify the contentious tags. In particular, we find that neighboring readers can cause a new type of tag collision, cross-tag-collision, which may impede the joint identification. We propose a protocol stack, named Season, to undertake the tasks in two phases and solve the cross-tag-collision. We conduct extensive simulations and preliminary implementation to demonstrate the efficiency of our scheme. The results show that our scheme can achieve above 6× improvement on the identification throughput in a large-scale dense reader environment.</abstract><pub>IEEE</pub><doi>10.1109/TPDS.2013.276</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1045-9219 |
ispartof | IEEE transactions on parallel and distributed systems, 2015-11, Vol.26 (11), p.3149-3159 |
issn | 1045-9219 1558-2183 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TPDS_2013_276 |
source | IEEE Electronic Library (IEL) |
subjects | Collaboration Computer Systems Organization Delays Interference Joints Protocols Radiofrequency identification Sensor networks Special-Purpose and Application-Based Systems Throughput Ubiquitous computing |
title | Shelving Interference and Joint Identification in Large-Scale RFID Systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T03%3A07%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Shelving%20Interference%20and%20Joint%20Identification%20in%20Large-Scale%20RFID%20Systems&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Yang,%20Lei&rft.date=2015-11-01&rft.volume=26&rft.issue=11&rft.spage=3149&rft.epage=3159&rft.pages=3149-3159&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2013.276&rft_dat=%3Ccrossref_RIE%3E10_1109_TPDS_2013_276%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6654142&rfr_iscdi=true |