{"id":"https://openalex.org/W4386464319","doi":"https://doi.org/10.1109/iccc57788.2023.10233495","title":"A Routing Scheme Based on Multi-Objective Optimization in Quantum Satellite Networks","display_name":"A Routing Scheme Based on Multi-Objective Optimization in Quantum Satellite Networks","publication_year":2023,"publication_date":"2023-08-10","ids":{"openalex":"https://openalex.org/W4386464319","doi":"https://doi.org/10.1109/iccc57788.2023.10233495"},"language":"en","primary_location":{"id":"doi:10.1109/iccc57788.2023.10233495","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iccc57788.2023.10233495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/CIC International Conference on Communications in China (ICCC)","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/A5074355807","display_name":"Miao Zhao","orcid":"https://orcid.org/0000-0002-4324-1467"},"institutions":[{"id":"https://openalex.org/I27357992","display_name":"Dalian University of Technology","ror":"https://ror.org/023hj5876","country_code":"CN","type":"education","lineage":["https://openalex.org/I27357992"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Miao Zhao","raw_affiliation_strings":["Dalian University of Technology,School of Information and Communication Engineering,Dalian,China,116024"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian University of Technology,School of Information and Communication Engineering,Dalian,China,116024","institution_ids":["https://openalex.org/I27357992"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010826342","display_name":"Na Deng","orcid":"https://orcid.org/0000-0002-9565-559X"},"institutions":[{"id":"https://openalex.org/I27357992","display_name":"Dalian University of Technology","ror":"https://ror.org/023hj5876","country_code":"CN","type":"education","lineage":["https://openalex.org/I27357992"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Na Deng","raw_affiliation_strings":["Dalian University of Technology,School of Information and Communication Engineering,Dalian,China,116024"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian University of Technology,School of Information and Communication Engineering,Dalian,China,116024","institution_ids":["https://openalex.org/I27357992"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043767506","display_name":"Haichao Wei","orcid":"https://orcid.org/0000-0003-2241-8806"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haichao Wei","raw_affiliation_strings":["Dalian Maritime University,School of Information Science and Technology,Dalian,China,116026"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian Maritime University,School of Information Science and Technology,Dalian,China,116026","institution_ids":["https://openalex.org/I43313876"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10622","display_name":"Quantum Mechanics and Applications","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.7465019226074219},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5741984248161316},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5181252360343933},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.511246919631958},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5010006427764893},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.49474212527275085},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.49218884110450745},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4710516929626465},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4487728178501129},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.42958736419677734},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4128861427307129},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3078958988189697},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.16691341996192932},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1422974169254303},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10214856266975403},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.09208384156227112}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7465019226074219},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5741984248161316},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5181252360343933},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.511246919631958},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5010006427764893},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.49474212527275085},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.49218884110450745},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4710516929626465},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4487728178501129},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42958736419677734},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4128861427307129},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3078958988189697},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.16691341996192932},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1422974169254303},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10214856266975403},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.09208384156227112}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccc57788.2023.10233495","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iccc57788.2023.10233495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/CIC International Conference on Communications in China (ICCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320323086","display_name":"Natural Science Foundation of Liaoning Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1996238339","https://openalex.org/W2015179126","https://openalex.org/W2049484418","https://openalex.org/W2061406469","https://openalex.org/W2775936334","https://openalex.org/W2999571935","https://openalex.org/W3045535614","https://openalex.org/W3105229315","https://openalex.org/W3113572749","https://openalex.org/W3118428022","https://openalex.org/W3206137648","https://openalex.org/W4206215898","https://openalex.org/W4290996388","https://openalex.org/W6787247663"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W2081964190","https://openalex.org/W2607223747","https://openalex.org/W1976978163","https://openalex.org/W2386380844","https://openalex.org/W2138035214","https://openalex.org/W2186630360","https://openalex.org/W2102969916","https://openalex.org/W2138388820","https://openalex.org/W1904064112"],"abstract_inverted_index":{"In":[0],"quantum":[1,22,42,75],"satellite":[2],"networks,":[3],"routing":[4,36,66,131],"is":[5,124,147,153],"an":[6],"important":[7],"task":[8],"for":[9,24,50],"providing":[10],"key":[11,43],"relay":[12],"services":[13],"to":[14,39,47,101],"ground":[15],"stations":[16],"(GSs).":[17],"For":[18],"the":[19,41,58,65,72,78,80,82,86,91,94,107,110,118,129,139,151],"demand":[20],"of":[21,60,84,93,96,121,128,141],"keys":[23,76,98,142],"multiple":[25],"concurrent":[26],"requests":[27,62],"between":[28],"GS":[29],"pairs,":[30],"we":[31,69,89],"formulate":[32],"a":[33,145],"multi-objective":[34],"optimization":[35,55],"(MOOR)":[37],"problem":[38],"allocate":[40],"and":[44,105],"time-slot":[45],"resources":[46],"find":[48,106],"routes":[49],"simultaneous":[51],"services.":[52],"The":[53],"proposed":[54],"scheme":[56,123],"maximizes":[57],"number":[59,95,140],"successful":[61],"while":[63],"minimizing":[64],"cost.":[67],"Specifically,":[68],"consider":[70],"that":[71,117,127],"fewer":[73],"available":[74,97],"on":[77,99,134],"link,":[79],"greater":[81],"cost":[83],"occupying":[85],"link.":[87],"Then":[88],"use":[90],"reciprocal":[92],"links":[100],"represent":[102],"link":[103,112],"costs,":[104],"route":[108],"with":[109],"minimum":[111],"costs.":[113],"Simulation":[114],"results":[115],"show":[116],"success":[119],"probability":[120],"MOOR":[122],"higher":[125],"than":[126],"comparison":[130],"strategy":[132],"based":[133],"Dijkstra":[135],"algorithm,":[136],"especially":[137],"when":[138],"forwarded":[143],"by":[144],"request":[146],"not":[148],"too":[149],"large,":[150],"improvement":[152],"significant.":[154]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}