{"id":"https://openalex.org/W2032028862","doi":"https://doi.org/10.1109/wcnc.2013.6554861","title":"CROP: Community-relevance-based opportunistic routing in delay tolerant networks","display_name":"CROP: Community-relevance-based opportunistic routing in delay tolerant networks","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2032028862","doi":"https://doi.org/10.1109/wcnc.2013.6554861","mag":"2032028862"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2013.6554861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2013.6554861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Wireless Communications and Networking Conference (WCNC)","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/A5074932687","display_name":"Je-Wei Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Je-Wei Chang","raw_affiliation_strings":["Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","Department of Computer Science; National Chiao Tung University; Hsinchu; Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer Science; National Chiao Tung University; Hsinchu; Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101586737","display_name":"Chien Chen","orcid":"https://orcid.org/0000-0002-0514-8886"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chien Chen","raw_affiliation_strings":["Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","Department of Computer Science; National Chiao Tung University; Hsinchu; Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer Science; National Chiao Tung University; Hsinchu; Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074932687"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":1.8123,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86669115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1938","last_page":"1943"},"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.9898999929428101,"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/T13553","display_name":"Age of Information Optimization","score":0.9624999761581421,"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.7400842905044556},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5313972234725952},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.5127955079078674},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.5101504921913147},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4589473009109497},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.44957858324050903},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4399743378162384},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.42158347368240356},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4208469092845917},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.39881569147109985},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3894082307815552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10465553402900696}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7400842905044556},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5313972234725952},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.5127955079078674},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.5101504921913147},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4589473009109497},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.44957858324050903},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4399743378162384},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.42158347368240356},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4208469092845917},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.39881569147109985},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3894082307815552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10465553402900696},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2013.6554861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2013.6554861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Wireless Communications and Networking Conference (WCNC)","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W23100675","https://openalex.org/W1573579329","https://openalex.org/W1923680614","https://openalex.org/W1974063789","https://openalex.org/W1993146938","https://openalex.org/W1995341435","https://openalex.org/W1998280181","https://openalex.org/W2025799476","https://openalex.org/W2033411413","https://openalex.org/W2039157284","https://openalex.org/W2044184930","https://openalex.org/W2068273572","https://openalex.org/W2082674813","https://openalex.org/W2083551858","https://openalex.org/W2089458547","https://openalex.org/W2096509679","https://openalex.org/W2104269843","https://openalex.org/W2131968517","https://openalex.org/W2134752223","https://openalex.org/W2136420233","https://openalex.org/W2142522527","https://openalex.org/W2144564703","https://openalex.org/W2148606196","https://openalex.org/W2149429274","https://openalex.org/W2161827863","https://openalex.org/W2162076967","https://openalex.org/W2164928285","https://openalex.org/W2171053358","https://openalex.org/W2200366263","https://openalex.org/W2293146328"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W2102655743","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W1976978163","https://openalex.org/W2386380844","https://openalex.org/W2138035214","https://openalex.org/W2186630360","https://openalex.org/W2138388820","https://openalex.org/W1904064112"],"abstract_inverted_index":{"Researchers":[0],"have":[1],"developed":[2],"several":[3],"social-based":[4,24],"routing":[5,19,25,59,65,139],"protocols":[6],"for":[7,111],"delay":[8,49],"tolerant":[9],"networks":[10],"(DTNs)":[11],"over":[12],"the":[13,43,102,119,129,168],"past":[14],"few":[15],"years.":[16],"Two":[17],"main":[18],"metrics":[20,35],"to":[21,40,45],"support":[22],"a":[23,47,57,69,81],"in":[26,74,91],"DTNs":[27,75],"are":[28,109],"centrality":[29,83],"and":[30,144,161],"similarity":[31],"metrics.":[32],"These":[33],"two":[34],"help":[36],"packets":[37,164],"decide":[38],"how":[39],"travel":[41],"through":[42],"network":[44],"achieve":[46],"low":[48,51],"or":[50],"drop":[52],"rate.":[53],"This":[54,133],"study":[55,134],"presents":[56],"new":[58,82],"scheme":[60],"called":[61,85],"Community-Relevance":[62],"based":[63],"OPportunistic":[64],"(CROP).":[66],"CROP":[67,136,150],"uses":[68],"different":[70],"message":[71],"forwarding":[72],"approach":[73,93],"by":[76],"combining":[77],"community":[78,86,96,125],"structure":[79],"with":[80,137],"metric":[84],"relevance.":[87],"One":[88],"fundamental":[89],"change":[90],"this":[92],"is":[94],"that":[95,118,149],"relevance":[97],"values":[98],"do":[99],"not":[100],"represent":[101],"importance":[103,122],"of":[104,121,123,157],"communities":[105],"themselves.":[106],"Instead,":[107],"they":[108],"computed":[110],"each":[112],"community-community":[113],"relationship":[114],"individually":[115],"which":[116],"means":[117],"level":[120],"one":[124],"varies":[126],"depending":[127],"on":[128],"packet's":[130],"destination":[131],"community.":[132],"compares":[135],"other":[138],"algorithms":[140],"such":[141],"as":[142],"BubbleRap":[143],"SimBet.":[145],"Simulation":[146],"results":[147],"show":[148],"achieves":[151],"an":[152],"average":[153],"delivery":[154],"ratio":[155],"improvement":[156],"at":[158],"least":[159],"30%":[160],"can":[162],"distribute":[163],"more":[165],"fairly":[166],"within":[167],"network.":[169]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}