{"id":"https://openalex.org/W2123030505","doi":"https://doi.org/10.1109/glocom.2010.5683082","title":"Friendship Based Routing in Delay Tolerant Mobile Social Networks","display_name":"Friendship Based Routing in Delay Tolerant Mobile Social Networks","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2123030505","doi":"https://doi.org/10.1109/glocom.2010.5683082","mag":"2123030505"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2010.5683082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 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 of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]"],"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":"[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 Center of Pervasive Computing and Networking, Rensselaer Polytechnic Institute, Troy, NY, USA","[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]"],"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":"[Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA]","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004397715"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":15.2485,"has_fulltext":false,"cited_by_count":160,"citation_normalized_percentile":{"value":0.99225689,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9886000156402588,"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.9729999899864197,"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/friendship","display_name":"Friendship","score":0.8130480051040649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7950252294540405},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6987819075584412},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5491726994514465},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5401394367218018},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5275247693061829},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5234964489936829},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5112473964691162},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.508468747138977},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.499147891998291},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.46623751521110535},{"id":"https://openalex.org/keywords/metrics","display_name":"Metrics","score":0.4367130696773529},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.43370553851127625},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.43202900886535645},{"id":"https://openalex.org/keywords/delay-tolerant-networking","display_name":"Delay-tolerant networking","score":0.42723989486694336},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42511433362960815},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.29874226450920105},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07778015732765198}],"concepts":[{"id":"https://openalex.org/C2778736484","wikidata":"https://www.wikidata.org/wiki/Q491","display_name":"Friendship","level":2,"score":0.8130480051040649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7950252294540405},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6987819075584412},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5491726994514465},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5401394367218018},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5275247693061829},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5234964489936829},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5112473964691162},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.508468747138977},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.499147891998291},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.46623751521110535},{"id":"https://openalex.org/C195780805","wikidata":"https://www.wikidata.org/wiki/Q1535986","display_name":"Metrics","level":5,"score":0.4367130696773529},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.43370553851127625},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.43202900886535645},{"id":"https://openalex.org/C53264328","wikidata":"https://www.wikidata.org/wiki/Q55320","display_name":"Delay-tolerant networking","level":5,"score":0.42723989486694336},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42511433362960815},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.29874226450920105},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07778015732765198},{"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2010.5683082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.172.6500","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.6500","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/gc10-friendship.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1572481965","https://openalex.org/W1975071275","https://openalex.org/W2010634640","https://openalex.org/W2073597268","https://openalex.org/W2079274032","https://openalex.org/W2082674813","https://openalex.org/W2083551858","https://openalex.org/W2102158101","https://openalex.org/W2105920492","https://openalex.org/W2107930846","https://openalex.org/W2123825896","https://openalex.org/W2129849999","https://openalex.org/W2134752223","https://openalex.org/W2135712710","https://openalex.org/W2139768213","https://openalex.org/W2142522527","https://openalex.org/W2144564703","https://openalex.org/W2157787711","https://openalex.org/W2162076967","https://openalex.org/W2162435761","https://openalex.org/W2166692930","https://openalex.org/W3118712427","https://openalex.org/W4242656826","https://openalex.org/W6634082847","https://openalex.org/W6643835115"],"related_works":["https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W1976978163","https://openalex.org/W2041855631","https://openalex.org/W2386380844","https://openalex.org/W2540928616","https://openalex.org/W2186630360","https://openalex.org/W1968750272","https://openalex.org/W1904064112","https://openalex.org/W1762001801"],"abstract_inverted_index":{"Routing":[0,90],"in":[1,38,91],"delay":[2],"tolerant":[3],"networks":[4,20],"(DTN)":[5],"have":[6],"attracted":[7],"a":[8,51],"great":[9],"interest":[10],"recently.":[11],"Increasingly":[12],"popular":[13],"type":[14],"of":[15,58,74,103],"DTNs":[16],"are":[17,96],"mobile":[18],"social":[19,30],"(MSN)":[21],"also":[22],"called":[23],"pocket":[24],"switched":[25],"networks.":[26],"Hence,":[27],"analyzing":[28],"accurately":[29],"network":[31],"properties":[32],"has":[33],"become":[34],"an":[35],"important":[36],"issue":[37],"designing":[39],"efficient":[40],"routing":[41],"protocols":[42],"for":[43,54],"MSNs.":[44],"In":[45],"this":[46],"paper,":[47],"we":[48,86],"first":[49],"introduce":[50],"new":[52],"metric":[53],"detecting":[55],"the":[56,62,72,100,111,123],"quality":[57],"friendships":[59,95],"accurately.":[60],"Using":[61],"introduced":[63,112],"metric,":[64],"each":[65],"node":[66],"defines":[67],"its":[68],"friendship":[69,78],"community":[70],"as":[71],"set":[73],"nodes":[75],"having":[76],"close":[77],"with":[79],"itself":[80],"either":[81],"directly":[82],"or":[83],"indirectly.":[84],"Then,":[85],"present":[87],"Friendship":[88],"Based":[89],"which":[92],"temporally":[93],"differentiated":[94],"used":[97],"to":[98],"make":[99],"forwarding":[101,119],"decisions":[102],"messages.":[104],"Real":[105],"trace-driven":[106],"simulation":[107],"results":[108],"show":[109],"that":[110],"algorithm":[113],"achieves":[114],"better":[115],"delivery":[116],"rate":[117],"while":[118],"fewer":[120],"messages":[121],"than":[122],"existing":[124],"algorithms.":[125]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}