{"id":"https://openalex.org/W2887293448","doi":"https://doi.org/10.1109/icc.2018.8422915","title":"N-Look Ahead Routing and Scheduling (N-LARS) for DTN Space Networks","display_name":"N-Look Ahead Routing and Scheduling (N-LARS) for DTN Space Networks","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2887293448","doi":"https://doi.org/10.1109/icc.2018.8422915","mag":"2887293448"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2018.8422915","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2018.8422915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Communications (ICC)","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/A5084621820","display_name":"Sara El Alaoui","orcid":"https://orcid.org/0000-0001-5611-2149"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sara El Alaoui","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047637562","display_name":"Byrav Ramamurthy","orcid":"https://orcid.org/0000-0002-4104-7513"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Byrav Ramamurthy","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.1976,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.57335542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"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.9782000184059143,"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/T12042","display_name":"Satellite Communication Systems","score":0.968500018119812,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.7397118806838989},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5651820302009583},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5288021564483643},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5151204466819763},{"id":"https://openalex.org/keywords/bundle","display_name":"Bundle","score":0.5063990354537964},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4569374620914459},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.43538641929626465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3248260021209717},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.29841291904449463},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2330380380153656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12907621264457703},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1262330412864685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7397118806838989},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5651820302009583},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5288021564483643},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5151204466819763},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.5063990354537964},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4569374620914459},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.43538641929626465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3248260021209717},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.29841291904449463},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2330380380153656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12907621264457703},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1262330412864685},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2018.8422915","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2018.8422915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308709","display_name":"Nebraska Space Grant Consortium","ror":"https://ror.org/02w20cr42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1974381434","https://openalex.org/W2021497904","https://openalex.org/W2041728874","https://openalex.org/W2059110084","https://openalex.org/W2148027993","https://openalex.org/W2166690961","https://openalex.org/W2273515758","https://openalex.org/W2757904281"],"related_works":["https://openalex.org/W4384890880","https://openalex.org/W4312613015","https://openalex.org/W2001136280","https://openalex.org/W2515636624","https://openalex.org/W4296591829","https://openalex.org/W2347701390","https://openalex.org/W999420501","https://openalex.org/W3123401086","https://openalex.org/W2469151836","https://openalex.org/W4245577662"],"abstract_inverted_index":{"Humans'":[0],"deep":[1],"space":[2],"exploration":[3],"missions":[4],"have":[5],"attracted":[6],"great":[7],"interest":[8],"in":[9,179],"the":[10,25,79,108,119,124,131,134,144,150,160,164,188,194],"past":[11],"decade.":[12],"The":[13],"Interplanetary":[14],"Network":[15],"(IPN),":[16],"hence,":[17],"has":[18],"to":[19,140,187],"undergo":[20],"many":[21],"structural":[22],"changes,":[23],"as":[24,149],"traffic":[26],"loads":[27],"and":[28,41,47,75,94,171,184],"types":[29],"will":[30],"drastically":[31],"increase.":[32],"In":[33],"this":[34],"paper,":[35],"we":[36,129],"propose":[37],"N-Look":[38],"Ahead":[39],"Routing":[40,153],"Scheduling":[42],"(N-LARS),":[43],"a":[44,84,102],"novel":[45],"scheduling":[46,67,138,170],"routing":[48,77,146,172],"technique":[49,147],"for":[50,60,91,110,168],"DTN-based":[51],"IPNs":[52,65],"with":[53],"these":[54],"new":[55],"challenges.":[56],"Our":[57,155],"N-LARS":[58,92,167],"model":[59,139],"Delay":[61],"Tolerant":[62],"Networking":[63],"(DTN)-based":[64],"provides":[66],"of":[68,133,163,181],"bundles":[69],"(also":[70],"called":[71],"requests":[72],"or":[73],"messages)":[74],"efficient":[76],"across":[78],"overall":[80,161],"network.":[81],"We":[82,99,113],"develop":[83],"mixed":[85],"integer":[86],"linear":[87],"programming":[88],"(MILP)":[89],"formulation":[90],"problem":[93],"solve":[95],"it":[96],"using":[97,136,143,166],"CPLEX.":[98],"further":[100],"derive":[101],"heuristic":[103],"that":[104,159],"scales":[105],"better":[106,176],"than":[107,177],"MILP":[109],"large":[111],"networks.":[112],"run":[114],"experiments":[115],"on":[116],"networks":[117],"mimicking":[118],"proposed":[120],"Mars":[121],"project":[122],"by":[123,193],"European":[125],"Space":[126],"Agency.":[127],"Finally,":[128],"compare":[130],"performance":[132,142,162],"network":[135,165],"our":[137],"its":[141],"usual":[145],"such":[148],"Contact":[151],"Graph":[152],"(CGR).":[154],"simulation":[156],"results":[157],"show":[158],"bundle":[169],"is":[173],"four":[174],"times":[175],"CGR,":[178],"terms":[180],"delivered":[182],"bundles,":[183],"13.8%":[185],"closer":[186],"sub-":[189],"optimal":[190],"schedule":[191],"generated":[192],"CPLEX":[195],"solver.":[196]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}