{"id":"https://openalex.org/W7139009415","doi":"https://doi.org/10.1109/globecom59602.2025.11432443","title":"Hierarchical Matching Game for Multiple User Association in Fully Decoupled Networks","display_name":"Hierarchical Matching Game for Multiple User Association in Fully Decoupled Networks","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7139009415","doi":"https://doi.org/10.1109/globecom59602.2025.11432443"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11432443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5130051559","display_name":"Chen Dai","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chen Dai","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130076372","display_name":"Haotong Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haotong Cao","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039232420","display_name":"Biyun Sheng","orcid":"https://orcid.org/0000-0002-5006-3822"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Biyun Sheng","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082429984","display_name":"Wael M. Bazzi","orcid":"https://orcid.org/0000-0002-6943-9965"},"institutions":[{"id":"https://openalex.org/I122640774","display_name":"American University in Dubai","ror":"https://ror.org/0540vvc38","country_code":"AE","type":"education","lineage":["https://openalex.org/I122640774"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"Wael M. Bazzi","raw_affiliation_strings":["American University in Dubai"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"American University in Dubai","institution_ids":["https://openalex.org/I122640774"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121016914","display_name":"Shahid Mumtaz","orcid":null},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shahid Mumtaz","raw_affiliation_strings":["Nottingham Trent University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nottingham Trent University","institution_ids":["https://openalex.org/I52590639"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6141","last_page":"6146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9059000015258789,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11133","display_name":"UAV Applications and Optimization","score":0.9059000015258789,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11489","display_name":"Air Traffic Management and Optimization","score":0.01759999990463257,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.01720000058412552,"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/matching","display_name":"Matching (statistics)","score":0.6419000029563904},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6171000003814697},{"id":"https://openalex.org/keywords/association","display_name":"Association (psychology)","score":0.5629000067710876},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4973999857902527},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.48260000348091125},{"id":"https://openalex.org/keywords/joint","display_name":"Joint (building)","score":0.4066999852657318},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.3896999955177307},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.37229999899864197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7552000284194946},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6419000029563904},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6171000003814697},{"id":"https://openalex.org/C142853389","wikidata":"https://www.wikidata.org/wiki/Q744778","display_name":"Association (psychology)","level":2,"score":0.5629000067710876},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4973999857902527},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4934999942779541},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.48260000348091125},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.4066999852657318},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3896999955177307},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.35740000009536743},{"id":"https://openalex.org/C2983325608","wikidata":"https://www.wikidata.org/wiki/Q17084606","display_name":"Data association","level":3,"score":0.34360000491142273},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C81692654","wikidata":"https://www.wikidata.org/wiki/Q225926","display_name":"Kriging","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C73361133","wikidata":"https://www.wikidata.org/wiki/Q4810150","display_name":"Association scheme","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.28540000319480896},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.2777999937534332},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.25540000200271606},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2981096252","https://openalex.org/W3010141230","https://openalex.org/W3011076322","https://openalex.org/W4283214530","https://openalex.org/W4312267651","https://openalex.org/W4324292640","https://openalex.org/W4365129491","https://openalex.org/W4387624003","https://openalex.org/W4387871036","https://openalex.org/W4394862728"],"related_works":[],"abstract_inverted_index":{"In":[0],"fully":[1],"decoupled":[2,123],"networks":[3],"with":[4,77],"separate":[5],"uplink/downlink":[6],"(UL/DL)":[7],"base":[8],"station":[9],"(BS)":[10],"deployments":[11],"and":[12,28,54,73,106,125,155],"high":[13],"user":[14,19,71,101],"mobility,":[15],"ensuring":[16],"efficient":[17],"UL/DL":[18],"association":[20,37,79,102],"remains":[21],"a":[22,60,87,111,129],"critical":[23],"challenge.":[24],"The":[25],"dynamic":[26,145],"environment":[27],"complex":[29],"channel":[30,74],"conditions":[31],"necessitate":[32],"state":[33],"perception":[34],"for":[35,103],"optimal":[36],"strategies,":[38],"while":[39],"the":[40,100,119,140,150,156],"densification":[41],"of":[42,152],"nodes":[43],"demands":[44],"scalable":[45],"solutions":[46],"to":[47,69,81,98,117,138],"handle":[48],"increased":[49],"combinatorial":[50],"complexity":[51],"in":[52,144],"UL":[53,105,124],"DL":[55,126],"transmissions.":[56],"This":[57],"paper":[58],"introduces":[59],"novel":[61],"framework":[62],"leveraging":[63],"unmanned":[64],"aerial":[65],"vehicle":[66],"(UAV)":[67],"sensing-assisted":[68],"predict":[70],"mobility":[72],"dynamics,":[75],"combined":[76],"multiple":[78],"mechanism":[80],"address":[82],"dense":[83],"node":[84],"interactions.":[85],"Accordingly,":[86],"joint":[88,120],"optimization":[89],"problem":[90,121],"is":[91,96,115,136,158],"formulated,":[92],"where":[93],"Kriging-based":[94],"prediction":[95],"adopted":[97],"assist":[99],"both":[104],"DL.":[107],"To":[108],"solve":[109],"it,":[110],"hierarchical":[112,133],"matching":[113,134],"game":[114],"developed":[116],"decompose":[118],"into":[122],"games.":[127],"Particularly,":[128],"low-complexity":[130],"Kriging":[131],"prediction-based":[132],"algorithm":[135],"designed":[137],"obtain":[139],"solution.":[141],"Simulation":[142],"results":[143],"network":[146],"scenarios":[147],"demonstrate":[148],"that":[149],"effectiveness":[151],"proposed":[153],"approach":[154],"superiority":[157],"validated":[159],"by":[160],"comparisons.":[161]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-03-20T00:00:00"}