Routing schemes for hybrid communication networks
Saved in:
| Published in: | Theoretical computer science Vol. 985; p. 114352 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
21.02.2024
|
| ISSN: | 0304-3975 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| ArticleNumber | 114352 |
|---|---|
| Author | Werthmann, Julian Czumaj, Artur Schneider, Philipp Coy, Sam Scheideler, Christian |
| Author_xml | – sequence: 1 givenname: Sam orcidid: 0000-0001-8500-8690 surname: Coy fullname: Coy, Sam – sequence: 2 givenname: Artur surname: Czumaj fullname: Czumaj, Artur – sequence: 3 givenname: Christian surname: Scheideler fullname: Scheideler, Christian – sequence: 4 givenname: Philipp surname: Schneider fullname: Schneider, Philipp – sequence: 5 givenname: Julian surname: Werthmann fullname: Werthmann, Julian |
| BookMark | eNotz81OwzAQBGAfikRbeABueYGEtTd2kiOq-JMqISE4W-7apgnERnYq1LcnVTuXmdNI34otQgyOsTsOFQeu7odqolwJEFhxXqMUC7YEhLrErpHXbJXzAHNko5aMv8fD1IevItPejS4XPqZif9yl3hYUx_EQejJTH0MR3PQX03e-YVfe_GR3e-k1-3x6_Ni8lNu359fNw7YkUcNUcqtq1xkBZEEiEsnG2s7YVu3aBluhfIckpAClCB1H6RRBx-ctpPXocc34-ZdSzDk5r39TP5p01Bz0yakHPTv1yanPTvwH5PpK8A |
| Cites_doi | 10.1023/A:1012319418150 10.1137/11085178X |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2023.114352 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2023_114352 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9DU 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ YNT ZMT ZY4 ~G- ~HD |
| ID | FETCH-LOGICAL-c240t-1d64e9a20cd0533cc57dd9ad86b873826f93c252066c3e135e6c091c3e25df3f3 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001156366000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:20:24 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c240t-1d64e9a20cd0533cc57dd9ad86b873826f93c252066c3e135e6c091c3e25df3f3 |
| ORCID | 0000-0001-8500-8690 |
| OpenAccessLink | https://doi.org/10.1016/j.tcs.2023.114352 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2023_114352 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-02-21 |
| PublicationDateYYYYMMDD | 2024-02-21 |
| PublicationDate_xml | – month: 02 year: 2024 text: 2024-02-21 day: 21 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2024 |
| References | Augustine (10.1016/j.tcs.2023.114352_br0040) 2020 Halldórsson (10.1016/j.tcs.2023.114352_br0120) 2019 Das Sarma (10.1016/j.tcs.2023.114352_br0220) 2012; 41 Schneider (10.1016/j.tcs.2023.114352_br0230) 2023 Bose (10.1016/j.tcs.2023.114352_br0050) 2001; 7 Censor-Hillel (10.1016/j.tcs.2023.114352_br0080) 2021 Kuhn (10.1016/j.tcs.2023.114352_br0150) 2003 Kuhn (10.1016/j.tcs.2023.114352_br0140) 2022 Elkin (10.1016/j.tcs.2023.114352_br0100) 2016 Kuhn (10.1016/j.tcs.2023.114352_br0160) 2002 Augustine (10.1016/j.tcs.2023.114352_br0030) 2019 Kuhn (10.1016/j.tcs.2023.114352_br0170) 2003 Anagnostides (10.1016/j.tcs.2023.114352_br0010) 2021; vol. 209 Censor-Hillel (10.1016/j.tcs.2023.114352_br0070) 2021; vol. 187 Castenow (10.1016/j.tcs.2023.114352_br0060) 2020 Kuhn (10.1016/j.tcs.2023.114352_br0130) 2020 Coy (10.1016/j.tcs.2023.114352_br0090) 2022; vol. 217 Lynch (10.1016/j.tcs.2023.114352_br0200) 1996 Asadi (10.1016/j.tcs.2023.114352_br0020) 2016 Lenzen (10.1016/j.tcs.2023.114352_br0180) 2013 Lenzen (10.1016/j.tcs.2023.114352_br0190) 2015 Feldmann (10.1016/j.tcs.2023.114352_br0110) 2020 Rozhoň (10.1016/j.tcs.2023.114352_br0210) 2022 |
| References_xml | – start-page: 14:1 year: 2020 ident: 10.1016/j.tcs.2023.114352_br0060 article-title: A bounding box overlay for competitive routing in hybrid communication networks – start-page: 381 year: 2013 ident: 10.1016/j.tcs.2023.114352_br0180 article-title: Fast routing table construction using small messages: extended abstract – start-page: 235 year: 2016 ident: 10.1016/j.tcs.2023.114352_br0100 article-title: On efficient distributed construction of near optimal routing schemes – year: 2023 ident: 10.1016/j.tcs.2023.114352_br0230 – start-page: 267 year: 2003 ident: 10.1016/j.tcs.2023.114352_br0170 article-title: Worst-case optimal and average-case efficient geometric ad-hoc routing – start-page: 1280 year: 2020 ident: 10.1016/j.tcs.2023.114352_br0040 article-title: Shortest paths in a hybrid network model – volume: vol. 187 start-page: 21:1 year: 2021 ident: 10.1016/j.tcs.2023.114352_br0070 article-title: Distance computations in the hybrid network model via oracle simulations – volume: vol. 209 start-page: 5:1 year: 2021 ident: 10.1016/j.tcs.2023.114352_br0010 article-title: Deterministic distributed algorithms and lower bounds in the hybrid model – start-page: 69 year: 2019 ident: 10.1016/j.tcs.2023.114352_br0030 article-title: Distributed computation in node-capacitated networks – volume: 7 start-page: 609 issue: 6 year: 2001 ident: 10.1016/j.tcs.2023.114352_br0050 article-title: Routing with guaranteed delivery in ad hoc wireless networks publication-title: Wirel. Netw. doi: 10.1023/A:1012319418150 – volume: vol. 217 start-page: 11:1 year: 2022 ident: 10.1016/j.tcs.2023.114352_br0090 article-title: Near-shortest path routing in hybrid communication networks – start-page: 153 year: 2015 ident: 10.1016/j.tcs.2023.114352_br0190 article-title: Fast partial distance estimation and applications – start-page: 63 year: 2003 ident: 10.1016/j.tcs.2023.114352_br0150 article-title: Geometric ad-hoc routing: of theory and practice – year: 1996 ident: 10.1016/j.tcs.2023.114352_br0200 – start-page: 28:1 year: 2022 ident: 10.1016/j.tcs.2023.114352_br0140 article-title: Routing schemes and distance oracles in the hybrid model – start-page: 109 year: 2020 ident: 10.1016/j.tcs.2023.114352_br0130 article-title: Computing shortest paths and diameter in the hybrid network model – start-page: 127 year: 2019 ident: 10.1016/j.tcs.2023.114352_br0120 article-title: Plain SINR is enough! – start-page: 24 year: 2002 ident: 10.1016/j.tcs.2023.114352_br0160 article-title: Asymptotically optimal geometric mobile ad-hoc routing – volume: 41 start-page: 1235 issue: 5 year: 2012 ident: 10.1016/j.tcs.2023.114352_br0220 article-title: Distributed verification and hardness of distributed approximation publication-title: SIAM J. Comput. doi: 10.1137/11085178X – start-page: 31:1 year: 2020 ident: 10.1016/j.tcs.2023.114352_br0110 article-title: Fast hybrid network algorithms for shortest paths in sparse graphs – start-page: 478 year: 2022 ident: 10.1016/j.tcs.2023.114352_br0210 article-title: Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms – start-page: 151 year: 2021 ident: 10.1016/j.tcs.2023.114352_br0080 article-title: On sparsity awareness in distributed computations – start-page: 1 year: 2016 ident: 10.1016/j.tcs.2023.114352_br0020 article-title: An sdr-based experimental study of outband d2d communications |
| SSID | ssj0000576 |
| Score | 2.4114144 |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 114352 |
| Title | Routing schemes for hybrid communication networks |
| Volume | 985 |
| WOSCitedRecordID | wos001156366000001&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 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211213 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxsxELZK0gMcoKWteFZ76Am0UdeO1_YxQkGA2giJgHJbOX4oILGN8kCBX8947X2AqFQOvVgr72pk-RvNzM4ToR9GS8LZOI2p5TbuWqtimRoSj6klRLPEkGLy3M0vNhjw0UhchvYE82KcAMtzvlqJ6X-FGvYAbFc6-w64K6KwAc8AOqwAO6z_BLzL8SmcBACH68Tk8ggnj64wy-WP19Ugx7nPAJ837dNho65RhYEPx0FLVuEK7767kvfVztPyXhZhoN4MVFgd3JkUXbRCreEkyJPG69y9n9WOnWnTCYG7RVF30pBVxAVYhB-CUgpWwWlDNCbOMsNvSm3vQLjrLJRroI5Jp_72ZYfsV5qryicsU9XuMiCRORKZJ7GG2phRwVuo3Tvvjy5qJU2ZD2OHc5cB7yL179U5GiZLw_YYfkKb4ach6nmwP6MPJt9GW-VAjijI52208btqwjv_gpLACVHghAg4IfKcEL3ghKjkhK_o-rQ_PDmLw4SMWIEltogTnXaNkPin0q6mWinKtBZS83TMGYE_RyuIwtS17FfEJISaVIGBCM-Yakss-YZa-Z_c7KBIYQ62upAWaHW5VFJLxsB6VtYwZiXeRUflJWRT3wgl--u1773n4320XrPUAWotZktziD6qh8XtfPY9APcM_KRYcg |
| 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=Routing+schemes+for+hybrid+communication+networks&rft.jtitle=Theoretical+computer+science&rft.au=Coy%2C+Sam&rft.au=Czumaj%2C+Artur&rft.au=Scheideler%2C+Christian&rft.au=Schneider%2C+Philipp&rft.date=2024-02-21&rft.issn=0304-3975&rft.volume=985&rft.spage=114352&rft_id=info:doi/10.1016%2Fj.tcs.2023.114352&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2023_114352 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |