{"id":"https://openalex.org/W2491230641","doi":"https://doi.org/10.1109/infocom.2016.7524397","title":"An approximation algorithm for AP association under user migration cost constraint","display_name":"An approximation algorithm for AP association under user migration cost constraint","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2491230641","doi":"https://doi.org/10.1109/infocom.2016.7524397","mag":"2491230641"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5030541750","display_name":"Wangkit Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Wangkit Wong","raw_affiliation_strings":["Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027393646","display_name":"Avishek Thakur","orcid":null},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Avishek Thakur","raw_affiliation_strings":["Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003418485","display_name":"S.-H. Gary Chan","orcid":"https://orcid.org/0000-0003-4207-764X"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"S.-H. Gary Chan","raw_affiliation_strings":["Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030541750"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":4.1343,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.94483477,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":1.0,"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/T11158","display_name":"Wireless Networks and Protocols","score":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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.9958000183105469,"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.813461184501648},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6940664052963257},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6294545531272888},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.601885199546814},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5501528382301331},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5342404246330261},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45856037735939026},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44356536865234375},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.40321892499923706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3679220676422119},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3654748201370239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09502819180488586}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.813461184501648},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6940664052963257},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6294545531272888},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.601885199546814},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5501528382301331},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5342404246330261},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45856037735939026},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44356536865234375},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.40321892499923706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3679220676422119},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3654748201370239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09502819180488586},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infocom.2016.7524397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-78138","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=978-1-4673-9953-1&rft.volume=&rft.issue=&rft.date=2016&rft.spage=198&rft.aulast=Wong&rft.aufirst=Wang%20Kit%7C014845&rft.atitle=An%20Approximation%20Algorithm%20for%20AP%20Association%20under%20User%20Migration%20Cost%20Constraint&rft.title=IEEE%20INFOCOM%202016%2C%20IEEE%20International%20Conference%20on%20Computer%20Communications%2C%20San%20Francisco%2C%20CA%2C%20USA","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1742958260","https://openalex.org/W1971391973","https://openalex.org/W1980776940","https://openalex.org/W1985632778","https://openalex.org/W1985822906","https://openalex.org/W2005002149","https://openalex.org/W2019694619","https://openalex.org/W2026438595","https://openalex.org/W2039979646","https://openalex.org/W2041986773","https://openalex.org/W2055259789","https://openalex.org/W2057578113","https://openalex.org/W2058885962","https://openalex.org/W2099285351","https://openalex.org/W2100461466","https://openalex.org/W2102201348","https://openalex.org/W2118057092","https://openalex.org/W2140598996","https://openalex.org/W2161145906","https://openalex.org/W2164067630","https://openalex.org/W2165715302","https://openalex.org/W2167164314","https://openalex.org/W2171579766","https://openalex.org/W4232163941","https://openalex.org/W6655190312"],"related_works":["https://openalex.org/W2883256816","https://openalex.org/W2171408034","https://openalex.org/W3003320923","https://openalex.org/W2106140982","https://openalex.org/W2152313554","https://openalex.org/W2064303750","https://openalex.org/W2078379271","https://openalex.org/W2043460294","https://openalex.org/W4210712718","https://openalex.org/W1905398909"],"abstract_inverted_index":{"In":[0,94],"wireless":[1,22],"local":[2],"area":[3],"networks":[4],"(WLANs),":[5],"association":[6],"of":[7,21,102,152,194],"the":[8,66,70,99,108,127,192],"access":[9],"points":[10],"(APs)":[11],"is":[12,77,129,160],"often":[13],"not":[14],"uniform":[15],"due":[16,31],"to":[17,27,32,69,79,85,116],"joining":[18],"and":[19,37,90,162],"leaving":[20],"users.":[23],"Such":[24,75],"imbalance":[25],"leads":[26],"unsatisfactory":[28],"user":[29,110,120],"throughput":[30,54,111],"congestion":[33],"at":[34,40],"some":[35,63,82],"APs":[36,49,68],"channel":[38],"under-utilization":[39],"others.":[41],"As":[42],"users":[43,64],"may":[44],"be":[45,56],"covered":[46],"by":[47,58,106],"multiple":[48],"in":[50,87],"WLAN":[51],"deployment,":[52],"their":[53],"can":[55],"improved":[57],"AP":[59,104],"re-association,":[60],"i.e.,":[61],"migrating":[62],"from":[65],"congested":[67],"less":[71],"loaded":[72],"neighboring":[73],"APs.":[74],"reassociation":[76],"expected":[78],"come":[80],"with":[81,179],"cost":[83,122,185],"(due":[84],"overhead":[86],"handshaking,":[88],"authentication":[89],"data":[91],"flow":[92],"management).":[93],"this":[95],"paper,":[96],"we":[97],"study":[98],"novel":[100],"problem":[101,128],"optimizing":[103],"re-association":[105],"maximizing":[107],"minimum":[109],"(i.e.,":[112],"max-min":[113],"fairness),":[114],"subject":[115],"a":[117],"certain":[118],"total":[119],"migration":[121],"constraint.":[123],"We":[124,131],"show":[125,171],"that":[126,172],"NP-hard.":[130],"then":[132],"propose":[133],"an":[134,149],"efficient":[135],"approximation":[136,150],"algorithm":[137],"called":[138],"CACA":[139,144],"(Cost-constrained":[140],"Association":[141],"Control":[142],"Algorithm).":[143],"has":[145],"provable":[146],"performance,":[147],"achieving":[148],"factor":[151],"(4+\u03f5),":[153],"for":[154],"any":[155],"\u03f5":[156],">":[157],"0.":[158],"It":[159],"simple":[161],"implementable.":[163],"Our":[164,187],"extensive":[165],"simulation":[166],"results":[167],"based":[168],"on":[169],"NS3":[170],"it":[173],"substantially":[174],"outperforms":[175],"other":[176],"comparison":[177],"schemes":[178],"close-to-optimal":[180],"performance":[181],"(the":[182],"case":[183],"without":[184],"constraint).":[186],"testbed":[188],"experiments":[189],"further":[190],"confirm":[191],"effectiveness":[193],"CACA.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}