{"id":"https://openalex.org/W2053652955","doi":"https://doi.org/10.1109/cig.2010.5592794","title":"On optimum communication cost for joint compression and dispersive information routing","display_name":"On optimum communication cost for joint compression and dispersive information routing","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2053652955","doi":"https://doi.org/10.1109/cig.2010.5592794","mag":"2053652955"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2010.5592794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2010.5592794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Information Theory Workshop","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/A5017446531","display_name":"Kumar Viswanatha","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kumar Viswanatha","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California,\uc2a0Santa Barbara, CA, USA","Department of Electrical and Computer Engineering University of California at Santa Barbara, CA-93106"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California,\uc2a0Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering University of California at Santa Barbara, CA-93106","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012879525","display_name":"Emrah Akyol","orcid":"https://orcid.org/0000-0002-0663-1677"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emrah Akyol","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California,\uc2a0Santa Barbara, CA, USA","Department of Electrical and Computer Engineering University of California at Santa Barbara, CA-93106"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California,\uc2a0Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering University of California at Santa Barbara, CA-93106","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026459097","display_name":"Kenneth Rose","orcid":"https://orcid.org/0000-0001-9463-2647"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kenneth Rose","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California,\uc2a0Santa Barbara, CA, USA","Department of Electrical and Computer Engineering University of California at Santa Barbara, CA-93106"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California,\uc2a0Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering University of California at Santa Barbara, CA-93106","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017446531"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":1.1757,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81025031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9911999702453613,"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.987500011920929,"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.7435386180877686},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6612891554832458},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.6293128728866577},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5709837079048157},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5570178627967834},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5531243681907654},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4929530620574951},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.45941174030303955},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4549245238304138},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.44035056233406067},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4212830066680908},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3967372179031372},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3906277120113373},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2984775900840759},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10190016031265259}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7435386180877686},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6612891554832458},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.6293128728866577},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5709837079048157},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5570178627967834},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5531243681907654},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4929530620574951},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.45941174030303955},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4549245238304138},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.44035056233406067},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4212830066680908},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3967372179031372},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3906277120113373},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2984775900840759},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10190016031265259},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cig.2010.5592794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2010.5592794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Information Theory Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.367.5627","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.5627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scl.ece.ucsb.edu/pubs/pubs_D/d10_10.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1930417601","https://openalex.org/W2004863950","https://openalex.org/W2037478555","https://openalex.org/W2045334208","https://openalex.org/W2099213070","https://openalex.org/W2109527244","https://openalex.org/W2116454348","https://openalex.org/W2119272044","https://openalex.org/W2129710358","https://openalex.org/W2130057404","https://openalex.org/W2141432745","https://openalex.org/W2150412388","https://openalex.org/W2155676967","https://openalex.org/W3004540582","https://openalex.org/W3216977419"],"related_works":["https://openalex.org/W2152381136","https://openalex.org/W1997091564","https://openalex.org/W146128134","https://openalex.org/W2351097701","https://openalex.org/W1655019438","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W2077927962","https://openalex.org/W1762001801","https://openalex.org/W2963821737"],"abstract_inverted_index":{"In":[0],"this":[1,148],"paper,":[2],"we":[3],"consider":[4],"the":[5,31,41,60,75,83,93,121,143],"problem":[6],"of":[7,40,54,120],"minimum":[8,144],"cost":[9,146],"joint":[10],"compression":[11],"and":[12,18,64,132,139],"routing":[13,24,65,113,149],"for":[14],"networks":[15],"with":[16],"multiple-sinks":[17],"correlated":[19],"sources.":[20],"We":[21,99,115],"introduce":[22,117],"a":[23,38,51,67,118],"paradigm,":[25],"called":[26,127],"dispersive":[27],"information":[28,85],"routing,":[29],"wherein":[30],"intermediate":[32],"nodes":[33],"are":[34,96,136],"allowed":[35],"to":[36,88,91,130],"forward":[37],"subset":[39],"received":[42],"bits":[43],"on":[44,59],"subsequent":[45],"paths.":[46],"This":[47],"paradigm":[48],"opens":[49],"up":[50],"rich":[52],"class":[53],"research":[55],"problems":[56],"which":[57,140],"focus":[58],"interplay":[61],"between":[62],"encoding":[63,78],"in":[66,77],"network.":[68],"What":[69],"makes":[70],"it":[71],"particularly":[72],"interesting":[73],"is":[74,86],"challenge":[76],"sources":[79,94,134],"such":[80],"that,":[81],"exactly":[82],"required":[84],"routed":[87],"each":[89],"sink,":[90],"reconstruct":[92],"they":[95],"interested":[97],"in.":[98],"demonstrate":[100],"using":[101],"simple":[102],"examples":[103],"that":[104,135],"our":[105],"approach":[106],"offers":[107],"better":[108],"asymptotic":[109],"performance":[110],"than":[111],"conventional":[112],"techniques.":[114],"also":[116],"variant":[119],"well":[122],"known":[123],"random":[124],"binning":[125],"technique,":[126],"`power":[128],"binning',":[129],"encode":[131],"decode":[133],"dispersively":[137],"transmitted,":[138],"asymptotically":[141],"achieves":[142],"communication":[145],"within":[147],"paradigm.":[150]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}