Distributed algorithms for the RFID coverage problem
We introduce distributed algorithms for the RFID coverage problem, which is defined as finding the minimum amount of RFID readers that cover every tag. The algorithms depends on rounds of writes and reads in/from the tags' memories. The first algorithm, called Greedy Distributed Elimination (GD...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1762 |
|---|---|
| container_issue | |
| container_start_page | 1758 |
| container_title | |
| container_volume | |
| creator | Jedda, Ahmed Khair, Mazen G. Mouftah, Hussein T. |
| description | We introduce distributed algorithms for the RFID coverage problem, which is defined as finding the minimum amount of RFID readers that cover every tag. The algorithms depends on rounds of writes and reads in/from the tags' memories. The first algorithm, called Greedy Distributed Elimination (GDE), is inspired of, and equivalent to, the greedy approximation algorithm of the set cover problem. Our second contribution is a randomized algorithm that can run in one or more write/read rounds (called RANDOM and RANDOM+). Using concepts concluded from these algorithms, we introduce algorithm GDE-RANDOM+ which improves further the number of non-redundant readers of GDE by integrating it with RAN-DOM+. |
| doi_str_mv | 10.1109/ICC.2013.6654773 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6654773</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6654773</ieee_id><sourcerecordid>6654773</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-405c711a70d7c8f5b8e0d68339d64f6edced00b41566e29f220ad04289d650a63</originalsourceid><addsrcrecordid>eNotj81Kw0AURkdRsNTsBTd5gcR75-fOZCmprYGCILouk8xNO5KSMomCb2_Brr4DBw58QjwglIhQPTV1XUpAVRIZba26ElllHWqySqGU9lossFKuQOfUzZmNgUIR2DuRTdMXAKAlUkYvhF7FaU6x_Z455H7YjynOh-OU92PK5wPn7-tmlXfjDye_5_yUxnbg47247f0wcXbZpfhcv3zUr8X2bdPUz9siojVzocF0FtFbCLZzvWkdQyCnVBVI98Sh4wDQajRELKteSvABtHRnb8CTWorH_25k5t0pxaNPv7vLZ_UH90hGlQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Distributed algorithms for the RFID coverage problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jedda, Ahmed ; Khair, Mazen G. ; Mouftah, Hussein T.</creator><creatorcontrib>Jedda, Ahmed ; Khair, Mazen G. ; Mouftah, Hussein T.</creatorcontrib><description>We introduce distributed algorithms for the RFID coverage problem, which is defined as finding the minimum amount of RFID readers that cover every tag. The algorithms depends on rounds of writes and reads in/from the tags' memories. The first algorithm, called Greedy Distributed Elimination (GDE), is inspired of, and equivalent to, the greedy approximation algorithm of the set cover problem. Our second contribution is a randomized algorithm that can run in one or more write/read rounds (called RANDOM and RANDOM+). Using concepts concluded from these algorithms, we introduce algorithm GDE-RANDOM+ which improves further the number of non-redundant readers of GDE by integrating it with RAN-DOM+.</description><identifier>ISSN: 1550-3607</identifier><identifier>EISSN: 1938-1883</identifier><identifier>EISBN: 9781467331227</identifier><identifier>EISBN: 1467331228</identifier><identifier>DOI: 10.1109/ICC.2013.6654773</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Approximation algorithms ; Low earth orbit satellites ; Monitoring ; Radiofrequency identification ; Wireless sensor networks</subject><ispartof>2013 IEEE International Conference on Communications (ICC), 2013, p.1758-1762</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6654773$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6654773$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jedda, Ahmed</creatorcontrib><creatorcontrib>Khair, Mazen G.</creatorcontrib><creatorcontrib>Mouftah, Hussein T.</creatorcontrib><title>Distributed algorithms for the RFID coverage problem</title><title>2013 IEEE International Conference on Communications (ICC)</title><addtitle>ICC</addtitle><description>We introduce distributed algorithms for the RFID coverage problem, which is defined as finding the minimum amount of RFID readers that cover every tag. The algorithms depends on rounds of writes and reads in/from the tags' memories. The first algorithm, called Greedy Distributed Elimination (GDE), is inspired of, and equivalent to, the greedy approximation algorithm of the set cover problem. Our second contribution is a randomized algorithm that can run in one or more write/read rounds (called RANDOM and RANDOM+). Using concepts concluded from these algorithms, we introduce algorithm GDE-RANDOM+ which improves further the number of non-redundant readers of GDE by integrating it with RAN-DOM+.</description><subject>Algorithm design and analysis</subject><subject>Approximation algorithms</subject><subject>Low earth orbit satellites</subject><subject>Monitoring</subject><subject>Radiofrequency identification</subject><subject>Wireless sensor networks</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>9781467331227</isbn><isbn>1467331228</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81Kw0AURkdRsNTsBTd5gcR75-fOZCmprYGCILouk8xNO5KSMomCb2_Brr4DBw58QjwglIhQPTV1XUpAVRIZba26ElllHWqySqGU9lossFKuQOfUzZmNgUIR2DuRTdMXAKAlUkYvhF7FaU6x_Z455H7YjynOh-OU92PK5wPn7-tmlXfjDye_5_yUxnbg47247f0wcXbZpfhcv3zUr8X2bdPUz9siojVzocF0FtFbCLZzvWkdQyCnVBVI98Sh4wDQajRELKteSvABtHRnb8CTWorH_25k5t0pxaNPv7vLZ_UH90hGlQ</recordid><startdate>201306</startdate><enddate>201306</enddate><creator>Jedda, Ahmed</creator><creator>Khair, Mazen G.</creator><creator>Mouftah, Hussein T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201306</creationdate><title>Distributed algorithms for the RFID coverage problem</title><author>Jedda, Ahmed ; Khair, Mazen G. ; Mouftah, Hussein T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-405c711a70d7c8f5b8e0d68339d64f6edced00b41566e29f220ad04289d650a63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithm design and analysis</topic><topic>Approximation algorithms</topic><topic>Low earth orbit satellites</topic><topic>Monitoring</topic><topic>Radiofrequency identification</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Jedda, Ahmed</creatorcontrib><creatorcontrib>Khair, Mazen G.</creatorcontrib><creatorcontrib>Mouftah, Hussein T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jedda, Ahmed</au><au>Khair, Mazen G.</au><au>Mouftah, Hussein T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Distributed algorithms for the RFID coverage problem</atitle><btitle>2013 IEEE International Conference on Communications (ICC)</btitle><stitle>ICC</stitle><date>2013-06</date><risdate>2013</risdate><spage>1758</spage><epage>1762</epage><pages>1758-1762</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><eisbn>9781467331227</eisbn><eisbn>1467331228</eisbn><abstract>We introduce distributed algorithms for the RFID coverage problem, which is defined as finding the minimum amount of RFID readers that cover every tag. The algorithms depends on rounds of writes and reads in/from the tags' memories. The first algorithm, called Greedy Distributed Elimination (GDE), is inspired of, and equivalent to, the greedy approximation algorithm of the set cover problem. Our second contribution is a randomized algorithm that can run in one or more write/read rounds (called RANDOM and RANDOM+). Using concepts concluded from these algorithms, we introduce algorithm GDE-RANDOM+ which improves further the number of non-redundant readers of GDE by integrating it with RAN-DOM+.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2013.6654773</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1550-3607 |
| ispartof | 2013 IEEE International Conference on Communications (ICC), 2013, p.1758-1762 |
| issn | 1550-3607 1938-1883 |
| language | eng |
| recordid | cdi_ieee_primary_6654773 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Approximation algorithms Low earth orbit satellites Monitoring Radiofrequency identification Wireless sensor networks |
| title | Distributed algorithms for the RFID coverage problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T15%3A29%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Distributed%20algorithms%20for%20the%20RFID%20coverage%20problem&rft.btitle=2013%20IEEE%20International%20Conference%20on%20Communications%20(ICC)&rft.au=Jedda,%20Ahmed&rft.date=2013-06&rft.spage=1758&rft.epage=1762&rft.pages=1758-1762&rft.issn=1550-3607&rft.eissn=1938-1883&rft_id=info:doi/10.1109/ICC.2013.6654773&rft_dat=%3Cieee_6IE%3E6654773%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467331227&rft.eisbn_list=1467331228&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6654773&rfr_iscdi=true |