Searcharxiv⌕ Search

arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

At least 199 records · Page 11Linked to original sources

RSMA for Dual-Polarized Massive MIMO Networks: A SIC-Free Approach

Aiming at overcoming practical issues of successive interference cancellation (SIC), this paper proposes a dual-polarized rate-splitting multiple access (RSMA) technique for a downlink massive multiple-input multiple-output (MIMO) network. By modeling the effects of polarization interference, an in-depth theoretical analysis is carried out, in which we derive tight closed-form approximations for the outage probabilities and ergodic sum-rates. Simulation results validate the accuracy of the theoretical analysis and confirm the effectiveness of the proposed approach. For instance, under low to moderate cross-polar interference, our results show that the proposed dual-polarized MIMO-RSMA strategy outperforms the single-polarized MIMO-RSMA counterpart for all considered levels of residual SIC error.

eess.SP↗

Query Timing Analysis for Content-based Wake-up Realizing Informative IoT Data Collection

Information freshness and high energy-efficiency are key requirements for sensor nodes serving Industrial Internet of Things (IIoT) applications, where a sink node must collect informative data before a deadline to control an external element. Pull-based communication is an interesting approach for optimizing information freshness and saving wasteful energy. To this end, we apply Content-based Wake-up (CoWu), in which the sink can activate a subset of nodes observing informative data at the time that wake-up signal is received. In this case, the timing of the wake-up signal plays an important role: early transmission leads to high reliability in data collection, but the received data may become obsolete by the deadline, while later transmission ensures a higher timeliness of the sensed data, but some nodes might not manage to communicate their data before the deadline. This letter investigates the timing for data collection using CoWu and characterizes the gain of CoWu. The obtained numerical results show that CoWu improves accuracy, while reducing energy consumption by about 75% with respect to round-robin scheduling.

cs.IT↗

Sustainable Wireless Services with UAV Swarms Tailored to Renewable Energy Sources

Unmanned Aerial Vehicle (UAV) swarms are often required in off-grid scenarios, such as disaster-struck, war-torn or rural areas, where the UAVs have no access to the power grid and instead rely on renewable energy. Considering a main battery fed from two renewable sources, wind and solar, we scale such a system based on the financial budget, environmental characteristics, and seasonal variations. Interestingly, the source of energy is correlated with the energy expenditure of the UAVs, since strong winds cause UAV hovering to become increasingly energy-hungry. The aim is to maximize the cost efficiency of coverage at a particular location, which is a combinatorial optimization problem for dimensioning of the multivariate energy generation system under non-convex criteria. We have devised a customized algorithm by lowering the processing complexity and reducing the solution space through sampling. Evaluation is done with condensed real-world data on wind, solar energy, and traffic load per unit area, driven by vendor-provided prices. The implementation was tested in four locations, with varying wind or solar intensity. The best results were achieved in locations with mild wind presence and strong solar irradiation, while locations with strong winds and low solar intensity require higher Capital Expenditure (CAPEX) allocation.

cs.NI↗

RIS-Enabled SISO Localization under User Mobility and Spatial-Wideband Effects

Reconfigurable intelligent surface (RIS) is a promising technological enabler for the 6th generation (6G) of wireless systems with applications in localization and communication. In this paper, we consider the problem of positioning a single-antenna user in 3D space based on the received signal from a single-antenna base station and reflected signal from an RIS by taking into account the mobility of the user and spatial-wideband (WB) effects. To do so, we first derive the spatial-WB channel model under the far-field assumption, for orthogonal frequency-division multiplexing signal transmission with the user having a constant velocity. We derive the Cramer Rao bounds to serve as a benchmark. Furthermore, we devise a low-complexity estimator that attains the bounds in high signal-to-noise ratios. Our estimator neglects the spatial-WB effects and deals with the user mobility by estimating the radial velocities and compensating for their effects in an iterative fashion. We show that the spatial-WB effects can degrade the localization accuracy for large RIS sizes and large signal bandwidths as the direction of arrival or departure deviate from the RIS normal. In particular, for a 64X64 RIS, the proposed estimator is resilient against the spatial-WB effects up to 140 MHz bandwidth. Regarding user mobility, our results suggest that the velocity of the user influences neither the bounds nor the accuracy of our estimator. Specifically, we observe that the state of the user with a high speed (42 m/s) can be estimated virtually with the same accuracy as a static user.

eess.SP↗

Efficient URLLC with a Reconfigurable Intelligent Surface and Imperfect Device Tracking

The use of Reconfigurable Intelligent Surfaces (RIS) technology to extend coverage and allow for better control of the wireless environment has been proposed in several use cases, including Ultra-Reliable Low-Latency Communications (URLLC), communications. However, the extremely challenging latency constraint makes explicit channel estimation difficult, so positioning information is often used to configure the RIS and illuminate the receiver device. In this work, we analyze the effect of imperfections in the positioning information on the reliability, deriving an upper bound to the outage probability. We then use this bound to perform power control, efficiently finding the minimum power that respects the URLLC constraints under positioning uncertainty. The optimization is conservative, so that all points respect the URLLC constraints, and the bound is relatively tight, with an optimality gap between 1.5 and 4.5~dB.

cs.IT↗

Continent-wide Efficient and Fair Downlink Resource Allocation in LEO Satellite Constellations

The integration of Low Earth Orbit (LEO) satellite constellations into 5G and Beyond is essential to achieve efficient global connectivity. As LEO satellites are a global infrastructure with predictable dynamics, a pre-planned fair and load-balanced allocation of the radio resources to provide efficient downlink connectivity over large areas is an achievable goal. In this paper, we propose a distributed and a global optimal algorithm for satellite-to-cell resource allocation with multiple beams. These algorithms aim to achieve a fair allocation of time-frequency resources and beams to the cells based on the number of users in connected mode (i.e., registered). Our analyses focus on evaluating the trade-offs between average per-user throughput, fairness, number of cell handovers, and computational complexity in a downlink scenario with fixed cells, where the number of users is extracted from a population map. Our results show that both algorithms achieve a similar average per-user throughput. However, the global optimal algorithm achieves a fairness index over 0.9 in all cases, which is more than twice that of the distributed algorithm. Furthermore, by correctly setting the handover cost parameter, the number of handovers can be effectively reduced by more than 70% with respect to the case where the handover cost is not considered.

cs.NI↗

Distributed Downlink Precoding and Equalization in Satellite Swarms

In this paper, we propose a novel approach for downlink transmission from a satellite swarm towards a ground station (GS). These swarms have the benefit of much higher spatial separation in the transmit antennas than traditional satellites with antenna arrays, promising a massive increase in spectral efficiency. The resulting precoder and equalizer have very low demands on computational complexity, inter-satellite coordination and channel estimation. This is achieved by taking knowledge about the geometry between satellites and GS into account. For precoding, each satellite only requires its angles of departure (AoDs) towards the GS and it turns out that almost optimal rates can be achieved if the satellites transmit independent data streams. For the equalizer, the GS requires only knowledge about the angles of arrival (AoAs) from all satellites. Furthermore, we show that, by choosing a proper inter-satellite distance, the proposed low-complexity approach achieves the theoretical upper bound in terms of data rate. This optimal inter-satellite distance is obtained analytically under simplifying assumption and provides a heuristic for practical scenarios. Furthermore, a novel approach to increase the robustness of the proposed precoder and equalizer against imperfect AoD and AoA knowledge is proposed by exploiting the statistics of the estimation error.

cs.IT↗

FedToken: Tokenized Incentives for Data Contribution in Federated Learning

Incentives that compensate for the involved costs in the decentralized training of a Federated Learning (FL) model act as a key stimulus for clients' long-term participation. However, it is challenging to convince clients for quality participation in FL due to the absence of: (i) full information on the client's data quality and properties; (ii) the value of client's data contributions; and (iii) the trusted mechanism for monetary incentive offers. This often leads to poor efficiency in training and communication. While several works focus on strategic incentive designs and client selection to overcome this problem, there is a major knowledge gap in terms of an overall design tailored to the foreseen digital economy, including Web 3.0, while simultaneously meeting the learning objectives. To address this gap, we propose a contribution-based tokenized incentive scheme, namely \texttt{FedToken}, backed by blockchain technology that ensures fair allocation of tokens amongst the clients that corresponds to the valuation of their data during model training. Leveraging the engineered Shapley-based scheme, we first approximate the contribution of local models during model aggregation, then strategically schedule clients lowering the communication rounds for convergence and anchor ways to allocate \emph{affordable} tokens under a constrained monetary budget. Extensive simulations demonstrate the efficacy of our proposed method.

cs.LG↗

Dual-Polarized Massive MIMO-RSMA Networks: Tackling Imperfect SIC

The polarization domain provides an extra degree of freedom (DoF) for improving the performance of multiple-input multiple-output (MIMO) systems. This paper takes advantage of this additional DoF to alleviate practical issues of successive interference cancellation (SIC) in rate-splitting multiple access (RSMA) schemes. Specifically, we propose three dual-polarized downlink transmission approaches for a massive MIMO-RSMA network under the effects of polarization interference and residual errors of imperfect SIC. The first approach implements polarization multiplexing for transmitting the users' data messages, which removes the need to execute SIC in the reception. The second approach transmits replicas of users' messages in the two polarizations, which enables users to exploit diversity through the polarization domain. The third approach, in its turn, employs the original SIC-based RSMA technique per polarization, and this allows the BS to transmit two independent superimposed data streams simultaneously. An in-depth theoretical analysis is carried out, in which we derive tight closed-form approximations for the outage probabilities of the three proposed approaches. Accurate approximations for the ergodic sum-rates of the two first schemes are also derived. Simulation results validate the theoretical analysis and confirm the effectiveness of the proposed schemes. For instance, under low to moderate cross-polar interference, the results show that, even under high levels of residual SIC error, our dual-polarized MIMO-RSMA strategies outperform the conventional single-polarized MIMO-RSMA counterpart. It is also shown that the performance of all RSMA schemes is impressively higher than that of single and dual-polarized massive MIMO systems employing non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) techniques.

eess.SP↗

Analysis of Distributed Ledger Technologies for Industrial Manufacturing

In recent years, industrial manufacturing has undergone massive technological changes that embrace digitalization and automation towards the vision of intelligent manufacturing plants. With the aim of maximizing efficiency and profitability in production, an important goal is to enable flexible manufacturing, both, for the customer (desiring more individualized products) and for the manufacturer (to adjust to market demands). Manufacturing-as-a-service can support this through manufacturing plants that are used by different tenants who utilize the machines in the plant, which are offered by different providers. To enable such pay-per-use business models, Distributed Ledger Technology (DLT) is a viable option to establish decentralized trust and traceability. Thus, in this paper, we study potential DLT technologies for an efficient and intelligent integration of DLT-based solutions in manufacturing environments. We propose a general framework to adapt DLT in manufacturing, then we introduce the use case of shared manufacturing, which we utilize to study the communication and computation efficiency of selected DLTs in resource-constrained wireless IoT networks.

cs.DC↗

Opportunities for Intelligent Reflecting Surfaces in 6G-Empowered V2X Communications

This paper first describes the introduction of 6G-empowered V2X communications and IRS technology. Then it discusses different use case scenarios of IRS enabled V2X communications and reports recent advances in the existing literature. Next, we focus our attention on the scenario of vehicular edge computing involving IRS enabled drone communications in order to reduce vehicle computational time via optimal computational and communication resource allocation. At the end, this paper highlights current challenges and discusses future perspectives of IRS enabled V2X communications in order to improve current work and spark new ideas.

eess.SP↗

Rate-Splitting Multiple Access: Fundamentals, Survey, and Future Research Trends

Rate-splitting multiple access (RSMA) has emerged as a novel, general, and powerful framework for the design and optimization of non-orthogonal transmission, multiple access (MA), and interference management strategies for future wireless networks. Through information and communication theoretic analysis, RSMA has been shown to be optimal (from a Degrees-of-Freedom region perspective) in several transmission scenarios. Compared to the conventional MA strategies used in 5G, RSMA enables spectral efficiency (SE), energy efficiency (EE), coverage, user fairness, reliability, and quality of service (QoS) enhancements for a wide range of network loads (including both underloaded and overloaded regimes) and user channel conditions. Furthermore, it enjoys a higher robustness against imperfect channel state information at the transmitter (CSIT) and entails lower feedback overhead and complexity. Despite its great potential to fundamentally change the physical (PHY) layer and media access control (MAC) layer of wireless communication networks, RSMA is still confronted with many challenges on the road towards standardization. In this paper, we present the first comprehensive overview on RSMA by providing a survey of the pertinent state-of-the-art research, detailing its architecture, taxonomy, and various appealing applications, as well as comparing with existing MA schemes in terms of their overall frameworks, performance, and complexities. An in-depth discussion of future RSMA research challenges is also provided to inspire future research on RSMA-aided wireless communication for beyond 5G systems.

cs.IT↗

Data-Driven Compressed Sensing for Massive Wireless Access

The central challenge in massive machine-type communications (mMTC) is to connect a large number of uncoordinated devices through a limited spectrum. The typical mMTC communication pattern is sporadic, with short packets. This could be exploited in grant-free random access in which the activity detection, channel estimation, and data recovery are formulated as a sparse recovery problem and solved via compressed sensing algorithms. This approach results in new challenges in terms of high computational complexity and latency. We present how data-driven methods can be applied in grant-free random access and demonstrate the performance gains. Variations of neural networks for the problem are discussed, as well as future challenges and potential directions.

cs.IT↗

MixTailor: Mixed Gradient Aggregation for Robust Learning Against Tailored Attacks

Implementations of SGD on distributed systems create new vulnerabilities, which can be identified and misused by one or more adversarial agents. Recently, it has been shown that well-known Byzantine-resilient gradient aggregation schemes are indeed vulnerable to informed attackers that can tailor the attacks (Fang et al., 2020; Xie et al., 2020b). We introduce MixTailor, a scheme based on randomization of the aggregation strategies that makes it impossible for the attacker to be fully informed. Deterministic schemes can be integrated into MixTailor on the fly without introducing any additional hyperparameters. Randomization decreases the capability of a powerful adversary to tailor its attacks, while the resulting randomized aggregation scheme is still competitive in terms of performance. For both iid and non-iid settings, we establish almost sure convergence guarantees that are both stronger and more general than those available in the literature. Our empirical studies across various datasets, attacks, and settings, validate our hypothesis and show that MixTailor successfully defends when well-known Byzantine-tolerant schemes fail.

cs.LG↗

Delivering Ultra-Reliable Low-Latency Communications via Statistical Radio Maps

High reliability guarantees for Ultra-Reliable Low-Latency Communications (URLLC) require accurate knowledge of channel statistics, used as an input for rate selection. Exploiting the spatial consistency of channel statistics arises as a promising solution, allowing a base station to predict the propagation conditions and select the communication parameters for a new user from samples collected from previous users of the network. Based on this idea, this article provides a timely framework to exploit long-range channel spatial correlation through so-called statistical radio maps, enabling URLLC communications with given statistical guarantees. The framework is exemplified by predicting the channel capacity distribution both in a location-based radio map and in a latent space rendered by a channel chart, the latter being a localization-free approach based on channel state information (CSI). It is also shown how to use the maps to select the transmission rate in a new location that achieves a target level of reliability. Finally, several future directions and research challenges are also discussed.

cs.IT↗

Opportunities for Physical Layer Security in UAV Communication Enhanced with Intelligent Reflective Surfaces

Unmanned Aerial Vehicles (UAVs) are an important component of next-generation wireless networks that can assist in high data rate communications and provide enhanced coverage.Their high mobility and aerial nature offer deployment flexibility and low-cost infrastructure support to existing cellular networks and provide many applications that rely on mobile wireless communications. However, security is a major challenge in UAV communications, and Physical Layer Security (PLS) is an important technique to improve the reliability and security of data shared with the assistance of UAVs. Recently, Intelligent Reflecting Surfaces (IRS) have emerged as a novel technology to extend and/or enhance wireless coverage by re-configuring the propagation environment of communications. This paper provides an overview of how IRS can improve the PLS of UAV networks. We discuss different use cases of PLS for IRS enhanced UAV communications and briefly review the recent advances in this area. Then based on the recent advances, we also present a case study that utilizes alternate optimization to maximize the secrecy capacity for IRS enhanced UAV scenario in the presence of multiple eavesdroppers. Finally, we highlight several open issues and research challenges to realize PLS in IRS enhanced UAV communications.

eess.SP↗

Traffic Prediction and Fast Uplink for Hidden Markov IoT Models

In this work, we present a novel traffic prediction and fast uplink framework for IoT networks controlled by binary Markovian events. First, we apply the forward algorithm with hidden Markov models (HMM) in order to schedule the available resources to the devices with maximum likelihood activation probabilities via fast uplink grant. In addition, we evaluate the regret metric as the number of wasted transmission slots to evaluate the performance of the prediction. Next, we formulate a fairness optimization problem to minimize the age of information while keeping the regret as minimum as possible. Finally, we propose an iterative algorithm to estimate the model hyperparameters (activation probabilities) in a real-time application and apply an online-learning version of the proposed traffic prediction scheme. Simulation results show that the proposed algorithms outperform baseline models such as time division multiple access (TDMA) and grant-free (GF) random-access in terms of regret, the efficiency of system usage, and age of information.

cs.NI↗

Globally Optimal Spectrum- and Energy-Efficient Beamforming for Rate Splitting Multiple Access

Rate splitting multiple access (RSMA) is a promising non-orthogonal transmission strategy for next-generation wireless networks. It has been shown to outperform existing multiple access schemes in terms of spectral and energy efficiency when suboptimal beamforming schemes are employed. In this work, we fill the gap between suboptimal and truly optimal beamforming schemes and conclusively establish the superior spectral and energy efficiency of RSMA. To this end, we propose a successive incumbent transcending (SIT) branch and bound (BB) algorithm to find globally optimal beamforming solutions that maximize the weighted sum rate or energy efficiency of RSMA in Gaussian multiple-input single-output (MISO) broadcast channels. Numerical results show that RSMA exhibits an explicit globally optimal spectral and energy efficiency gain over conventional multi-user linear precoding (MU-LP) and power-domain non-orthogonal multiple access (NOMA). Compared to existing globally optimal beamforming algorithms for MU-LP, the proposed SIT BB not only improves the numerical stability but also achieves faster convergence. Moreover, for the first time, we show that the spectral/energy efficiency of RSMA achieved by suboptimal beamforming schemes (including weighted minimum mean squared error (WMMSE) and successive convex approximation) almost coincides with the corresponding globally optimal performance, making it a valid choice for performance comparisons. The globally optimal results provided in this work are imperative to the ongoing research on RSMA as they serve as benchmarks for existing suboptimal beamforming strategies and those to be developed in multi-antenna broadcast channels.

cs.IT↗