{"id":"https://openalex.org/W2323875092","doi":"https://doi.org/10.1109/tnet.2015.2417861","title":"Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels","display_name":"Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels","publication_year":2015,"publication_date":"2015-04-13","ids":{"openalex":"https://openalex.org/W2323875092","doi":"https://doi.org/10.1109/tnet.2015.2417861","mag":"2323875092"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2015.2417861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2015.2417861","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5035314009","display_name":"Changhee Joo","orcid":"https://orcid.org/0000-0003-1690-2298"},"institutions":[{"id":"https://openalex.org/I48566637","display_name":"Ulsan National Institute of Science and Technology","ror":"https://ror.org/017cjz748","country_code":"KR","type":"education","lineage":["https://openalex.org/I48566637"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Changhee Joo","raw_affiliation_strings":["ECE, UNIST"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE, UNIST","institution_ids":["https://openalex.org/I48566637"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082208896","display_name":"Xiaojun Lin","orcid":"https://orcid.org/0000-0001-9117-7212"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaojun Lin","raw_affiliation_strings":["ECE, Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE, Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050287020","display_name":"Jiho Ryu","orcid":"https://orcid.org/0000-0001-5777-0725"},"institutions":[{"id":"https://openalex.org/I48566637","display_name":"Ulsan National Institute of Science and Technology","ror":"https://ror.org/017cjz748","country_code":"KR","type":"education","lineage":["https://openalex.org/I48566637"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jiho Ryu","raw_affiliation_strings":["ECE, UNIST"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE, UNIST","institution_ids":["https://openalex.org/I48566637"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035752536","display_name":"Ness B. Shroff","orcid":"https://orcid.org/0000-0002-4606-6879"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ness B. Shroff","raw_affiliation_strings":["ECE and CSE, The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE and CSE, The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4005,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.9499151,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"24","issue":"3","first_page":"1476","last_page":"1488"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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.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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9997000098228455,"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.7923569679260254},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.6451749205589294},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.607801616191864},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.522959291934967},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5060312151908875},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4750102460384369},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45663905143737793},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4531153440475464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38285619020462036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36563432216644287},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3272499442100525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17199575901031494},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1627388894557953},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12677597999572754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7923569679260254},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.6451749205589294},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.607801616191864},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.522959291934967},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5060312151908875},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4750102460384369},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45663905143737793},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4531153440475464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38285619020462036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36563432216644287},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3272499442100525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17199575901031494},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1627388894557953},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12677597999572754}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnet.2015.2417861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2015.2417861","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:scholarworks.unist.ac.kr:201301/20901","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/document/7084695/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401118","display_name":"Scholarworks@UNIST (Ulsan National Institute of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I48566637","host_organization_name":"Ulsan National Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I48566637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ARTICLE"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1599688444","https://openalex.org/W1969520463","https://openalex.org/W1989377671","https://openalex.org/W2000167291","https://openalex.org/W2008690976","https://openalex.org/W2024034265","https://openalex.org/W2038187727","https://openalex.org/W2039917366","https://openalex.org/W2053012823","https://openalex.org/W2059739072","https://openalex.org/W2065193595","https://openalex.org/W2070317877","https://openalex.org/W2076079552","https://openalex.org/W2087294514","https://openalex.org/W2088693732","https://openalex.org/W2097058227","https://openalex.org/W2099448597","https://openalex.org/W2100061495","https://openalex.org/W2105177639","https://openalex.org/W2106387257","https://openalex.org/W2113901500","https://openalex.org/W2116071440","https://openalex.org/W2133301570","https://openalex.org/W2137465094","https://openalex.org/W2137775453","https://openalex.org/W2150129794","https://openalex.org/W2152652256","https://openalex.org/W2152859483","https://openalex.org/W2156214642","https://openalex.org/W2157860744","https://openalex.org/W2178884895","https://openalex.org/W2747397037","https://openalex.org/W4251767568","https://openalex.org/W4253990512","https://openalex.org/W6665560743","https://openalex.org/W6669424448","https://openalex.org/W6672956425"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2163115662","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2979334915","https://openalex.org/W2574250816","https://openalex.org/W2544904580"],"abstract_inverted_index":{"<?Pub":[0],"Dtl=\"\"?>":[1],"It":[2],"has":[3,158,174],"been":[4,49],"known":[5,38],"that":[6,51,64,122,153,162,170,187,197,215,240],"scheduling":[7,46,120,148],"algorithms":[8,47,97],"designed":[9],"to":[10,39,54,61,132,186,209],"achieve":[11],"throughput":[12,199],"optimality":[13],"and":[14,104,129,179,200,255],"good":[15,111],"delay":[16,202],"performance":[17,182],"often":[18],"require":[19],"solving":[20],"the":[21,34,55,72,80,139,146,166,171,189,198,201,212,231,249],"Maximum":[22],"Weighted":[23],"Independent":[24],"Set":[25],"(MWIS)":[26],"problem.":[27],"However,":[28,75],"under":[29,126,150],"most":[30],"realistic":[31],"network":[32,167],"settings,":[33],"MWIS":[35,56,217],"problem":[36],"is":[37,130,145],"be":[40],"NP-hard.":[41],"In":[42,113],"non-fading":[43],"environments,":[44],"low-complexity":[45,119],"have":[48],"provided":[50],"converge":[52],"either":[53],"solution":[57,63],"in":[58,76,91,109,134,226,253],"time":[59],"or":[60],"a":[62,68,118,135,159,227],"achieves":[65,180],"at":[66,85,218],"least":[67],"provable":[69,181],"fraction":[70],"of":[71,101,141,188,203,211],"achievable":[73],"throughput.":[74],"more":[77],"practical":[78],"systems":[79],"channel":[81],"conditions":[82],"can":[83],"vary":[84],"faster":[86],"time-scales":[87],"than":[88],"convergence":[89],"occurs":[90],"these":[92,96],"lower-complexity":[93],"algorithms.":[94],"Hence,":[95],"cannot":[98],"take":[99],"advantage":[100],"opportunistic":[102,251],"gains,":[103],"may":[105],"no":[106],"longer":[107],"result":[108],"achieving":[110],"performance.":[112],"this":[114,144],"paper,":[115],"we":[116,222],"propose":[117],"scheme":[121,149,206],"performs":[123],"provably":[124],"well":[125],"fading":[127,151],"channels":[128],"amenable":[131],"implement":[133,223],"distributed":[136],"manner.":[137],"To":[138],"best":[140],"our":[142,204,224,241],"knowledge,":[143],"first":[147],"environments":[152],"requires":[154],"only":[155],"local":[156],"information,":[157],"low":[160],"complexity":[161],"grows":[163],"logarithmically":[164],"with":[165],"size":[168],"(provided":[169],"conflict":[172],"graph":[173],"bounded":[175],"maximum":[176],"vertex":[177],"degree),":[178],"guarantees":[183],"(arbitrarily":[184],"close":[185,208],"well-known":[190],"centralized":[191],"Greedy":[192],"Maximal":[193],"Scheduler).":[194],"We":[195],"verify":[196],"proposed":[205],"are":[207],"those":[210],"optimal":[213],"MaxWeight":[214],"solves":[216],"each":[219],"time.":[220],"Further,":[221],"algorithm":[225],"testbed":[228],"by":[229],"modifying":[230],"existing":[232],"IEEE":[233,259],"802.11":[234,260],"DCF.":[235,261],"The":[236],"experiment":[237],"results":[238],"show":[239],"implementation":[242],"successfully":[243],"accounts":[244],"for":[245],"wireless":[246],"fading,":[247],"attains":[248],"short-term":[250],"gains":[252],"practice,":[254],"hence":[256],"substantially":[257],"outperforms":[258]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}