{"id":"https://openalex.org/W3007721075","doi":"https://doi.org/10.1109/globecom38437.2019.9013525","title":"Deadline Scheduling in Energy Harvesting Networks: Competitive and Learning Algorithms","display_name":"Deadline Scheduling in Energy Harvesting Networks: Competitive and Learning Algorithms","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3007721075","doi":"https://doi.org/10.1109/globecom38437.2019.9013525","mag":"3007721075"},"language":"en","primary_location":{"id":"doi:10.1109/globecom38437.2019.9013525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom38437.2019.9013525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Global Communications Conference (GLOBECOM)","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/A5071657961","display_name":"Zoubeir Mlika","orcid":"https://orcid.org/0000-0003-3417-7704"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zoubeir Mlika","raw_affiliation_strings":["Dept. of computer science, University of Quebec at Montreal, Montreal, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer science, University of Quebec at Montreal, Montreal, Canada","institution_ids":["https://openalex.org/I159129438"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057382530","display_name":"Elmahdi Driouch","orcid":null},"institutions":[{"id":"https://openalex.org/I154799132","display_name":"Universit\u00e9 de Moncton","ror":"https://ror.org/029tnqt29","country_code":"CA","type":"education","lineage":["https://openalex.org/I154799132"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Elmahdi Driouch","raw_affiliation_strings":["Dept. of computer science, University of Moncton, New Brunswick, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer science, University of Moncton, New Brunswick, Canada","institution_ids":["https://openalex.org/I154799132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070153535","display_name":"Wessam Ajib","orcid":"https://orcid.org/0000-0003-4409-9447"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wessam Ajib","raw_affiliation_strings":["Dept. of computer science, University of Quebec at Montreal, Montreal, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer science, University of Quebec at Montreal, Montreal, Canada","institution_ids":["https://openalex.org/I159129438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2058,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63152681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2019","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9973000288009644,"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/T12288","display_name":"Optimization and Search Problems","score":0.9957000017166138,"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/regret","display_name":"Regret","score":0.8410699367523193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8185940980911255},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7542926073074341},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5933308601379395},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.583391547203064},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5816152095794678},{"id":"https://openalex.org/keywords/online-learning","display_name":"Online learning","score":0.5190268754959106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4159720838069916},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4019168019294739},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.35618263483047485},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2702285349369049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08812955021858215}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8410699367523193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8185940980911255},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7542926073074341},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5933308601379395},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.583391547203064},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5816152095794678},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.5190268754959106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4159720838069916},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4019168019294739},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35618263483047485},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2702285349369049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08812955021858215},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/globecom38437.2019.9013525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom38437.2019.9013525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},{"id":"mag:3086587475","is_oa":false,"landing_page_url":"https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002231288599601","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8799999952316284,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1964689772","https://openalex.org/W1973221673","https://openalex.org/W2067453003","https://openalex.org/W2076668355","https://openalex.org/W2077723394","https://openalex.org/W2077902449","https://openalex.org/W2128085284","https://openalex.org/W2155490650","https://openalex.org/W2214256523","https://openalex.org/W2398209208","https://openalex.org/W2809579289","https://openalex.org/W2895512712","https://openalex.org/W2963615650","https://openalex.org/W4292022450"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W4390751688"],"abstract_inverted_index":{"This":[0,24],"paper":[1],"considers":[2],"the":[3,7,38,52,56,69,99,102],"problem":[4,25],"of":[5,9,101],"maximizing":[6],"number":[8],"scheduled":[10],"users":[11],"that":[12,83],"request":[13],"to":[14,62,97],"download":[15],"data":[16],"with":[17,87],"deadlines":[18],"from":[19],"an":[20,41],"energy-harvesting":[21],"base":[22],"station.":[23],"is":[26,60],"solved":[27],"based":[28,67],"on":[29,68],"two":[30],"frameworks:":[31],"online":[32,35,53],"computation":[33],"and":[34,44,75,81],"learning.":[36],"In":[37,51],"first":[39],"framework,":[40,55],"optimal":[42],"offline":[43],"a":[45,64],"deterministic":[46],"competitive":[47],"algorithms":[48],"are":[49],"designed.":[50],"learning":[54,65],"multi-armed":[57],"bandit":[58],"approach":[59],"used":[61],"design":[63],"algorithm":[66,72],"well-known":[70],"exponential-weight":[71],"for":[73],"exploration":[74],"exploitation.":[76],"We":[77],"bound":[78],"its":[79],"regret":[80],"show":[82],"it":[84],"grows":[85],"sub-linearly":[86],"time.":[88],"Finally,":[89],"we":[90],"supplement":[91],"our":[92],"theoretical":[93],"results":[94],"by":[95],"simulations":[96],"illustrate":[98],"performance":[100],"proposed":[103],"algorithms.":[104]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}