Decentralized RFID coverage algorithms using writeable tags
A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID tag in a given area. The RFID coverage (RFC) problem is defined as follows. Given a reader network, assign to each tag t a specific reader v...
Uložené v:
| Vydané v: | Computer networks (Amsterdam, Netherlands : 1999) Ročník 102; s. 96 - 108 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Amsterdam
Elsevier B.V
19.06.2016
Elsevier Sequoia S.A |
| Predmet: | |
| ISSN: | 1389-1286, 1872-7069 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID tag in a given area. The RFID coverage (RFC) problem is defined as follows. Given a reader network, assign to each tag t a specific reader v in its proximity such that v is responsible for covering t (called its owner), while minimizing the number of owner readers. The problem has applications in energy conservation and in eliminating readers and data redundancy from the reader networks. We introduce a number of decentralized algorithms for the RFID coverage problem: 1) algorithms RANDOM, RANDOM+, and MAX-MIN which are randomized algorithms that run in O(1) write/read rounds, 2) algorithm GDE which is an efficient decentralized implementation of the greedy set cover algorithm, and 3) an improvement of GDE which is called . Our algorithms assume that the RFID tags are writeable, where a writeable tag is a passive RFID tag with writeable memory. We show using simulation experiments that our algorithms outperform major RFID coverage algorithms in various scenarios with respect to a number of performance metrics. |
|---|---|
| AbstractList | A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID tag in a given area. The RFID coverage (RFC) problem is defined as follows. Given a reader network, assign to each tag t a specific reader v in its proximity such that v is responsible for covering t (called its owner), while minimizing the number of owner readers. The problem has applications in energy conservation and in eliminating readers and data redundancy from the reader networks. We introduce a number of decentralized algorithms for the RFID coverage problem: 1) algorithms RANDOM, RANDOM+ , and MAX-MIN which are randomized algorithms that run in O(1) write/read rounds, 2) algorithm GDE which is an efficient decentralized implementation of the greedy set cover algorithm, and 3) an improvement of GDE which is called . Our algorithms assume that the RFID tags are writeable, where a writeable tag is a passive RFID tag with writeable memory. We show using simulation experiments that our algorithms outperform major RFID coverage algorithms in various scenarios with respect to a number of performance metrics. |
| Author | Khair, Mazen G. Jedda, Ahmed Mouftah, Hussein T. |
| Author_xml | – sequence: 1 givenname: Ahmed surname: Jedda fullname: Jedda, Ahmed email: ahmed.jedda@uottawa.ca – sequence: 2 givenname: Mazen G. orcidid: 0000-0001-6888-1391 surname: Khair fullname: Khair, Mazen G. email: mkhair@site.uottawa.ca – sequence: 3 givenname: Hussein T. surname: Mouftah fullname: Mouftah, Hussein T. email: mouftah@uottawa.ca |
| BookMark | eNqFkE1LxDAQhoMo6Kr_wEPBi5fWfHSbREGQ9RMEQfQc0mS6Zuk2a5Iq-uvNsp486Glm4HlfhmeCtgc_AEJHBFcEk-Z0URm_HCBVNF8VZhXGbAvtEcFpyXEjt_POhCwJFc0umsS4wBjXNRV76PwKDAwp6N59gS2ebu6vCuPfIeg5FLqf--DS6zIWY3TDvPjIF-i2hyLpeTxAO53uIxz-zH30cnP9PLsrHx5v72eXD6WpGU4lZ0bitpOCUs2pwIC7RmhrWy0p67gFoCIjtqmNFbzV1Eoj2ZTJllpSA2X76GTTuwr-bYSY1NJFA32vB_BjVETQad1gzklGj3-hCz-GIX-nCJdMUkqna-psQ5ngYwzQKeOSTs6vRbheEazWXtVCbbyqtVeFmcpec7j-FV4Ft9Th87_YxSYG2dS7g6CicTAYsC6AScp693fBNw_olYc |
| CitedBy_id | crossref_primary_10_1109_JRFID_2018_2795801 crossref_primary_10_1016_j_comnet_2017_04_035 |
| Cites_doi | 10.1016/j.jnca.2013.07.015 10.1016/j.comnet.2008.03.003 10.1145/1978802.1978811 10.1145/1138127.1138131 10.1016/j.jpdc.2008.06.013 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier B.V. Copyright Elsevier Sequoia S.A. Jun 19, 2016 |
| Copyright_xml | – notice: 2016 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Jun 19, 2016 |
| DBID | AAYXX CITATION 7SC 8FD E3H F2A JQ2 L7M L~C L~D |
| DOI | 10.1016/j.comnet.2016.03.003 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database Library & Information Sciences Abstracts (LISA) Library & Information Science Abstracts (LISA) 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 Library and Information Science Abstracts (LISA) ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1872-7069 |
| EndPage | 108 |
| ExternalDocumentID | 4079057611 10_1016_j_comnet_2016_03_003 S1389128616300676 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 77K 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABMAC ABYKQ ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE J1W JJJVA KOM M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. PQQKQ Q38 RIG ROL RPZ RXW SDF SDG SDP SES SPC SPCBC SST SSV SSZ T5K TAE TN5 ZMT ~G- 29F 77I 9DU AATTM AAXKI AAYWO AAYXX ABFNM ABJNI ABXDB ACLOT ACNNM ACVFH ADCNI ADJOM AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS F0J FGOYB HZ~ R2- SEW ZY4 ~HD 7SC 8FD E3H F2A JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c430t-73c90bf9822a7280e0f68addba923f7dee283c9d64cd87ba2d9c93539b2d14e23 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000377838100007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1389-1286 |
| IngestDate | Sun Nov 09 09:23:05 EST 2025 Sat Nov 15 15:51:29 EST 2025 Sat Nov 29 05:30:24 EST 2025 Tue Nov 18 21:38:57 EST 2025 Fri Feb 23 02:26:55 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | RFID RFID coverage Topology construction Distributed algorithms |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c430t-73c90bf9822a7280e0f68addba923f7dee283c9d64cd87ba2d9c93539b2d14e23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0001-6888-1391 |
| PQID | 1793922251 |
| PQPubID | 47119 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_1825460771 proquest_journals_1793922251 crossref_citationtrail_10_1016_j_comnet_2016_03_003 crossref_primary_10_1016_j_comnet_2016_03_003 elsevier_sciencedirect_doi_10_1016_j_comnet_2016_03_003 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-06-19 |
| PublicationDateYYYYMMDD | 2016-06-19 |
| PublicationDate_xml | – month: 06 year: 2016 text: 2016-06-19 day: 19 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Computer networks (Amsterdam, Netherlands : 1999) |
| PublicationYear | 2016 |
| Publisher | Elsevier B.V Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A |
| References | Young (bib0020) 1995 Cărbunar, Grama, Vitek, Cărbunar (bib0005) 2006; 2 Aggarwal, Han (bib0003) 2013 Alsalihy, Askar (bib0017) 2013 Motwani, Raghavan (bib0019) 1995 Dong, Shukla, Shrivastava, Agrawal, Banerjee, Kar (bib0010) 2008; 52 Hsu, Chen, Yang (bib0008) 2007 Yu, Yu, Lin (bib0007) 2008; 1 Irfan, Yagoub (bib0009) 2010; 3 Dhas, Muthukaruppan, Balakrishnan, Ganesan (bib0011) 2010 Leiserson, Rivest, Stein, Cormen (bib0014) 2001 Swedberg (bib0001) 2009 EPCglobal (bib0002) 2011 Yihua, Shilei (bib0015) 2011; 1 (bib0018) 2011 Wang (bib0004) 2011; 43 Carbunar, Ramanathan, Koyutürk, Jagannathan, Grama (bib0006) 2009; 69 Jedda, Mouftah (bib0012) 2015 Lu, Yu (bib0013) 2014; 39 Jedda (bib0021) 2014 Ali, Alsalih, Hassanein (bib0016) 2011 Swedberg (10.1016/j.comnet.2016.03.003_sbref0001) 2009 Motwani (10.1016/j.comnet.2016.03.003_bib0019) 1995 Wang (10.1016/j.comnet.2016.03.003_bib0004) 2011; 43 Yu (10.1016/j.comnet.2016.03.003_bib0007) 2008; 1 Hsu (10.1016/j.comnet.2016.03.003_bib0008) 2007 Cărbunar (10.1016/j.comnet.2016.03.003_bib0005) 2006; 2 Leiserson (10.1016/j.comnet.2016.03.003_bib0014) 2001 EPCglobal (10.1016/j.comnet.2016.03.003_bib0002) 2011 Jedda (10.1016/j.comnet.2016.03.003_bib0021) 2014 Carbunar (10.1016/j.comnet.2016.03.003_bib0006) 2009; 69 Lu (10.1016/j.comnet.2016.03.003_bib0013) 2014; 39 Dong (10.1016/j.comnet.2016.03.003_bib0010) 2008; 52 Irfan (10.1016/j.comnet.2016.03.003_bib0009) 2010; 3 Yihua (10.1016/j.comnet.2016.03.003_bib0015) 2011; 1 Jedda (10.1016/j.comnet.2016.03.003_bib0012) 2015 Dhas (10.1016/j.comnet.2016.03.003_bib0011) 2010 Young (10.1016/j.comnet.2016.03.003_bib0020) 1995 Aggarwal (10.1016/j.comnet.2016.03.003_sbref0003) 2013 Alsalihy (10.1016/j.comnet.2016.03.003_bib0017) 2013 Ali (10.1016/j.comnet.2016.03.003_bib0016) 2011 (10.1016/j.comnet.2016.03.003_bib0018) 2011 |
| References_xml | – year: 2001 ident: bib0014 article-title: Introduction to algorithms – start-page: 41 year: 2010 end-page: 49 ident: bib0011 article-title: Optimal solution for RFID load balancing publication-title: Recent trends in networks and communications – volume: 1 start-page: 89 year: 2008 end-page: 92 ident: bib0007 article-title: A density-based algorithm for redundant reader elimination in a RFID network publication-title: The second international conference on future generation communication and networking (FGCN’08) – year: 2015 ident: bib0012 article-title: Decentralized RFID coverage algorithms with applications for the reader collision avoidance problem publication-title: IEEE Trans Emerg Top Comput – start-page: 832 year: 2011 end-page: 837 ident: bib0016 article-title: Using neighbor and tag estimations for redundant reader eliminations in RFID networks publication-title: Wireless communications and networking conference (WCNC) – year: 2011 ident: bib0002 article-title: Tag Data Standard, version 1.6 publication-title: Tech. Rep. – volume: 43 start-page: 1 year: 2011 end-page: 53 ident: bib0004 article-title: Coverage problems in sensor networks: A survey publication-title: ACM Comput Surv – volume: 39 start-page: 280 year: 2014 end-page: 291 ident: bib0013 article-title: A fuzzy k-coverage approach for RFID network planning using plant growth simulation algorithm publication-title: J Netw Comput Appl – year: 2011 ident: bib0018 article-title: Tag Data Standard, version 1.6 publication-title: Tech. Rep. – year: 2009 ident: bib0001 article-title: Chip-size passive RFID tag promise long range publication-title: RFID J – start-page: 170 year: 1995 end-page: 178 ident: bib0020 article-title: Randomized rounding without solving the linear program publication-title: The sixth annual ACM-SIAM symposium on Discrete algorithms – year: 2013 ident: bib0003 – volume: 1 start-page: 209 year: 2011 end-page: 214 ident: bib0015 article-title: A middleware-based approach for redundant reader elimination publication-title: The fifth international conference on new trends in information science and service Science (NISS) – start-page: 138 year: 2007 end-page: 145 ident: bib0008 article-title: A layered optimization approach for redundant reader elimination in wireless RFID networks publication-title: The second IEEE Asia-Pacific service computing conference – volume: 2 start-page: 94 year: 2006 end-page: 128 ident: bib0005 article-title: Redundancy and coverage detection in sensor networks publication-title: ACM Trans Sens Netw. – start-page: 1 year: 2013 end-page: 18 ident: bib0017 article-title: Enhancement of redundant reader elimination by using hybrid algorithm in RFID systems publication-title: Wireless Pers Commun – year: 1995 ident: bib0019 publication-title: Randomized algorithms – volume: 3 start-page: 1 year: 2010 end-page: 8 ident: bib0009 article-title: Efficient algorithm for redundant reader elimination in wireless RFID networks publication-title: Int j comput sci issues – year: 2014 ident: bib0021 publication-title: Distributed algorithms for networks formation in a scalable internet of things – volume: 69 start-page: 180 year: 2009 end-page: 196 ident: bib0006 article-title: Efficient tag detection in RFID systems publication-title: J. Parallel Distrib Comput. – volume: 52 start-page: 1782 year: 2008 end-page: 1796 ident: bib0010 article-title: Load balancing in large-scale RFID systems publication-title: Comput Netw – volume: 3 start-page: 1 issue: 11 year: 2010 ident: 10.1016/j.comnet.2016.03.003_bib0009 article-title: Efficient algorithm for redundant reader elimination in wireless RFID networks publication-title: Int j comput sci issues – year: 2011 ident: 10.1016/j.comnet.2016.03.003_bib0018 article-title: Tag Data Standard, version 1.6 – year: 2011 ident: 10.1016/j.comnet.2016.03.003_bib0002 article-title: Tag Data Standard, version 1.6 – issue: 99 year: 2015 ident: 10.1016/j.comnet.2016.03.003_bib0012 article-title: Decentralized RFID coverage algorithms with applications for the reader collision avoidance problem publication-title: IEEE Trans Emerg Top Comput – start-page: 1 year: 2013 ident: 10.1016/j.comnet.2016.03.003_bib0017 article-title: Enhancement of redundant reader elimination by using hybrid algorithm in RFID systems publication-title: Wireless Pers Commun – start-page: 41 year: 2010 ident: 10.1016/j.comnet.2016.03.003_bib0011 article-title: Optimal solution for RFID load balancing – volume: 39 start-page: 280 year: 2014 ident: 10.1016/j.comnet.2016.03.003_bib0013 article-title: A fuzzy k-coverage approach for RFID network planning using plant growth simulation algorithm publication-title: J Netw Comput Appl doi: 10.1016/j.jnca.2013.07.015 – year: 2009 ident: 10.1016/j.comnet.2016.03.003_sbref0001 article-title: Chip-size passive RFID tag promise long range publication-title: RFID J – volume: 52 start-page: 1782 year: 2008 ident: 10.1016/j.comnet.2016.03.003_bib0010 article-title: Load balancing in large-scale RFID systems publication-title: Comput Netw doi: 10.1016/j.comnet.2008.03.003 – volume: 43 start-page: 1 issue: 4 year: 2011 ident: 10.1016/j.comnet.2016.03.003_bib0004 article-title: Coverage problems in sensor networks: A survey publication-title: ACM Comput Surv doi: 10.1145/1978802.1978811 – year: 2001 ident: 10.1016/j.comnet.2016.03.003_bib0014 – year: 2013 ident: 10.1016/j.comnet.2016.03.003_sbref0003 – volume: 1 start-page: 209 year: 2011 ident: 10.1016/j.comnet.2016.03.003_bib0015 article-title: A middleware-based approach for redundant reader elimination – volume: 1 start-page: 89 year: 2008 ident: 10.1016/j.comnet.2016.03.003_bib0007 article-title: A density-based algorithm for redundant reader elimination in a RFID network – start-page: 138 year: 2007 ident: 10.1016/j.comnet.2016.03.003_bib0008 article-title: A layered optimization approach for redundant reader elimination in wireless RFID networks – start-page: 832 year: 2011 ident: 10.1016/j.comnet.2016.03.003_bib0016 article-title: Using neighbor and tag estimations for redundant reader eliminations in RFID networks – start-page: 170 year: 1995 ident: 10.1016/j.comnet.2016.03.003_bib0020 article-title: Randomized rounding without solving the linear program – volume: 2 start-page: 94 issue: 1 year: 2006 ident: 10.1016/j.comnet.2016.03.003_bib0005 article-title: Redundancy and coverage detection in sensor networks publication-title: ACM Trans Sens Netw. doi: 10.1145/1138127.1138131 – volume: 69 start-page: 180 issue: 2 year: 2009 ident: 10.1016/j.comnet.2016.03.003_bib0006 article-title: Efficient tag detection in RFID systems publication-title: J. Parallel Distrib Comput. doi: 10.1016/j.jpdc.2008.06.013 – year: 1995 ident: 10.1016/j.comnet.2016.03.003_bib0019 – year: 2014 ident: 10.1016/j.comnet.2016.03.003_bib0021 |
| SSID | ssj0004428 |
| Score | 2.1665087 |
| Snippet | A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 96 |
| SubjectTerms | Algorithms Automatic identification Computer simulation Decentralization Decentralized Distributed algorithms Energy conservation Experiments Greedy algorithms Monitors Networks Performance measurement Proximity Radio Radio frequency identification Readers Redundancy RFID RFID coverage Simulation Studies Tags Topology construction Tracking |
| Title | Decentralized RFID coverage algorithms using writeable tags |
| URI | https://dx.doi.org/10.1016/j.comnet.2016.03.003 https://www.proquest.com/docview/1793922251 https://www.proquest.com/docview/1825460771 |
| Volume | 102 |
| WOSCitedRecordID | wos000377838100007&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7069 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: AIEXJ dateStart: 19990114 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb5tAEF5ZTg_toepTdZtWVOoNEQFLgFVOVpM0ySGqKlfyDS27S01k48iAG-XXZ2ZZHknUpjn0gnjtCpiPmY9hHoR8wQrjsfKlEwT7gRMAB3dYwDNHZinQZcGVF6a62UR0fh7P5-z7aLRtc2G2y6go4qsrdvlfRQ37QNiYOvsIcXeTwg5YB6HDEsQOy38S_KEyAZf5NZDJH8enh7bAOE0MzuHLX-tNXi1WpV1rJ8Fv2FI6e6rixmPeli0w7R7sogkU197Z6QrrKkgDoj5X2DgWGBs4Fs6UlI3TdrEyGVSo2Bc83zRJQteqsL_tdRJf11nFtZPnpC5LlRf2bG_ok_BCjJ0ymq9Ro0CDHLB84S096_oDTcnCgc31dG2H--q88SxcoDTgZjEQL2xK0tLefLW_7O9YtS7WsA1ju0iaWRKcJXFpoovE7vjwweSOyc709Gh-1mfUBrorb3cfbdKljgy8fzV_IjV3zLvmLLMX5Ln52LCmDUhekpEqXpFngxKUr8nBLbhYCBerhYvVw8XScLE6uFgIlzfk5_HR7OuJYxpqOCKgbuVEVDA3zbBkI8e2ZMrNwhgMXMqB5meRVArIpmAyDISMo5T7kglG9ylLfekFyqdvybhYF-odsZQbyjRWjCMjpy5DIpkJEUkXB1E2IbR9Iokw1eax6cky-Zs8JsTpRl021VYeOD9qH3ZiGGPDBBNA0AMjd1vZJOblLRM0VgwdIN6EfO4Og77Fn2i8UOsaztEdJNwo8t4_8mI_kKf9u7JLxtWmVh_JE7Gt8nLzySDwBqtKolw |
| linkProvider | Elsevier |
| 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=Decentralized+RFID+coverage+algorithms+using+writeable+tags&rft.jtitle=Computer+networks+%28Amsterdam%2C+Netherlands+%3A+1999%29&rft.au=Jedda%2C+Ahmed&rft.au=Khair%2C+Mazen+G.&rft.au=Mouftah%2C+Hussein+T.&rft.date=2016-06-19&rft.issn=1389-1286&rft.volume=102&rft.spage=96&rft.epage=108&rft_id=info:doi/10.1016%2Fj.comnet.2016.03.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_comnet_2016_03_003 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-1286&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-1286&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-1286&client=summon |