{"id":"https://openalex.org/W2106540902","doi":"https://doi.org/10.1109/mass.2010.5663962","title":"Efficient routing in delay tolerant networks with correlated node mobility","display_name":"Efficient routing in delay tolerant networks with correlated node mobility","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W2106540902","doi":"https://doi.org/10.1109/mass.2010.5663962","mag":"2106540902"},"language":"en","primary_location":{"id":"doi:10.1109/mass.2010.5663962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mass.2010.5663962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010)","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 for 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 for 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 for 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 for 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 for 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 for 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":4.0911,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94178428,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"79","last_page":"88"},"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.9890999794006348,"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.9790999889373779,"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.7849329113960266},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7333821058273315},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5880740880966187},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.5876496434211731},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5697208046913147},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5502901673316956},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5137702226638794},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5133625864982605},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5035716891288757},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5012803077697754},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.48905548453330994},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4646662473678589},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4553227722644806},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.448588103055954},{"id":"https://openalex.org/keywords/metrics","display_name":"Metrics","score":0.4397870600223541},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42137232422828674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2167903482913971},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07864022254943848},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06826460361480713}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7849329113960266},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7333821058273315},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5880740880966187},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.5876496434211731},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5697208046913147},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5502901673316956},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5137702226638794},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5133625864982605},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5035716891288757},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5012803077697754},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.48905548453330994},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4646662473678589},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4553227722644806},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.448588103055954},{"id":"https://openalex.org/C195780805","wikidata":"https://www.wikidata.org/wiki/Q1535986","display_name":"Metrics","level":5,"score":0.4397870600223541},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42137232422828674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2167903482913971},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07864022254943848},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06826460361480713},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/mass.2010.5663962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mass.2010.5663962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.172.6511","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.6511","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/mass.10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.227.6185","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.6185","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/mass_2010_Bulut.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.4115","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.4115","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/mass10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.7135","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.7135","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/~szymansk/papers/mass.10.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1572481965","https://openalex.org/W2010634640","https://openalex.org/W2040459121","https://openalex.org/W2068273572","https://openalex.org/W2073418598","https://openalex.org/W2073597268","https://openalex.org/W2082674813","https://openalex.org/W2099485835","https://openalex.org/W2105920492","https://openalex.org/W2107930846","https://openalex.org/W2112459052","https://openalex.org/W2116600847","https://openalex.org/W2123825896","https://openalex.org/W2125957038","https://openalex.org/W2134752223","https://openalex.org/W2135712710","https://openalex.org/W2137259487","https://openalex.org/W2137774589","https://openalex.org/W2139768213","https://openalex.org/W2142522527","https://openalex.org/W2145517691","https://openalex.org/W2147830904","https://openalex.org/W2161827863","https://openalex.org/W2162076967","https://openalex.org/W2162435761","https://openalex.org/W4241072175","https://openalex.org/W4242656826"],"related_works":["https://openalex.org/W1655019438","https://openalex.org/W2555559350","https://openalex.org/W2120137201","https://openalex.org/W1975971517","https://openalex.org/W2543752581","https://openalex.org/W2950120971","https://openalex.org/W2620451430","https://openalex.org/W2128948913","https://openalex.org/W4394645426","https://openalex.org/W2081964190"],"abstract_inverted_index":{"In":[0,70],"a":[1,22,45,103,121,124],"delay":[2],"tolerant":[3],"network":[4],"(DTN),":[5],"nodes":[6,52,87,118,178],"are":[7,15,179],"connected":[8,24],"intermittently":[9],"and":[10,88],"the":[11,57,63,77,80,91,112,129,133,143,147,174,217,223],"future":[12],"node":[13,65,84,126],"connections":[14],"mostly":[16],"unknown.":[17],"Since":[18],"in":[19,72,161,172],"these":[20],"networks,":[21],"fully":[23],"path":[25],"from":[26],"source":[27],"to":[28,32,67,120,152,165,192],"destination":[29],"is":[30,53],"unlikely":[31],"exist,":[33],"message":[34],"delivery":[35,200],"relies":[36],"on":[37,44,90,146,211],"opportunistic":[38],"routing.":[39,69],"However,":[40],"effective":[41],"forwarding":[42,188,204],"based":[43,158],"limited":[46],"knowledge":[47,131],"of":[48,51,56,82,93,99,132,206],"contact":[49],"behavior":[50],"challenging.":[54],"Most":[55],"previous":[58],"studies":[59],"looked":[60],"at":[61],"only":[62,128],"pairwise":[64],"relations":[66],"decide":[68],"contrast,":[71],"this":[73,94],"paper,":[74],"we":[75,137,140,163,190],"analyze":[76],"correlation":[78,95],"between":[79,116,177],"meetings":[81],"each":[83],"with":[85,123],"other":[86],"focus":[89],"utilization":[92],"for":[96,186],"efficient":[97],"routing":[98,150,159],"messages.":[100,207],"We":[101],"introduce":[102],"new":[104],"metric":[105,145,201],"called":[106],"conditional":[107,169,182,194],"intermeeting":[108,114,183,195],"time,":[109],"which":[110,173],"computes":[111],"average":[113],"time":[115,196],"two":[117],"relative":[119],"meeting":[122],"third":[125],"using":[127],"local":[130],"past":[134],"contacts.":[135],"Then,":[136],"show":[138,215],"how":[139],"can":[141],"utilize":[142],"proposed":[144],"existing":[148],"DTN":[149],"protocols":[151,160],"improve":[153],"their":[154],"performance.":[155],"For":[156],"shortest-path":[157],"DTNs,":[162],"propose":[164,191],"route":[166],"messages":[167],"over":[168],"shortest":[170],"paths":[171],"link":[175],"cost":[176],"defined":[180],"by":[181],"times.":[184],"Moreover,":[185],"metric-based":[187],"protocols,":[189],"use":[193],"as":[197],"an":[198],"additional":[199],"while":[202],"making":[203],"decisions":[205],"Our":[208],"trace-driven":[209],"simulations":[210],"three":[212],"different":[213],"datasets":[214],"that":[216],"modified":[218],"algorithms":[219],"perform":[220],"better":[221],"than":[222],"original":[224],"ones.":[225]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}