arXiv subjects

Luis F. Abanto-Leon

Publications and source records attributed to Luis F. Abanto-Leon.

At least 19 recordsLinked to original sources

arXiv2026

Secure RIS-Aided Multicasting: Globally Optimal Beam Management and Discrete-Phase RIS Configuration

Reconfigurable intelligent surfaces (RISs) are poised to revolutionize wireless multicasting by enabling extended coverage and reliable operation in obstructed environments. These benefits, however, can be undermined by security vulnerabilities arising from practical deployment factors. This work addresses three such critical factors, (i) the discrete nature of RIS phase shifts, (ii) the presence of colluding eavesdroppers, and (iii) the inefficiency of static illumination beams, each threatening security if not properly accounted for in system design. To mitigate these issues, we formulate a joint resource allocation problem that minimizes the wiretap signal-to-noise ratio (SNR) across all eavesdroppers by co-optimizing the RIS configuration and the base station (BS) beam management. This yields a complex, nonconvex mixed-integer nonlinear program (MINLP), which we equivalently reformulate into a tractable mixed-integer quadratically constrained program (MIQCP) solvable to global optimality. Numerical results confirm that the proposed scheme significantly bolsters security, suppressing the wiretap SNR by up to 58% compared to existing baselines.

eess.SP↗

arXiv2026

Fault-Aware Design for Reconfigurable Holographic Surface-Aided ISAC Systems

Reconfigurable holographic surface (RHS)-aided integrated sensing and communication (ISAC) systems hold great promise for achieving both sensing and communication with low hardware costs and high energy efficiency. However, existing works largely overlook practical hardware impairments in RHSs, particularly faulty RHS elements with uncontrollable amplitudes, which degrade system performance if left unaddressed. This work aims to fill the gap by i) quantifying the impact of faulty RHS elements on ISAC performance and ii) optimizing the functional RHS elements to preserve the ISAC performance. Specifically, we derive the misspecified Cramer-Rao bound (MCRB) for sensing and the signal-to-interference-and-noise ratio (SINR) for communication to measure the performance loss caused by faulty elements. We then formulate an optimization problem that minimizes MCRB, subject to constraints on SINR, transmit power budget, and RHS amplitude. The high non-convexity of the formulated problem poses a significant challenge, which we address by reformulating and proposing a block coordinate descent-based solution incorporating majorization-minimization and successive convex approximation techniques. Simulation results verify that the proposed approach achieves an average 13.7% performance gain compared to the fault-unaware benchmark.

eess.SP↗

arXiv2026

Scheduling Mechanisms in Wireless Sensor-Actuator Networks for Multi-rate Periodic Control in Industry 4.0

This paper investigates scheduling strategies for wireless sensor-actuator networks (WSANs) in Industry 4.0 scenarios. In particular, we address the problem of real-time scheduling for multi-rate control systems by proposing a novel framework. Our framework features four strategies that improve reliability, schedulability and execution time, and reduce communication and storage costs. Two-phase scheduling is our first strategy, devised to improve communication reliability. Our second strategy is the least-laxity-first with remaining conflicts (LLF-RC) scheduling algorithm, which has high schedulability and affordable execution time. LLF-RC also keeps the maximum queue length at a moderate level, making it suitable for storage-constrained devices. Our third and fourth strategies are opportunistic aggregation and repetitive scheduling. Opportunistic aggregation performs simple and effective packet aggregation, enhancing schedulability by up to 97% and reducing execution time by up to 29%, in our simulation. Repetitive scheduling has negligible execution time, and contributes to minimize communication and storage costs. It reduces the maximum execution time by 92% and the maximum communication and storage cost by 99%, in our simulation. We compare our proposed framework against existing approaches, and evaluate the advantages of our strategies in realistic scenarios.

cs.NI↗

arXiv2026

Fast-Reconfiguring Liquid-Crystal RIS for Pervasive Wireless Networks

Reconfigurable intelligent surfaces (RISs) have emerged as a key technology for dynamically reshaping wireless propagation, enhancing coverage and mitigating blockages to enable more pervasive network connectivity. However, implementing RISs at high frequencies remains challenging due to the cost and power demands of semiconductor-based components. To address these critical limitations, liquid crystals (LCs) technology has been identified as a promising low-cost and low-power alternative, giving rise to LC-RIS. The central challenge of this technology, however, lies in its limited responsiveness, as the slow molecular dynamics of LCs lead to long phase-shift reconfiguration times that restrict practicality. This paper presents LiquiRIS, a novel framework that enables substantially faster phase shifting in LC-RIS. By explicitly incorporating the physical dynamics of LC molecules into the phase-shift configuration process, LiquiRIS intelligently selects phase transitions that minimize the overall reconfiguration time. As a result, LiquiRIS achieves up to $ 71.61 \% $ reduction in overall reconfiguration time compared to conventional schemes, significantly improving the feasibility of LC-RIS deployment. The proposed framework is further validated through experiments on a mmWave LC-RIS prototype.

eess.SP↗

arXiv2026

Optimal Radio Resource Management for ISAC Under Imperfect Information: A Resource Economy-Driven Perspective

This work investigates the radio resource management (RRM) design for downlink integrated sensing and communications (ISAC) systems, jointly optimizing timeslot allocation, beam adaptation, functionality selection, and user-target pairing, with the goal of economizing resource consumption under imperfect information. Timeslot allocation assigns a number of discrete channel uses to targets and users, while beam adaptation selects transmit and receive beams with suitable directions, power levels, and beamwidths. Functionality selection determines whether each timeslot is used for sensing, communication, or their simultaneous operation, while user-target pairing specifies which users and targets are jointly served within the same timeslot. To ensure reliable operation, information imperfections arising from motion, quantization, feedback delays, and hardware limitations are considered. Resource economization is achieved by minimizing energy and time consumption through a multi-objective function, with strict prioritization of time savings. The resulting RRM problem is formulated as a semi-infinite, nonconvex mixed-integer nonlinear program (MINLP). Given the lack of generic methods for solving such problems, we propose a tailor-made approach that exploits the underlying structure of the problem to uncover hidden convexities. This enables an exact reformulation as a mixed-integer semidefinite program (MISDP), which can be solved to global optimality. Simulations reveal important interdependencies among the considered RRM components and show that the proposed approach achieves substantial performance improvements over baseline schemes, with gains up to 88%.

eess.SP↗

arXiv2025

Faulty RIS-aided Integrated Sensing and Communication: Modeling and Optimization

This work investigates a practical reconfigurable intelligent surface (RIS)-aided integrated sensing and communication (ISAC) system, where a subset of RIS elements fail to function properly and reflect incident signals randomly towards unintended directions, thereby degrading system performance. To date, no study has addressed such impairments caused by faulty RIS elements in ISAC systems. This work aims to fill the gap. First, to quantify the impact of faulty elements on ISAC performance, we derive the misspecified Cramér-Rao bound (MCRB) for sensing parameter estimation and signal-to-interference-and-noise ratio (SINR) for communication quality. Then, to mitigate the performance loss caused by faulty elements, we jointly design the remaining functional RIS phase shifts and transmit beamforming to minimize the MCRB, subject to the communication SINR and transmit power constraints. The resulting optimization problem is highly non-convex due to the intricate structure of the MCRB expression and constant-modulus constraint imposed on RIS. To address this, we reformulate it into a more tractable form and propose a block coordinate descent (BCD) algorithm that incorporates majorization-minimization (MM), successive convex approximation (SCA), and penalization techniques. Simulation results demonstrate that our proposed approach reduces the MCRB performance loss by 21.25% on average compared to the case where the presence of faulty elements is ignored. Furthermore, the performance gain becomes more evident as the number of faulty elements increases.

eess.SP↗

arXiv2025

Resilient Full-Duplex ISAC in the Face of Imperfect SI Cancellation: Globally Optimal Timeslot Allocation and Beam Selection

This work addresses the radio resource management (RRM) design in downlink full-duplex integrated sensing and communications (ISAC) systems, jointly optimizing timeslot allocation and beam selection under imperfect self-interference cancellation. Timeslot allocation governs the distribution of discrete channel uses between sensing and communication tasks, while beam selection determines transmit and receive directions along with adaptive beamwidths. The joint design leads to a semi-infinite, nonconvex mixed-integer nonlinear program (MINLP), which is difficult to solve. To overcome this, we develop a tailored reformulation strategy that transforms the problem into a tractable mixed-integer linear program (MILP), enabling globally optimal solutions. Our approach provides insights into the coordinated optimization of timeslot allocation and beam selection, enhancing the efficiency of full-duplex ISAC systems while ensuring resilience against residual self-interference.

eess.SP↗

arXiv2025

BARProp: Fast-Converging and Memory-Efficient RSS-Based Localization Algorithm for IoT

Leveraging received signal strength (RSS) measurements for indoor localization is highly attractive due to their inherent availability in ubiquitous wireless protocols. However, prevailing RSS-based methods often depend on complex computational algorithms or specialized hardware, rendering them impractical for low-cost access points. To address these challenges, this paper introduces buffer-aided RMSProp (BARProp), a fast and memory-efficient localization algorithm specifically designed for RSS-based tasks. The key innovation of BARProp lies in a novel mechanism that dynamically adapts the decay factor by monitoring the energy variations of recent gradients stored in a buffer, thereby achieving both accelerated convergence and enhanced stability. Furthermore, BARProp requires less than 15% of the memory used by state-of-the-art methods. Extensive evaluations with real-world data demonstrate that BARProp not only achieves higher localization accuracy but also delivers at least a fourfold improvement in convergence speed compared to existing benchmarks.

eess.SP↗

arXiv2025

Optimal User and Target Scheduling, User-Target Pairing, and Low-Resolution Phase-Only Beamforming for ISAC Systems

We investigate the joint user and target scheduling, user-target pairing, and low-resolution phase-only beamforming design for integrated sensing and communications (ISAC). Scheduling determines which users and targets are served, while pairing specifies which users and targets are grouped into pairs. Additionally, the beamformers are designed using few-bit constant-modulus phase shifts. This resource allocation problem is a nonconvex mixed-integer nonlinear program (MINLP) and challenging to solve. To address it, we propose an exact mixed-integer linear program (MILP) reformulation, which leads to a globally optimal solution. Our results demonstrate the superiority of an optimal joint design compared to heuristic stage-wise approaches, which are highly sensitive to scenario characteristics.

eess.SP↗

arXiv2024

Hierarchical Functionality Prioritization in Multicast ISAC: Optimal Admission Control and Discrete-Phase Beamforming

We investigate the joint admission control and discrete-phase multicast beamforming design for integrated sensing and communications (ISAC) systems, where sensing and communications functionalities have different hierarchies. Specifically, the ISAC system first allocates resources to the higher-hierarchy functionality and opportunistically uses the remaining resources to support the lower-hierarchy one. This resource allocation problem is a nonconvex mixed-integer nonlinear program (MINLP). We propose an exact mixed-integer linear program (MILP) reformulation, leading to a globally optimal solution. In addition, we implemented three baselines for comparison, which our proposed method outperforms by more than 39%.

eess.SP↗

arXiv2024

Resource Allocation for ISAC Networks with Application to Target Tracking

Future 6G networks are expected to empower communication systems by integrating sensing capabilities, resulting in integrated sensing and communication (ISAC) systems. However, this integration may exacerbate the data traffic congestion in existing communication systems due to limited resources. Therefore, the resources of ISAC systems must be carefully allocated to ensure high performance. Given the increasing demands for both sensing and communication services, current methods are inadequate for tracking targets frequently in every frame while simultaneously communicating with users. To address this gap, this work formulates an optimization problem that jointly allocates resources in the time, frequency, power, and spatial domains for targets and users, accounting for the movement of targets and time-varying communication channels. Specifically, we minimize the trace of posterior Cramér-Rao bound for target tracking subject to communication throughput and resource allocation constraints. To solve this non-convex problem, we develop a block coordinate descent (BCD) algorithm based on the penalty method, successive convex approximation (SCA), and one-dimensional search. Simulation results demonstrate the validity of the proposed algorithm and the performance trade-off between sensing and communication.

eess.SP↗

arXiv2023

Joint Communication and Sensing in RIS-enabled mmWave Networks

Empowering cellular networks with augmented sensing capabilities is one of the key research areas in 6G communication systems. Recently, we have witnessed a plethora of efforts to devise solutions that integrate sensing capabilities into communication systems, i.e., joint communication and sensing (JCAS). However, most prior works do not consider the impact of reconfigurable intelligent surfaces (RISs) on JCAS systems, especially at millimeter-wave (mmWave) bands. Given that RISs are expected to become an integral part of cellular systems, it is important to investigate their potential in cellular networks beyond communication goals. In this paper, we study mmWave orthogonal frequency-division multiplexing (OFDM) JCAS systems in the presence of RISs. Specifically, we jointly design the hybrid beamforming and RIS phase shifts to guarantee the sensing functionalities via minimizing a chordal-distance metric, subject to signal-to-interference-plus-noise (SINR) and power constraints. The non-convexity of the investigated problem poses a challenge which we address by proposing a solution based on the penalty method and manifold-based alternating direction method of multipliers (ADMM). Simulation results demonstrate that under various settings both sensing and communication experience improved performance when the RIS is adequately designed. In addition, we discuss the tradeoff between sensing and communication.

eess.SP↗

arXiv2022

Next2You: Robust Copresence Detection Based on Channel State Information

Context-based copresence detection schemes are a necessary prerequisite to building secure and usable authentication systems in the Internet of Things (IoT). Such schemes allow one device to verify proximity of another device without user assistance utilizing their physical context (e.g., audio). The state-of-the-art copresence detection schemes suffer from two major limitations: (1) they cannot accurately detect copresence in low-entropy context (e.g., empty room with few events occurring) and insufficiently separated environments (e.g., adjacent rooms), (2) they require devices to have common sensors (e.g., microphones) to capture context, making them impractical on devices with heterogeneous sensors. We address these limitations, proposing Next2You, a novel copresence detection scheme utilizing channel state information (CSI). In particular, we leverage magnitude and phase values from a range of subcarriers specifying a Wi-Fi channel to capture a robust wireless context created when devices communicate. We implement Next2You on off-the-shelf smartphones relying only on ubiquitous Wi-Fi chipsets and evaluate it based on over 95 hours of CSI measurements that we collect in five real-world scenarios. Next2You achieves error rates below 4%, maintaining accurate copresence detection both in low-entropy context and insufficiently separated environments. We also demonstrate the capability of Next2You to work reliably in real-time and its robustness to various attacks.

cs.CR↗

arXiv2022

Sequential Parametric Optimization for Rate-Splitting Precoding in Non-Orthogonal Unicast and Multicast Transmissions

This paper investigates rate-splitting (RS) precoding for non-orthogonal unicast and multicast (NOUM) transmissions using fully-digital and hybrid precoders. We study the nonconvex weighted sum-rate (WSR) maximization problem subject to a multicast requirement. We propose FALCON, an approach based on sequential parametric optimization, to solve the aforementioned problem. We show that FALCON converges to a local optimum without requiring judicious selection of an initial feasible point. Besides, we show through simulations that by leveraging RS, hybrid precoders can attain nearly the same performance as their fully-digital counterparts under certain specific settings.

cs.IT↗

arXiv2021

BEAMWAVE: Cross-Layer Beamforming and Scheduling for Superimposed Transmissions in Industrial IoT mmWave Networks

The omnipresence of IoT devices in Industry 4.0 is expected to foster higher reliability, safety, and efficiency. However, interconnecting a large number of wireless devices without jeopardizing the system performance proves challenging. To address the requirements of future industries, we investigate the cross-layer design of beamforming and scheduling for layered-division multiplexing (LDM) systems in millimeter-wave bands. Scheduling is crucial as the devices in industrial settings are expected to proliferate rapidly. Also, highly performant beamforming is necessary to ensure scalability. By adopting LDM, multiple transmissions can be non-orthogonally superimposed. Specifically, we consider a superior-importance control multicast message required to be ubiquitous to all devices and inferior-importance private unicast messages targeting a subset of scheduled devices. Due to NP-hardness, we propose BEAMWAVE, which decomposes the problem into beamforming and scheduling. Through simulations, we show that BEAMWAVE attains near-optimality and outperforms other competing schemes.

eess.SP↗

arXiv2021

System Level Simulation of Scheduling Schemes for C-V2X Mode-3

The 3rd Generation Partnership Project (3GPP) introduced Cellular Vehicle-to-Everything (C-V2X) as a novel technology for enabling sidelink vehicular communications. While a distributed scheduling scheme (i.e., C-V2X mode-4) has been standardized by 3GPP in order to support out-of-coverage scenarios, the design of centralized infrastructure-based schemes (i.e., C-V2X mode-3) is open to implementation. In this paper, we propose two C-V2X mode-3 schemes based on bipartite graph matching (BGM), called BGM - Pow and BGM - Dist. Specifically, BGM - Pow allocates subchannels based on the minimization of the overall power perceived by the vehicles whereas BGM - Dist is based on the maximization of the subchannels reusage distance. Through simulations we show that the proposed centralized schemes outperform C-V2X mode-4 as the subchannels can be assigned more efficiently with reduced interference.

eess.SP↗

arXiv2020

Stay Connected, Leave no Trace: Enhancing Security and Privacy in WiFi via Obfuscating Radiometric Fingerprints

The intrinsic hardware imperfection of WiFi chipsets manifests itself in the transmitted signal, leading to a unique radiometric fingerprint. This fingerprint can be used as an additional means of authentication to enhance security. In fact, recent works propose practical fingerprinting solutions that can be readily implemented in commercial-off-the-shelf devices. In this paper, we prove analytically and experimentally that these solutions are highly vulnerable to impersonation attacks. We also demonstrate that such a unique device-based signature can be abused to violate privacy by tracking the user device, and, as of today, users do not have any means to prevent such privacy attacks other than turning off the device. We propose RF-Veil, a radiometric fingerprinting solution that not only is robust against impersonation attacks but also protects user privacy by obfuscating the radiometric fingerprint of the transmitter for non-legitimate receivers. Specifically, we introduce a randomized pattern of phase errors to the transmitted signal such that only the intended receiver can extract the original fingerprint of the transmitter. In a series of experiments and analyses, we expose the vulnerability of adopting naive randomization to statistical attacks and introduce countermeasures. Finally, we show the efficacy of RF-Veil experimentally in protecting user privacy and enhancing security. More importantly, our proposed solution allows communicating with other devices, which do not employ RF-Veil.

cs.CR↗

arXiv2020

SWAN: Swarm-Based Low-Complexity Scheme for PAPR Reduction

Cyclically shifted partial transmit sequences (CS-PTS) has conventionally been used in SISO systems for PAPR reduction of OFDM signals. Compared to other techniques, CS-PTS attains superior performance. Nevertheless, due to the exhaustive search requirement, it demands excessive computational complexity. In this paper, we adapt CS-PTS to operate in a MIMO framework, where singular value decomposition (SVD) precoding is employed. We also propose SWAN, a novel optimization method based on swarm intelligence to circumvent the exhaustive search. SWAN not only provides a significant reduction in computational complexity, but it also attains a fair balance between optimality and complexity. Through simulations, we show that SWAN achieves near-optimal performance at a much lower complexity than other competing approaches.

eess.SP↗