{"id":"https://openalex.org/W1973573306","doi":"https://doi.org/10.1109/wowmom.2010.5534960","title":"Conditional shortest path routing in delay tolerant networks","display_name":"Conditional shortest path routing in delay tolerant networks","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1973573306","doi":"https://doi.org/10.1109/wowmom.2010.5534960","mag":"1973573306"},"language":"en","primary_location":{"id":"doi:10.1109/wowmom.2010.5534960","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wowmom.2010.5534960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","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/A5004397715","display_name":"Eyuphan Bulut","orcid":"https://orcid.org/0000-0003-4744-9211"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eyuphan Bulut","raw_affiliation_strings":["Department of Computer Science and Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","Department of Computer Science and Center for Pervasive Computing and Networking, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Department of Computer Science and Center for Pervasive Computing and Networking, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA#TAB#","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071195197","display_name":"Sahin Cem Geyik","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sahin Cem Geyik","raw_affiliation_strings":["Department of Computer Science and Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","Department of Computer Science and Center for Pervasive Computing and Networking, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Department of Computer Science and Center for Pervasive Computing and Networking, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA#TAB#","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004745888","display_name":"Boles\u0142aw K. Szyma\u0144ski","orcid":"https://orcid.org/0000-0002-0307-6743"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Boleslaw K. Szymanski","raw_affiliation_strings":["Department of Computer Science and Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","Department of Computer Science and Center for Pervasive Computing and Networking, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Department of Computer Science and Center for Pervasive Computing and Networking, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA#TAB#","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004397715"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":5.5882,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.95989225,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"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.984000027179718,"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/T13553","display_name":"Age of Information Optimization","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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7353600263595581},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7238972783088684},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7177321314811707},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5990564227104187},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5306954383850098},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5287292003631592},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5043541193008423},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.49439454078674316},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.48826074600219727},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4801437556743622},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4559124708175659},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45480769872665405},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.45255720615386963},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4349466562271118},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4141961634159088},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16183626651763916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10350346565246582}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7353600263595581},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7238972783088684},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7177321314811707},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5990564227104187},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5306954383850098},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5287292003631592},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5043541193008423},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.49439454078674316},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.48826074600219727},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4801437556743622},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4559124708175659},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45480769872665405},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.45255720615386963},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4349466562271118},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4141961634159088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16183626651763916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10350346565246582},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/wowmom.2010.5534960","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wowmom.2010.5534960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.172.6470","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.6470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rpi.edu/%7Eszymansk/papers/wowmom.10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.227.5583","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.5583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rpi.edu/%7Egeyiks/wowmom_2010_bulut.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1572481965","https://openalex.org/W2010634640","https://openalex.org/W2022319427","https://openalex.org/W2040459121","https://openalex.org/W2068273572","https://openalex.org/W2073418598","https://openalex.org/W2082674813","https://openalex.org/W2099485835","https://openalex.org/W2107930846","https://openalex.org/W2112459052","https://openalex.org/W2116600847","https://openalex.org/W2125957038","https://openalex.org/W2129849999","https://openalex.org/W2135712710","https://openalex.org/W2137259487","https://openalex.org/W2142522527","https://openalex.org/W2147830904","https://openalex.org/W2153297552","https://openalex.org/W2162076967","https://openalex.org/W2162435761","https://openalex.org/W2613173048","https://openalex.org/W4241072175","https://openalex.org/W4242656826","https://openalex.org/W6634082847"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1515277195","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2237860883","https://openalex.org/W1698965822","https://openalex.org/W768680197","https://openalex.org/W2121598558","https://openalex.org/W1971025399"],"abstract_inverted_index":{"Delay":[0],"tolerant":[1,134],"networks":[2],"are":[3,29],"characterized":[4],"by":[5,162],"the":[6,14,25,49,68,75,91,108,112,119,122,126,146,154,168,189,197,202],"sporadic":[7],"connectivity":[8],"between":[9,56,95,158],"their":[10],"nodes":[11,97,159],"and":[12,74,183],"therefore":[13],"lack":[15],"of":[16,77,111,121,156],"stable":[17],"end-to-end":[18,185],"paths":[19,151],"from":[20,59],"source":[21],"to":[22,39,99,188],"destination.":[23],"Since":[24],"future":[26],"node":[27,105],"connections":[28],"mostly":[30],"unknown":[31],"in":[32,152],"these":[33],"networks,":[34],"opportunistic":[35],"forwarding":[36,45],"is":[37,62,160],"used":[38],"deliver":[40],"messages.":[41],"However,":[42],"making":[43],"effective":[44],"decisions":[46],"using":[47,106],"only":[48,107],"network":[50],"characteristics":[51],"(i.e.":[52],"average":[53,92],"intermeeting":[54,87,93,164,170,199],"time":[55,94,200],"nodes)":[57],"extracted":[58],"contact":[60],"history":[61],"a":[63,82,100,103],"challenging":[64],"problem.":[65],"Based":[66],"on":[67,125],"observations":[69],"about":[70],"human":[71],"mobility":[72],"traces":[73],"findings":[76],"previous":[78],"work,":[79],"we":[80,175],"introduce":[81],"new":[83],"metric":[84,124],"called":[85],"conditional":[86,149,163],"time,":[88],"which":[89,153],"computes":[90],"two":[96],"relative":[98],"meeting":[101],"with":[102],"third":[104],"local":[109],"knowledge":[110],"past":[113],"contacts.":[114],"We":[115,136],"then":[116],"look":[117],"at":[118],"effects":[120],"proposed":[123],"shortest":[127,150,190],"path":[128,191],"based":[129,192],"routing":[130,193],"designed":[131],"for":[132],"delay":[133,186],"networks.":[135],"propose":[137],"Conditional":[138],"Shortest":[139],"Path":[140],"Routing":[141],"(CSPR)":[142],"protocol":[143],"that":[144,177,195],"routes":[145],"messages":[147],"over":[148],"cost":[155],"links":[157],"defined":[161],"times":[165],"rather":[166],"than":[167],"conventional":[169,198],"times.":[171],"Through":[172],"trace-driven":[173],"simulations,":[174],"demonstrate":[176],"CSPR":[178],"achieves":[179],"higher":[180],"delivery":[181],"rate":[182],"lower":[184],"compared":[187],"protocols":[194],"use":[196],"as":[201],"link":[203],"metric.":[204]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}