{"id":"https://openalex.org/W3151407988","doi":"https://doi.org/10.1109/wcnc.2011.5779164","title":"Fair and efficient scheduling in wireless networks with successive interference cancellation","display_name":"Fair and efficient scheduling in wireless networks with successive interference cancellation","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W3151407988","doi":"https://doi.org/10.1109/wcnc.2011.5779164","mag":"3151407988"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2011.5779164","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2011.5779164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Wireless Communications and Networking Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1282817","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072619150","display_name":"Mohsen Mollanoori","orcid":null},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mohsen Mollanoori","raw_affiliation_strings":["Department of Computer Science, University of Calgary, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081502954","display_name":"Majid Ghaderi","orcid":"https://orcid.org/0000-0002-3783-4346"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Majid Ghaderi","raw_affiliation_strings":["Department of Computer Science, University of Calgary, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072619150"],"corresponding_institution_ids":["https://openalex.org/I168635309"],"apc_list":null,"apc_paid":null,"fwci":0.8086,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7845242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"221","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network 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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network 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.9993000030517578,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.8703203797340393},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.7837587594985962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7721941471099854},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.726754903793335},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6482221484184265},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6376926898956299},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5039584040641785},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.49364030361175537},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4559313952922821},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4528222978115082},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4147219955921173},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4118739366531372},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4019484519958496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3212345838546753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14836549758911133},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07939517498016357}],"concepts":[{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.8703203797340393},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.7837587594985962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7721941471099854},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.726754903793335},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6482221484184265},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6376926898956299},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5039584040641785},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.49364030361175537},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4559313952922821},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4528222978115082},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4147219955921173},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4118739366531372},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4019484519958496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3212345838546753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14836549758911133},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07939517498016357},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/wcnc.2011.5779164","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2011.5779164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Wireless Communications and Networking Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1282817","is_oa":true,"landing_page_url":"https://zenodo.org/record/1282817","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1282817","is_oa":true,"landing_page_url":"https://zenodo.org/record/1282817","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1487361149","https://openalex.org/W1630733292","https://openalex.org/W1987497363","https://openalex.org/W1997834106","https://openalex.org/W2011039300","https://openalex.org/W2071526016","https://openalex.org/W2104128146","https://openalex.org/W2114776857","https://openalex.org/W2117584696","https://openalex.org/W2119727697","https://openalex.org/W2131089922","https://openalex.org/W2133349072","https://openalex.org/W2153014083","https://openalex.org/W2160389555","https://openalex.org/W2165014894","https://openalex.org/W2166697480","https://openalex.org/W2169398171","https://openalex.org/W6629119327","https://openalex.org/W6636933019","https://openalex.org/W6677755023"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2093454713","https://openalex.org/W1999684000","https://openalex.org/W2225350526","https://openalex.org/W3151407988","https://openalex.org/W2117584696","https://openalex.org/W2071937864","https://openalex.org/W2129448549","https://openalex.org/W2359535379","https://openalex.org/W2356538771"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,17,30,60,77,83,94,101,113,132,166,171],"problem":[4,64,136],"of":[5,170],"uplink":[6],"scheduling":[7,42,46,63,86,116,135,141,173],"in":[8,33,119,137,142,156,175],"wireless":[9],"networks":[10],"supporting":[11],"successive":[12],"interference":[13],"cancellation":[14],"(SIC)":[15],"at":[16,29],"physical":[18],"layer.":[19],"By":[20],"allowing":[21],"concurrent":[22],"interfering":[23],"transmissions,":[24],"SIC":[25],"enables":[26],"multi-packet":[27],"reception":[28],"receiver":[31],"resulting":[32],"increased":[34],"network":[35],"throughput.":[36],"Specifically,":[37],"we":[38,123,145],"consider":[39],"maximum":[40,61,84],"throughput":[41,62,70,81,85,106],"and":[43,48,51,67,168],"proportional":[44,97,110,133],"fair":[45,98,134,154],"problems":[47],"study":[49],"optimal":[50,107],"heuristic":[52],"algorithms":[53,174],"for":[54,76],"these":[55],"problems.":[56],"We":[57],"prove":[58],"that":[59,125,130,150],"is":[65,104],"NP-hard":[66],"develop":[68,146],"a":[69,120,147,152],"efficient":[71],"polynomial":[72,138,157],"time":[73],"greedy":[74,148],"algorithm":[75,129,149],"problem.":[78],"While":[79],"being":[80],"efficient,":[82],"can":[87],"lead":[88],"to":[89,164],"highly":[90,153],"unfair":[91],"rates":[92],"among":[93,112],"users.":[95,114],"The":[96],"scheduling,":[99],"on":[100],"other":[102],"hand,":[103],"not":[105],"but":[108],"achieves":[109],"fairness":[111],"For":[115,140],"multiple":[117,143],"users":[118],"single":[121],"time-slot,":[122],"show":[124,165],"there":[126],"exists":[127],"an":[128],"solves":[131],"time.":[139,158],"time-slots,":[144],"computes":[151],"schedule":[155],"Numerical":[159],"results":[160],"are":[161],"also":[162],"provided":[163],"utility":[167],"efficiency":[169],"proposed":[172],"various":[176],"simulated":[177],"networks.":[178]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}