{"id":"https://openalex.org/W1976268973","doi":"https://doi.org/10.1109/glocomw.2012.6477618","title":"A joint polling and contention based opportunistic scheduling algorithm with fairness constraint","display_name":"A joint polling and contention based opportunistic scheduling algorithm with fairness constraint","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W1976268973","doi":"https://doi.org/10.1109/glocomw.2012.6477618","mag":"1976268973"},"language":"en","primary_location":{"id":"doi:10.1109/glocomw.2012.6477618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2012.6477618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Globecom Workshops","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/A5067085862","display_name":"Mohammed E. Eltayeb","orcid":"https://orcid.org/0000-0003-2229-1649"},"institutions":[{"id":"https://openalex.org/I110152177","display_name":"University of Akron","ror":"https://ror.org/02kyckx55","country_code":"US","type":"education","lineage":["https://openalex.org/I110152177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammed Eltayeb","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Akron, OH, USA","[Department of Electrical and Computer Engineering, The University of Akron, Ohio, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Akron, OH, USA","institution_ids":["https://openalex.org/I110152177"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering, The University of Akron, Ohio, USA]","institution_ids":["https://openalex.org/I110152177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072044063","display_name":"Hamid Reza Bahrami","orcid":"https://orcid.org/0000-0001-9682-0860"},"institutions":[{"id":"https://openalex.org/I110152177","display_name":"University of Akron","ror":"https://ror.org/02kyckx55","country_code":"US","type":"education","lineage":["https://openalex.org/I110152177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hamid Reza Bahrami","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Akron, OH, USA","[Department of Electrical and Computer Engineering, The University of Akron, Ohio, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Akron, OH, USA","institution_ids":["https://openalex.org/I110152177"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering, The University of Akron, Ohio, USA]","institution_ids":["https://openalex.org/I110152177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067085862"],"corresponding_institution_ids":["https://openalex.org/I110152177"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05269692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"470","last_page":"474"},"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.9940000176429749,"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.9850000143051147,"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.8564724326133728},{"id":"https://openalex.org/keywords/polling","display_name":"Polling","score":0.8419608473777771},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.7135688066482544},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.704047441482544},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.642377495765686},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.6264172196388245},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6141409277915955},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5535545349121094},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5040158629417419},{"id":"https://openalex.org/keywords/max-min-fairness","display_name":"Max-min fairness","score":0.5020520687103271},{"id":"https://openalex.org/keywords/fair-queuing","display_name":"Fair queuing","score":0.49837303161621094},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.44710665941238403},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3263121247291565},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.3074902296066284},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.27468225359916687},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.22745561599731445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19568577408790588}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8564724326133728},{"id":"https://openalex.org/C204854418","wikidata":"https://www.wikidata.org/wiki/Q1362921","display_name":"Polling","level":2,"score":0.8419608473777771},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.7135688066482544},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.704047441482544},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.642377495765686},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.6264172196388245},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6141409277915955},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5535545349121094},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5040158629417419},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.5020520687103271},{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.49837303161621094},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.44710665941238403},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3263121247291565},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.3074902296066284},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.27468225359916687},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.22745561599731445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19568577408790588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"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.1109/glocomw.2012.6477618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2012.6477618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Globecom Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1975449193","https://openalex.org/W2019081563","https://openalex.org/W2100794673","https://openalex.org/W2134861634","https://openalex.org/W2144758716","https://openalex.org/W2149245348","https://openalex.org/W2156903232","https://openalex.org/W2158116199","https://openalex.org/W2161872841","https://openalex.org/W2167264214","https://openalex.org/W4239651601"],"related_works":["https://openalex.org/W1534183152","https://openalex.org/W1605983382","https://openalex.org/W1999684000","https://openalex.org/W2114791561","https://openalex.org/W2402400303","https://openalex.org/W2361713743","https://openalex.org/W2163922947","https://openalex.org/W2160893738","https://openalex.org/W1521255234","https://openalex.org/W4238636457"],"abstract_inverted_index":{"Opportunistic":[0],"schedulers":[1,21,45],"improve":[2],"the":[3,8,26,35,47,57,61,70,77,113,118,137,147,151,155,161,164,184,188,195,217,223,228,240],"network":[4,9,36,58,148,241],"capacity":[5],"by":[6,55],"allocating":[7,56],"resources":[10,59],"to":[11,60,98,150,168,201],"users":[12,28,62,95,144,167],"with":[13,154],"good":[14],"link":[15,157,171],"qualities.":[16],"A":[17],"drawback":[18],"of":[19,34,53,69,80,87,125,135,142,191,220],"these":[20,88],"is":[22],"that":[23,111,183,212],"they":[24],"deprive":[25],"remaining":[27],"from":[29,93],"receiving":[30],"a":[31,51,64,100,108,123,133,140,174,213,232],"fair":[32,72,205],"share":[33],"resources,":[37],"or":[38],"violate":[39],"their":[40,170],"quality-of-service":[41],"(QoS)":[42],"requirements.":[43],"Fair":[44],"on":[46,239],"other":[48,202],"hand":[49],"impose":[50,76,132],"degree":[52,79,124,134,190,219],"fairness":[54,81,126,192,221,235],"in":[63,82,96,127,173],"weighted":[65],"manner.":[66,179],"However,":[67],"majority":[68,86],"existing":[71],"algorithms":[73,89],"do":[74],"not":[75],"same":[78],"heterogenous":[83],"networks.":[84,130],"Furthermore,":[85,209],"require":[90],"full":[91],"feedback":[92,114,162,169,197],"all":[94],"order":[97],"make":[99],"scheduling":[101,109,119,224],"decision.":[102],"In":[103],"this":[104],"paper,":[105],"we":[106,210],"propose":[107],"algorithm":[110,186],"reduces":[112],"overhead,":[115,163],"and":[116,145,177,206,222,226,236],"thus":[117],"delay,":[120,225],"while":[121,193],"maintaining":[122],"heterogeneous":[128],"wireless":[129],"To":[131,159],"fairness,":[136],"scheduler":[138,165,229],"prioritizes":[139],"set":[141],"starved":[143],"allocates":[146],"resource":[149],"user":[152],"(starved)":[153],"best":[156],"quality.":[158],"reduce":[160],"requests":[166],"qualities":[172],"joint":[175],"polling":[176],"contention":[178],"Numerical":[180],"results":[181],"show":[182,211],"proposed":[185],"attains":[187],"highest":[189],"reducing":[194],"overall":[196],"load":[198],"when":[199],"compared":[200],"well":[203],"known":[204],"greedy":[207],"algorithms.":[208],"trade-off":[214],"exits":[215],"between":[216,234],"attainable":[218],"hence,":[227],"should":[230],"strike":[231],"balance":[233],"delay":[237],"depending":[238],"priority.":[242]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}