{"id":"https://openalex.org/W2044184930","doi":"https://doi.org/10.1109/infcom.2010.5462135","title":"Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing","display_name":"Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2044184930","doi":"https://doi.org/10.1109/infcom.2010.5462135","mag":"2044184930"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2010.5462135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2010.5462135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052271875","display_name":"Theus Hossmann","orcid":"https://orcid.org/0000-0002-4036-6221"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Theus Hossmann","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056364055","display_name":"Thrasyvoulos Spyropoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thrasyvoulos Spyropoulos","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089856017","display_name":"Franck Legendre","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Franck Legendre","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":19.9425,"has_fulltext":false,"cited_by_count":160,"citation_normalized_percentile":{"value":0.99806892,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7834669947624207},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.768051266670227},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4437548518180847},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4425656795501709},{"id":"https://openalex.org/keywords/sophistication","display_name":"Sophistication","score":0.4366436302661896},{"id":"https://openalex.org/keywords/delay-tolerant-networking","display_name":"Delay-tolerant networking","score":0.4124804735183716},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38860082626342773},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3863663375377655},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3731813430786133},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35416364669799805},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35067954659461975},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.15833023190498352},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09195882081985474}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834669947624207},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.768051266670227},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4437548518180847},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4425656795501709},{"id":"https://openalex.org/C168725872","wikidata":"https://www.wikidata.org/wiki/Q991663","display_name":"Sophistication","level":2,"score":0.4366436302661896},{"id":"https://openalex.org/C53264328","wikidata":"https://www.wikidata.org/wiki/Q55320","display_name":"Delay-tolerant networking","level":5,"score":0.4124804735183716},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38860082626342773},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3863663375377655},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3731813430786133},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35416364669799805},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35067954659461975},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.15833023190498352},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09195882081985474},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2010.5462135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2010.5462135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1207633162","https://openalex.org/W1490760466","https://openalex.org/W1527463082","https://openalex.org/W1578099820","https://openalex.org/W1964119857","https://openalex.org/W1978231807","https://openalex.org/W1983345514","https://openalex.org/W1987235421","https://openalex.org/W2010634640","https://openalex.org/W2013672662","https://openalex.org/W2022713969","https://openalex.org/W2032094375","https://openalex.org/W2037933327","https://openalex.org/W2039157284","https://openalex.org/W2056944867","https://openalex.org/W2082674813","https://openalex.org/W2095293504","https://openalex.org/W2112701160","https://openalex.org/W2123825896","https://openalex.org/W2125957038","https://openalex.org/W2135712710","https://openalex.org/W2141615341","https://openalex.org/W2143554828","https://openalex.org/W2144148193","https://openalex.org/W2144447514","https://openalex.org/W2145636261","https://openalex.org/W2148606196","https://openalex.org/W2148899275","https://openalex.org/W2153297552","https://openalex.org/W2165874743","https://openalex.org/W2293146328","https://openalex.org/W2316753634","https://openalex.org/W2569576787","https://openalex.org/W4232932184","https://openalex.org/W4241072175","https://openalex.org/W4244494905","https://openalex.org/W4251670979","https://openalex.org/W6684578312"],"related_works":["https://openalex.org/W2317823609","https://openalex.org/W4241263575","https://openalex.org/W3130462184","https://openalex.org/W2902287117","https://openalex.org/W4318256508","https://openalex.org/W2401463593","https://openalex.org/W2349808627","https://openalex.org/W2391671934","https://openalex.org/W2938528237","https://openalex.org/W2900704462"],"abstract_inverted_index":{"Delay":[0],"Tolerant":[1],"Networks":[2],"(DTN)":[3],"are":[4,20,67,214],"networks":[5],"of":[6,42,59,76,94,123,191,207,211,222],"self-organizing":[7],"wireless":[8],"nodes,":[9],"where":[10,226],"end-to-end":[11],"connectivity":[12],"is":[13,115,183,186],"intermittent.":[14],"In":[15,108],"these":[16],"networks,":[17],"forwarding":[18],"decisions":[19],"generally":[21],"made":[22],"using":[23],"locally":[24,267],"collected":[25],"knowledge":[26],"about":[27],"node":[28,96,265],"behavior":[29],"(e.g.,":[30,78,84],"past":[31,66],"contacts":[32,144],"between":[33],"nodes)":[34],"to":[35,50,69,90,97,105,145,204,255,266,271],"predict":[36],"future":[37],"contact":[38],"opportunities.":[39],"The":[40],"use":[41],"complex":[43,167],"network":[44,168],"analysis":[45],"has":[46],"been":[47,88],"recently":[48],"suggested":[49],"perform":[51],"this":[52,109,238,257,261],"prediction":[53],"task":[54],"and":[55,73,80,126,160,170,195,251,269,276],"improve":[56],"the":[57,65,92,106,119,130,137,140,146,179,227,233,272],"performance":[58,174,279],"DTN":[60,155],"routing.":[61],"Contacts":[62],"seen":[63],"in":[64,209,280],"aggregated":[68,147,228],"a":[70,74,95,99,189,205,218],"social":[71,124,148],"graph,":[72],"variety":[75],"metrics":[77,125],"centrality":[79],"similarity)":[81],"or":[82,101,121],"algorithms":[83,127,157],"community":[85],"detection)":[86],"have":[87],"proposed":[89],"assess":[91],"utility":[93],"deliver":[98],"content":[100],"bring":[102],"it":[103,114],"closer":[104],"destination.":[107],"paper,":[110],"we":[111,198,240],"argue":[112],"that":[113,128,163,172,200,245],"not":[116],"so":[117],"much":[118],"choice":[120],"sophistication":[122],"bears":[129],"most":[131,230],"weight":[132],"on":[133,165,177],"performance,":[134],"but":[135],"rather":[136],"mapping":[138,180],"from":[139,248],"mobility":[141,193,235],"process":[142],"generating":[143],"graph.":[149],"We":[150],"first":[151],"study":[152],"two":[153],"well-known":[154],"routing":[156],"-":[158,162],"SimBet":[159],"BubbleRap":[161],"rely":[164],"such":[166],"analysis,":[169],"show":[171,199],"their":[173],"heavily":[175],"depends":[176],"how":[178],"(contact":[181],"aggregation)":[182],"performed.":[184],"What":[185],"more,":[187],"for":[188,217],"range":[190,221],"synthetic":[192],"models":[194],"real":[196],"traces,":[197],"improved":[201],"performances":[202],"(up":[203],"factor":[206],"4":[208],"terms":[210],"delivery":[212],"ratio)":[213],"consistently":[215],"achieved":[216],"relatively":[219],"narrow":[220],"aggregation":[223],"levels":[224],"only,":[225],"graph":[229,253,259],"closely":[231],"reflects":[232],"underlying":[234],"structure.":[236],"To":[237],"end,":[239],"propose":[241],"an":[242],"online":[243],"algorithm":[244,262],"uses":[246],"concepts":[247],"unsupervised":[249],"learning":[250],"spectral":[252],"theory":[254],"infer":[256],"'correct'":[258],"structure;":[260],"allows":[263],"each":[264],"identify":[268],"adjust":[270],"optimal":[273],"operating":[274],"point,":[275],"achieves":[277],"good":[278],"all":[281],"scenarios":[282],"considered.":[283]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":29},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":22}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}