{"id":"https://openalex.org/W2023041362","doi":"https://doi.org/10.1145/2248371.2248389","title":"Adaptive network coding for scheduling real-time traffic with hard deadlines","display_name":"Adaptive network coding for scheduling real-time traffic with hard deadlines","publication_year":2012,"publication_date":"2012-06-11","ids":{"openalex":"https://openalex.org/W2023041362","doi":"https://doi.org/10.1145/2248371.2248389","mag":"2023041362"},"language":"en","primary_location":{"id":"doi:10.1145/2248371.2248389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2248371.2248389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing","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/A5072565301","display_name":"Lei Yang","orcid":"https://orcid.org/0000-0002-5176-003X"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lei Yang","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089570143","display_name":"Yalin E. Sagduyu","orcid":"https://orcid.org/0000-0003-1576-5527"},"institutions":[{"id":"https://openalex.org/I4210130203","display_name":"Intelligent Automation (United States)","ror":"https://ror.org/02fwb6r86","country_code":"US","type":"company","lineage":["https://openalex.org/I4210130203"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yalin Evren Sagduyu","raw_affiliation_strings":["Intelligent Automation, Inc., Rockville, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent Automation, Inc., Rockville, MD, USA","institution_ids":["https://openalex.org/I4210130203"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048682964","display_name":"Jason Hongjun Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4210130203","display_name":"Intelligent Automation (United States)","ror":"https://ror.org/02fwb6r86","country_code":"US","type":"company","lineage":["https://openalex.org/I4210130203"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Hongjun Li","raw_affiliation_strings":["Intelligent Automation, Inc., Rockville, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent Automation, Inc., Rockville, MD, USA","institution_ids":["https://openalex.org/I4210130203"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.3159,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.98175337,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"114"},"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9919000267982483,"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.9915000200271606,"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.7730545997619629},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5570082068443298},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5344938635826111},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.5004196166992188},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.49328702688217163},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.47431063652038574},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.42446208000183105},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42351460456848145},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.42060586810112},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3487696945667267},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.34550607204437256},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34510529041290283},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3326486349105835},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3140244781970978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28928738832473755},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23706930875778198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10849645733833313}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7730545997619629},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5570082068443298},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5344938635826111},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.5004196166992188},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.49328702688217163},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.47431063652038574},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.42446208000183105},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42351460456848145},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.42060586810112},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3487696945667267},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.34550607204437256},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34510529041290283},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3326486349105835},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3140244781970978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28928738832473755},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23706930875778198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10849645733833313},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2248371.2248389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2248371.2248389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.755.1920","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.755.1920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1203.4008.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6700000166893005,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309835","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1985078982","https://openalex.org/W1995469408","https://openalex.org/W2023041362","https://openalex.org/W2037278536","https://openalex.org/W2048235391","https://openalex.org/W2055148782","https://openalex.org/W2059676477","https://openalex.org/W2097651478","https://openalex.org/W2098432798","https://openalex.org/W2102543764","https://openalex.org/W2105040801","https://openalex.org/W2105831729","https://openalex.org/W2113334170","https://openalex.org/W2123530434","https://openalex.org/W2130286537","https://openalex.org/W2137152139","https://openalex.org/W2138993731","https://openalex.org/W2141789914","https://openalex.org/W2143375750","https://openalex.org/W2143752912","https://openalex.org/W2154594768","https://openalex.org/W2163729038","https://openalex.org/W2165855437","https://openalex.org/W2166076277","https://openalex.org/W2168131851","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W4297972233"],"related_works":["https://openalex.org/W2212571888","https://openalex.org/W2139379087","https://openalex.org/W2020805386","https://openalex.org/W2285288187","https://openalex.org/W2411336269","https://openalex.org/W2124128583","https://openalex.org/W2489403550","https://openalex.org/W2079655802","https://openalex.org/W2581667880","https://openalex.org/W2096444692"],"abstract_inverted_index":{"We":[0,186],"study":[1],"adaptive":[2,56,178],"network":[3],"coding":[4],"(NC)":[5],"for":[6,147],"scheduling":[7,172,206],"real-time":[8,21,171],"traffic":[9],"over":[10],"a":[11,28,81,138,163,169,203],"single-hop":[12],"wireless":[13,229],"network.":[14],"To":[15],"meet":[16],"the":[17,32,36,39,50,59,66,70,91,103,107,114,127,148,189,210,238,241,245],"hard":[18,195],"deadlines":[19,196],"of":[20,42,130,240],"traffic,":[22],"it":[23,122],"is":[24,62,89,111],"critical":[25],"to":[26,69,124,183,191,220,236],"strike":[27],"balance":[29],"between":[30],"maximizing":[31],"throughput":[33],"and":[34,95,106,173,197,212,222],"minimizing":[35],"risk":[37],"that":[38,90,144,180],"entire":[40],"block":[41,60,76,93,109,116,150,247],"coded":[43],"packets":[44],"may":[45],"not":[46],"be":[47,160],"decodable":[48],"by":[49,72,113],"deadline.":[51],"Thus":[52],"motivated,":[53],"we":[54,136,166,225],"explore":[55],"NC,":[57],"where":[58],"size":[61,77,94,110,151,248],"adapted":[63],"based":[64],"on":[65,134],"remaining":[67],"time":[68],"deadline,":[71],"casting":[73],"this":[74],"sequential":[75],"adaptation":[78],"problem":[79],"as":[80,102],"finite-horizon":[82],"Markov":[83],"decision":[84],"process.":[85],"One":[86],"interesting":[87],"finding":[88,244],"optimal":[92,108,149,246],"its":[96,215],"corresponding":[97],"action":[98],"space":[99,129],"monotonically":[100],"decrease":[101],"deadline":[104],"approaches,":[105],"bounded":[112],"\"greedy\"":[115],"size.":[117],"These":[118],"unique":[119],"structures":[120],"make":[121],"possible":[123],"narrow":[125],"down":[126],"search":[128],"dynamic":[131],"programming,":[132],"building":[133],"which":[135],"develop":[137,168],"monotonicity-based":[139],"backward":[140],"induction":[141],"algorithm":[142,207],"(MBIA)":[143],"can":[145,181],"solve":[146],"in":[152,162,243,249],"polynomial":[153],"time.":[154,251],"Since":[155],"channel":[156,174,184],"erasure":[157],"probabilities":[158],"would":[159],"time-varying":[161],"mobile":[164],"network,":[165],"further":[167],"joint":[170],"learning":[175],"scheme":[176],"with":[177,194,209,232],"NC":[179],"adapt":[182],"dynamics.":[185],"also":[187],"generalize":[188],"analysis":[190,221],"multiple":[192],"flows":[193],"long-term":[198],"delivery":[199],"ratio":[200],"constraints,":[201],"devise":[202],"low-complexity":[204],"online":[205],"integrated":[208],"MBIA,":[211],"then":[213],"establish":[214],"asymptotic":[216],"throughput-optimality.":[217],"In":[218],"addition":[219],"simulation":[223],"results,":[224],"perform":[226],"high":[227],"fidelity":[228],"emulation":[230],"tests":[231],"real":[233,250],"radio":[234],"transmissions":[235],"demonstrate":[237],"feasibility":[239],"MBIA":[242]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}