{"id":"https://openalex.org/W2041728874","doi":"https://doi.org/10.1109/lcn.2010.5735753","title":"Look-ahead routing and Message Scheduling in delay-tolerant networks","display_name":"Look-ahead routing and Message Scheduling in delay-tolerant networks","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2041728874","doi":"https://doi.org/10.1109/lcn.2010.5735753","mag":"2041728874"},"language":"en","primary_location":{"id":"doi:10.1109/lcn.2010.5735753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.2010.5735753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Local Computer Network Conference","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/A5069145368","display_name":"Yi Xian","orcid":null},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yi Xian","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, USA","Dept. of Computer Science and Engineering University of South Carolina#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, USA","institution_ids":["https://openalex.org/I155781252"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering University of South Carolina#TAB#","institution_ids":["https://openalex.org/I155781252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056673342","display_name":"Chin\u2010Tser Huang","orcid":"https://orcid.org/0000-0003-3983-972X"},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chin-Tser Huang","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, USA","Dept. of Computer Science and Engineering University of South Carolina#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, USA","institution_ids":["https://openalex.org/I155781252"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering University of South Carolina#TAB#","institution_ids":["https://openalex.org/I155781252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014205107","display_name":"Jorge A. Cobb","orcid":"https://orcid.org/0000-0002-8211-1913"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorge Cobb","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, USA","Department of Computer Science,The University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science,The University of Texas at Dallas","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069145368"],"corresponding_institution_ids":["https://openalex.org/I155781252"],"apc_list":null,"apc_paid":null,"fwci":3.9173,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.93731817,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4838","issue":null,"first_page":"40","last_page":"47"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9872000217437744,"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.9861999750137329,"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-network","display_name":"Computer network","score":0.850699782371521},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8134942054748535},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5951175689697266},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.5459046959877014},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5343801975250244},{"id":"https://openalex.org/keywords/interior-gateway-protocol","display_name":"Interior gateway protocol","score":0.5240359902381897},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5102555751800537},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4981813430786133},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4891367256641388},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4804793894290924},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47891223430633545},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.42119884490966797},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4184204936027527},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.41485974192619324},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3798547685146332},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1053054928779602}],"concepts":[{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.850699782371521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8134942054748535},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5951175689697266},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.5459046959877014},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5343801975250244},{"id":"https://openalex.org/C52837422","wikidata":"https://www.wikidata.org/wiki/Q431028","display_name":"Interior gateway protocol","level":5,"score":0.5240359902381897},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5102555751800537},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4981813430786133},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4891367256641388},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4804793894290924},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47891223430633545},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.42119884490966797},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4184204936027527},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.41485974192619324},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3798547685146332},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1053054928779602},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcn.2010.5735753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.2010.5735753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Local Computer Network Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/3","display_name":"Good health and well-being"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1488540163","https://openalex.org/W1549535141","https://openalex.org/W1572481965","https://openalex.org/W1966518282","https://openalex.org/W2040459121","https://openalex.org/W2050395517","https://openalex.org/W2102258543","https://openalex.org/W2119848598","https://openalex.org/W2125957038","https://openalex.org/W2128928510","https://openalex.org/W2129849999","https://openalex.org/W2132283527","https://openalex.org/W2142522527","https://openalex.org/W2149429274","https://openalex.org/W2162076967","https://openalex.org/W2200366263","https://openalex.org/W2253517037","https://openalex.org/W2273515758","https://openalex.org/W6629337237","https://openalex.org/W6632928162","https://openalex.org/W6634082847","https://openalex.org/W6675445138","https://openalex.org/W6692059270","https://openalex.org/W6694493389"],"related_works":["https://openalex.org/W2280760643","https://openalex.org/W2188603028","https://openalex.org/W2003936810","https://openalex.org/W1655019438","https://openalex.org/W2077927962","https://openalex.org/W4312035994","https://openalex.org/W2035841327","https://openalex.org/W2963821737","https://openalex.org/W2188727730","https://openalex.org/W2742547501"],"abstract_inverted_index":{"Routing":[0,45],"is":[1],"one":[2],"of":[3,14,16,72,94,144,186],"the":[4,66,73,91,98,104,120,123,141,155,161,167],"most":[5],"challenging":[6],"development":[7],"issues":[8],"in":[9,65,77,122,184],"delay-tolerant":[10],"networks":[11],"(DTNs)":[12],"because":[13],"lack":[15],"continuous":[17],"connection.":[18],"Existing":[19],"routing":[20,60,108,177],"schemes":[21],"for":[22],"DTNs":[23],"provide":[24],"best":[25],"effort":[26],"service,":[27],"but":[28],"are":[29,80],"unable":[30],"to":[31,61,87,103,139,157],"optimize":[32],"QoS":[33,64],"and":[34,46,100,127,153,182,191,201],"support":[35,205],"message":[36,146,156,206],"priority.":[37,207],"In":[38],"this":[39,137],"paper,":[40],"we":[41],"present":[42],"a":[43,70],"Look-Ahead":[44],"Message":[47],"Scheduling":[48],"approach":[49],"(ALARMS)":[50],"which":[51,78,163],"exploits":[52],"more":[53],"accurate":[54],"knowledge":[55],"about":[56,110],"various":[57],"parameters":[58],"regarding":[59],"achieve":[62],"better":[63],"DTN.":[67],"We":[68,193],"assume":[69],"variation":[71],"well-known":[74],"ferry":[75,81,162],"model,":[76],"there":[79],"nodes":[82,106,135],"moving":[83],"along":[84],"pre-defined":[85],"routes":[86],"exchange":[88],"messages":[89],"with":[90],"gateway":[92,105,117,134],"node":[93,118],"each":[95,116,145],"region":[96],"on":[97,119,199],"route":[99,121],"also":[101,194],"pass":[102],"look-ahead":[107],"information":[109,138],"when":[111,147],"it":[112,130],"will":[113,131],"arrive":[114],"at":[115,166],"next":[124],"two":[125],"rounds":[126],"how":[128,202],"long":[129],"stay.":[132],"The":[133],"use":[136],"estimate":[140],"delivery":[142,189],"delay":[143,187],"being":[148],"delivered":[149,159],"by":[150,160],"different":[151],"ferries,":[152],"schedule":[154],"be":[158],"arrives":[164],"earliest":[165],"destination.":[168],"Simulation":[169],"results":[170],"show":[171],"that":[172],"ALARMS":[173,200,203],"outperforms":[174],"three":[175,196],"existing":[176],"protocols:":[178],"epidemic":[179],"routing,":[180],"spray-and-wait,":[181],"spray-and-focus,":[183],"terms":[185],"time,":[188],"ratio,":[190],"overhead.":[192],"discuss":[195],"enhancement":[197],"strategies":[198],"can":[204]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}