{"id":"https://openalex.org/W1483953177","doi":"https://doi.org/10.1109/tit.2010.2059830","title":"Information Propagation Speed in Mobile and Delay Tolerant Networks","display_name":"Information Propagation Speed in Mobile and Delay Tolerant Networks","publication_year":2010,"publication_date":"2010-09-15","ids":{"openalex":"https://openalex.org/W1483953177","doi":"https://doi.org/10.1109/tit.2010.2059830","mag":"1483953177"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2059830","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2059830","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/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":"Philippe Jacquet","raw_affiliation_strings":["INRIA, Le Chesnay, France","INRIA Le Chesnay, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA Le Chesnay, France","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":"Bernard Mans","raw_affiliation_strings":["Macquarie University, Sydney, NSW, Australia","Macquarie University, Sydney NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Macquarie University, Sydney, NSW, 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":"Georgios Rodolakis","raw_affiliation_strings":["Macquarie University, Sydney, NSW, Australia","Macquarie University, Sydney NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Macquarie University, Sydney, NSW, 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":25.1281,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.99603906,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"56","issue":"10","first_page":"5001","last_page":"5015"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.998199999332428,"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":0.998199999332428,"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.00039999998989515007,"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/T13553","display_name":"Age of Information Optimization","score":0.0003000000142492354,"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/bounded-function","display_name":"Bounded function","score":0.6847757697105408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5536669492721558},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5521419048309326},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.508915901184082},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46337074041366577},{"id":"https://openalex.org/keywords/waypoint","display_name":"Waypoint","score":0.4158092141151428},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41403281688690186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.402205228805542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37486332654953003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35538482666015625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33065903186798096},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1709253191947937},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1305347979068756},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.10038331151008606}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6847757697105408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5536669492721558},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5521419048309326},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.508915901184082},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46337074041366577},{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.4158092141151428},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41403281688690186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.402205228805542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37486332654953003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35538482666015625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33065903186798096},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1709253191947937},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1305347979068756},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.10038331151008606},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2010.2059830","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2059830","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.426","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.comp.mq.edu.au/~bmans/BMans/Papers/JMR_Infocom09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.189.225","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.comp.mq.edu.au/%7Ebmans/BMans/Papers/IEEETiT_JMR10.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00196956v3","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00196956","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-6390, INRIA. 2007, pp.22","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W587813246","https://openalex.org/W1918250237","https://openalex.org/W1965396227","https://openalex.org/W2000285226","https://openalex.org/W2011300998","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/W2155550691","https://openalex.org/W2161575750","https://openalex.org/W2164562671","https://openalex.org/W2169293240","https://openalex.org/W2340541605","https://openalex.org/W2801179766","https://openalex.org/W4300223101","https://openalex.org/W6640281494","https://openalex.org/W6650370798"],"related_works":["https://openalex.org/W2688471429","https://openalex.org/W4360939124","https://openalex.org/W2077345734","https://openalex.org/W2899287767","https://openalex.org/W2275928629","https://openalex.org/W1978127373","https://openalex.org/W2915444871","https://openalex.org/W2612848489","https://openalex.org/W2096610529","https://openalex.org/W4235170104"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,10,15,73,165],"this":[3],"paper":[4],"is":[5,119,133,143],"to":[6,44,92,96,176],"increase":[7],"our":[8,87,174],"understanding":[9],"the":[11,51,68,129,163,166],"fundamental":[12],"performance":[13],"limits":[14],"mobile":[16,58],"and":[17,29,38,59,121,178],"Delay":[18],"Tolerant":[19],"Networks":[20],"(DTNs),":[21],"where":[22],"end-to-end":[23],"multihop":[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,157],"use":[41],"analytical":[42,99],"tools":[43],"derive":[45],"generic":[46],"theoretical":[47],"upper":[48,134,144],"bounds":[49,167],"for":[50],"information":[52,130],"propagation":[53,131],"speed":[54,132],"in":[55,71,103,168],"large":[56],"scale":[57],"intermittently":[60],"connected":[61],"networks.":[62,180],"In":[63,101],"other":[64,150],"words,":[65],"we":[66,126,172],"upper-bound":[67],"optimal":[69],"performance,":[70],"terms":[72],"delay,":[74],"that":[75,128,161],"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,98],"mobility":[94,151],"models":[95,152],"obtain":[97],"estimates.":[100],"particular,":[102],"2-D":[104],"networks,":[105],"when":[106],"nodes":[107],"move":[108],"at":[109],"a":[110],"maximum":[111],"speed$v$and":[112],"their":[113],"density$\\nu":[114],"$is":[115],"small":[116],"(the":[117],"network":[118],"sparse":[120],"asymptotically":[122],"almost":[123],"surely":[124],"disconnected),":[125],"prove":[127],"bounded":[135,145],"by$(1+O(\\nu":[136],"^{2}))v$in":[137],"random":[138],"waypoint-like":[139],"models,":[140],"while":[141],"it":[142],"by$O(\\sqrt":[146],"{\\nu":[147],"v}":[148],"v)$for":[149],"(random":[153],"walk,":[154],"Brownian":[155],"motion).":[156],"also":[158],"present":[159],"simulations":[160],"confirm":[162],"validity":[164],"these":[169],"scenarios.":[170],"Finally,":[171],"generalize":[173],"results":[175],"1-D":[177],"3-D":[179]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":27}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}