{"id":"https://openalex.org/W4239750512","doi":"https://doi.org/10.1109/glocom.2014.7417328","title":"On the Convexity of Energy-Efficient Packet Scheduling Problem with Finite Blocklength Codes","display_name":"On the Convexity of Energy-Efficient Packet Scheduling Problem with Finite Blocklength Codes","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W4239750512","doi":"https://doi.org/10.1109/glocom.2014.7417328"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2014.7417328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7417328","pdf_url":null,"source":{"id":"https://openalex.org/S4363607712","display_name":"2015 IEEE Global Communications Conference (GLOBECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Global Communications Conference (GLOBECOM)","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/A5065405048","display_name":"Shengfeng Xu","orcid":"https://orcid.org/0000-0002-3962-4414"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]},{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shengfeng Xu","raw_affiliation_strings":["State Key Laboratory of Integrated Services Networks, Xidian University, China","State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Services Networks, Xidian University, China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064271996","display_name":"Tsung\u2010Hui Chang","orcid":"https://orcid.org/0000-0003-1349-2764"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tsung-Hui Chang","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114377379","display_name":"Shih\u2010Chun Lin","orcid":"https://orcid.org/0000-0001-6821-6893"},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shih-Chun Lin","raw_affiliation_strings":["National Taiwan University of Science and Technology, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Taiwan University of Science and Technology, Taiwan","institution_ids":["https://openalex.org/I154864474"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055833004","display_name":"Chao Shen","orcid":"https://orcid.org/0000-0003-2860-8897"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]},{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao Shen","raw_affiliation_strings":["State Key Laboratory of Integrated Services Networks, Xidian University, China","State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Services Networks, Xidian University, China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100723171","display_name":"Gang Zhu","orcid":"https://orcid.org/0000-0001-7518-6418"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gang Zhu","raw_affiliation_strings":["State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China","institution_ids":["https://openalex.org/I21193070"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9947999715805054,"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.9947999715805054,"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.9912999868392944,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9456999897956848,"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.6630651950836182},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6469378471374512},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.637504518032074},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.5579278469085693},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5467917919158936},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4672028720378876},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4303315579891205},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42822521924972534},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42720210552215576},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4228718876838684},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.26478588581085205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22710153460502625},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10072225332260132},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0972256064414978},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07701122760772705}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6630651950836182},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6469378471374512},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.637504518032074},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.5579278469085693},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5467917919158936},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4672028720378876},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4303315579891205},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42822521924972534},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42720210552215576},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4228718876838684},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26478588581085205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22710153460502625},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10072225332260132},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0972256064414978},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07701122760772705},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2014.7417328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7417328","pdf_url":null,"source":{"id":"https://openalex.org/S4363607712","display_name":"2015 IEEE Global Communications Conference (GLOBECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8799999952316284,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1957025051","https://openalex.org/W1970906284","https://openalex.org/W1998143554","https://openalex.org/W2019707189","https://openalex.org/W2050968963","https://openalex.org/W2081973366","https://openalex.org/W2102261801","https://openalex.org/W2103972037","https://openalex.org/W2106864314","https://openalex.org/W2148185819","https://openalex.org/W2155670180","https://openalex.org/W2160390925","https://openalex.org/W2160706299","https://openalex.org/W2478503558","https://openalex.org/W4236905297","https://openalex.org/W6641058135","https://openalex.org/W6650011257"],"related_works":["https://openalex.org/W2187391117","https://openalex.org/W2056357792","https://openalex.org/W1981809986","https://openalex.org/W1843467136","https://openalex.org/W2949367465","https://openalex.org/W2051545453","https://openalex.org/W2006359264","https://openalex.org/W4211227406","https://openalex.org/W3002934918","https://openalex.org/W2743400891"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"an":[3,135],"energy-efficient":[4],"packet":[5,73,137],"scheduling":[6,74,112,138],"problem":[7,29,75,95,113],"over":[8],"green":[9],"data":[10],"networks,":[11],"aiming":[12],"at":[13],"minimizing":[14],"the":[15,20,34,46,72,77,84,92,103,145,154,158,163,173],"transmission":[16,175],"energy":[17,176],"subject":[18],"to":[19,100,142],"First-In-First-Out":[21],"and":[22,51,119],"strict":[23],"delay":[24],"constraints.":[25],"Traditionally,":[26],"such":[27],"a":[28,128],"is":[30,42,53,96,140],"studied":[31],"based":[32,166],"on":[33,123,167],"classical":[35],"Shannon":[36,40,168],"capacity":[37,41,81,169],"formula.":[38],"However,":[39],"valid":[43],"only":[44],"when":[45],"code":[47],"blocklength":[48,86,160],"approaches":[49],"infinity":[50],"therefore":[52],"not":[54],"practical":[55],"for":[56,83,177],"some":[57],"applications":[58],"in":[59],"5G":[60],"system":[61],"which":[62],"allow":[63],"short":[64],"delays":[65],"only.":[66],"In":[67],"this":[68],"paper,":[69],"we":[70,107],"formulate":[71],"using":[76,157],"recently":[78],"developed":[79],"channel":[80,161],"formula":[82],"finite":[85,159],"code.":[87],"It":[88],"turns":[89],"out":[90],"that":[91,110],"newly":[93],"formulated":[94],"much":[97],"more":[98],"challenging":[99],"solve":[101,144],"than":[102],"traditional":[104,164],"ones.":[105],"Nevertheless,":[106],"analytically":[108],"show":[109,150],"our":[111],"can":[114],"possess":[115],"certain":[116],"desirable":[117],"monotonic":[118],"convex":[120],"properties.":[121],"Based":[122],"these":[124],"properties,":[125],"by":[126],"applying":[127],"successive":[129],"upper":[130],"bound":[131],"minimization":[132],"(SUM)":[133],"method,":[134],"iterative":[136],"algorithm":[139],"proposed":[141,155],"efficiently":[143],"considered":[146],"problem.":[147],"Simulation":[148],"results":[149],"that,":[151],"compared":[152],"with":[153],"design":[156,165],"capacity,":[162],"will":[170],"seriously":[171],"underestimate":[172],"required":[174],"reliable":[178],"communications.":[179]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}