Anamika Sharma

Work place: Graphic Era Deemed to be University, Dehradun, 248002, India

E-mail: anamikaa2707@gmail.com

Website: https://orcid.org/0000-0003-0197-642X

Research Interests: Artificial Intelligence, Machine Learning, Cybersecurity, Networking

Biography

Anamika Sharma, Assistant Professor of Computer Science department of Graphic Era Deemed to be University, Dehradun, Uttarakhand, India. Born on August 30, 1985. MTech in CSE (2015), B. Tech in CSE (2009), Doct. Of Philosophy (Pursuing) from the Amity University of India. Major interest: Cybersecurity, Artificial Intelligence, Machine Learning, Networking.

Author Articles
Graph Neural Network Representation for Low-Complexity Antenna Selection in RIS-Assisted MIMO Systems

By Anamika Sharma Jagrati Nagdiya Jagdish Chandra Patni Om Prakash Pal

DOI: https://doi.org/10.5815/ijwmt.2026.04.24, Pub. Date: 8 Aug. 2026

Antenna selection in reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) systems presents has significant computational challenges.  The contribution of each transmit antenna is determined by the combined effects of direct and RIS-reflected channels. To address the complexity of combinatorial search a graph neural network (GNN)-based antenna selection framework is proposed. In this framework transmit antennas are represented as graph nodes with channel-correlation information forming. The graph edges and magnitude-phase channel statistics serve as node features. A three-layer feedforward GNN is trained using greedy-selection labels generated from 1000 channel realizations and evaluated on 200 independent test realizations. For a 16×8 MIMO system assisted by a 64-element RIS at 28 GHz the proposed method achieves a spectral efficiency of 63.41 bits/s/Hz and corresponding to 94.5% of the greedy baseline performance of 67.09 bits/s/Hz. While reducing the average selection time from 0.441 ms to 0.025 ms. These results determine that graph-structured learning enables near-greedy antenna selection with considerably lower inference complexity. The current study is limited to simulated settings with fixed system dimensions and idealized channel assumptions; future work will address broader channel models and larger-scale configurations.

[...] Read more.
Other Articles