{"id":"https://openalex.org/W2784141234","doi":"https://doi.org/10.1109/glocom.2017.8254647","title":"Base Station Operation and User Association in HetNets: Complexity and Heuristic Algorithms","display_name":"Base Station Operation and User Association in HetNets: Complexity and Heuristic Algorithms","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2784141234","doi":"https://doi.org/10.1109/glocom.2017.8254647","mag":"2784141234"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2017.8254647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2017.8254647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2017 - 2017 IEEE Global Communications Conference","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/A5071657961","display_name":"Zoubeir Mlika","orcid":"https://orcid.org/0000-0003-3417-7704"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Zoubeir Mlika","raw_affiliation_strings":["Department of Computer Science, University of Quebec, Montreal"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Quebec, Montreal","institution_ids":["https://openalex.org/I159129438"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057382530","display_name":"Elmahdi Driouch","orcid":null},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Elmahdi Driouch","raw_affiliation_strings":["Department of Computer Science, University of Quebec, Montreal"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Quebec, Montreal","institution_ids":["https://openalex.org/I159129438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070153535","display_name":"Wessam Ajib","orcid":"https://orcid.org/0000-0003-4409-9447"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wessam Ajib","raw_affiliation_strings":["Department of Computer Science, University of Quebec, Montreal"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Quebec, Montreal","institution_ids":["https://openalex.org/I159129438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071657961"],"corresponding_institution_ids":["https://openalex.org/I159129438"],"apc_list":null,"apc_paid":null,"fwci":0.2867,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61830327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":1.0,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":1.0,"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.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"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9976000189781189,"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/base-station","display_name":"Base station","score":0.7496917247772217},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7315714359283447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7221630215644836},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6732869148254395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6351243257522583},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5693247318267822},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5629127025604248},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5337091088294983},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5128865242004395},{"id":"https://openalex.org/keywords/brute-force","display_name":"Brute force","score":0.4705631732940674},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4464859962463379},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41306808590888977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17230811715126038},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09397232532501221},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0738978385925293}],"concepts":[{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.7496917247772217},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7315714359283447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7221630215644836},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6732869148254395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6351243257522583},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5693247318267822},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5629127025604248},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5337091088294983},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5128865242004395},{"id":"https://openalex.org/C2986801135","wikidata":"https://www.wikidata.org/wiki/Q1209494","display_name":"Brute force","level":2,"score":0.4705631732940674},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4464859962463379},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41306808590888977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17230811715126038},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09397232532501221},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0738978385925293},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2017.8254647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2017.8254647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2017 - 2017 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8999999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1611985086","https://openalex.org/W1984829015","https://openalex.org/W2010630450","https://openalex.org/W2011039300","https://openalex.org/W2016008722","https://openalex.org/W2037153888","https://openalex.org/W2054692642","https://openalex.org/W2140516799","https://openalex.org/W2261342007","https://openalex.org/W2296627564","https://openalex.org/W2518231294","https://openalex.org/W2558317272","https://openalex.org/W2740712950"],"related_works":["https://openalex.org/W2500106866","https://openalex.org/W2411032004","https://openalex.org/W2952407405","https://openalex.org/W2384373317","https://openalex.org/W1973952720","https://openalex.org/W1581805909","https://openalex.org/W961142965","https://openalex.org/W4296309200","https://openalex.org/W2949926007","https://openalex.org/W2568970949"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,53,64,87,100,103,110],"base":[4,23,32,59],"station":[5,60],"operation":[6,61],"and":[7,27,46,80,106,114],"association":[8,65],"problem":[9,39,54,62,88],"for":[10],"energy-efficient":[11],"heterogeneous":[12],"cellular":[13],"networks.":[14],"The":[15,38],"objective":[16],"is":[17,40,47,55,78,83,95],"to":[18,25,28,31,49,57,109],"find":[19],"a":[20,43,58,74,115],"set":[21],"of":[22,66,102],"stations":[24,33],"activate":[26],"associate":[29],"users":[30,67],"under":[34],"minimum":[35],"rate":[36],"requirements.":[37],"formulated":[41],"as":[42],"nonconvex":[44],"program":[45],"shown":[48],"be":[50],"NP-hard.":[51],"Then,":[52],"reduced":[56],"where":[63],"becomes":[68],"straightforward.":[69],"Based":[70],"on":[71],"this":[72],"reduction,":[73],"brute":[75,111],"force":[76,112],"algorithm":[77,94,105,113],"developed":[79],"its":[81],"complexity":[82],"discussed.":[84],"To":[85],"solve":[86],"efficiently":[89],"in":[90],"polynomial-time,":[91],"an":[92],"heuristic":[93],"proposed.":[96],"Simulation":[97],"results":[98],"illustrate":[99],"performance":[101],"proposed":[104],"compares":[107],"it":[108],"benchmark":[116],"algorithm.":[117]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}