{"id":"https://openalex.org/W2027034953","doi":"https://doi.org/10.1109/tac.2012.2194333","title":"Delay Guarantees for Throughput-Optimal Wireless Link Scheduling","display_name":"Delay Guarantees for Throughput-Optimal Wireless Link Scheduling","publication_year":2012,"publication_date":"2012-04-09","ids":{"openalex":"https://openalex.org/W2027034953","doi":"https://doi.org/10.1109/tac.2012.2194333","mag":"2027034953"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2012.2194333","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2012.2194333","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-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/A5090686321","display_name":"Koushik Kar","orcid":"https://orcid.org/0000-0003-2506-672X"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Koushik Kar","raw_affiliation_strings":["Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","Dept. of Electr., Comput., & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Dept. of Electr., Comput., & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111720851","display_name":"Saswati Sarkar","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saswati Sarkar","raw_affiliation_strings":["Department of Electrical Engineering, University of Pennsylvania, Philadelphia, PA, USA","Dept. of Electr. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA#TAB#","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038927068","display_name":"Abouzar Ghavami","orcid":"https://orcid.org/0000-0001-5772-0285"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abouzar Ghavami","raw_affiliation_strings":["Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","Dept. of Electr., Comput., & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Dept. of Electr., Comput., & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047386659","display_name":"Xiang Luo","orcid":"https://orcid.org/0000-0002-9438-5225"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiang Luo","raw_affiliation_strings":["Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","Dept. of Electr., Comput., & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Dept. of Electr., Comput., & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9821,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.78004106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"57","issue":"11","first_page":"2906","last_page":"2911"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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.9991000294685364,"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.6778115034103394},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6186549067497253},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5772742629051208},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4624837040901184},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.45406410098075867},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4528421461582184},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.45189666748046875},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4510365128517151},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.45018965005874634},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.450120747089386},{"id":"https://openalex.org/keywords/performance-metric","display_name":"Performance metric","score":0.44939547777175903},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.43490070104599},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42215609550476074},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.4145314693450928},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3898073732852936},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3830479383468628},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3734769821166992},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3649287223815918},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.2792649567127228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26634591817855835},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08302298188209534}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6778115034103394},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6186549067497253},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5772742629051208},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4624837040901184},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.45406410098075867},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4528421461582184},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.45189666748046875},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4510365128517151},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.45018965005874634},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.450120747089386},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.44939547777175903},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.43490070104599},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42215609550476074},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4145314693450928},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3898073732852936},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3830479383468628},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3734769821166992},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3649287223815918},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.2792649567127228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26634591817855835},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08302298188209534},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tac.2012.2194333","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2012.2194333","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.161.5066","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.5066","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.seas.upenn.edu/~swati/Infocom09-delay.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.7396","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.7396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ecse.rpi.edu/homepages/koushik/mypapers/tac-delay.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1992294614","https://openalex.org/W2010763333","https://openalex.org/W2015207483","https://openalex.org/W2071025940","https://openalex.org/W2076426337","https://openalex.org/W2102713325","https://openalex.org/W2105177639","https://openalex.org/W2106413335","https://openalex.org/W2109487495","https://openalex.org/W2120344179","https://openalex.org/W2120407858","https://openalex.org/W2136268609","https://openalex.org/W2144862578","https://openalex.org/W2153086189","https://openalex.org/W2154946939","https://openalex.org/W2162809229","https://openalex.org/W2167993065","https://openalex.org/W2174312043","https://openalex.org/W4388297583"],"related_works":["https://openalex.org/W2165383991","https://openalex.org/W2380982398","https://openalex.org/W3038706899","https://openalex.org/W2140783760","https://openalex.org/W1007906405","https://openalex.org/W2143993543","https://openalex.org/W2393471163","https://openalex.org/W2142540075","https://openalex.org/W4231101290","https://openalex.org/W2809579289"],"abstract_inverted_index":{"We":[0,108,142],"consider":[1],"the":[2,44,74,86,90,94,98,102,106,118,127,139,148],"question":[3],"of":[4,21,59,89,124,150],"obtaining":[5],"tight":[6,116],"delay":[7,77,129],"guarantees":[8],"for":[9,56,165],"throughout-optimal":[10],"link":[11],"scheduling":[12,22,33,41,46,133],"in":[13,97,117],"arbitrary":[14],"topology":[15],"wireless":[16],"ad-hoc":[17],"networks.":[18],"Two":[19],"classes":[20,123],"policies":[23,52],"are":[24,48,65],"considered:":[25],"1)":[26],"a":[27,37,81],"maximum":[28],"queue-length":[29],"weighted":[30],"independent":[31,39],"set":[32,40,45,58],"policy":[34,42,134],"and":[35,64,93,168],"2)":[36],"randomized":[38],"where":[43,126],"probabilities":[47],"selected":[49],"optimally.":[50],"Both":[51],"stabilize":[53],"all":[54],"queues":[55],"any":[57,132],"feasible":[60],"packet":[61,76,170],"arrival":[62,95,171],"rates,":[63],"therefore":[66],"throughput-optimal.":[67],"For":[68],"these":[69],"policies,":[70],"we":[71,155],"show":[72],"that":[73,83,110,120],"average":[75],"is":[78,114,135],"bounded":[79,137],"by":[80,131,138],"constant":[82],"depends":[84],"on":[85,105],"chromatic":[87],"number":[88],"interference":[91],"graph,":[92],"slack":[96],"system-a":[99],"metric":[100],"representing":[101],"overall":[103],"load":[104],"network.":[107],"prove":[109],"this":[111],"upper":[112,145],"bound":[113],"asymptotically":[115],"sense":[119],"there":[121],"exist":[122],"topologies":[125],"expected":[128],"attained":[130],"lower":[136],"same":[140],"constant.":[141],"extend":[143],"our":[144,158],"bounds":[146],"to":[147],"case":[149],"multi-hop":[151],"sessions.":[152],"Through":[153],"simulations,":[154],"study":[156],"how":[157],"analysis":[159],"compares":[160],"with":[161],"actual":[162],"delays":[163],"computed":[164],"i.i.d.,":[166],"Markovian,":[167],"trace-driven":[169],"processes.":[172]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}