{"id":"https://openalex.org/W2021319127","doi":"https://doi.org/10.1109/icc.2013.6654792","title":"Social-similarity-based routing algorithm in Delay Tolerant Networks","display_name":"Social-similarity-based routing algorithm in Delay Tolerant Networks","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2021319127","doi":"https://doi.org/10.1109/icc.2013.6654792","mag":"2021319127"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2013.6654792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2013.6654792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Communications (ICC)","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/A5068402148","display_name":"Daniel Rothfus","orcid":null},"institutions":[{"id":"https://openalex.org/I118808232","display_name":"LeTourneau University","ror":"https://ror.org/006t60p65","country_code":"US","type":"education","lineage":["https://openalex.org/I118808232"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Rothfus","raw_affiliation_strings":["Department of Computer Science, LeTourneau University, Longview, TX, USA","Dept. of Comput. Sci., LeTourneau Univ., Longview, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, LeTourneau University, Longview, TX, USA","institution_ids":["https://openalex.org/I118808232"]},{"raw_affiliation_string":"Dept. of Comput. Sci., LeTourneau Univ., Longview, TX, USA","institution_ids":["https://openalex.org/I118808232"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055628768","display_name":"Christina Dunning","orcid":null},"institutions":[{"id":"https://openalex.org/I193198326","display_name":"Montana State University Billings","ror":"https://ror.org/01tj58m37","country_code":"US","type":"education","lineage":["https://openalex.org/I193198326","https://openalex.org/I4210126032"]},{"id":"https://openalex.org/I6750721","display_name":"University of Montana","ror":"https://ror.org/0078xmk34","country_code":"US","type":"education","lineage":["https://openalex.org/I6750721"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christina Dunning","raw_affiliation_strings":["Department of Computer Science, University of Montana, Billings, MT, USA","Department of Computer Science, University of Montana, Billings, MT USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Montana, Billings, MT, USA","institution_ids":["https://openalex.org/I193198326","https://openalex.org/I6750721"]},{"raw_affiliation_string":"Department of Computer Science, University of Montana, Billings, MT USA","institution_ids":["https://openalex.org/I6750721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100768162","display_name":"Xiao Chen","orcid":"https://orcid.org/0000-0002-7634-9319"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiao Chen","raw_affiliation_strings":["Department of Computer Science, Texas State University, San Marcos, TX, USA","Department of Computer Science , Texas State University , San Marcos , TX , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]},{"raw_affiliation_string":"Department of Computer Science , Texas State University , San Marcos , TX , USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1862","last_page":"1866"},"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.9954000115394592,"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.9868000149726868,"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.7723182439804077},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.6401689052581787},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5774821043014526},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5425177216529846},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3515625596046448},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3477399945259094},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32243868708610535},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2884332537651062},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23704484105110168}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7723182439804077},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.6401689052581787},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5774821043014526},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5425177216529846},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3515625596046448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3477399945259094},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32243868708610535},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2884332537651062},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23704484105110168},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2013.6654792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2013.6654792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5099999904632568,"display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1554192035","https://openalex.org/W1572481965","https://openalex.org/W1995875735","https://openalex.org/W2103357518","https://openalex.org/W2120353768","https://openalex.org/W2125957038","https://openalex.org/W2126343340","https://openalex.org/W2140190241","https://openalex.org/W2142522527","https://openalex.org/W2147830904","https://openalex.org/W2151342861","https://openalex.org/W2166406195","https://openalex.org/W2293146328","https://openalex.org/W3141915197","https://openalex.org/W6634082847","https://openalex.org/W6678808313"],"related_works":["https://openalex.org/W2149224531","https://openalex.org/W4247716783","https://openalex.org/W2160885658","https://openalex.org/W2098791961","https://openalex.org/W2144164383","https://openalex.org/W4230539218","https://openalex.org/W2137646787","https://openalex.org/W2154215043","https://openalex.org/W2003154778","https://openalex.org/W2150731467"],"abstract_inverted_index":{"A":[0],"Delay":[1],"Tolerant":[2],"Network":[3],"(DTN)":[4],"is":[5,130],"a":[6,48,103,112,115,142,185],"type":[7],"of":[8,38,70],"wireless":[9],"mobile":[10,44],"network":[11,17],"that":[12,29,67,120,146,177,197],"does":[13],"not":[14],"guarantee":[15],"continuous":[16],"connectivity.":[18],"One":[19],"application":[20],"can":[21,180],"be":[22],"found":[23],"in":[24,78,93,132,172],"the":[25,36,76,79,97,107,201],"social":[26,72,94,108,128,161],"communication":[27],"networks":[28],"are":[30],"becoming":[31],"ever":[32],"more":[33,39,158],"ubiquitous":[34],"with":[35,96,184],"development":[37],"portable,":[40],"affordable,":[41],"and":[42,53,114],"powerful":[43],"devices.":[45],"In":[46,85],"such":[47,86],"network,":[49],"people":[50],"move":[51],"around":[52],"contact":[54,155],"each":[55],"other":[56],"based":[57],"on":[58,153],"their":[59],"common":[60],"interests.":[61],"Recently,":[62],"some":[63],"social-feature-based":[64],"routing":[65,77,100,144,182],"protocols":[66],"take":[68],"advantage":[69],"recorded":[71],"features":[73,95,129],"to":[74,105,157],"steer":[75],"right":[80],"direction":[81],"have":[82],"been":[83],"proposed.":[84],"protocols,":[87],"every":[88],"node":[89],"finds":[90],"its":[91],"differences":[92,110],"destination.":[98,116],"The":[99,189],"hence":[101],"becomes":[102],"process":[104],"resolve":[106],"feature":[109],"between":[111,163],"source":[113],"However,":[117],"we":[118,138,168],"believe":[119],"merely":[121],"distinguishing":[122],"nodes":[123],"by":[124],"\u201csame\u201d":[125],"or":[126],"\u201cdifferent\u201d":[127],"insufficient":[131],"reflecting":[133],"nodes'":[134,154],"dynamic":[135],"behavior.":[136],"Therefore,":[137],"put":[139],"forward":[140],"SOSIM,":[141],"novel":[143],"algorithm":[145,179,199],"uses":[147],"similarity":[148],"metrics":[149],"from":[150],"data":[151],"mining":[152],"history":[156],"accurately":[159],"evaluate":[160],"similarities":[162],"nodes.":[164],"To":[165],"improve":[166,181],"efficiency,":[167],"apply":[169],"delegation":[170],"forwarding":[171],"our":[173,178,198],"algorithm.":[174],"Analysis":[175],"indicates":[176],"performance":[183],"low":[186],"implementation":[187],"cost.":[188],"simulation":[190],"results":[191],"using":[192],"real":[193],"trace":[194],"also":[195],"show":[196],"outperforms":[200],"existing":[202],"ones.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}