{"id":"https://openalex.org/W2168131851","doi":"https://doi.org/10.1109/isit.2010.5513290","title":"Dynamic coding and rate-control for serving deadline-constrained traffic over fading channels","display_name":"Dynamic coding and rate-control for serving deadline-constrained traffic over fading channels","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2168131851","doi":"https://doi.org/10.1109/isit.2010.5513290","mag":"2168131851"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513290","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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/A5064906847","display_name":"Harsha Gangammanavar","orcid":"https://orcid.org/0000-0003-4389-5433"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harsha Gangammanavar","raw_affiliation_strings":["Ohio State Uinversity, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio State Uinversity, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076974020","display_name":"Atilla Ery\u0131lmaz","orcid":"https://orcid.org/0000-0001-5560-5806"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Atilla Eryilmaz","raw_affiliation_strings":["Ohio State Uinversity, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio State Uinversity, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1788","last_page":"1792"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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.9983999729156494,"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.7870962619781494},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.596779465675354},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5886484980583191},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.5614191293716431},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.5258092284202576},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.49846792221069336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4926827549934387},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.49198243021965027},{"id":"https://openalex.org/keywords/dynamic-pricing","display_name":"Dynamic pricing","score":0.43064019083976746},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4258754849433899},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39784544706344604},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3609238266944885},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.35915738344192505},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.35016483068466187},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.2054901421070099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20278307795524597},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1243559718132019},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12016025185585022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10643219947814941}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7870962619781494},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.596779465675354},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5886484980583191},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.5614191293716431},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.5258092284202576},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.49846792221069336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4926827549934387},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.49198243021965027},{"id":"https://openalex.org/C2779391423","wikidata":"https://www.wikidata.org/wiki/Q17009728","display_name":"Dynamic pricing","level":2,"score":0.43064019083976746},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4258754849433899},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39784544706344604},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3609238266944885},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.35915738344192505},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35016483068466187},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.2054901421070099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20278307795524597},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1243559718132019},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12016025185585022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10643219947814941},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513290","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.468.7715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.468.7715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.ece.ohio-state.edu/~eryilmaz/papers/ISIT10_Final.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":16,"referenced_works":["https://openalex.org/W2004279685","https://openalex.org/W2011720124","https://openalex.org/W2058677708","https://openalex.org/W2098432798","https://openalex.org/W2104259309","https://openalex.org/W2111781120","https://openalex.org/W2116661213","https://openalex.org/W2135227402","https://openalex.org/W2148096039","https://openalex.org/W2160721090","https://openalex.org/W2167264214","https://openalex.org/W2170880416","https://openalex.org/W2329255212","https://openalex.org/W2580226899","https://openalex.org/W4296180618","https://openalex.org/W6664830801"],"related_works":["https://openalex.org/W2548963335","https://openalex.org/W2159941915","https://openalex.org/W1995129237","https://openalex.org/W4388081250","https://openalex.org/W1761601995","https://openalex.org/W2904599916","https://openalex.org/W2950385751","https://openalex.org/W3123048190","https://openalex.org/W2052799988","https://openalex.org/W2159276216"],"abstract_inverted_index":{"We":[0,122],"study":[1,141],"the":[2,46,49,61,83,94,105,109,151,156,164,168],"problem":[3],"of":[4,36,48,93,108],"optimal":[5,157],"dynamic":[6,40,55,76,152],"coding":[7,77,138,153,159],"and":[8,27,38,74,135,170],"rate-control":[9],"for":[10],"broadcasting":[11],"deadline-constrained":[12,110],"traffic":[13,63],"with":[14,134],"average":[15],"delivery":[16,86,116],"ratio":[17,87,117],"constraints":[18],"over":[19],"time-varying":[20],"wireless":[21],"channels.":[22],"In":[23],"particular,":[24],"we":[25],"propose":[26],"analyze":[28],"a":[29,34,54,75],"novel":[30],"policy":[31,103],"that":[32,100,150],"utilizes":[33],"combination":[35],"pricing":[37],"finite-horizon":[39],"programming":[41],"strategies":[42],"to":[43,68,114,128,140],"jointly":[44],"optimize":[45],"operation":[47,98],"following":[50],"two":[51],"components:":[52],"(i)":[53],"rate":[56],"allocation":[57],"policy,":[58,80],"which":[59,81],"manages":[60],"incoming":[62],"flow":[64,111],"rates":[65],"so":[66],"as":[67],"maximize":[69],"their":[70],"weighted":[71,106],"sum;":[72],"(ii)":[73],"window":[78],"selection":[79],"satisfies":[82],"flows'":[84],"individual":[85],"requirements.":[88],"Our":[89,147],"heuristic":[90],"fluid":[91],"analysis":[92],"resulting":[95],"stochastic":[96],"network":[97,137],"indicates":[99],"our":[101],"joint":[102],"maximizes":[104],"sum":[107],"throughput":[112],"subject":[113],"heterogeneous":[115],"requirements":[118],"imposed":[119],"on":[120],"them.":[121],"also":[123],"apply":[124],"these":[125],"general":[126],"results":[127],"an":[129],"important":[130],"cellular":[131],"downlink":[132],"scenario":[133],"without":[136],"capabilities":[139],"its":[142],"behavior":[143],"under":[144],"various":[145],"conditions.":[146],"simulations":[148],"reveal":[149],"strategy":[154,160],"outperforms":[155],"static":[158],"by":[161],"opportunistically":[162],"exploiting":[163],"statistical":[165],"variations":[166],"in":[167],"arrival":[169],"channel":[171],"processes.":[172]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}