{"id":"https://openalex.org/W2770458473","doi":"https://doi.org/10.1109/allerton.2017.8262768","title":"Cooperative data exchange with weighted cost based on d-basis construction","display_name":"Cooperative data exchange with weighted cost based on d-basis construction","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2770458473","doi":"https://doi.org/10.1109/allerton.2017.8262768","mag":"2770458473"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2017.8262768","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/232514","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100374892","display_name":"Su Li","orcid":"https://orcid.org/0000-0003-0816-4715"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Su Li","raw_affiliation_strings":["EPFL"],"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091862883","display_name":"Abhin Shah","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abhin Shah","raw_affiliation_strings":["EPFL"],"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063528341","display_name":"Michael Gastpar","orcid":"https://orcid.org/0000-0002-5499-5336"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Gastpar","raw_affiliation_strings":["EPFL"],"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100374892"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19996174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"421","last_page":"428"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.988099992275238,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9768000245094299,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6786835193634033},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5969279408454895},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49415209889411926},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4813888370990753},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.46621543169021606},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4541860818862915},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44121259450912476},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4315624237060547},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4204522669315338},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3659090995788574},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.28690266609191895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2474079132080078},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.134098082780838}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6786835193634033},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5969279408454895},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49415209889411926},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4813888370990753},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.46621543169021606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4541860818862915},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44121259450912476},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4315624237060547},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4204522669315338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3659090995788574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28690266609191895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2474079132080078},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.134098082780838},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2017.8262768","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:232514","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/232514","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:232514","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/232514","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1951888449","https://openalex.org/W1965032536","https://openalex.org/W2024301368","https://openalex.org/W2033259439","https://openalex.org/W2050536468","https://openalex.org/W2123562143","https://openalex.org/W2152592427","https://openalex.org/W2153753235","https://openalex.org/W2153984637","https://openalex.org/W2179841277","https://openalex.org/W2516759950","https://openalex.org/W2559477689","https://openalex.org/W2963659944","https://openalex.org/W2964130221","https://openalex.org/W3104735109"],"related_works":["https://openalex.org/W2755490834","https://openalex.org/W2075737586","https://openalex.org/W2051294371","https://openalex.org/W1964720438","https://openalex.org/W2960282440","https://openalex.org/W3125481297","https://openalex.org/W2501473353","https://openalex.org/W2963693149","https://openalex.org/W2589968180","https://openalex.org/W2064166548"],"abstract_inverted_index":{"We":[0,118],"consider":[1],"the":[2,24,35,61,79,126,132,136,148,155,161,176,179,186,196],"cooperative":[3,97,111],"data":[4,98,112],"exchange":[5,99,113],"problem,":[6],"in":[7],"which":[8,45,72,87],"nodes":[9,68],"are":[10],"fully":[11],"connected":[12],"with":[13,115],"each":[14,144],"other.":[15],"Each":[16],"node":[17],"initially":[18],"only":[19],"has":[20,171],"a":[21,29,42,89,106,120,192],"subset":[22],"of":[23,64,82,157,160,178,195,199],"K":[25],"packets":[26,137],"making":[27],"up":[28],"file":[30],"and":[31,49,130,135],"wants":[32],"to":[33,59,70,95,109,124,142,150],"recover":[34],"whole":[36],"file.":[37],"Node":[38],"i":[39],"can":[40,165],"make":[41],"broadcast":[43],"transmission,":[44],"incurs":[46],"cost":[47,63,129,189],"w":[48],"is":[50,58,73,191],"received":[51],"by":[52],"all":[53,67],"other":[54],"nodes.":[55],"The":[56],"goal":[57],"minimize":[60],"total":[62,197],"transmissions":[65,200],"that":[66,138,185],"have":[69],"send,":[71],"also":[74],"called":[75],"weighted":[76,102,116,128,188],"cost.":[77,117],"Following":[78],"same":[80],"idea":[81],"our":[83],"previous":[84],"work":[85],"[1]":[86],"provided":[88],"method":[90,108],"based":[91],"on":[92],"d-Basis":[93],"construction":[94],"solve":[96,110],"problem":[100,114],"without":[101],"cost,":[103],"we":[104,183],"present":[105,119],"modified":[107],"polynomial-time":[121],"deterministic":[122],"algorithm":[123,170],"compute":[125],"minimum":[127,187],"determine":[131],"rate":[133,203],"vector":[134],"should":[139],"be":[140,166],"used":[141],"generate":[143],"transmission.":[145],"By":[146],"leveraging":[147],"connection":[149],"Maximum":[151],"Distance":[152],"Separable":[153],"codes,":[154],"coefficients":[156],"linear":[158],"combinations":[159],"optimal":[162],"coding":[163],"scheme":[164],"efficiently":[167],"generated.":[168],"Our":[169],"significantly":[172],"lower":[173],"complexity":[174],"than":[175],"state":[177],"art.":[180],"In":[181],"particular,":[182],"prove":[184],"function":[190,194],"convex":[193],"number":[198],"for":[201],"integer":[202],"cases.":[204]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}