{"id":{"repo_id":"uoit","oai_identifier":"oai:ontariotechu.scholaris.ca:10155/1944"},"canonical_url":"https://search.dev.ndltd.org/etd/uoit/oai:ontariotechu.scholaris.ca:10155/1944","repository":{"repo_id":"uoit","name":"Ontario Institute of Technology","base_url":"https://ontariotechu.scholaris.ca/server/oai/request"},"display":{"title":"Structure-based learning via graph neural networks for multi-group multicast beamforming","abstract":"In this thesis, we consider a downlink multi-antenna multi-group multicasting problem, where users in the same group request the same content. Even though existing optimization-based algorithms can obtain a sub-optimal multicast beamforming solution, they are designed under perfect channel state information (CSI) and need to be performed each time channel state information is updated. Due to the complexity involved in solving the problem, they lead to high computational run-time for largescale antenna-array systems. To overcome this challenge, we propose a robust efficient learning-based approach for a scalable beamformer design under imperfect CSI. We mainly focus on the design of the base station (BS) multicast beamformer to maximize the weighted signal-to-interference-plus-noise ratio (SINR) among all users, subject to a transmit power budget constraint, also known as the max-min fair (MMF) problem. We propose to solve the MMF problem by developing a graph neural network (GNN) model and explore the available optimal multicast beamforming structure to speed up the training process and improve performance. A scalable GNN-based beamformer architecture critically depends on the design of the hidden layers. By exploring the interactions between user groups, we construct the hidden layers of our proposed GNN to effectively capture intra-group and inter-group interaction patterns, enabling the network to learn the beamforming solution effectively. Our GNN via design can also generalize different numbers of users and groups without re-training. Simulation results show that the proposed GNN model achieves a near-optimal performance. We also show that our GNN-based model is significantly faster compared to conventional optimization-based methods and outperforms other existing learning-based models. It can be well generalized to different numbers of users and groups with excellent accuracy.","abstract_html":"In this thesis, we consider a downlink multi-antenna multi-group multicasting problem, where users in the same group request the same content. Even though existing optimization-based algorithms can obtain a sub-optimal multicast beamforming solution, they are designed under perfect channel state information (CSI) and need to be performed each time channel state information is updated. Due to the complexity involved in solving the problem, they lead to high computational run-time for largescale antenna-array systems. To overcome this challenge, we propose a robust efficient learning-based approach for a scalable beamformer design under imperfect CSI. We mainly focus on the design of the base station (BS) multicast beamformer to maximize the weighted signal-to-interference-plus-noise ratio (SINR) among all users, subject to a transmit power budget constraint, also known as the max-min fair (MMF) problem. We propose to solve the MMF problem by developing a graph neural network (GNN) model and explore the available optimal multicast beamforming structure to speed up the training process and improve performance. A scalable GNN-based beamformer architecture critically depends on the design of the hidden layers. By exploring the interactions between user groups, we construct the hidden layers of our proposed GNN to effectively capture intra-group and inter-group interaction patterns, enabling the network to learn the beamforming solution effectively. Our GNN via design can also generalize different numbers of users and groups without re-training. Simulation results show that the proposed GNN model achieves a near-optimal performance. We also show that our GNN-based model is significantly faster compared to conventional optimization-based methods and outperforms other existing learning-based models. It can be well generalized to different numbers of users and groups with excellent accuracy.","abstract_has_math":false,"creators":["SoleimaniMajd, Reza"],"institution":"University of Ontario Institute of Technology","degree_name":"Master of Applied Science (MASc)","degree_level":null,"degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":[],"advisors":["Dong, Min"],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-04-01","date_published":"2025-04-01","updated_at":"2026-07-24T05:35:24Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10155/1944","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Dong, Min"]},{"key":"dc:creator","label":"Author","values":["SoleimaniMajd, Reza"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-04-29T19:36:58Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-04-29T19:36:58Z"]},{"key":"dc:date.issued","label":"Date","values":["2025-04-01"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Applied Science (MASc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Ontario Institute of Technology"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10155/1944"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we consider a downlink multi-antenna multi-group multicasting problem, where users in the same group request the same content. Even though existing optimization-based algorithms can obtain a sub-optimal multicast beamforming solution, they are designed under perfect channel state information (CSI) and need to be performed each time channel state information is updated. Due to the complexity involved in solving the problem, they lead to high computational run-time for largescale antenna-array systems. To overcome this challenge, we propose a robust efficient learning-based approach for a scalable beamformer design under imperfect CSI. We mainly focus on the design of the base station (BS) multicast beamformer to maximize the weighted signal-to-interference-plus-noise ratio (SINR) among all users, subject to a transmit power budget constraint, also known as the max-min fair (MMF) problem. We propose to solve the MMF problem by developing a graph neural network (GNN) model and explore the available optimal multicast beamforming structure to speed up the training process and improve performance. A scalable GNN-based beamformer architecture critically depends on the design of the hidden layers. By exploring the interactions between user groups, we construct the hidden layers of our proposed GNN to effectively capture intra-group and inter-group interaction patterns, enabling the network to learn the beamforming solution effectively. Our GNN via design can also generalize different numbers of users and groups without re-training. Simulation results show that the proposed GNN model achieves a near-optimal performance. We also show that our GNN-based model is significantly faster compared to conventional optimization-based methods and outperforms other existing learning-based models. It can be well generalized to different numbers of users and groups with excellent accuracy."]},{"key":"dc:title","label":"Title","values":["Structure-based learning via graph neural networks for multi-group multicast beamforming"]}]}],"canonical_facts":{"dc:contributor.advisor":["Dong, Min"],"dc:creator":["SoleimaniMajd, Reza"],"dc:date.accessioned":["2025-04-29T19:36:58Z"],"dc:date.available":["2025-04-29T19:36:58Z"],"dc:date.issued":["2025-04-01"],"dc:description.abstract":["In this thesis, we consider a downlink multi-antenna multi-group multicasting problem, where users in the same group request the same content. Even though existing optimization-based algorithms can obtain a sub-optimal multicast beamforming solution, they are designed under perfect channel state information (CSI) and need to be performed each time channel state information is updated. Due to the complexity involved in solving the problem, they lead to high computational run-time for largescale antenna-array systems. To overcome this challenge, we propose a robust efficient learning-based approach for a scalable beamformer design under imperfect CSI. We mainly focus on the design of the base station (BS) multicast beamformer to maximize the weighted signal-to-interference-plus-noise ratio (SINR) among all users, subject to a transmit power budget constraint, also known as the max-min fair (MMF) problem. We propose to solve the MMF problem by developing a graph neural network (GNN) model and explore the available optimal multicast beamforming structure to speed up the training process and improve performance. A scalable GNN-based beamformer architecture critically depends on the design of the hidden layers. By exploring the interactions between user groups, we construct the hidden layers of our proposed GNN to effectively capture intra-group and inter-group interaction patterns, enabling the network to learn the beamforming solution effectively. Our GNN via design can also generalize different numbers of users and groups without re-training. Simulation results show that the proposed GNN model achieves a near-optimal performance. We also show that our GNN-based model is significantly faster compared to conventional optimization-based methods and outperforms other existing learning-based models. It can be well generalized to different numbers of users and groups with excellent accuracy."],"dc:identifier.uri":["https://hdl.handle.net/10155/1944"],"dc:language.iso":["en"],"dc:title":["Structure-based learning via graph neural networks for multi-group multicast beamforming"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_name":["Master of Applied Science (MASc)"],"thesis:institution_name":["University of Ontario Institute of Technology"]},"updated_at":"2026-07-24T05:35:24Z"}