{"id":"https://openalex.org/W2291076990","doi":"https://doi.org/10.1109/wcnc.2015.7127753","title":"Simple receding horizon approach to scheduling mobile wireless clients with uncertainty","display_name":"Simple receding horizon approach to scheduling mobile wireless clients with uncertainty","publication_year":2015,"publication_date":"2015-03-01","ids":{"openalex":"https://openalex.org/W2291076990","doi":"https://doi.org/10.1109/wcnc.2015.7127753","mag":"2291076990"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2015.7127753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2015.7127753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Wireless Communications and Networking Conference (WCNC)","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/A5027904246","display_name":"Daniel Bennett","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniel T. Bennett","raw_affiliation_strings":["Politecnico di Milano, DEIB, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Milano, DEIB, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091627069","display_name":"Timothy X. Brown","orcid":"https://orcid.org/0000-0002-0670-0935"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Timothy X. Brown","raw_affiliation_strings":["Politecnico di Milano, DEIB, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Milano, DEIB, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1871","last_page":"1876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9993000030517578,"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.9993000030517578,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9969000220298767,"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/T12288","display_name":"Optimization and Search Problems","score":0.9951000213623047,"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.7134579420089722},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7053864002227783},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5527252554893494},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5063725709915161},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.5049579739570618},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47019776701927185},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4577428996562958},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44030192494392395},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4020217955112457},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.39505964517593384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13205015659332275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1231435239315033},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08003741502761841}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7134579420089722},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7053864002227783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5527252554893494},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5063725709915161},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.5049579739570618},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47019776701927185},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4577428996562958},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44030192494392395},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4020217955112457},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.39505964517593384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13205015659332275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1231435239315033},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08003741502761841},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2015.7127753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2015.7127753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Wireless Communications and Networking Conference (WCNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1571051474","https://openalex.org/W1592635802","https://openalex.org/W1979255915","https://openalex.org/W2031279008","https://openalex.org/W2044338512","https://openalex.org/W2137527671","https://openalex.org/W2143247922","https://openalex.org/W2147507583","https://openalex.org/W2163131390","https://openalex.org/W2599791781","https://openalex.org/W4234401428","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W1973859074","https://openalex.org/W2568276500","https://openalex.org/W4386546585","https://openalex.org/W2580557022","https://openalex.org/W2089992496"],"abstract_inverted_index":{"A":[0],"key":[1],"challenge":[2],"in":[3,27,61],"planning":[4],"is":[5],"how":[6],"to":[7,15,54,63,132,148],"schedule":[8],"under":[9,32],"uncertainty.":[10],"We":[11],"consider":[12],"scheduling":[13,151],"communications":[14],"dispersed":[16],"wireless":[17],"clients":[18],"sharing":[19],"a":[20,23,28,48,110],"hub":[21],"over":[22,125],"period":[24],"of":[25,106,120],"time":[26,98],"dynamic":[29],"environment.":[30],"Scheduling":[31],"uncertainty":[33,70,133,153],"research":[34],"has":[35],"produced":[36],"either":[37],"complex":[38],"or":[39],"unsatisfactory":[40],"solutions":[41],"for":[42,57],"this":[43],"problem.":[44],"This":[45,143],"paper":[46],"develops":[47],"simple":[49],"receding":[50,92],"horizon":[51,93],"linear":[52],"program":[53],"allocate":[55],"times":[56],"client":[58,66],"specific":[59],"traffic":[60],"order":[62],"realistically":[64],"maximize":[65],"throughput.":[67],"Given":[68],"future":[69,75],"it":[71],"considers":[72],"clients'":[73],"(estimated)":[74],"rates":[76],"and":[77,79,134],"loads":[78],"aggregates":[80],"them":[81],"utilizing":[82],"various":[83],"permutations.":[84],"For":[85],"the":[86,90,107,121,129,137],"scenario":[87],"we":[88],"present,":[89],"simplest":[91],"approach":[94,112],"using":[95],"only":[96,114],"two":[97],"intervals":[99],"can":[100,113,145],"perform":[101],"within":[102,116],"3.4":[103],"percentage":[104,118],"points":[105,119],"optimal":[108],"whereas":[109],"greedy":[111],"achieve":[115],"13":[117],"optimal.":[122],"The":[123],"aggregation":[124],"many":[126,149],"periods":[127],"minimizes":[128],"variations":[130],"due":[131],"greatly":[135],"simplifies":[136],"problem":[138],"while":[139],"providing":[140],"good":[141],"performance.":[142],"result":[144],"be":[146],"extended":[147],"other":[150],"with":[152],"type":[154],"scenarios.":[155]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}