{"id":"https://openalex.org/W1974653561","doi":"https://doi.org/10.1109/sahcn.2014.6990397","title":"Optimizing multi-copy two-hop routing in mobile social networks","display_name":"Optimizing multi-copy two-hop routing in mobile social networks","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W1974653561","doi":"https://doi.org/10.1109/sahcn.2014.6990397","mag":"1974653561"},"language":"en","primary_location":{"id":"doi:10.1109/sahcn.2014.6990397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2014.6990397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","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/A5044419929","display_name":"Huanyang Zheng","orcid":"https://orcid.org/0000-0002-5529-4080"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huanyang Zheng","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, USA","\u2002Department of Computer and Information Sciences, Temple University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]},{"raw_affiliation_string":"\u2002Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100754862","display_name":"Yunsheng Wang","orcid":"https://orcid.org/0000-0002-9876-5356"},"institutions":[{"id":"https://openalex.org/I39965400","display_name":"Kettering University","ror":"https://ror.org/03rcspa57","country_code":"US","type":"education","lineage":["https://openalex.org/I39965400"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yunsheng Wang","raw_affiliation_strings":["Department of Computer Science, Kettering University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kettering University, USA","institution_ids":["https://openalex.org/I39965400"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100600528","display_name":"Jie Wu","orcid":"https://orcid.org/0000-0002-3472-1717"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Wu","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, USA","\u2002Department of Computer and Information Sciences, Temple University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]},{"raw_affiliation_string":"\u2002Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"573","last_page":"581"},"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.9972000122070312,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9966999888420105,"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.7982090711593628},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.7248272895812988},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6878317594528198},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5753936767578125},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.502225399017334},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.46890154480934143},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4548526406288147},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45187729597091675},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4291999340057373},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.42499661445617676},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.42095616459846497},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41807660460472107},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.40510302782058716},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40119192004203796},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.30225127935409546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1879066824913025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7982090711593628},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.7248272895812988},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6878317594528198},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5753936767578125},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.502225399017334},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46890154480934143},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4548526406288147},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45187729597091675},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4291999340057373},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.42499661445617676},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.42095616459846497},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41807660460472107},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.40510302782058716},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40119192004203796},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.30225127935409546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1879066824913025},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sahcn.2014.6990397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2014.6990397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.643.6064","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.6064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.temple.edu/~wu/research/publications/Publication_files/secon14-zhy.pdf","raw_type":"text"},{"id":"pmh:oai:digitalcommons.kettering.edu:computerscience_conference-1028","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/abstract/document/6990397","pdf_url":null,"source":{"id":"https://openalex.org/S4377196609","display_name":"Kettering University Digital Commons (Kettering University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39965400","host_organization_name":"Kettering University","host_organization_lineage":["https://openalex.org/I39965400"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Presentations And Conference Materials","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1965396227","https://openalex.org/W2017478515","https://openalex.org/W2071882951","https://openalex.org/W2082674813","https://openalex.org/W2097147215","https://openalex.org/W2099633905","https://openalex.org/W2103357518","https://openalex.org/W2140881359","https://openalex.org/W2147753918","https://openalex.org/W2149429274","https://openalex.org/W2149959815","https://openalex.org/W2166692930","https://openalex.org/W2293146328","https://openalex.org/W6654642102","https://openalex.org/W6681949580"],"related_works":["https://openalex.org/W2347665962","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W1655019438","https://openalex.org/W2555559350","https://openalex.org/W1996079847","https://openalex.org/W2120137201","https://openalex.org/W2317653264","https://openalex.org/W106527558","https://openalex.org/W1975971517"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"an":[3,113],"opportunistic":[4],"multi-copy":[5,136],"two-hop":[6,137],"routing":[7,138,146],"algorithm":[8,139],"is":[9,45,140],"proposed":[10,135,164],"for":[11],"mobile":[12],"social":[13,155],"networks":[14],"(MSNs)":[15],"to":[16,76,91,100,142],"minimize":[17],"the":[18,30,48,57,77,89,92,102,110,134,149,159,163],"expected":[19],"data":[20],"delivery":[21],"delay,":[22],"using":[23],"local":[24],"information.":[25],"For":[26],"each":[27],"source-destination":[28],"pair,":[29],"source":[31,71],"dynamically":[32],"maintains":[33],"a":[34,67,97,126,143],"forwarding":[35,42,82,103,120],"set":[36,43,104],"consisting":[37],"of":[38,50,61,129,162],"relay":[39,78],"nodes.":[40],"The":[41,70],"selection":[44],"based":[46],"on":[47],"number":[49,58],"remaining":[51],"message":[52,68,75,90,107],"copies,":[53],"as":[54,56],"well":[55],"and":[59],"quality":[60],"relays":[62],"that":[63],"have":[64],"not":[65],"received":[66],"copy.":[69],"only":[72],"forwards":[73],"its":[74,81],"nodes":[79],"in":[80,86,112,168],"set,":[83],"which":[84],"will":[85],"turn":[87],"forward":[88],"destination":[93],"directly.":[94],"We":[95],"propose":[96],"greedy":[98],"approach":[99],"select":[101],"with":[105,115,125],"n":[106],"copies":[108],"at":[109],"source,":[111],"MSN":[114],"m":[116],"(m>n)":[117],"relays.":[118],"All":[119],"sets":[121],"can":[122],"be":[123],"determined":[124],"time":[127],"complexity":[128],"O(m":[130],"log":[131],"m+nm).":[132],"Then,":[133],"applied":[141],"feature":[144,156],"space":[145],"scheme,":[147],"where":[148],"contact":[150],"frequencies":[151],"are":[152,166],"estimated":[153],"by":[154],"distances.":[157],"Finally,":[158],"competitive":[160],"performance":[161],"schemes":[165],"shown":[167],"real":[169],"trace-driven":[170],"simulations.":[171]},"counts_by_year":[{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}