{"id":"https://openalex.org/W2135419668","doi":"https://doi.org/10.1109/icccn.2011.6005812","title":"On Secure Multi-Copy Based Routing in Compromised Delay Tolerant Networks","display_name":"On Secure Multi-Copy Based Routing in Compromised Delay Tolerant Networks","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2135419668","doi":"https://doi.org/10.1109/icccn.2011.6005812","mag":"2135419668"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2011.6005812","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2011.6005812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)","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/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":false,"raw_author_name":"Eyuphan Bulut","raw_affiliation_strings":["Department of Computer Science and Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY, USA","[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]","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 Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY, USA","[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"1","last_page":"7"},"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.9871000051498413,"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.9789999723434448,"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.8235431909561157},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.8099778294563293},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5533937811851501},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5375997424125671},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5306892395019531},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5225874185562134},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4926303029060364},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4910123646259308},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4793456494808197},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.46841946244239807},{"id":"https://openalex.org/keywords/delay-tolerant-networking","display_name":"Delay-tolerant networking","score":0.4641178250312805},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4618239998817444},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4540454149246216},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.44603610038757324},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.2490236461162567},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.22219392657279968},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.0976552963256836},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07697311043739319}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8235431909561157},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.8099778294563293},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5533937811851501},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5375997424125671},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5306892395019531},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5225874185562134},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4926303029060364},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4910123646259308},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4793456494808197},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.46841946244239807},{"id":"https://openalex.org/C53264328","wikidata":"https://www.wikidata.org/wiki/Q55320","display_name":"Delay-tolerant networking","level":5,"score":0.4641178250312805},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4618239998817444},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4540454149246216},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.44603610038757324},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.2490236461162567},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22219392657279968},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0976552963256836},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07697311043739319},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icccn.2011.6005812","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2011.6005812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.227.8240","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.8240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cgi2.cs.rpi.edu/%7Eszymansk/papers/secure-final.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":29,"referenced_works":["https://openalex.org/W1572481965","https://openalex.org/W1966182548","https://openalex.org/W1970861198","https://openalex.org/W2010634640","https://openalex.org/W2032741002","https://openalex.org/W2068791956","https://openalex.org/W2069929443","https://openalex.org/W2070536508","https://openalex.org/W2073418598","https://openalex.org/W2073597268","https://openalex.org/W2082674813","https://openalex.org/W2099485835","https://openalex.org/W2106540902","https://openalex.org/W2107930846","https://openalex.org/W2109505558","https://openalex.org/W2112459052","https://openalex.org/W2113261592","https://openalex.org/W2123030505","https://openalex.org/W2123825896","https://openalex.org/W2129849999","https://openalex.org/W2130741280","https://openalex.org/W2137774589","https://openalex.org/W2142522527","https://openalex.org/W2142545387","https://openalex.org/W2157445816","https://openalex.org/W2162435761","https://openalex.org/W2169926009","https://openalex.org/W2589327169","https://openalex.org/W6641602965"],"related_works":["https://openalex.org/W2027756030","https://openalex.org/W2157163318","https://openalex.org/W2123812631","https://openalex.org/W1655019438","https://openalex.org/W4286008197","https://openalex.org/W2062799909","https://openalex.org/W2002267183","https://openalex.org/W1511174345","https://openalex.org/W1958233137","https://openalex.org/W1973373960"],"abstract_inverted_index":{"Routing":[0],"in":[1,33,44,98,123,150],"delay":[2],"tolerant":[3],"networks":[4,58,72],"(DTNs)":[5],"is":[6],"challenging":[7],"due":[8],"to":[9,28,74,80,104,108,140],"their":[10],"unique":[11],"characteristics":[12],"of":[13,31,48,56,63,84,118,120,129,152,176],"intermittent":[14],"node":[15],"connectivity.":[16],"Different":[17],"protocols":[18],"(single-copy,":[19],"multi-copy,":[20],"erasure-coding-based":[21],"etc.)":[22],"utilizing":[23],"store-carry-and-forward":[24],"paradigm":[25],"are":[26,43,102],"proposed":[27,181],"achieve":[29,141],"routing":[30,128,136],"messages":[32,86],"such":[34],"environments":[35],"by":[36,145,167,179],"opportunistic":[37],"message":[38],"exchanges":[39],"between":[40,66,89],"nodes":[41,76,101,122],"that":[42],"the":[45,61,82,85,90,116,124,163,177,180],"communication":[46],"range":[47],"each":[49],"other.":[50],"The":[51],"sparsity":[52],"and":[53,114],"distributed":[54],"nature":[55],"these":[57,71],"together":[59],"with":[60,159],"lack":[62],"stable":[64],"connectivity":[65],"source":[67],"destination":[68],"pairs":[69],"make":[70],"vulnerable":[73],"malicious":[75,100,121,153],"which":[77,99,105,138],"might":[78],"attempt":[79],"learn":[81],"content":[83],"being":[87],"routed":[88],"nodes.":[91,154],"In":[92],"this":[93],"paper,":[94],"we":[95,106],"consider":[96],"DTNs":[97],"present,":[103],"refer":[107],"as":[109],"compromised":[110,125],"DTNs.":[111],"We":[112,131],"discuss":[113],"analyze":[115],"effects":[117],"presence":[119,151],"DTN":[126],"on":[127],"messages.":[130],"propose":[132],"a":[133,146,168],"two":[134],"period":[135],"approach":[137],"aims":[139],"desired":[142,164],"delivery":[143,148,165,170],"ratio":[144,166],"given":[147,169],"deadline":[149,171],"Our":[155],"results":[156],"show":[157],"that,":[158],"proper":[160],"parameter":[161],"setting,":[162],"can":[172],"be":[173],"achieved":[174],"most":[175],"time":[178],"method.":[182]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
