{"id":"https://openalex.org/W2772154582","doi":"https://doi.org/10.1109/milcom.2017.8170722","title":"Shortest paths for routing information over temporally dynamic communication networks","display_name":"Shortest paths for routing information over temporally dynamic communication networks","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2772154582","doi":"https://doi.org/10.1109/milcom.2017.8170722","mag":"2772154582"},"language":"en","primary_location":{"id":"doi:10.1109/milcom.2017.8170722","is_oa":false,"landing_page_url":"https://doi.org/10.1109/milcom.2017.8170722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","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/A5081794087","display_name":"Michael J. Hirsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael J. Hirsch","raw_affiliation_strings":["ISEA TEK, LLC, Maitland, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISEA TEK, LLC, Maitland, FL, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062039700","display_name":"Azar Sadeghnejad Barkousaraie","orcid":"https://orcid.org/0000-0002-4331-4988"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Azar Sadeghnejad","raw_affiliation_strings":["ISE Dept., University at Buffalo, Buffalo, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISE Dept., University at Buffalo, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061734837","display_name":"H\u00e9ctor J. Ortiz-Pe\u00f1a","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156279","display_name":"Calspan-University of Buffalo Research Center","ror":"https://ror.org/05hb9gz45","country_code":"US","type":"education","lineage":["https://openalex.org/I4210156279"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hector Ortiz-Pena","raw_affiliation_strings":["CUBRC, Inc., Buffalo, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CUBRC, Inc., Buffalo, NY, USA","institution_ids":["https://openalex.org/I4210156279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3495,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.5351215,"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":"587","last_page":"591"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9702000021934509,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.955299973487854,"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.7255301475524902},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.600614607334137},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6004329323768616},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5937445163726807},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5487951040267944},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5436676144599915},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5023081302642822},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47176554799079895},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.470525860786438},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.46857500076293945},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4420330822467804},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.43384772539138794},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.39972078800201416},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08969834446907043}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7255301475524902},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.600614607334137},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6004329323768616},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5937445163726807},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5487951040267944},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5436676144599915},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5023081302642822},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47176554799079895},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.470525860786438},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.46857500076293945},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4420330822467804},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.43384772539138794},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.39972078800201416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08969834446907043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/milcom.2017.8170722","is_oa":false,"landing_page_url":"https://doi.org/10.1109/milcom.2017.8170722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2028777142","https://openalex.org/W2035057445","https://openalex.org/W2137560895","https://openalex.org/W2158449659","https://openalex.org/W2186343332","https://openalex.org/W2336259629","https://openalex.org/W2489140591","https://openalex.org/W2787038900"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W2152381136","https://openalex.org/W2102655743","https://openalex.org/W2351097701","https://openalex.org/W2001312276","https://openalex.org/W146128134","https://openalex.org/W2372626604","https://openalex.org/W2607223747","https://openalex.org/W1655019438","https://openalex.org/W2077927962"],"abstract_inverted_index":{"There":[0],"has":[1,73],"been":[2,75],"a":[3,70,79],"significant":[4],"increase":[5],"in":[6,95,117],"the":[7,45,51,55,58,109,127,137,149],"number":[8],"of":[9,61,67],"sensors":[10,17],"deployed":[11],"to":[12,50,105,129,141,151],"accomplish":[13],"military":[14,64],"missions.":[15],"These":[16],"might":[18,26],"be":[19,106],"on":[20],"manned":[21],"or":[22],"unmanned":[23],"resources,":[24],"and":[25],"collect":[27],"quantitative":[28],"and/or":[29],"qualitative":[30],"information":[31,47,56,68,102,118],"important":[32],"for":[33,39,57,136],"mission":[34,40],"success.":[35],"Of":[36],"critical":[37],"importance":[38],"success":[41],"is":[42,48,88,103],"ensuring":[43],"that":[44,53],"collected":[46],"routed":[49,107],"people/systems":[52],"need":[54],"proper":[59],"making":[60],"decisions.":[62],"For":[63],"applications,":[65],"routing":[66,82,113,143],"across":[69,108],"communication":[71],"network":[72],"typically":[74],"accomplished":[76],"using":[77,130],"fixed,":[78],"priori":[80],"defined,":[81],"paths.":[83,144],"When":[84],"bandwidth":[85,96],"between":[86],"resources":[87],"unlimited,":[89],"this":[90,123],"presents":[91,115],"no":[92],"problems.":[93],"However,":[94],"constrained":[97],"environments,":[98],"when":[99],"not":[100],"all":[101],"able":[104],"network,":[110],"then":[111],"fixed":[112,142],"paths":[114],"limitations":[116],"reaching":[119],"appropriate":[120],"consumers.":[121],"In":[122],"research,":[124],"we":[125],"consider":[126],"advantages":[128],"dynamic":[131,152],"shortest":[132,153],"temporal":[133],"path":[134,154],"routes":[135],"information,":[138],"as":[139],"opposed":[140],"Multiple":[145],"metrics":[146],"show":[147],"empirically":[148],"benefit":[150],"routes.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}