{"id":"https://openalex.org/W2053744159","doi":"https://doi.org/10.1109/iccs.2014.7024761","title":"On the optimality of the threshold-based scheduling in green communications: A new proof","display_name":"On the optimality of the threshold-based scheduling in green communications: A new proof","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2053744159","doi":"https://doi.org/10.1109/iccs.2014.7024761","mag":"2053744159"},"language":"en","primary_location":{"id":"doi:10.1109/iccs.2014.7024761","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccs.2014.7024761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communication Systems","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/A5100441949","display_name":"Xiang Chen","orcid":"https://orcid.org/0000-0002-9800-6472"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiang Chen","raw_affiliation_strings":["Department of Electronic Engineering, Tsinghua University, Beijing, CHINA","Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Tsinghua University, Beijing, CHINA","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Electronic Engineering, Tsinghua University, Beijing 100084, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108049716","display_name":"Wei Chen","orcid":"https://orcid.org/0000-0002-9066-1448"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Chen","raw_affiliation_strings":["Department of Electronic Engineering, Tsinghua University, Beijing, CHINA","Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Tsinghua University, Beijing, CHINA","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Electronic Engineering, Tsinghua University, Beijing 100084, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100441949"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.2093,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59440849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"40"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998000264167786,"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.9994999766349792,"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.7197911739349365},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6602885127067566},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6385997533798218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5981858968734741},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5648539066314697},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4822167158126831},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4580264985561371},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.4542745053768158},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4407285451889038},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4387814402580261},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4260893166065216},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4055604934692383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24438485503196716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17441686987876892},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12574118375778198},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.12307149171829224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7197911739349365},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6602885127067566},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6385997533798218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5981858968734741},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5648539066314697},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4822167158126831},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4580264985561371},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.4542745053768158},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4407285451889038},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4387814402580261},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4260893166065216},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4055604934692383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24438485503196716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17441686987876892},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12574118375778198},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.12307149171829224},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccs.2014.7024761","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccs.2014.7024761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communication Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1972802922","https://openalex.org/W1985988498","https://openalex.org/W1994543072","https://openalex.org/W2013471876","https://openalex.org/W2111340059","https://openalex.org/W2121824394","https://openalex.org/W2122902035","https://openalex.org/W2165820867","https://openalex.org/W2317792922","https://openalex.org/W6654160732"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W4386128920","https://openalex.org/W4390711934","https://openalex.org/W4390711951","https://openalex.org/W4390711911","https://openalex.org/W4390711927","https://openalex.org/W4390711908","https://openalex.org/W4390722068"],"abstract_inverted_index":{"Joint":[0],"channel-aware":[1],"and":[2,11,18,33,64,89],"buffer-aware":[3],"scheduling":[4,50,82],"with":[5,44],"power":[6],"adaptation":[7],"is":[8,94],"an":[9],"important":[10],"promising":[12],"way":[13],"to":[14],"achieve":[15],"delay":[16],"minimum":[17],"energy":[19],"efficiency":[20],"for":[21,67,85],"Green":[22],"communications.":[23],"Based":[24],"on":[25,96],"this":[26,58],"idea,":[27],"we":[28,60],"exploited":[29],"some":[30],"various":[31],"scenarios,":[32],"found":[34],"that":[35],"they":[36],"can":[37,101],"be":[38],"modelled":[39],"as":[40],"linear":[41,69],"programming":[42,70],"problems":[43],"similar":[45],"forms.":[46],"Moreover,":[47],"their":[48],"optimal":[49],"policies":[51],"all":[52],"have":[53],"a":[54,62],"threshold-based":[55,107],"pattern.":[56],"In":[57],"paper,":[59],"give":[61],"new":[63],"vigorous":[65],"proof":[66,93],"the":[68,73,103,106],"problems,":[71],"using":[72],"system":[74],"model":[75],"from":[76],"our":[77],"former":[78],"work,":[79],"where":[80],"probabilistic":[81],"are":[83],"proposed":[84],"random":[86],"data":[87],"arrival":[88],"time-varying":[90],"channels.":[91],"The":[92],"based":[95],"Lagrange":[97],"duality":[98],"theory,":[99],"which":[100],"reveal":[102],"essence":[104],"of":[105],"scheduling.":[108]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}