{"id":"https://openalex.org/W2605735674","doi":"https://doi.org/10.1109/icoin.2017.7899586","title":"Improving throughput and user fairness through priority scheduling in WLAN","display_name":"Improving throughput and user fairness through priority scheduling in WLAN","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2605735674","doi":"https://doi.org/10.1109/icoin.2017.7899586","mag":"2605735674"},"language":"en","primary_location":{"id":"doi:10.1109/icoin.2017.7899586","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2017.7899586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Information Networking (ICOIN)","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/A5015384857","display_name":"Prateek Pandey","orcid":null},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Prateek Pandey","raw_affiliation_strings":["Advanced Computing & Microelectronics Unit, Indian Statistical Institute, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Advanced Computing & Microelectronics Unit, Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012476636","display_name":"Sasthi C. Ghosh","orcid":"https://orcid.org/0000-0002-3444-0333"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sasthi C. Ghosh","raw_affiliation_strings":["Advanced Computing & Microelectronics Unit, Indian Statistical Institute, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Advanced Computing & Microelectronics Unit, Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015384857"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03864772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"700","last_page":"705"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9998000264167786,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9991000294685364,"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/computer-science","display_name":"Computer science","score":0.800777792930603},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7511154413223267},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7019447684288025},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6983824968338013},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.6578628420829773},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5105420351028442},{"id":"https://openalex.org/keywords/channel-allocation-schemes","display_name":"Channel allocation schemes","score":0.46933498978614807},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.46267932653427124},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4426981508731842},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.41057974100112915},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.38187894225120544},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3362414240837097},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.20704400539398193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1809384822845459},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14570021629333496},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.13890686631202698},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.12838464975357056},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10146233439445496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07162180542945862}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.800777792930603},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7511154413223267},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7019447684288025},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6983824968338013},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.6578628420829773},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5105420351028442},{"id":"https://openalex.org/C114237682","wikidata":"https://www.wikidata.org/wiki/Q5072483","display_name":"Channel allocation schemes","level":3,"score":0.46933498978614807},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.46267932653427124},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4426981508731842},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.41057974100112915},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.38187894225120544},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3362414240837097},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.20704400539398193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1809384822845459},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14570021629333496},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.13890686631202698},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.12838464975357056},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10146233439445496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07162180542945862}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icoin.2017.7899586","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2017.7899586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Information Networking (ICOIN)","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":16,"referenced_works":["https://openalex.org/W1630733292","https://openalex.org/W1662911496","https://openalex.org/W1974681615","https://openalex.org/W2006478220","https://openalex.org/W2034976621","https://openalex.org/W2064298136","https://openalex.org/W2095647256","https://openalex.org/W2104830451","https://openalex.org/W2127904107","https://openalex.org/W2135861020","https://openalex.org/W2139611568","https://openalex.org/W2143690081","https://openalex.org/W2152421030","https://openalex.org/W2160710554","https://openalex.org/W2460120232","https://openalex.org/W6637183788"],"related_works":["https://openalex.org/W2091476158","https://openalex.org/W3195229121","https://openalex.org/W4309118773","https://openalex.org/W1572212932","https://openalex.org/W2121723384","https://openalex.org/W4210909622","https://openalex.org/W2063980628","https://openalex.org/W2109511273","https://openalex.org/W4317418931","https://openalex.org/W2955440244"],"abstract_inverted_index":{"Increasing":[0],"the":[1,12,59,94,126,130,134,148,191,196,201],"density":[2,25],"of":[3,16,43,61,63,74,104,115,129,141,150,203],"access":[4],"points":[5],"(APs)":[6],"is":[7,47,157],"often":[8],"required":[9],"to":[10,58,82,92,100,162],"improve":[11],"coverage":[13],"and":[14,31,67,132,166,175,188],"capacity":[15],"wireless":[17],"local":[18],"area":[19],"network":[20,34,131,136],"(WLAN).":[21],"But":[22],"such":[23],"high":[24],"deployment":[26],"may":[27,53,111],"result":[28],"increased":[29,68],"interference":[30,71,137],"hence":[32],"poor":[33],"performance.":[35],"The":[36,144],"channel":[37,70,173],"assignment":[38,174],"problem":[39],"under":[40],"this":[41],"type":[42],"highly":[44],"interfering":[45],"environment":[46],"a":[48,121],"challenging":[49],"task.":[50],"Every":[51],"link":[52],"not":[54],"be":[55],"activated":[56],"due":[57],"limitation":[60],"number":[62,103,202],"non-overlapping":[64],"channels":[65,77],"(NOCs)":[66],"adjacent":[69],"in":[72,106,153],"case":[73],"partially":[75],"overlapping":[76],"(POCs).":[78],"Existing":[79],"work":[80],"tries":[81],"activate":[83,101],"as":[84,87],"many":[85],"links":[86,105],"possible":[88],"at":[89],"every":[90,107],"slot":[91],"maximize":[93],"throughput.":[95],"If":[96],"we":[97,167],"always":[98,112],"try":[99],"maximum":[102],"slot,":[108],"some":[109,159],"nodes":[110],"suffer":[113],"because":[114],"their":[116],"disadvantageous":[117],"positions.":[118],"We":[119,178],"present":[120],"greedy":[122],"algorithm":[123,146,183,197],"which":[124,154],"improves":[125],"average":[127,186],"throughput":[128,187],"minimizes":[133],"total":[135],"while":[138],"taking":[139],"care":[140],"user":[142,192],"fairness.":[143],"proposed":[145],"uses":[147],"concept":[149],"priority":[151,160,170],"scheduling":[152],"each":[155,163],"AP":[156],"assigning":[158],"value":[161],"station":[164],"(STA)":[165],"use":[168],"these":[169],"values":[171],"for":[172],"AP-STA":[176],"association.":[177],"have":[179],"shown":[180],"that":[181],"our":[182],"produces":[184],"better":[185],"also":[189],"schedules":[190],"traffic":[193],"earlier":[194],"than":[195],"based":[198],"on":[199],"maximizing":[200],"links.":[204]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}