{"id":"https://openalex.org/W1998800093","doi":"https://doi.org/10.1145/1374618.1374624","title":"Complexity in wireless scheduling","display_name":"Complexity in wireless scheduling","publication_year":2008,"publication_date":"2008-05-26","ids":{"openalex":"https://openalex.org/W1998800093","doi":"https://doi.org/10.1145/1374618.1374624","mag":"1998800093"},"language":"en","primary_location":{"id":"doi:10.1145/1374618.1374624","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374618.1374624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th 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/A5037245619","display_name":"Yung Yi","orcid":"https://orcid.org/0000-0002-6955-3135"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yung Yi","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA","Princeton University , Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University , Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025136069","display_name":"Alexandre Prouti\u00e8re","orcid":"https://orcid.org/0000-0002-4679-4673"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandre Prouti\u00e8re","raw_affiliation_strings":["Microsft Research, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Microsft Research, Cambridge, United Kingdom","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110782105","display_name":"Mung Chiang","orcid":"https://orcid.org/0000-0002-8920-651X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mung Chiang","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA","Princeton University , Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University , Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037245619"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":9.3224,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.9821419,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"42"},"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/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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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.7832936644554138},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6857941150665283},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6457955837249756},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5961806178092957},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.545680582523346},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.5255074501037598},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4755527675151825},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4382270574569702},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4166397154331207},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26343560218811035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21133098006248474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13633552193641663}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7832936644554138},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6857941150665283},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6457955837249756},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5961806178092957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.545680582523346},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.5255074501037598},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4755527675151825},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4382270574569702},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4166397154331207},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26343560218811035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21133098006248474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13633552193641663},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1374618.1374624","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374618.1374624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1607044975","https://openalex.org/W1901187898","https://openalex.org/W1992294614","https://openalex.org/W1995713768","https://openalex.org/W2005076479","https://openalex.org/W2059739072","https://openalex.org/W2069994955","https://openalex.org/W2070317877","https://openalex.org/W2076426337","https://openalex.org/W2105177639","https://openalex.org/W2117363591","https://openalex.org/W2120408503","https://openalex.org/W2122857537","https://openalex.org/W2126941466","https://openalex.org/W2127904018","https://openalex.org/W2131298387","https://openalex.org/W2136268609","https://openalex.org/W2144320177","https://openalex.org/W2149632365","https://openalex.org/W2152652256","https://openalex.org/W2165768656","https://openalex.org/W2169704709","https://openalex.org/W2170178059","https://openalex.org/W2611804663","https://openalex.org/W4214714086","https://openalex.org/W4249868639","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2365647353","https://openalex.org/W4385401023","https://openalex.org/W2044363610","https://openalex.org/W2363056536","https://openalex.org/W2029548118","https://openalex.org/W2295575944","https://openalex.org/W2072421453","https://openalex.org/W1597107533","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"It":[0],"has":[1],"been":[2],"an":[3],"important":[4],"research":[5],"topic":[6],"since":[7],"1992":[8],"to":[9,35,79,106,132,141,159,203],"maximize":[10],"stability":[11,83],"region":[12,84],"in":[13,51,62,71,99,195,207],"constrained":[14],"queueing":[15],"systems,":[16],"which":[17,180],"includes":[18],"the":[19,48,63,85,90,100,112,154,163,210],"study":[20,36,64],"of":[21,40,65,92,95,209],"scheduling":[22,44,121,197],"over":[23],"wireless":[24],"ad":[25],"hoc":[26],"networks.":[27],"In":[28],"this":[29,205],"paper,":[30],"we":[31,167],"propose":[32],"a":[33,37,104,201],"framework":[34],"wide":[38],"range":[39],"existing":[41],"and":[42,46,54,110,134,176,199],"future":[43],"algorithms":[45,122],"characterize":[47],"achieved":[49],"tradeoffs":[50],"stability,":[52],"delay,":[53],"complexity.":[55,135],"These":[56],"characterizations":[57],"reveal":[58],"interesting":[59],"properties":[60],"hidden":[61],"any":[66],"one":[67,108],"or":[68],"two":[69,114],"dimensions":[70],"isolation.":[72],"For":[73,116],"example,":[74,117],"decreasing":[75],"complexity":[76],"from":[77,162],"exponential":[78,93],"polynomial,":[80],"while":[81],"keeping":[82],"same,":[86],"generally":[87],"comes":[88],"at":[89],"expense":[91],"growth":[94],"delays.":[96],"Investigating":[97],"trade-offs":[98],"3-dimensional":[101],"space":[102],"allows":[103],"designer":[105],"fix":[107],"dimension":[109],"vary":[111],"other":[113],"jointly.":[115],"incentives":[118],"for":[119,149],"using":[120],"with":[123,130,143,172],"only":[124],"partial":[125],"throughput-guarantee":[126],"can":[127],"be":[128,160],"quantified":[129],"regards":[131],"delay":[133],"Trade-off":[136],"analysis":[137],"is":[138,157],"then":[139],"extended":[140],"systems":[142],"congestion":[144],"control":[145,185],"through":[146],"utility":[147],"maximization":[148],"non-stabilizable":[150],"arrival":[151],"inputs,":[152],"where":[153],"complexity-utility-delay":[155],"trade-off":[156],"shown":[158],"different":[161],"complexity-stability-delay":[164],"tradeoff.":[165],"Finally,":[166],"analyze":[168],"more":[169],"practical":[170],"models":[171],"bounded":[173],"message":[174],"size,":[175],"consider":[177],"\"effective":[178],"throughput\"":[179],"reflects":[181],"resource":[182],"occupied":[183],"by":[184],"messages.":[186],"We":[187],"show":[188],"that":[189],"effective":[190],"throughput":[191],"may":[192],"degrade":[193],"significantly":[194],"certain":[196],"algorithms,":[198],"suggest":[200],"mechanism":[202],"avoid":[204],"problem":[206],"light":[208],"3D":[211],"tradeoff":[212],"framework.":[213]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}