{"id":"https://openalex.org/W4304820057","doi":"https://doi.org/10.1109/ipccc55026.2022.9894346","title":"Tropical Geometric Route Decision-Making in Simulated Lunar Gateway Communications","display_name":"Tropical Geometric Route Decision-Making in Simulated Lunar Gateway Communications","publication_year":2022,"publication_date":"2022-10-12","ids":{"openalex":"https://openalex.org/W4304820057","doi":"https://doi.org/10.1109/ipccc55026.2022.9894346"},"language":"en","primary_location":{"id":"doi:10.1109/ipccc55026.2022.9894346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipccc55026.2022.9894346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Performance, Computing, and Communications Conference (IPCCC)","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/A5077459307","display_name":"Jacob Cleveland","orcid":null},"institutions":[{"id":"https://openalex.org/I2799786008","display_name":"Glenn Research Center","ror":"https://ror.org/059fqnc42","country_code":"US","type":"facility","lineage":["https://openalex.org/I2799786008","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jacob Cleveland","raw_affiliation_strings":["NASA Glenn,Communications and Intelligent Systems,Cleveland,OH","Communications and Intelligent Systems, NASA Glenn, Cleveland, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NASA Glenn,Communications and Intelligent Systems,Cleveland,OH","institution_ids":["https://openalex.org/I2799786008"]},{"raw_affiliation_string":"Communications and Intelligent Systems, NASA Glenn, Cleveland, OH","institution_ids":["https://openalex.org/I2799786008"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111917136","display_name":"Robert Short","orcid":null},"institutions":[{"id":"https://openalex.org/I2799786008","display_name":"Glenn Research Center","ror":"https://ror.org/059fqnc42","country_code":"US","type":"facility","lineage":["https://openalex.org/I2799786008","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Short","raw_affiliation_strings":["NASA Glenn,Communications and Intelligent Systems,Cleveland,OH","Communications and Intelligent Systems, NASA Glenn, Cleveland, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NASA Glenn,Communications and Intelligent Systems,Cleveland,OH","institution_ids":["https://openalex.org/I2799786008"]},{"raw_affiliation_string":"Communications and Intelligent Systems, NASA Glenn, Cleveland, OH","institution_ids":["https://openalex.org/I2799786008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007599747","display_name":"Alan Hylton","orcid":null},"institutions":[{"id":"https://openalex.org/I1306266525","display_name":"Goddard Space Flight Center","ror":"https://ror.org/0171mag52","country_code":"US","type":"facility","lineage":["https://openalex.org/I1306266525","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Hylton","raw_affiliation_strings":["NASA Goddard,Near Space Network,Greenbelt,MD","Near Space Network, NASA Goddard, Greenbelt, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NASA Goddard,Near Space Network,Greenbelt,MD","institution_ids":["https://openalex.org/I1306266525"]},{"raw_affiliation_string":"Near Space Network, NASA Goddard, Greenbelt, MD","institution_ids":["https://openalex.org/I1306266525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2696,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42442631,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"161","issue":null,"first_page":"94","last_page":"100"},"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.9998000264167786,"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.9998000264167786,"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/T10772","display_name":"Distributed systems and fault tolerance","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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7248445749282837},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.5896840691566467},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5886813402175903},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.536831796169281},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4851273000240326},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.41861429810523987},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.37994351983070374},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3547596037387848},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32367604970932007},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.2818273901939392},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08991214632987976}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7248445749282837},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.5896840691566467},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5886813402175903},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.536831796169281},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4851273000240326},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.41861429810523987},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37994351983070374},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3547596037387848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32367604970932007},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2818273901939392},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08991214632987976}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipccc55026.2022.9894346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipccc55026.2022.9894346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Performance, Computing, and Communications Conference (IPCCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W2130034315","https://openalex.org/W2169528473","https://openalex.org/W2596750584","https://openalex.org/W2765284286","https://openalex.org/W2950050320","https://openalex.org/W3097750129","https://openalex.org/W3098986442","https://openalex.org/W3138467756","https://openalex.org/W3196474105","https://openalex.org/W4253695550","https://openalex.org/W4254686712","https://openalex.org/W4297960648","https://openalex.org/W6785396038"],"related_works":["https://openalex.org/W2061699822","https://openalex.org/W2119673702","https://openalex.org/W3160281244","https://openalex.org/W947546393","https://openalex.org/W4220949317","https://openalex.org/W2122925822","https://openalex.org/W1977412657","https://openalex.org/W2531225563","https://openalex.org/W2146461188","https://openalex.org/W2735229889"],"abstract_inverted_index":{"Communications":[0],"networks":[1],"involving":[2],"space":[3,27,84,132],"systems":[4],"are":[5,18,62,99],"complex":[6],"and":[7,15,68,107],"evolve":[8],"over":[9,29,102],"time.":[10],"Orbital":[11],"mechanics,":[12],"light":[13],"propagation,":[14],"asset":[16],"availability":[17],"some":[19],"characteristics":[20],"that":[21,33,58,96],"dictate":[22],"the":[23,26,59,86,94,97,120,140,144,151],"state":[24],"of":[25,157],"network":[28,60,133],"time,":[30,67],"which":[31,143],"means":[32],"traditional":[34,54],"routing":[35,55,78],"methods":[36],"relying":[37],"on":[38,66],"e.g.":[39],"Open":[40],"Shortest":[41],"Path":[42],"First":[43],"(OSPF)":[44],"cannot":[45],"be":[46,112],"expected":[47],"to":[48,80,114],"work.":[49],"This":[50,137],"is":[51,160],"mainly":[52],"because":[53],"algorithms":[56],"assume":[57],"parameters":[61],"not":[63],"themselves":[64],"dependent":[65],"make":[69],"assumptions":[70],"regarding":[71],"end-to-end":[72],"connectivity.":[73],"In":[74,117],"order":[75],"for":[76,93,126],"a":[77,83,123,131],"algorithm":[79,87,153],"work":[81],"in":[82],"network,":[85],"must,":[88],"among":[89],"other":[90],"things,":[91],"account":[92],"fact":[95],"links":[98],"constantly":[100],"changing":[101],"time;":[103],"rather":[104],"than":[105],"forwarding":[106],"dropping,":[108],"routers":[109],"must":[110],"also":[111],"able":[113],"store":[115],"data.":[116],"this":[118,158],"paper,":[119],"authors":[121],"propose":[122],"new":[124],"method":[125,138,159],"computing":[127],"optimal":[128],"routes":[129],"through":[130,162],"using":[134,150,164],"tropical":[135],"geometry.":[136],"determines":[139],"times":[141],"at":[142],"single-source":[145],"shortest-path":[146],"(SSSP)":[147],"tree":[148],"changes":[149],"Joswig":[152],"[1].":[154],"The":[155],"efficacy":[156],"demonstrated":[161],"simulation":[163],"orbital":[165],"analysis":[166],"software.":[167]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}