{"id":"https://openalex.org/W2402131064","doi":"https://doi.org/10.1109/tmc.2016.2567388","title":"Engage Others or Leave it to the Source? On Optimal Message Replication in DTNs Under Imperfect Cooperation","display_name":"Engage Others or Leave it to the Source? On Optimal Message Replication in DTNs Under Imperfect Cooperation","publication_year":2016,"publication_date":"2016-05-17","ids":{"openalex":"https://openalex.org/W2402131064","doi":"https://doi.org/10.1109/tmc.2016.2567388","mag":"2402131064"},"language":"en","primary_location":{"id":"doi:10.1109/tmc.2016.2567388","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2016.2567388","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Mobile Computing","raw_type":"journal-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/A5071820944","display_name":"Merkourios Karaliopoulos","orcid":"https://orcid.org/0000-0003-1514-4165"},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Merkourios Karaliopoulos","raw_affiliation_strings":["Department of Informatics, Athens University of Economics and Business, 76 Patission Str., Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0003-1514-4165","affiliations":[{"raw_affiliation_string":"Department of Informatics, Athens University of Economics and Business, 76 Patission Str., Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071820944"],"corresponding_institution_ids":["https://openalex.org/I73142707"],"apc_list":null,"apc_paid":null,"fwci":0.8499,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76654167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"16","issue":"3","first_page":"730","last_page":"743"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"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":0.9998999834060669,"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.9606000185012817,"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/T11388","display_name":"Grief, Bereavement, and Mental Health","score":0.9491000175476074,"subfield":{"id":"https://openalex.org/subfields/3203","display_name":"Clinical Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8063648343086243},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6811957359313965},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.6186892986297607},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.616014301776886},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5814880728721619},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4764302670955658},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4554831385612488},{"id":"https://openalex.org/keywords/replica","display_name":"Replica","score":0.45075318217277527},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4250604808330536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10833033919334412}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8063648343086243},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6811957359313965},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.6186892986297607},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.616014301776886},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5814880728721619},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4764302670955658},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4554831385612488},{"id":"https://openalex.org/C2775937380","wikidata":"https://www.wikidata.org/wiki/Q1232589","display_name":"Replica","level":2,"score":0.45075318217277527},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4250604808330536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10833033919334412},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tmc.2016.2567388","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2016.2567388","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Mobile Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1533162646","https://openalex.org/W1974942795","https://openalex.org/W2021453001","https://openalex.org/W2035892582","https://openalex.org/W2042184760","https://openalex.org/W2043564810","https://openalex.org/W2066268301","https://openalex.org/W2081411782","https://openalex.org/W2100920893","https://openalex.org/W2101946268","https://openalex.org/W2119567691","https://openalex.org/W2122385092","https://openalex.org/W2124927196","https://openalex.org/W2129849999","https://openalex.org/W2140656373","https://openalex.org/W2153297552","https://openalex.org/W2159695997","https://openalex.org/W2162493140","https://openalex.org/W2166735950","https://openalex.org/W2293146328","https://openalex.org/W2334782222","https://openalex.org/W4241072175","https://openalex.org/W4242656826"],"related_works":["https://openalex.org/W3013979739","https://openalex.org/W2655578171","https://openalex.org/W2577913821","https://openalex.org/W4296976839","https://openalex.org/W2460131733","https://openalex.org/W2953070151","https://openalex.org/W1520094959","https://openalex.org/W2083990828","https://openalex.org/W2122589784","https://openalex.org/W2760372971"],"abstract_inverted_index":{"The":[0,137,181],"message":[1,7,29,52,61,74,92],"replication":[2,117,129,159],"strategy,":[3],"namely":[4],"the":[5,16,45,57,73,85,88,112,123,155,177,186,190,229,246,256],"way":[6],"copies":[8,53,62],"are":[9,140],"generated":[10],"and":[11,80,99,173,210,258],"diffused":[12],"(a.k.a.":[13],"sprayed)":[14],"in":[15,32,189,236],"network,":[17],"is":[18],"a":[19,162,212,232,237,251],"fundamental,":[20],"yet":[21],"not":[22],"thoroughly":[23],"explored,":[24],"component":[25],"of":[26,47,59,87,126,133,158,192,205,221,231,240,260],"all":[27,37],"multi-copy":[28,241],"forwarding":[30,243,262],"schemes":[31],"opportunistic":[33],"networks.":[34],"Whereas":[35],"almost":[36],"related":[38],"protocols":[39],"rely":[40],"to":[41,223,255],"some":[42],"extent":[43],"on":[44],"assistance":[46],"intermediate":[48,127,203],"nodes":[49],"for":[50,84,143,176,265],"relaying":[51],"towards":[54],"their":[55],"destination,":[56],"generation":[58],"new":[60],"may":[63],"either":[64],"involve":[65],"them":[66],"or":[67],"be":[68],"carried":[69],"out":[70],"exclusively":[71],"by":[72],"source.":[75],"This":[76],"paper":[77],"first":[78],"formulates":[79],"solves":[81],"analytical":[82,138],"models":[83],"performance":[86],"two":[89],"most":[90],"popular":[91],"spraying":[93,179,188,215],"strategies":[94],"under":[95,130],"imperfect":[96],"node":[97,104,113,135,146],"cooperation":[98,114],"homogeneous":[100],"exponentially":[101],"distributed":[102],"pairwise":[103],"inter-contact":[105],"times.":[106],"Numerical":[107],"results":[108],"suggest":[109],"that":[110,263],"as":[111,161],"decreases":[115],"source":[116],"consistently":[118],"outperforms":[119],"binary":[120],"replication,":[121],"i.e.,":[122],"optimal":[124,178,182],"variant":[125],"node-assisted":[128],"nominal":[131],"conditions":[132],"full":[134],"cooperation.":[136],"conclusions":[139],"also":[141],"verified":[142],"more":[144,252],"realistic":[145],"mobility":[147],"patterns":[148],"through":[149],"trace-driven":[150],"experimentation.":[151],"We":[152],"then":[153],"formulate":[154],"ideal":[156],"selection":[157],"mode":[160],"finite-horizon":[163],"Continuous":[164],"Time":[165],"Markov":[166],"Decision":[167],"Process":[168],"with":[169,185],"restricted":[170],"decision":[171],"epochs":[172],"solve":[174],"it":[175,201,249],"policy.":[180],"policy":[183,216],"coincides":[184],"binary-(source-)":[187],"presence":[191],"few":[193],"(resp.":[194],"many)":[195],"misbehaving":[196],"nodes.":[197],"To":[198],"better":[199],"approximate":[200],"at":[202],"levels":[204],"misbehavior":[206],"intensity,":[207],"we":[208],"introduce":[209],"analyze":[211],"simple":[213],"static":[214],"permitting":[217],"source-destination":[218],"space-time":[219],"paths":[220],"up":[222],"three":[224],"hops.":[225],"Our":[226],"work":[227],"deepens":[228],"understanding":[230],"core":[233],"operation":[234],"embedded":[235],"broad":[238],"range":[239],"DTN":[242,261],"protocols.":[244],"At":[245],"same":[247],"time,":[248],"advocates":[250],"thorough":[253],"approach":[254],"design":[257],"evaluation":[259],"accounts":[264],"beyond-nominal":[266],"conditions.":[267]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}