{"id":"https://openalex.org/W1970925257","doi":"https://doi.org/10.1109/glocom.2011.6134460","title":"Enhancing Contact Graph Routing for Delay Tolerant Space Networking","display_name":"Enhancing Contact Graph Routing for Delay Tolerant Space Networking","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W1970925257","doi":"https://doi.org/10.1109/glocom.2011.6134460","mag":"1970925257"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6134460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6134460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","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/A5097883824","display_name":"J. Segui","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]},{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Segui","raw_affiliation_strings":["Communications Networks Group, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA USA"],"affiliations":[{"raw_affiliation_string":"Communications Networks Group, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I1334627681"]},{"raw_affiliation_string":"Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000328917","display_name":"Esther Jennings","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]},{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Jennings","raw_affiliation_strings":["Communications Networks Group, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA USA"],"affiliations":[{"raw_affiliation_string":"Communications Networks Group, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I1334627681"]},{"raw_affiliation_string":"Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020622156","display_name":"Scott Burleigh","orcid":"https://orcid.org/0000-0003-3768-5413"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]},{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Burleigh","raw_affiliation_strings":["End-To-End Information System Engineering Group, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA USA"],"affiliations":[{"raw_affiliation_string":"End-To-End Information System Engineering Group, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I1334627681"]},{"raw_affiliation_string":"Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5097883824"],"corresponding_institution_ids":["https://openalex.org/I122411786","https://openalex.org/I1334627681"],"apc_list":null,"apc_paid":null,"fwci":2.8006,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.90366444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9929999709129333,"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.992900013923645,"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/computer-science","display_name":"Computer science","score":0.78098464012146},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6217241287231445},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5993191003799438},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5965090990066528},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5934353470802307},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5806708931922913},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5523852705955505},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4873107671737671},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4853176474571228},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4245245158672333},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4126434028148651},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4121629595756531},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.28998062014579773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19791290163993835},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19050246477127075}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.78098464012146},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6217241287231445},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5993191003799438},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5965090990066528},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5934353470802307},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5806708931922913},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5523852705955505},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4873107671737671},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4853176474571228},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4245245158672333},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4126434028148651},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4121629595756531},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.28998062014579773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19791290163993835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19050246477127075}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2011.6134460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6134460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W23100675","https://openalex.org/W60158733","https://openalex.org/W1737660401","https://openalex.org/W1965396227","https://openalex.org/W1984196269","https://openalex.org/W2095884194","https://openalex.org/W2113230746","https://openalex.org/W2120358295","https://openalex.org/W2147830904","https://openalex.org/W2151627646","https://openalex.org/W2333590349","https://openalex.org/W2498871114","https://openalex.org/W3162828249","https://openalex.org/W6602464246"],"related_works":["https://openalex.org/W2152381136","https://openalex.org/W1997091564","https://openalex.org/W146128134","https://openalex.org/W2148093630","https://openalex.org/W2351097701","https://openalex.org/W4253436398","https://openalex.org/W2001312276","https://openalex.org/W2102668930","https://openalex.org/W2754318699","https://openalex.org/W1924167960"],"abstract_inverted_index":{"When":[0],"designing":[1],"routing":[2,32,99,115,137],"protocols":[3],"for":[4,84,146,161],"space-based":[5,19,85],"networks,":[6],"we":[7,76],"must":[8],"take":[9],"into":[10,155],"consideration":[11],"the":[12,36,47,67,91,95,129,156,180],"unique":[13],"characteristics":[14],"of":[15,51,69,90,94,120,133,179],"such":[16],"networks.":[17,86],"Since":[18],"networks":[20],"are":[21,53,58],"inherently":[22],"sparse":[23],"with":[24],"constrained":[25],"resources,":[26],"one":[27],"needs":[28],"to":[29,39,66,97,111,128,135],"design":[30],"smart":[31],"algorithms":[33],"that":[34],"use":[35,89],"resources":[37],"efficiently":[38],"maximize":[40],"network":[41],"performance.":[42],"In":[43,73],"Space":[44],"Exploration":[45],"Missions,":[46],"trajectories":[48],"and":[49,71,102,122,139,170],"orbits":[50],"spacecraft":[52],"predetermined,":[54],"thus":[55],"communication":[56],"opportunities":[57],"predictable.":[59],"This":[60],"a-priori":[61],"knowledge":[62],"can":[63],"be":[64],"used":[65,107],"advantage":[68],"scheduling":[70],"routing.":[72],"this":[74],"paper,":[75],"focus":[77],"on":[78,114],"analyzing":[79],"Contact":[80],"Graph":[81],"Routing":[82],"(CGR)":[83],"CGR":[87,134],"makes":[88],"predictable":[92],"nature":[93],"contacts":[96],"make":[98],"decisions.":[100],"Mars":[101],"Lunar":[103],"mission-like":[104],"scenarios":[105],"were":[106],"in":[108,118,172],"our":[109],"simulations":[110],"gather":[112],"statistics":[113],"protocol":[116],"performance":[117],"terms":[119],"delay":[121],"buffer":[123],"usage.":[124],"We":[125],"provide":[126],"improvements":[127],"underlying":[130],"cost":[131,150],"function":[132,151],"avoid":[136],"loops":[138],"suggest":[140],"applying":[141],"Dijkstra's":[142,163],"shortest":[143,164],"path":[144,147,165],"algorithm":[145,166],"selection.":[148],"The":[149],"change":[152],"was":[153,167],"incorporated":[154],"latest":[157],"Internet":[158],"Draft":[159],"posted":[160],"CGR.":[162],"successfully":[168],"implemented":[169],"tested":[171],"NASA's":[173],"Interplanetary":[174],"Overlay":[175],"Network":[176],"(ION)":[177],"implementation":[178],"DTN":[181],"protocols.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-02-07T06:11:34.122080","created_date":"2025-10-10T00:00:00"}