Searcharxiv⌕ Search

arXiv subjects

Onel Luis Alcaraz López

Publications and source records attributed to Onel Luis Alcaraz López.

At least 19 recordsLinked to original sources

Goal-Oriented Sensor Reporting Scheduling for Non-linear Dynamic System Monitoring

Goal-oriented communication (GoC) is a form of semantic communication where the effectiveness of information transmission is measured by its impact on achieving the desired goal. In Internet-of-Things (IoT) networks, GoC can enable sensors to selectively transmit data relevant to the intended goals of the receiver, thereby facilitating timely decision-making, reducing network congestion, and enhancing spectral efficiency. In this paper, we consider an IoT scenario where an edge node polls sensors monitoring the state of a non-linear dynamic system (NLDS) to respond to the queries of several clients. This work delves into the foregoing GoC problem and solution, which we termed goal-oriented scheduling (GoS). The latter utilizes deep reinforcement learning (DRL) with meticulously devised action space, state space, and reward function. A long short-term memory network is used to estimate the inter-query duration and the corresponding estimation standard deviation. This empowers the proposed DRL scheduler to make judicious decisions, even when no queries are posed. Numerical analysis demonstrates that the proposed GoS reduces the mean square error (MSE) of the query responses compared to the benchmark scheduling methods even as the number of clients and DRL action space increase, which proves its scalability. Moreover, this is attained without polling sensors during $70\% - 87\%$ of the testing phase, thus promoting energy efficiency. Lastly, the complexity of the proposed GoS is relatively lower than the benchmark scheduling methods.

eess.SY↗

TinyML for On-Device and Edge Analytics in Wireless Networks: A Survey of Deployments, Opportunities, and Concept-Drift Mitigation

Ubiquitous intelligence is essential for enabling real-time, adaptive, autonomous, and scalable operations in the next generation of wireless networks. However, this poses significant challenges in data management and energy consumption on the end-device/edge side, specially under dynamic environmental conditions. This has driven the adoption of tiny machine learning (tinyML), which offers data-driven optimization at the end-device/edge side. In this work, we survey and thoroughly discuss various tapped/untapped deployment possibilities of tinyML in wireless networks. We identify existing frameworks, accustomed to design tinyML algorithms, that could be utilized to solve a range of wireless network problems. We present a federated learning-based tinyML model update procedure, for both battery-powered and batteryless end-devices, to resolve the concept drift problem faced by tinyML models. Furthermore, we discuss the update-aware checkpointing, fault-tolerant bootloader, and intermittent-aware modify operation, which could support federated learning-based tinyML model update in the case of batteryless end-devices. Overall, this paper spells out several areas where end-device/edge intelligence can be utilized in the next generation of wireless systems, as well as ways to mitigate the concept drift problem faced in the case of end-device intelligence.

eess.SY↗

Sequential Monte Carlo for Network Resilience Assessment and Control

Resilience is emerging as a key requirement for next-generation wireless communication systems, requiring the ability to assess and control rare, path-dependent failure events arising from sequential degradation and delayed recovery. In this work, we develop a sequential Monte Carlo (SMC) framework for resilience assessment and control in networked systems. Resilience failures are formulated as staged, path-dependent events and represented through a reaction-coordinate-based decomposition that captures the progression toward non-recovery. Building on this structure, we propose a multilevel splitting approach with fixed, semantically interpretable levels and a budget-adaptive population control mechanism that dynamically allocates computational effort under a fixed total simulation cost. The framework is further extended to incorporate mitigation policies by leveraging SMC checkpoints for policy evaluation, comparison, and state-contingent selection via simulation-based lookahead. A delay-critical wireless network use case is considered to demonstrate the approach. Numerical results show that the proposed SMC method significantly outperforms standard Monte Carlo in estimating rare non-recovery probabilities and enables effective policy-driven recovery under varying system conditions. The results highlight the potential of SMC as a practical tool for resilience-oriented analysis and control in future communication systems.

eess.SY↗

Active IoT User Detection in Near-Field with Location Information

In this paper, we address active users detection (AUD) in near-field Internet of Things (IoT) networks by exploring prior knowledge of users' locations. We consider a scenario where users are distributed in a semi-circular area within the Rayleigh distance of a multi-antenna base station (BS). We propose the BS to use location estimates of the users to reconstruct their line-of-sight (LoS) channel components, hence assisting the AUD process. For this, the BS combines these reconstructed channels with users' pilot sequences, enhancing the correlation between received signals and active users. We formulate the location-aided AUD as a convex optimization problem, solved via the alternating direction method of multipliers (ADMM). {Our proposal has a higher computational complexity compared to the baseline ADMM approach where location information is not used. Moreover, the proposal requires location information of users, which can be readily informed if users are static, or inferred via established localization algorithms if they are mobile.} Simulation results compare our proposal against the baseline across varying systems parameters, such as number of users, pilot length and LoS component strength. We demonstrate that under perfect location estimation and strong LoS, our proposed method significantly outperforms the baseline. Furthermore, robustness analysis shows that performance gains persist under imperfect location estimation, provided the estimation error remains within bounds determined by the system parameters.

eess.SP↗

On the Value of Base Station Motion Knowledge for Goal-Oriented Remote Monitoring with Energy-Harvesting Sensors

This paper investigates goal-oriented remote monitoring of an unobservable Markov source using energy-harvesting sensors that communicate with a mobile receiver, such as a Low Earth Orbit (LEO) satellite or Unmanned Aerial Vehicle (UAV). Unlike conventional systems that assume stationary base stations, the proposed framework explicitly accounts for receiver mobility, which induces time-varying channel characteristics modeled as a finite-state Markov process. The remote monitoring problem is formulated as a partially observable Markov decision process (POMDP), which is transformed into a tractable belief-state MDP and solved using relative value iteration to obtain optimal sampling and transmission policies. Two estimation strategies are considered: Maximum Likelihood (ML) and Minimum Mean Distortion (MMD). Numerical results demonstrate that incorporating receiver mobility and channel state information into the optimization reduces the average distortion by 10% to 42% compared to baseline policies and constant-channel assumptions, highlighting the importance of base station motion knowledge for effective goal-oriented communication.

eess.SY↗

UAV-Enabled Wireless-Powered Underground Communication Networks: A Novel Time Allocation Approach

Wireless-powered underground communication networks (WPUCNs), which allow underground devices (UDs) to harvest energy from wireless signals for battery-free communication, offer a promising solution for sustainable underground monitoring. However, the severe wireless signal attenuation in challenging underground environments and the costly acquisition of channel state information (CSI) make large-scale WPUCNs economically infeasible in practice. To address this challenge, we introduce flexible unmanned aerial vehicles (UAVs) into WPUCNs, leading to UAV-enabled WPUCN systems. In this system, a UAV is first charged by a terrestrial hybrid access point (HAP), then flies to the monitoring area to wirelessly charge UDs. Afterwards, the UAV collects data from the UDs and finally returns to the HAP for data offloading. Based on the proposed UAV-enabled WPUCN system, we first propose its energy consumption model and a hybrid wireless energy transfer (WET) approach (i.e., UDs can harvest energy from both the HAP and the UAV) relying on full-CSI and CSI-free multi-antenna beamforming. Then, we formulate and address a time allocation problem to minimize the energy consumption of UAV, while ensuring that the throughput requirements of all UDs are met and all sensor data is offloaded. Through simulations of a realistic farming scenario, we demonstrate that the proposed hybrid WET approach outperforms other WET approaches, with performance gains influenced by the number of antennas, communication distance, number of UDs, and underground conditions. Additionally, under the optimized time allocation, we found that the proposed hybrid WET approach based on a CSI-free multi-antenna scheme achieves the lowest UAV's energy consumption among all WET mechanisms, thereby enabling sustainable underground monitoring in WPUCNs.

cs.NI↗

On the Spectral Efficiency of Indoor Wireless Networks with a Rotary Uniform Linear Array

Contemporary wireless communication systems rely on Multi-User Multiple-Input Multiple-Output (MU-MIMO) techniques. In such systems, each Access Point (AP) is equipped with multiple antenna elements and serves multiple devices simultaneously. Notably, traditional systems utilize fixed antennas, i.e., antennas without any movement capabilities, while the idea of movable antennas has recently gained traction among the research community. By moving in a confined region, movable antennas are able to exploit the wireless channel variation in the continuous domain. This additional degree of freedom may enhance the quality of the wireless links, and consequently the communication performance. However, movable antennas for MU-MIMO proposed in the literature are complex, bulky, expensive and present a high power consumption. In this paper, we propose an alternative to such systems that has lower complexity and lower cost. More specifically, we propose the incorporation of rotation capabilities to APs equipped with Uniform Linear Arrays (ULAs) of antennas. We consider the uplink of an indoor scenario where the AP serves multiple devices simultaneously. The optimal rotation of the ULA is computed based on estimates of the positions of the active devices and aiming at maximizing the per-user mean achievable Spectral Efficiency (SE). Adopting a spatially correlated Rician channel model, our numerical results show that the rotation capabilities of the AP can bring substantial improvements in the SE in scenarios where the line-of-sight component of the channel vectors is strong. Moreover, our proposed system is robust against imperfect positioning estimates.

cs.IT↗

Neural Network-Based Bandit: A Medium Access Control for the IIoT Alarm Scenario

Efficient Random Access (RA) is critical for enabling reliable communication in Industrial Internet of Things (IIoT) networks. Herein, we propose a deep reinforcement learning based distributed RA scheme, entitled Neural Network-Based Bandit (NNBB), for the IIoT alarm scenario. In such a scenario, the devices may detect a common critical event, and the goal is to ensure the alarm information is delivered successfully from at least one device. The proposed NNBB scheme is implemented at each device, where it trains itself online and establishes implicit inter-device coordination to achieve the common goal. Devices can transmit simultaneously on multiple orthogonal channels and each possible transmission pattern constitutes a possible action for the NNBB, which uses a deep neural network to determine the action. Our simulation results show that as the number of devices in the network increases, so does the performance gain of the NNBB compared to the Multi-Armed Bandit (MAB) RA benchmark. For instance, NNBB experiences a 7% success rate drop when there are four channels and the number of devices increases from 10 to 60, while MAB faces a 25% drop.

math.OC↗

On the Spectral Efficiency of Movable and Rotary Antenna Arrays under Rician Fading

Most works evaluating the performance of Multi-User Multiple-Input Multiple-Output (MU-MIMO) systems consider Access Points (APs) with fixed antennas, that is, without any movement capability. Recently, the idea of APs with antenna arrays that are able to move have gained traction among the research community. Many works evaluate the communications performance of Movable Antenna Arrays (MAAs) that can move on the horizontal plane. However, they require a very bulky, complex and expensive movement system. In this work, we propose a simpler and cheaper alternative: the utilization of Rotary Antenna Arrays (RAA)s, i.e. antenna arrays that can rotate. We also analyze the performance of a system in which the array is able to both move and rotate. The movements and/or rotations of the array are computed in order to maximize the mean per-user achievable spectral efficiency, based on estimates of the locations of the active devices and using particle swarm optimization. We adopt a spatially correlated Rician fading channel model, and evaluate the resulting optimized performance of the different setups in terms of mean per-user achievable spectral efficiencies. Our numerical results show that both the optimal rotations and movements of the arrays can provide substantial performance gains when the line-of-sight components of the channel vectors are strong. Moreover, the simpler RAAs can outperform the MAAs when their movement area is constrained.

eess.SP↗

Distributed MIMO Networks with Rotary ULAs for Indoor Scenarios under Rician Fading

The Fifth-Generation (5G) wireless communications networks introduced native support for Machine-Type Communications (MTC) use cases. Nevertheless, current 5G networks cannot fully meet the very stringent requirements regarding latency, reliability, and number of connected devices of most MTC use cases. Industry and academia have been working on the evolution from 5G to Sixth Generation (6G) networks. One of the main novelties is adopting Distributed Multiple-Input Multiple-Output (D-MIMO) networks. However, most works studying D-MIMO consider antenna arrays with no movement capabilities, even though some recent works have shown that this could bring substantial performance improvements. In this work, we propose the utilization of Access Points (APs) equipped with Rotary Uniform Linear Arrays (RULAs) for this purpose. Considering a spatially correlated Rician fading model, the optimal angular position of the RULAs is jointly computed by the central processing unit using particle swarm optimization as a function of the location of the active devices. Considering the impact of imperfect location estimates, our numerical results show that the RULAs's optimal rotation brings substantial performance gains in terms of mean per-user spectral efficiency. The improvement grows with the strength of the line-of-sight components of the channel vectors. Given the total number of antenna elements, we study the trade-off between the number of APs and the number of antenna elements per AP, revealing an optimal number of APs for the cases of APs equipped with static ULAs and RULAs.

eess.SP↗

On the Spectral Efficiency of D-MIMO Networks under Rician Fading

Contemporary wireless communications systems adopt the Multi-User Multiple-Input Multiple-Output (MU-MIMO) technique: a single base station or Access Point (AP) equipped with multiple antenna elements serves multiple active users simultaneously. Aiming at providing a more uniform wireless coverage, industry and academia have been working towards the evolution from centralized MIMO to Distributed-MIMO. That is, instead of having all the antenna elements co-located at a single AP, multiple APs, each equipped with a few or a single antenna element, jointly cooperate to serve the active users in the coverage area. In this work, we evaluate the performance of different D-MIMO setups under Rician fading, and considering different receive combining schemes. Note that the Rician fading model is convenient for MU-MIMO performance assessment, as it encompasses a wide variety of scenarios. Our numerical results show that the correlation among the channel vectors of different users increases with the Rician factor, which leads to a reduction on the achievable Spectral Efficiency (SE). Moreover, given a total number of antenna elements, there is an optimal number of APs and antenna elements per AP that provides the best performance. This "sweet spot" depends on the Rician factor and on the adopted receive combining scheme.

cs.IT↗

Non-Orthogonal Multiple-Access Strategies for Direct-to-Satellite IoT Networks

Direct-to-Satellite IoT (DtS-IoT) has the potential to support multiple verticals, including agriculture, industry, smart cities, and environmental disaster prevention. This work introduces two novel DtS-IoT schemes using power domain NonOrthogonal Multiple Access (NOMA) in the uplink with either fixed (FTP) or controlled (CTP) transmit power. We consider that the IoT devices use LoRa technology to transmit data packets to the satellite in orbit, equipped with a Successive Interference Cancellation (SIC)-enabled gateway. We also assume the IoT devices are empowered with a predictor of the satellite orbit. Using real geographic location and trajectory data, we evaluate the performance of the average number of successfully decoded transmissions, goodput (bytes/lap), and energy consumption (bytes/Joule) as a function of the number of network devices. Numerical results show the trade-off between goodput and energy efficiency for both proposed schemes. Comparing FTP and CTP with regular ALOHA for 100 (600) devices, we find goodput improvements of 65% (29%) and 52% (101%), respectively. Notably, CTP effectively leverages transmission opportunities as the network size increases, outperforming the other strategies. Moreover, CTP shows the best performance in energy efficiency compared to FTP and ALOHA.

eess.SP↗

Channel Scheduling for IoT Access with Spatial Correlation

Spatially correlated device activation is a typical feature of the Internet of Things (IoT). This motivates the development of channel scheduling (CS) methods that mitigate device collisions efficiently in such scenarios, which constitutes the scope of this work. Specifically, we present a quadratic program (QP) formulation for the CS problem considering the joint activation probabilities among devices. This formulation allows the devices to stochastically select the transmit channels, thus, leading to a soft-clustering approach. We prove that the optimal QP solution can only be attained when it is transformed into a hard-clustering problem, leading to a pure integer QP, which we transform into a pure integer linear program (PILP). We leverage the branch-and-cut (B&C) algorithm to solve PILP optimally. Due to the high computational cost of B&C, we resort to some sub-optimal clustering methods with low computational costs to tackle the clustering problem in CS. Our findings demonstrate that the CS strategy, sourced from B&C, significantly outperforms those derived from sub-optimal clustering methods, even amidst increased device correlation.

cs.IT↗

Joint Activity Detection and Channel Estimation for Clustered Massive Machine Type Communications

Compressed sensing multi-user detection (CS-MUD) algorithms play a key role in optimizing grant-free (GF) non-orthogonal multiple access (NOMA) for massive machine-type communications (mMTC). However, current CS-MUD algorithms cannot be efficiently parallelized, leading to computationally expensive implementations of joint activity detection and channel estimation (JADCE) as the number of deployed machine-type devices (MTDs) increases. To address this, the present work proposes novel JADCE algorithms that can be applied in parallel for different clusters of MTDs by exploiting the structure of the pilot sequences. These are the approximation error method (AEM)-alternating direction method of multipliers (ADMM), and AEM-sparse Bayesian learning (SBL). Results presented in terms of the normalized mean square error and the probability of miss detection show comparable performance to the conventional algorithms. However, both AEM-ADMM and AEM-SBL algorithms have significantly reduced computational complexity and run times, thus, facilitating network scalability.

eess.SP↗

On CSI-Free Multi-Antenna Schemes for Massive Wireless-Powered Underground Sensor Networks

Radio-frequency wireless energy transfer (WET) is a promising technology to realize wireless-powered underground sensor networks (WPUSNs) and enable sustainable underground monitoring. However, due to the severe attenuation in harsh underground soil and the tight energy budget of the underground sensors, traditional WPUSNs relying on the channel state information (CSI) are highly inefficient, especially in massive WET scenarios. To address this challenge, we comparatively assess the feasibility of several state-of-the-art CSI-free multi-antenna WET schemes for WPUSNs, under a given power budget. Moreover, to overcome the extremely low WET efficiency in underground channels, we propose a distributed CSI-free system, where multiple power beacons (PBs) simultaneously charge a large set of underground sensors without any CSI. We consider the position-aware K-Means and the position-agnostic equally-far-from-center (EFFC) approaches for the optimal deployment of the PBs. Our results evince that the performance of the proposed distributed CSI-free system can approach or even surpass that of a traditional full-CSI WET strategy, especially when adopting an appropriate CSI-free scheme, applying the advisable PBs deployment approach, and equipping the PBs with an appropriate number of antennas. Finally, we discuss the impact of underground parameters, i.e., the burial depth of devices and the volumetric water content of soil, on the system's performance, and identify potential challenges and research opportunities for practical distributed CSI-free WPUSNs deployment.

cs.IT↗

Age-of-Information Dependent Random Access in NOMA-Aided Multiple-Relay Slotted ALOHA

We propose and evaluate the performance of a Non-Orthogonal Multiple Access (NOMA) dual-hop multiple relay (MR) network from an information freshness perspective using the Age of Information (AoI) metric. More specifically, we consider an age dependent (AD) policy, named as AD-NOMA- MR, in which users only transmit, with a given probability, after they reach a certain age threshold. The packets sent by the users are potentially received by the relays, and then forwarded to a common sink in a NOMA fashion by randomly selecting one of the available power levels, and multiple packets are received if all selected levels are unique. We derive analytical expressions for the average AoI of AD-NOMA-MR. Through numerical and simulation results, we show that the proposed policy can improve the average AoI up to 76.6% when compared to a previously proposed AD Orthogonal Multiple Access MR policy.

cs.IT↗

Joint Coherent and Non-Coherent Detection and Decoding Techniques for Heterogeneous Networks

Cellular networks that are traditionally designed for human-type communication (HTC) have the potential to provide cost effective connectivity to machine-type communication (MTC). However, MTC is characterized by unprecedented traffic in cellular networks, thus posing a challenge to its successful incorporation. In this work, we propose a unified framework for amicable coexistence of MTC and HTC. We consider a heterogeneous network where machine-type devices coexist with enhanced mobile broadband (eMBB) devices and propose transceiver techniques that promote efficient signal recovery from these devices. For this, we present an eMBB pilot and MTC data generation strategy that facilitates joint coherent decoding of eMBB data and non-coherent decoding of MTC data. Furthermore, we assess the feasibility of coexistence using receiver operating characteristics, outage probability, and normalized mean square error (NMSE). Our numerical results reveal that a harmonious coexistence of the heterogeneous services can be achieved with properly configured average signal-to-noise ratios and pilot length.

eess.SP↗

Dynamic RF Combining for Multi-Antenna Ambient Energy Harvesting

Ambient radio frequency (RF) energy harvesting (EH) technology is key to realize self-sustainable, always-on, low-power, massive Internet of Things networks. Typically, rigid (non-adaptable to channel fluctuations) multi-antenna receive architectures are proposed to support reliable EH operation. Herein, we introduce a dynamic RF combining architecture for ambient RF EH use cases, and exemplify the attainable performance gains via three simple phase shifts' exploration mechanisms, namely, brute force (BF), sequential testing (ST) and codebook based (CB). Among the proposed mechanisms, BF demands the highest power consumption, while CB requires the highest-resolution phase shifters, thus tipping the scales in favor of ST. Finally, we show that the performance gains of ST over a rigid RF combining scheme increase with the number of receive antennas and energy transmitters' deployment density.

cs.PF↗