[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-82783-en":3,"doc-seo-82783-105":30,"detail-sidebar-cat-0-en-105":92},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":13,"seo_description":14,"update_tm":28,"read_time":29},82783,137441390410,"Hazel","https://ap-avatar.wpscdn.com/avatar/2000252f4ab5702993?_k=1776741390130283984",8,"Research & Report","Study of Graph-Based Search for Energy-Efficient Clustering in Cell-Free Massive MIMO Networks","The document presents a study on energy-efficient clustering in user-centric cell-free massive MIMO networks, focusing on access point clustering and transmit power allocation. It formulates the problem as a mixed-integer fractional program and introduces a graph-based structured search to obtain an optimal solution through exhaustive search. A Graph-Based Steepest Ascent (GBSA) algorithm is developed, combining discrete graph search with continuous fractional-programming power optimization, delivering linear per-iteration complexity and energy efficiency near the global optimum with scalable performance.","Study of Graph-Based Search for Energy-Efficient Clustering in Cell-Free Massive MIMO Networks  \nJulio Cesar Cardoso Tesolin and Rodrigo C. de Lamare  \nCentre for Telecommunications Studies, PUC-Rio, Brazil  \nEmails: [jcctesolin@gmail.com](jcctesolin@gmail.com), [delamare@puc-rio.br](delamare@puc-rio.br)  \narXiv :2607 .04074v 1 [ cs .IT] 5 Jul 2026  \nAbstract—This paper investigates energy-efficient clustering in user-centric cell-free massive MIMO networks, addressing the access point clustering and power allocation problems via a mixed-integer fractional program. We propose a framework for energy-efficient clustering and power allocation with a graphbased structured search and describe its optimum solution via an exhaustive search. We also develop the Graph-Based Steepest Ascent (GBSA) algorithm, which combines a graph-based structured search along with continuous power allocation via fractional programming. The proposed GBSA algorithm achieves linear per-iteration complexity while reaching energy efficiency close to the global optimum, outperforming competing techniques and offering a scalable solution for future networks.  \nIndex Terms—Massive MIMO, clustering, energy efficiency.  \nI. INTRODUCTION  \nUser-centric (UC) cell-free (CF) massive multiple-input multiple-output (mMIMO) systems [1], [2], [3] has become a key architecture for next-generation wireless systems. By replacing fixed cells with many distributed Access Points (APs), CF-mMIMO significantly improves uniformity of service and spectral efficiency. In the UC approach, users are served only by APs with strong large-scale fading coefficients, reducing fronthaul load and improving scalability [1], [4], [5] . While this cooperative model enhances quality of service, it also increases power consumption, making energy efficiency (EE) a critical requirement. Optimization strategies are therefore essential to balance high service quality with energy expenditure control.  \nPrior efforts have investigated UC clustering to reduce signaling and computational burden [6], [7], [8], [9] . Growing attention has been given to resource allocation and energydriven UC clustering [10], [11], [12],[13] often employing complex schemes like deep reinforcement learning to achieve effective performance–power trade-offs [14] . Despite these advancements, the combinatorial complexity of the EE-optimal cluster selection problem remains a significant challenge, demanding scalable and tractable solutions that avoid the high cost of exhaustive search.  \nIn this work, we investigate energy-efficient cluster selection and power allocation in UC CF-mMIMO downlink networks. We present a framework for energy-efficient clustering and power allocation with a graph-based structured search and describe its optimum solution via an exhaustive search [15] . We also devise the Graph-Based Steepest Ascent (GBSA) algorithm, which combines a graph-based structured search  \nalong with continuous power allocation via fractional programming. The GBSA algorithm uses graph-based modeling and fractional programming to maximize radio access network (RAN) energy efficiency. This approach ensures scalability and tractability, with simulations showing performance superior to competing techniques and close to the global optimum.  \nNotation: Scalars are denoted by a, A ; column vectors by a ∈ Cn ; and matrices by A ∈ Cm ×n. A denotes a set. (·)T is the transpose, E{·} is the statistical expectation, and \\#(·) is the set cardinality. O (·) represents the worst-case asymptotic complexity.  \nII. SYSTEM MODEL  \nEnergy consumption has become a critical performance factor in wireless networks that enable cooperation across distributed APs, allowing for highly flexible and scalable deployments. In this context, energy efficiency (EE) measures the trade-off between the network utility function and the total power expenditure required to sustain communication and signal processing operations [16] . A general form of EE metric ca","cbCaicbTRcAgLBK3","https://ap.wps.com/l/cbCaicbTRcAgLBK3","pdf",346913,5,1,6,"English","en",105,"# Introduction\n# System Model","[{\"question\":\"What optimization problems does the study address in user-centric cell-free massive MIMO networks?\",\"answer\":\"It addresses access point clustering and downlink power allocation jointly to improve energy efficiency in the network.\"},{\"question\":\"How does the proposed framework find the optimal solution?\",\"answer\":\"It uses a graph-based structured search and describes the optimum obtained via an exhaustive search strategy.\"},{\"question\":\"What is the GBSA algorithm and why is it efficient?\",\"answer\":\"GBSA combines graph-based structured search for cluster selection with continuous power allocation solved through fractional programming, achieving linear per-iteration complexity while approaching the global optimum energy efficiency.\"}]",1784182909,15,{"code":4,"msg":31,"data":32},"ok",{"site_id":25,"language":24,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":87,"head_meta":89,"extra_data":91,"updated_unix":28},"study-of-graph-based-search-for-energy-efficient-clustering-in-cell-free-massive-mimo-networks","",{"@graph":36,"@context":86},[37,54,69],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,51],{"item":41,"name":42,"@type":43,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":50},"https://docshare.wps.com/document/research-report/",3,{"item":52,"name":13,"@type":43,"position":53},"https://docshare.wps.com/document/study-of-graph-based-search-for-energy-efficient-clustering-in-cell-free-massive-mimo-networks/82783/",4,{"url":52,"name":13,"@type":55,"author":56,"headline":13,"publisher":58,"fileFormat":61,"inLanguage":24,"description":14,"dateModified":62,"datePublished":63,"encodingFormat":61,"isAccessibleForFree":64,"interactionStatistic":65},"DigitalDocument",{"name":9,"@type":57},"Person",{"url":41,"name":59,"@type":60},"DocShare","Organization","application/pdf","2026-07-24","2026-07-16",true,{"@type":66,"interactionType":67,"userInteractionCount":20},"InteractionCounter",{"@type":68},"ViewAction",{"@type":70,"mainEntity":71},"FAQPage",[72,78,82],{"name":73,"@type":74,"acceptedAnswer":75},"What optimization problems does the study address in user-centric cell-free massive MIMO networks?","Question",{"text":76,"@type":77},"It addresses access point clustering and downlink power allocation jointly to improve energy efficiency in the network.","Answer",{"name":79,"@type":74,"acceptedAnswer":80},"How does the proposed framework find the optimal solution?",{"text":81,"@type":77},"It uses a graph-based structured search and describes the optimum obtained via an exhaustive search strategy.",{"name":83,"@type":74,"acceptedAnswer":84},"What is the GBSA algorithm and why is it efficient?",{"text":85,"@type":77},"GBSA combines graph-based structured search for cluster selection with continuous power allocation solved through fractional programming, achieving linear per-iteration complexity while approaching the global optimum energy efficiency.","https://schema.org",{"og:url":52,"og:type":88,"og:title":13,"og:site_name":59,"og:description":14},"article",{"robots":90,"canonical":52},"index,follow",{"doc_id":7,"site_id":25},{"code":4,"msg":5,"data":93},[94,98,102,106,110,114,119,122,127,130,134],{"id":21,"doc_module":4,"doc_module_name":46,"category_name":95,"show_sort_weight":96,"slug":97},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":99,"show_sort_weight":100,"slug":101},"Literature",80,"literature",{"id":53,"doc_module":4,"doc_module_name":46,"category_name":103,"show_sort_weight":104,"slug":105},"Exam",70,"exam",{"id":20,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},"Comic",60,"comic",{"id":22,"doc_module":4,"doc_module_name":46,"category_name":111,"show_sort_weight":112,"slug":113},"Technology",50,"technology",{"id":115,"doc_module":4,"doc_module_name":46,"category_name":116,"show_sort_weight":117,"slug":118},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":120,"slug":121},30,"research-report",{"id":123,"doc_module":4,"doc_module_name":46,"category_name":124,"show_sort_weight":125,"slug":126},9,"Religion & Spirituality",20,"religion-spirituality",{"id":125,"doc_module":4,"doc_module_name":46,"category_name":128,"show_sort_weight":125,"slug":129},"World Cup","world-cup",{"id":131,"doc_module":4,"doc_module_name":46,"category_name":132,"show_sort_weight":131,"slug":133},10,"Lifestyle","lifestyle",{"id":135,"doc_module":4,"doc_module_name":46,"category_name":136,"show_sort_weight":20,"slug":137},19,"General","general"]