{"id":"https://openalex.org/W2104948292","doi":"https://doi.org/10.1109/icme.2009.5202787","title":"Network coding-aware rate control and scheduling in wireless networks","display_name":"Network coding-aware rate control and scheduling in wireless networks","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2104948292","doi":"https://doi.org/10.1109/icme.2009.5202787","mag":"2104948292"},"language":"en","primary_location":{"id":"doi:10.1109/icme.2009.5202787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icme.2009.5202787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Multimedia and Expo","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/A5059833598","display_name":"H\u00fclya Sefero\u011flu","orcid":"https://orcid.org/0000-0001-5497-6090"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hulya Seferoglu","raw_affiliation_strings":["University of California, Irvine, USA","University of California Irvine (USA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"University of California Irvine (USA)","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013543313","display_name":"Athina Markopoulou","orcid":"https://orcid.org/0000-0003-1803-8675"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Athina Markopoulou","raw_affiliation_strings":["University of California, Irvine, USA","University of California Irvine (USA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"University of California Irvine (USA)","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020802179","display_name":"Ula\u015f C. Kozat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ulas Kozat","raw_affiliation_strings":["DoCoMo Communications Laboratory USA, Inc., USA","DoCoMo USA Labs, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DoCoMo Communications Laboratory USA, Inc., USA","institution_ids":[]},{"raw_affiliation_string":"DoCoMo USA Labs, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1496","last_page":"1499"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T11158","display_name":"Wireless Networks and Protocols","score":0.9965999722480774,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9954000115394592,"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/linear-network-coding","display_name":"Linear network coding","score":0.8224615454673767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7740017175674438},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5896321535110474},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5553231239318848},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5391848683357239},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.534605860710144},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4891369640827179},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4730707108974457},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4366086721420288},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.42482486367225647},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.41204604506492615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24192151427268982},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10150477290153503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09792140126228333},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09380444884300232}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8224615454673767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7740017175674438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5896321535110474},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5553231239318848},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5391848683357239},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.534605860710144},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4891369640827179},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4730707108974457},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4366086721420288},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.42482486367225647},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.41204604506492615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24192151427268982},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10150477290153503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09792140126228333},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09380444884300232},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icme.2009.5202787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icme.2009.5202787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Multimedia and Expo","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.382.5512","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.382.5512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://newport.eecs.uci.edu/~athina/PAPERS/icme09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1985155234","https://openalex.org/W2096568537","https://openalex.org/W2098232769","https://openalex.org/W2119805989","https://openalex.org/W2123893388","https://openalex.org/W2137775453","https://openalex.org/W2138088216","https://openalex.org/W2149863032","https://openalex.org/W2154968665","https://openalex.org/W2159797391","https://openalex.org/W6646715095","https://openalex.org/W6683112175"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2952087324","https://openalex.org/W2350191883","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2084271153","https://openalex.org/W2978148977","https://openalex.org/W2225350526"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,112],"study":[4],"rate":[5,25,63,100],"control":[6,26,64,83,101],"and":[7,27,49,65,84,102],"scheduling":[8,28],"over":[9],"wireless":[10],"networks":[11],"with":[12],"intersession":[13],"network":[14,33,42,46,71,75,98],"coding,":[15],"as":[16],"a":[17,115],"utility":[18],"maximization":[19],"problem.":[20],"We":[21,68],"demonstrate":[22],"that":[23,41,118],"making":[24],"aware":[29],"of":[30,106],"the":[31,70,74,95,110,120],"underlying":[32],"coding":[34,43],"increases":[35],"throughput.":[36],"The":[37],"key":[38],"intuition":[39],"is":[40,92],"introduces":[44],"new":[45,51],"coded":[47],"flows":[48],"eventually":[50],"conflicts":[52],"between":[53],"nodes,":[54],"which":[55],"should":[56],"be":[57],"taken":[58],"into":[59],"account":[60],"both":[61],"in":[62,66,78],"scheduling.":[67],"compare":[69],"coding-aware":[72,99],"to":[73,93],"coding-unaware":[76],"schemes":[77],"two":[79],"cases:":[80],"(i)":[81],"optimal":[82,121],"(ii)":[85],"practical,":[86],"suboptimal":[87],"control.":[88,122],"Our":[89],"main":[90],"goal":[91],"make":[94],"case":[96],"for":[97],"scheduling,":[103],"via":[104],"simulation":[105],"representative":[107],"examples.":[108],"Along":[109],"way,":[111],"also":[113],"propose":[114],"practical":[116],"scheme":[117],"approximates":[119]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}