{"id":"https://openalex.org/W4414531688","doi":"https://doi.org/10.1080/24751839.2025.2560125","title":"ML-based agglomerative hierarchical clustering and MMSE precoding for fair user scheduling in LEO MU-MIMO systems","display_name":"ML-based agglomerative hierarchical clustering and MMSE precoding for fair user scheduling in LEO MU-MIMO systems","publication_year":2025,"publication_date":"2025-09-26","ids":{"openalex":"https://openalex.org/W4414531688","doi":"https://doi.org/10.1080/24751839.2025.2560125"},"language":"en","primary_location":{"id":"doi:10.1080/24751839.2025.2560125","is_oa":true,"landing_page_url":"https://doi.org/10.1080/24751839.2025.2560125","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/24751839.2025.2560125?needAccess=true","source":{"id":"https://openalex.org/S4210226961","display_name":"Journal of Information and Telecommunication","issn_l":"2475-1839","issn":["2475-1839","2475-1847"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information and Telecommunication","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/24751839.2025.2560125?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101663032","display_name":"Bilal Ahmad","orcid":"https://orcid.org/0009-0006-3986-2072"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Bilal Ahmad","raw_affiliation_strings":["Middle East Technical University, Northern Cyprus Campus, Kalkanl\u0131, G\u00fczelyurt, Turkey"],"raw_orcid":"https://orcid.org/0009-0006-3986-2072","affiliations":[{"raw_affiliation_string":"Middle East Technical University, Northern Cyprus Campus, Kalkanl\u0131, G\u00fczelyurt, Turkey","institution_ids":["https://openalex.org/I201799495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101663032"],"corresponding_institution_ids":["https://openalex.org/I201799495"],"apc_list":{"value":925,"currency":"GBP","value_usd":1134},"apc_paid":{"value":925,"currency":"GBP","value_usd":1134},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14147341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"1","first_page":"180","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998999834060669,"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":0.9998999834060669,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9993000030517578,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9979000091552734,"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/scheduling","display_name":"Scheduling (production processes)","score":0.5985999703407288},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5034000277519226},{"id":"https://openalex.org/keywords/normalization","display_name":"Normalization (sociology)","score":0.4408999979496002},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.3871999979019165},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.35749998688697815},{"id":"https://openalex.org/keywords/minimum-mean-square-error","display_name":"Minimum mean square error","score":0.35589998960494995},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3465000092983246},{"id":"https://openalex.org/keywords/frequency-reuse","display_name":"Frequency reuse","score":0.32109999656677246},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.3111000061035156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.753600001335144},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5985999703407288},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5034000277519226},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.4408999979496002},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42809998989105225},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.3871999979019165},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C90652560","wikidata":"https://www.wikidata.org/wiki/Q11091747","display_name":"Minimum mean square error","level":3,"score":0.35589998960494995},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33799999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3221000134944916},{"id":"https://openalex.org/C2985367402","wikidata":"https://www.wikidata.org/wiki/Q535695","display_name":"Frequency reuse","level":3,"score":0.32109999656677246},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.30399999022483826},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C153646914","wikidata":"https://www.wikidata.org/wiki/Q535695","display_name":"Cellular network","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.273499995470047},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C160562895","wikidata":"https://www.wikidata.org/wiki/Q7239557","display_name":"Precoding","level":4,"score":0.2590999901294708},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C139945424","wikidata":"https://www.wikidata.org/wiki/Q1940696","display_name":"Mean squared error","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/24751839.2025.2560125","is_oa":true,"landing_page_url":"https://doi.org/10.1080/24751839.2025.2560125","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/24751839.2025.2560125?needAccess=true","source":{"id":"https://openalex.org/S4210226961","display_name":"Journal of Information and Telecommunication","issn_l":"2475-1839","issn":["2475-1839","2475-1847"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information and Telecommunication","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:0b584a84292246d9a72fd606d55c63a6","is_oa":true,"landing_page_url":"https://doaj.org/article/0b584a84292246d9a72fd606d55c63a6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Information and Telecommunication, Vol 10, Iss 1, Pp 180-198 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/24751839.2025.2560125","is_oa":true,"landing_page_url":"https://doi.org/10.1080/24751839.2025.2560125","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/24751839.2025.2560125?needAccess=true","source":{"id":"https://openalex.org/S4210226961","display_name":"Journal of Information and Telecommunication","issn_l":"2475-1839","issn":["2475-1839","2475-1847"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information and Telecommunication","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8833345287","display_name":"6G Non Terrestrial Networks","funder_award_id":"101096479","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414531688.pdf","grobid_xml":"https://content.openalex.org/works/W4414531688.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W2063207793","https://openalex.org/W2132790099","https://openalex.org/W2188529126","https://openalex.org/W2421520832","https://openalex.org/W2537515126","https://openalex.org/W2782685534","https://openalex.org/W2963740148","https://openalex.org/W3026551266","https://openalex.org/W3170654182","https://openalex.org/W4232003011","https://openalex.org/W4306147962","https://openalex.org/W4384343481","https://openalex.org/W4385269836","https://openalex.org/W4385478329","https://openalex.org/W4392153337","https://openalex.org/W4400578856","https://openalex.org/W4400770731","https://openalex.org/W4400811258","https://openalex.org/W4403863507"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,36,51,68,88,106,168,183,189,203],"problem":[4],"of":[5,38,72,90,108,196],"user":[6,156],"scheduling":[7,76],"in":[8,50,67,194],"Low":[9],"Earth":[10],"Orbit":[11],"(LEO)":[12],"High":[13],"Throughput":[14],"Satellite":[15],"(HTS)":[16],"multi-user":[17],"(MU)":[18],"Multiple-Input-Multiple-Output":[19],"(MIMO)":[20],"systems.":[21],"We":[22],"propose":[23],"a":[24,83,124,143,149,163],"Machine":[25],"Learning":[26],"(ML)-based":[27],"hierarchical":[28],"clustering":[29],"approach":[30],"i.e.":[31],"AGNES":[32],"(Agglomerative":[33],"Nesting),":[34],"where":[35],"hierarchy":[37],"clusters":[39],"is":[40,57,78,136],"established":[41],"by":[42,63,104],"splitting":[43],"and":[44,111,152,161,191,198],"merging":[45],"users":[46,91],"across":[47,209],"different":[48],"levels":[49],"service":[52],"area.":[53],"The":[54,74,133],"primary":[55],"objective":[56],"to":[58,101,122,174],"minimize":[59],"inter-beam":[60],"interference":[61],"caused":[62],"aggressive":[64],"frequency":[65],"reuse":[66],"feed":[69],"space":[70],"(FS)":[71],"LEO-HTS.":[73],"proposed":[75,184],"algorithm":[77],"computationally":[79,169],"efficient,":[80],"thus":[81],"offering":[82],"novel":[84],"solution":[85],"that":[86,147,166,182],"maximizes":[87],"number":[89,107],"accommodated":[92],"within":[93],"minimal":[94],"time":[95,109],"slots.":[96],"Additionally,":[97],"it":[98,201],"provides":[99],"flexibility":[100],"enhance":[102],"performance":[103,135],"increasing":[105],"slots":[110],"relaxing":[112],"cluster":[113],"size":[114],"constraints.":[115],"Three":[116],"power":[117,211],"normalization":[118,212],"methods":[119],"are":[120],"used":[121],"apply":[123],"per-cluster":[125],"Minimum":[126],"Mean":[127],"Square":[128],"Error":[129],"(MMSE)":[130],"beamforming":[131],"matrix.":[132],"algorithm's":[134],"compared":[137],"against":[138],"two":[139],"benchmark":[140],"schedulers:":[141],"(1)":[142],"position-based":[144,190],"random":[145],"scheduler":[146,165,185],"generates":[148],"beam":[150,158],"lattice":[151],"randomly":[153],"selects":[154],"one":[155],"per":[157],"for":[159,205],"clustering,":[160],"(2)":[162],"graph-based":[164,192],"uses":[167],"demanding":[170],"maximum":[171],"clique":[172],"technique":[173],"improve":[175],"graph":[176],"density.":[177],"Extensive":[178],"simulation":[179],"results":[180],"demonstrate":[181],"significantly":[186],"outperforms":[187],"both":[188],"approaches":[193],"terms":[195],"efficiency":[197],"performance.":[199],"Moreover,":[200],"eliminates":[202],"need":[204],"hard":[206],"threshold":[207],"optimization":[208],"various":[210],"schemes.":[213]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}
