{"id":"https://openalex.org/W2004000487","doi":"https://doi.org/10.1109/wd.2010.5657728","title":"Trade-off between hops and delays in hub-based forwarding in DTNs","display_name":"Trade-off between hops and delays in hub-based forwarding in DTNs","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2004000487","doi":"https://doi.org/10.1109/wd.2010.5657728","mag":"2004000487"},"language":"en","primary_location":{"id":"doi:10.1109/wd.2010.5657728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wd.2010.5657728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IFIP Wireless Days","raw_type":"proceedings-article"},"type":"article","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/A5023356812","display_name":"Alessandro Adamo","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Adamo","raw_affiliation_strings":["Dipartimento di Scienze dell'Informazione (DSI), Universita degli studi di Milano, Milan, Italy","Dipartimento di Scienze dell'Informazione (DSI), Universit\u00e0 degli studi di Milano, Via Comelico 39, I-20135 Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione (DSI), Universita degli studi di Milano, Milan, Italy","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione (DSI), Universit\u00e0 degli studi di Milano, Via Comelico 39, I-20135 Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037883962","display_name":"Giuliano Grossi","orcid":"https://orcid.org/0000-0001-9274-4047"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuliano Grossi","raw_affiliation_strings":["Dipartimento di Scienze dell'Informazione (DSI), Universita degli studi di Milano, Milan, Italy","Dipartimento di Scienze dell'Informazione (DSI), Universit\u00e0 degli studi di Milano, Via Comelico 39, I-20135 Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione (DSI), Universita degli studi di Milano, Milan, Italy","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione (DSI), Universit\u00e0 degli studi di Milano, Via Comelico 39, I-20135 Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016573065","display_name":"Federico Pedersini","orcid":"https://orcid.org/0000-0001-7367-6114"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Pedersini","raw_affiliation_strings":["Dipartimento di Scienze dell'Informazione (DSI), Universita degli studi di Milano, Milan, Italy","Dipartimento di Scienze dell'Informazione (DSI), Universit\u00e0 degli studi di Milano, Via Comelico 39, I-20135 Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione (DSI), Universita degli studi di Milano, Milan, Italy","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione (DSI), Universit\u00e0 degli studi di Milano, Via Comelico 39, I-20135 Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12292079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9789000153541565,"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.9684000015258789,"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.6776271462440491},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6580064296722412},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6377934217453003},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6141488552093506},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5896810293197632},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5759644508361816},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5663415193557739},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5625860691070557},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5576481819152832},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.503091037273407},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.488920122385025},{"id":"https://openalex.org/keywords/delay-tolerant-networking","display_name":"Delay-tolerant networking","score":0.44497764110565186},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.4275173842906952},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3500778079032898},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.34920454025268555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20105788111686707},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1380665898323059},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08505675196647644},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.08251872658729553}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6776271462440491},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6580064296722412},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6377934217453003},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6141488552093506},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5896810293197632},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5759644508361816},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5663415193557739},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5625860691070557},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5576481819152832},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.503091037273407},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.488920122385025},{"id":"https://openalex.org/C53264328","wikidata":"https://www.wikidata.org/wiki/Q55320","display_name":"Delay-tolerant networking","level":5,"score":0.44497764110565186},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.4275173842906952},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3500778079032898},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.34920454025268555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20105788111686707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1380665898323059},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08505675196647644},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.08251872658729553},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wd.2010.5657728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wd.2010.5657728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IFIP Wireless Days","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Good health and well-being","id":"https://metadata.un.org/sdg/3","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1505703356","https://openalex.org/W1971937094","https://openalex.org/W1975804880","https://openalex.org/W2056944867","https://openalex.org/W2086991377","https://openalex.org/W2096509679","https://openalex.org/W2109528718","https://openalex.org/W2112701160","https://openalex.org/W2112876030","https://openalex.org/W2135009572","https://openalex.org/W2135712710","https://openalex.org/W2140391454","https://openalex.org/W2143554828","https://openalex.org/W2164988386","https://openalex.org/W3199947862","https://openalex.org/W6630079033","https://openalex.org/W6633076157","https://openalex.org/W6680141038"],"related_works":["https://openalex.org/W2555559350","https://openalex.org/W1971663816","https://openalex.org/W2113362813","https://openalex.org/W2108305519","https://openalex.org/W1242343826","https://openalex.org/W2138676684","https://openalex.org/W2001312276","https://openalex.org/W2949702215","https://openalex.org/W4241849776","https://openalex.org/W3035942111"],"abstract_inverted_index":{"The":[0],"analysis":[1,150],"of":[2,21,24,46,69,73,83,103,118,144,159,179,187,221],"temporal":[3],"connectivity":[4],"graphs":[5],"associated":[6],"to":[7,53,89,109,153,191,194],"real":[8,172],"mobility":[9,61],"traces":[10],"in":[11,30,51,57,92,156,170],"structureless":[12],"Delay":[13],"Tolerant":[14],"Networks":[15],"(DTN)":[16],"has":[17,43],"revealed":[18],"the":[19,47,67,80,93,104,110,115,126,129,142,157,185,195],"existence":[20],"a":[22,70,90,100,175,204,218],"portion":[23],"nodes,":[25],"called":[26],"hubs,":[27],"appearing":[28],"frequently":[29],"optimal":[31,111],"paths":[32],"connecting":[33],"arbitrary":[34],"node":[35],"pairs.":[36],"Based":[37],"on":[38,141,164],"these":[39],"findings,":[40],"hub-based":[41],"routing":[42,161,202],"become":[44],"one":[45],"most":[48,212],"promising":[49],"strategies":[50],"order":[52],"successfully":[54],"deliver":[55],"messages":[56],"DTNs.":[58],"Considering":[59],"human":[60],"traces,":[62],"we":[63,124],"empirically":[64],"prove":[65],"that":[66,169],"selection":[68],"suitable":[71],"set":[72,178],"hubs":[74,145,180],"as":[75,147],"relays,":[76],"not":[77],"only":[78,216],"ensures":[79],"same":[81],"probability":[82],"successful":[84],"delivery,":[85],"but":[86],"also":[87],"leads":[88],"decrease":[91],"mean":[94,196],"shortest":[95,136,198],"path":[96,119,199],"length,":[97],"combined":[98],"with":[99,107],"limited":[101],"increase":[102],"delivery":[105,205],"time":[106,215],"respect":[108],"case.":[112],"By":[113],"analyzing":[114],"empirical":[116],"distributions":[117],"length":[120],"and":[121,134,183],"travel":[122,214],"times,":[123],"study":[125],"conditions":[127],"for":[128,217],"best":[130],"trade-off":[131],"between":[132],"delay-optimal":[133,197],"delay-sub-optimal":[135],"paths,":[137],"which":[138],"uniquely":[139],"depends":[140],"number":[143,186],"enabled":[146],"forwarders.":[148],"This":[149],"turns":[151],"out":[152],"be":[154],"useful":[155],"design":[158],"energy-saving":[160],"algorithms":[162],"based":[163],"epidemic":[165,201],"propagation.":[166],"We":[167],"found":[168],"some":[171],"experiments,":[173],"using":[174],"very":[176],"little":[177,219],"(under":[181],"50%)":[182],"limiting":[184],"hops":[188],"per":[189],"packet":[190],"three":[192],"(corresponding":[193],"length),":[200],"guaranteed":[203],"ratio":[206],"around":[207],"90%,":[208],"when":[209],"tolerating":[210],"at":[211],"double":[213],"fraction":[220],"messages.":[222]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}