{"id":"https://openalex.org/W2092762864","doi":"https://doi.org/10.1109/isita.2010.5649536","title":"Relay-aided multi-cell broadcasting with random network coding","display_name":"Relay-aided multi-cell broadcasting with random network coding","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2092762864","doi":"https://doi.org/10.1109/isita.2010.5649536","mag":"2092762864"},"language":"en","primary_location":{"id":"doi:10.1109/isita.2010.5649536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory &amp; Its Applications","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/A5100366043","display_name":"Lu Lu","orcid":"https://orcid.org/0000-0003-0337-2005"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Lu Lu","raw_affiliation_strings":["Communication Theory Laboratory, Royal Institute of Technology, Sweden","Communication Theory Lab, Royal Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Communication Theory Laboratory, Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Communication Theory Lab, Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113698941","display_name":"Fan Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Fan Sun","raw_affiliation_strings":["Radio Access Technology Section, University of Aalborg, Denmark","Radio Access Technology Section, Aalborg University"],"affiliations":[{"raw_affiliation_string":"Radio Access Technology Section, University of Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Radio Access Technology Section, Aalborg University","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037292846","display_name":"Ming Xiao","orcid":"https://orcid.org/0000-0002-5407-0835"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ming Xiao","raw_affiliation_strings":["Communication Theory Laboratory, ACCESS Linnaeus Center, Royal Institute of Technology, Sweden","Communication Theory Lab, and ACCESS Linneaus Center, Royal Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Communication Theory Laboratory, ACCESS Linnaeus Center, Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Communication Theory Lab, and ACCESS Linneaus Center, Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026962956","display_name":"Lars K. Rasmussen","orcid":"https://orcid.org/0000-0001-7182-9543"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Lars K. Rasmussen","raw_affiliation_strings":["Communication Theory Laboratory, ACCESS Linnaeus Center, Royal Institute of Technology, Sweden","Communication Theory Lab, and ACCESS Linneaus Center, Royal Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Communication Theory Laboratory, ACCESS Linnaeus Center, Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Communication Theory Lab, and ACCESS Linneaus Center, Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100366043"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":1.4902,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83809684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"957","last_page":"962"},"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9941999912261963,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.983299970626831,"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.799401044845581},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6119381189346313},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.6011713147163391},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5872527956962585},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5769309997558594},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5510016679763794},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5508022904396057},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5462105870246887},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4708371162414551},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.42099496722221375},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39835479855537415},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3690223693847656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3442401885986328},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.268263041973114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09569716453552246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.799401044845581},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6119381189346313},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.6011713147163391},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5872527956962585},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5769309997558594},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5510016679763794},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5508022904396057},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5462105870246887},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4708371162414551},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.42099496722221375},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39835479855537415},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3690223693847656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3442401885986328},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.268263041973114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09569716453552246},{"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/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isita.2010.5649536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory &amp; Its Applications","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/6e29e13a-88f4-47a7-9032-79abf04dfaf1","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=78651342020&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lu , L , Sun , F , Xiao , M &amp; Rasmussen , L K 2010 , Relay-aided multi-cell broadcasting with random network coding . in ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications . IEEE Press , pp. 957-962 , 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 , Taichung , Taiwan, Province of China , 17/10/2010 . https://doi.org/10.1109/ISITA.2010.5649536","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/6e29e13a-88f4-47a7-9032-79abf04dfaf1","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/6e29e13a-88f4-47a7-9032-79abf04dfaf1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lu, L, Sun, F, Xiao, M & Rasmussen, L K 2010, Relay-aided multi-cell broadcasting with random network coding. in ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications. IEEE Press, pp. 957-962, 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010, Taichung, Taiwan, Province of China, 17/10/2010. https://doi.org/10.1109/ISITA.2010.5649536","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1993709531","https://openalex.org/W2015794320","https://openalex.org/W2048235391","https://openalex.org/W2098567664","https://openalex.org/W2099805730","https://openalex.org/W2114206850","https://openalex.org/W2116661213","https://openalex.org/W2135019170","https://openalex.org/W2138928022","https://openalex.org/W2143447102","https://openalex.org/W2159384192","https://openalex.org/W2341171179","https://openalex.org/W2798875205","https://openalex.org/W3124613635","https://openalex.org/W4248288458","https://openalex.org/W4251949759","https://openalex.org/W6704298589"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W3184267879","https://openalex.org/W2372008037","https://openalex.org/W2106332846","https://openalex.org/W1545991362","https://openalex.org/W2397293317","https://openalex.org/W2363433593","https://openalex.org/W2167574351"],"abstract_inverted_index":{"We":[0],"investigate":[1],"a":[2,36,48],"relay-aided":[3],"multi-cell":[4],"broadcasting":[5],"system":[6],"using":[7],"random":[8,100],"network":[9],"codes,":[10],"where":[11],"the":[12,60,75,79,85],"focus":[13],"is":[14,65],"on":[15,31],"devising":[16],"efficient":[17],"scheduling":[18,26,38,50,101],"algorithms":[19,27],"between":[20],"relay":[21],"and":[22,47,99],"base":[23],"stations.":[24],"Two":[25],"are":[28],"proposed":[29],"based":[30],"different":[32],"feedback":[33,42,53],"strategies;":[34],"namely,":[35],"one-step":[37,86],"algorithm":[39,51,81],"with":[40,52],"instantaneous":[41],"for":[43],"each":[44],"redundancy":[45,57],"packet;":[46],"multi-step":[49,80],"only":[54],"after":[55],"multiple":[56],"packets.":[58],"For":[59],"latter":[61],"case,":[62],"dynamic":[63],"programming":[64],"applied":[66],"to":[67],"determine":[68],"optimal":[69],"scheduling.":[70],"Numerical":[71],"results":[72],"show":[73],"that":[74,83],"transmission":[76],"efficiency":[77],"of":[78,84],"approaches":[82],"algorithm,":[87],"but":[88],"requires":[89],"significantly":[90,95],"less":[91],"feedback.":[92],"They":[93],"both":[94],"outperform":[96],"corresponding":[97],"ARQ":[98],"approaches.":[102]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}
