{"id":"https://openalex.org/W1976081465","doi":"https://doi.org/10.1109/infcom.2009.5061927","title":"Information Propagation Speed in Mobile and Delay Tolerant Networks","display_name":"Information Propagation Speed in Mobile and Delay Tolerant Networks","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W1976081465","doi":"https://doi.org/10.1109/infcom.2009.5061927","mag":"1976081465"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5061927","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","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/A5102728318","display_name":"Philippe Jacquet","orcid":"https://orcid.org/0000-0001-7919-1206"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Jacquet","raw_affiliation_strings":["INRIA, Rocquencourt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Rocquencourt","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071932180","display_name":"Bernard Mans","orcid":"https://orcid.org/0000-0001-7897-2043"},"institutions":[{"id":"https://openalex.org/I99043593","display_name":"Macquarie University","ror":"https://ror.org/01sf06y89","country_code":"AU","type":"education","lineage":["https://openalex.org/I99043593"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"B. Mans","raw_affiliation_strings":["Macquarie University, Australia","Macquarie University, Sydney NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Macquarie University, Australia","institution_ids":["https://openalex.org/I99043593"]},{"raw_affiliation_string":"Macquarie University, Sydney NSW, Australia","institution_ids":["https://openalex.org/I99043593"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037352032","display_name":"Georgios Rodolakis","orcid":null},"institutions":[{"id":"https://openalex.org/I99043593","display_name":"Macquarie University","ror":"https://ror.org/01sf06y89","country_code":"AU","type":"education","lineage":["https://openalex.org/I99043593"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"G. Rodolakis","raw_affiliation_strings":["Macquarie University, Sydney, Australia","Macquarie University, Sydney NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Macquarie University, Sydney, Australia","institution_ids":["https://openalex.org/I99043593"]},{"raw_affiliation_string":"Macquarie University, Sydney NSW, Australia","institution_ids":["https://openalex.org/I99043593"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.6495,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.98664517,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"244","last_page":"252"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9979000091552734,"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.9764000177383423,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6899010539054871},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6821562051773071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6194179654121399},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5099936723709106},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.4754352569580078},{"id":"https://openalex.org/keywords/mobility-model","display_name":"Mobility model","score":0.45784419775009155},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4459644854068756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3503417372703552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33288684487342834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30807822942733765},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2475605010986328},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09920424222946167},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08987143635749817}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6899010539054871},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6821562051773071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6194179654121399},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5099936723709106},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.4754352569580078},{"id":"https://openalex.org/C191485582","wikidata":"https://www.wikidata.org/wiki/Q6887309","display_name":"Mobility model","level":2,"score":0.45784419775009155},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4459644854068756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3503417372703552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33288684487342834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30807822942733765},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2475605010986328},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09920424222946167},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08987143635749817}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2009.5061927","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W587813246","https://openalex.org/W1918250237","https://openalex.org/W1964119857","https://openalex.org/W1965396227","https://openalex.org/W1967533244","https://openalex.org/W1984196269","https://openalex.org/W1996160600","https://openalex.org/W2000285226","https://openalex.org/W2011300998","https://openalex.org/W2033097611","https://openalex.org/W2033968113","https://openalex.org/W2037598546","https://openalex.org/W2073418598","https://openalex.org/W2085901659","https://openalex.org/W2095831097","https://openalex.org/W2105273407","https://openalex.org/W2109528718","https://openalex.org/W2111935381","https://openalex.org/W2118323697","https://openalex.org/W2129028537","https://openalex.org/W2137775453","https://openalex.org/W2142346726","https://openalex.org/W2148135143","https://openalex.org/W2149959815","https://openalex.org/W2155550691","https://openalex.org/W2161575750","https://openalex.org/W2166406195","https://openalex.org/W2169293240","https://openalex.org/W2276699909","https://openalex.org/W2313299119","https://openalex.org/W2340541605","https://openalex.org/W2801179766","https://openalex.org/W4300223101"],"related_works":["https://openalex.org/W2554282488","https://openalex.org/W1597743604","https://openalex.org/W2038723108","https://openalex.org/W2033630974","https://openalex.org/W2325737604","https://openalex.org/W4245069437","https://openalex.org/W2042537860","https://openalex.org/W3013085049","https://openalex.org/W4297449606","https://openalex.org/W3112412180"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,10,15,73,166],"this":[3],"paper":[4],"is":[5,115,119,131,145],"to":[6,44,92,98],"increase":[7],"our":[8,87],"understanding":[9],"the":[11,51,68,127,139,164,167],"fundamental":[12],"performance":[13],"limits":[14],"mobile":[16,58],"and":[17,29,38,59,95,111,121],"delay":[18],"tolerant":[19],"networks":[20],"(DTNs),":[21],"where":[22],"end-to-end":[23],"multi-hop":[24],"paths":[25],"may":[26,32],"not":[27],"exist":[28],"communication":[30],"routes":[31],"only":[33],"be":[34,77,90],"available":[35],"through":[36],"time":[37],"mobility.":[39],"We":[40,83,158],"use":[41],"analytical":[42,101],"tools":[43],"derive":[45],"generic":[46],"theoretical":[47],"upper":[48,132,146],"bounds":[49,168],"for":[50,150],"information":[52,128],"propagation":[53,129],"speed":[54,109,130],"in":[55,71,138,169],"large":[56],"scale":[57],"intermittently":[60],"connected":[61],"networks.":[62],"In":[63,103],"other":[64,151],"words,":[65],"we":[66,124],"upper-bound":[67],"optimal":[69],"performance,":[70],"terms":[72],"delay,":[74],"that":[75,126,162],"can":[76,89],"achieved":[78],"using":[79],"any":[80],"routing":[81],"algorithm.":[82],"then":[84],"show":[85],"how":[86],"analysis":[88],"applied":[91],"specific":[93,100],"mobility":[94,152],"graph":[96],"models":[97,153],"obtain":[99],"estimates.":[102],"particular,":[104],"when":[105],"nodes":[106],"move":[107],"at":[108],"v":[110,114],"their":[112],"density":[113],"small":[116],"(the":[117],"network":[118],"sparse":[120],"surely":[122],"disconnected),":[123],"prove":[125],"bounded":[133,147],"by":[134,148],"(1":[135],"+":[136],"O(v2))v":[137],"random":[140],"way-point":[141],"model,":[142],"while":[143],"it":[144],"O(radic(vv)v)":[149],"(random":[154],"walk,":[155],"Brownian":[156],"motion).":[157],"also":[159],"present":[160],"simulations":[161],"confirm":[163],"validity":[165],"these":[170],"scenarios.":[171]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}