Channel-Oblivious Counting Algorithms for Large-Scale RFID Systems
Scalable, low-latency and accurate RFID counting algorithms have recently been proposed as a fundamental building block to support more complex query operations in a large-scale RFID system. One distinct feature of these algorithms is that they do not require explicit identification of individual ta...
Uloženo v:
| Vydáno v: | IEEE transactions on parallel and distributed systems Ročník 26; číslo 12; s. 3303 - 3316 |
|---|---|
| Hlavní autoři: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.12.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1045-9219, 1558-2183 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Scalable, low-latency and accurate RFID counting algorithms have recently been proposed as a fundamental building block to support more complex query operations in a large-scale RFID system. One distinct feature of these algorithms is that they do not require explicit identification of individual tags and therefore can eliminate the latency bottleneck caused by serialization during multiple access control. However, these algorithms all assume reliable communications between the reader and the tags. While this assumption is also adopted by many tag-identification protocols in the current RFID standards, it is practically unachievable given the current technology and low-cost requirement of RFID tags. In fact, recent empirical studies have found that the communication between an RFID reader and a set of seemingly "in-range" tags are still unreliable and highly non-deterministic due to the varying channel conditions. In this paper, we discuss the design and performance analysis of a set of channel-oblivious RFID counting algorithms which can estimate the size of a tag-set of interest over unreliable wireless channels. The proposed schemes can provide accurate cardinality estimates without any prior knowledge of the channel parameters. We first propose a series of algorithms and analyze their performance under a simplified memoryless lossy channel model. We then extend them to handle the impact due to backscattering effects and correlated losses found in practical RFID systems. Our proposed designs only require simple modifications to standard RFID tags and readers and can be implemented using current technologies with minimal increase in tag/ reader cost. Our designs can also be extended to other RFID counting algorithms which assumed reliable communication channels. |
|---|---|
| AbstractList | Scalable, low-latency and accurate RFID counting algorithms have recently been proposed as a fundamental building block to support more complex query operations in a large-scale RFID system. One distinct feature of these algorithms is that they do not require explicit identification of individual tags and therefore can eliminate the latency bottleneck caused by serialization during multiple access control. However, these algorithms all assume reliable communications between the reader and the tags. While this assumption is also adopted by many tag-identification protocols in the current RFID standards, it is practically unachievable given the current technology and low-cost requirement of RFID tags. In fact, recent empirical studies have found that the communication between an RFID reader and a set of seemingly "in-range" tags are still unreliable and highly non-deterministic due to the varying channel conditions. In this paper, we discuss the design and performance analysis of a set of channel-oblivious RFID counting algorithms which can estimate the size of a tag-set of interest over unreliable wireless channels. The proposed schemes can provide accurate cardinality estimates without any prior knowledge of the channel parameters. We first propose a series of algorithms and analyze their performance under a simplified memoryless lossy channel model. We then extend them to handle the impact due to backscattering effects and correlated losses found in practical RFID systems. Our proposed designs only require simple modifications to standard RFID tags and readers and can be implemented using current technologies with minimal increase in tag/ reader cost. Our designs can also be extended to other RFID counting algorithms which assumed reliable communication channels. |
| Author | Kodialam, Murali Wing Cheong Lau Yulin Deng Nandagopal, Thyaga Wai Kit Sze Onching Yue |
| Author_xml | – sequence: 1 surname: Wai Kit Sze fullname: Wai Kit Sze email: swk.sbcs@gmail.com organization: Stony Brook Univ., Stony Brook, NY, USA – sequence: 2 surname: Yulin Deng fullname: Yulin Deng email: yud207@gmail.com organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China – sequence: 3 surname: Wing Cheong Lau fullname: Wing Cheong Lau email: wclau@ie.cuhk.edu.hk organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China – sequence: 4 givenname: Murali surname: Kodialam fullname: Kodialam, Murali email: muralik@alcatel-lucent.com organization: Bell Labs., Holmdel, NJ, USA – sequence: 5 givenname: Thyaga surname: Nandagopal fullname: Nandagopal, Thyaga email: thyaga.n@gmail.com organization: Bell Labs., Alcatel-Lucent Technol., Murray, NJ, USA – sequence: 6 surname: Onching Yue fullname: Onching Yue email: onching@ie.cuhk.edu.hk organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China |
| BookMark | eNp9kE9PwjAYhxuDiYB-AONliedh_6zbesQhSkKCETw3XddCyWix3Uz49m6BePDg6X0Pz_P-3vxGYGCdVQDcIzhBCLKnzftsPcEQJRNMcpJAcgWGiNI8xigng26HCY0ZRuwGjELYw46kMBmC52InrFV1vCpr821cG6LCtbYxdhtN663zptkdQqSdj5bCb1W8lqJW0cd8MYvWp9CoQ7gF11rUQd1d5hh8zl82xVu8XL0uiukylpiRJmZVwjShCFMtWVKVklZZpkqocpYxqSsCSyzSCuIOIbp_L6VSSyiIkAQxQcbg8Xz36N1Xq0LD9671tovkKCN5lkGG845CZ0p6F4JXmh-9OQh_4gjyvireV8X7qvilqs7J_jjSNKIxzjZemPpf8-FsGqXUb1LKGEphTn4Av_p3WA |
| CODEN | ITDSEO |
| CitedBy_id | crossref_primary_10_1371_journal_pone_0219344 crossref_primary_10_1016_j_matpr_2020_09_604 crossref_primary_10_1007_s10776_016_0329_9 crossref_primary_10_1109_JSEN_2018_2855410 |
| Cites_doi | 10.1109/INFCOM.2013.6566879 10.1109/INFCOM.2010.5461944 10.1109/ICC.2010.5501854 10.1109/ICC.2009.5199030 10.2307/2531487 10.1109/APS.2006.1710704 10.1109/TPDS.2011.36 10.1109/MCOM.1987.1093629 10.1109/49.16840 10.1109/49.16842 10.2307/2531532 10.1109/JSYST.2007.909179 10.1109/5.231342 10.1109/ICDCS.2011.9 10.1109/INFCOM.2007.145 10.1145/1409944.1409970 10.1198/108571101750524670 10.1049/el:19900074 10.1109/WIOPT.2011.5930065 10.2307/2533199 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2015 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2015 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TPDS.2014.2383403 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-2183 |
| EndPage | 3316 |
| ExternalDocumentID | 3883129761 10_1109_TPDS_2014_2383403 6991608 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Research Grants Council of the Hong Kong Special Administrative Region, China grantid: CUHK413610 |
| GroupedDBID | --Z -~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AGQYO AGSQL AHBIQ AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ IEDLZ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS TN5 TWZ UHB AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c293t-9d49f35125fc94dbc5d77eb0e8979cfd30b2a6d025123f145065cfc0a3ac319a3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000364853900008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1045-9219 |
| IngestDate | Sun Nov 30 04:16:29 EST 2025 Sat Nov 29 03:36:08 EST 2025 Tue Nov 18 21:32:39 EST 2025 Wed Aug 27 02:52:19 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Keywords | time-correlated packet loss RFID counting algorithms wireless channel modeling |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-9d49f35125fc94dbc5d77eb0e8979cfd30b2a6d025123f145065cfc0a3ac319a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1738770928 |
| PQPubID | 85437 |
| PageCount | 14 |
| ParticipantIDs | crossref_primary_10_1109_TPDS_2014_2383403 ieee_primary_6991608 crossref_citationtrail_10_1109_TPDS_2014_2383403 proquest_journals_1738770928 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-Dec.-1 2015-12-1 20151201 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 2015-Dec.-1 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on parallel and distributed systems |
| PublicationTitleAbbrev | TPDS |
| PublicationYear | 2015 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref12 ref11 ref10 ref17 (ref14) 0 ref19 (ref16) 0 ref18 kodialam (ref2) 0 sweeney ii (ref1) 2010 rappaport (ref7) 1996 ref23 ref26 ref25 ref20 ref22 chen (ref24) 0 ref21 (ref13) 0 ref28 ref27 deng (ref29) 0 ref8 ref9 ref4 ref3 ref6 neyman (ref15) 1950 ref5 |
| References_xml | – ident: ref27 doi: 10.1109/INFCOM.2013.6566879 – year: 1996 ident: ref7 publication-title: Wireless Communications Principles and Practice – ident: ref25 doi: 10.1109/INFCOM.2010.5461944 – start-page: 291 year: 0 ident: ref24 article-title: Understanding RFID Counting Protocols publication-title: Proc 14th Annu ACM Int Conf Mobile Comput Netw – ident: ref5 doi: 10.1109/ICC.2010.5501854 – ident: ref4 doi: 10.1109/ICC.2009.5199030 – ident: ref18 doi: 10.2307/2531487 – year: 0 ident: ref13 – year: 1950 ident: ref15 publication-title: First course in probability and statistics – ident: ref21 doi: 10.1109/APS.2006.1710704 – year: 2010 ident: ref1 publication-title: RFID for Dummies – start-page: 322 year: 0 ident: ref2 article-title: Fast and reliable estimation schemes in RFID systems publication-title: Proc 13th Annu ACM Int Conf Mobile Comput Netw – start-page: 443 year: 0 ident: ref29 article-title: Design and evaluation of RFID counting algorithms under time-correlated channels publication-title: Proc Consumer Commun Netw Conf – ident: ref26 doi: 10.1109/TPDS.2011.36 – ident: ref11 doi: 10.1109/MCOM.1987.1093629 – ident: ref9 doi: 10.1109/49.16840 – ident: ref8 doi: 10.1109/49.16842 – ident: ref19 doi: 10.2307/2531532 – ident: ref23 doi: 10.1109/JSYST.2007.909179 – ident: ref10 doi: 10.1109/5.231342 – year: 0 ident: ref14 – ident: ref28 doi: 10.1109/ICDCS.2011.9 – ident: ref3 doi: 10.1109/INFCOM.2007.145 – ident: ref22 doi: 10.1145/1409944.1409970 – ident: ref17 doi: 10.1198/108571101750524670 – ident: ref12 doi: 10.1049/el:19900074 – year: 0 ident: ref16 – ident: ref6 doi: 10.1109/WIOPT.2011.5930065 – ident: ref20 doi: 10.2307/2533199 |
| SSID | ssj0014504 |
| Score | 2.1666946 |
| Snippet | Scalable, low-latency and accurate RFID counting algorithms have recently been proposed as a fundamental building block to support more complex query... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 3303 |
| SubjectTerms | Access control Algorithm design and analysis Algorithms Channel estimation counting algorithms Loss measurement Packet switching Probabilistic logic Radio frequency identification Radiofrequency identification RFID Scalability time-correlated packet loss wireless channel modeling Wireless networks |
| Title | Channel-Oblivious Counting Algorithms for Large-Scale RFID Systems |
| URI | https://ieeexplore.ieee.org/document/6991608 https://www.proquest.com/docview/1738770928 |
| Volume | 26 |
| WOSCitedRecordID | wos000364853900008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4g8aAHUdCIotmDJ2Ox7Xa73SOCRBODRDDh1rT7UBIEA4Xf7267NCYaE2897LbNfJ2dmc7jA7gKFOWCaQUMJdEBSiQ9R7sR3FFEuQHm-siMkpxsgg4G0WTChhW4KXthpJR58Zlsm8s8ly8WfG1-ld2Gxpkxnb07lIZFr1aZMQhIThWoowuin-Yxm8H0XHY7HvZGpograGv7hIMtP5a1QTmpyo-TODcv_dr_XuwQDqwbiToF7kdQkfM61LYUDchqbB32v80bbMCd6SWYy5nznM6mG1P9irqWKwJ1Zm-L5TR7_1gh7ceiJ1Mh7ow0ghK99B97yI42P4bX_v24--BYEgWHa0ueOUwETGFt1oniLBApJ4JSmboyYpRxJbCb-kkoTKjhY2XEGBKuuJvghGv1TPAJVOeLuTwFhIVHtUNBCBXaicJ-khpjplIeMl8lFDfB3Yo15nbCuCG6mMV5pOGy2CARGyRii0QTrsstn8V4jb8WN4zoy4VW6k1obbGLrQKuYo_iiFKX-dHZ77vOYU_fmxSVKS2oZsu1vIBdvsmmq-Vl_m19Afb0ybI |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5KFdSDryrW5x48ibFJNpvNHrW1KNZabAVvIdmHFmorbfX3u5Nui6AI3nLYZcN8mZ2ZzOMDOI0Ml0pYBYw1swFKogPPuhHSM8z4EZX2ykyygmyCt9vJ87PolOB80QujtS6Kz_QFPha5fDWSH_irrBajM4OdvUvInOW6tRY5g4gVZIE2vmD2vEC4HGbgi1qv0-hiGVd0YS0UjeYMWc4KFbQqP-7iwsA0N_73apuw7hxJcjlDfgtKergNG3OSBuJ0dhvWvk0crMAVdhMM9cB7yAf9T6x_JXXHFkEuBy-jcX_6-jYh1pMlLawR97oWQ00em7cN4oab78BT87pXv_EcjYInrS2fekJFwlBr2JmRIlK5ZIpznfs6EVxIo6ifh1msMNgIqUExxkwa6Wc0k1ZBM7oL5eFoqPeAUBVw61IwxhUCEGY5mjOTy1iEJuO0Cv5crKl0M8aR6mKQFrGGL1JEIkUkUodEFc4WW95nAzb-WlxB0S8WOqlX4XCOXepUcJIGnCac-yJM9n_fdQIrN737Vtq6bd8dwKo9h83qVA6hPB1_6CNYlp_T_mR8XHxnX6X0zPs |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Channel-Oblivious+Counting+Algorithms+for+Large-Scale+RFID+Systems&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Sze%2C+Wai+Kit&rft.au=Deng%2C+Yulin&rft.au=Lau%2C+Wing+Cheong&rft.au=Kodialam%2C+Murali&rft.date=2015-12-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=26&rft.issue=12&rft.spage=3303&rft_id=info:doi/10.1109%2FTPDS.2014.2383403&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3883129761 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon |